SRIN

Role: Not Specified (likely Software Engineer/R&D)

College: Not Specified (On-Campus)

Interview Date: 2024-10-20

Interview Type: On-Campus

Result: Not Specified

Difficulty: Medium

Rounds: 3 rounds

Topics Asked: Data Structures (Linkedlist, Trees, array greedy problem, trees, graphs, trie), Computer Architecture, Resume-based questions, Real-world problem-solving (choosing data structures/algorithms), Hidden test cases, CGPA.

Experience:

The interview process for Samsung R&D started with a coding round on the Cocubes platform. There were three coding questions, with different questions shuffled among candidates but maintaining an equal difficulty level. The candidate received questions on Linkedlist, Trees, and an array greedy problem, with one being easy and the other two of medium difficulty. All test cases were hidden, emphasizing the importance of careful coding and considering all corner cases. A significant number of students successfully completed all three coding questions. Approximately 25-28 students were selected for the subsequent rounds based on their coding performance and academic CGPA.

1st Interview: This interview, lasting 40-45 minutes, was conducted via Skype. The interviewer initiated the discussion by reviewing the candidate's resume, particularly highlighting the achievements section and acknowledging the candidate's coding proficiency. Theoretical questions related to coding were posed, such as "where does the code we write will be saved and is it volatile or non-volatile memory." When asked about Computer Architecture, the candidate honestly admitted to not being fully prepared, being from an ECE background. Following this, the interviewer requested the candidate to share their screen and solve two coding questions on the spot.

2nd Interview: This round differed significantly from the first. For this candidate, there were no coding or resume-specific questions (though a friend's interview heavily focused on projects). The interviewer adopted an encouraging approach, presenting real-world problems and asking the candidate to propose suitable data structures and algorithms (such as trees, graphs, and trie) to achieve optimal results. The candidate found this round both challenging and enjoyable due to its problem-solving nature.