Samsung Advanced Developer Interview Experience
Summary
My interview for an Advanced Developer role at Samsung involved a deep dive into my internship project, fundamental Data Structures and Algorithms, two challenging aptitude questions, and discussions on core CS fundamentals, focusing heavily on problem-solving and logical thinking.
Full Experience
My Samsung Advanced Developer Interview Experience
During my interview, the discussion started with an in-depth exploration of my internship project at Samsung R&D, Bangalore. The interviewer probed me about potential single points of failure within the project and asked how I would approach addressing them. We also delved into the significance of 'doChoreographer' frames and how they could be utilized to pinpoint performance bottlenecks.
Following this, the focus shifted to fundamental Data Structures and Algorithms. I was asked about various traversal algorithms for trees and graphs, with an emphasis on their real-world applications and use cases.
The interviewer then presented two aptitude questions that required logical reasoning and problem-solving:
- The Scooter and Tires problem.
- The Weighing Coins problem.
After these aptitude challenges, we transitioned back to Data Structures and Algorithms. The conversation covered Dijkstra's Algorithm, Bellman-Ford, and Floyd-Warshall, where I discussed their time and space complexities. There was also a brief mention of a dynamic programming problem involving directed graphs that had appeared in the SWC Advanced test.
Finally, the interview concluded with a discussion on core Computer Science fundamentals, including semaphores, threads, locking mechanisms, critical sections, race conditions, and various strategies to handle these concurrency issues. Throughout the entire interview, I felt the emphasis was predominantly on assessing my problem-solving capabilities and logical thinking rather than just theoretical recall.
Interview Questions (2)
You have a scooter with two tires and a third spare tire. Each tire can last for 5 km. The task is to find the maximum distance you can travel.
You are given 10 bags of coins, with one bag weighing differently. The challenge is to determine the minimum number of weighings required to identify the odd bag.