Samsung Interview Experience

Interviewee - Abhishek Thakur
FTE - 12 base (15.5 CTC)
Athenasquare - https://athenasquare.org/AbheeshekThakur
Location - Delhi

Online Assessment:

The Online Assessment was held in Offline Mode. Samsung representatives were present for invigilation to ensure that the whole process was conducted offline and strictly with the rules to avoid cheating.

The problem presented to us was related to BFS (breadth-first search) or DFS (depth-first search) traversal in a matrix. At first, the problem seemed confusing, mainly because it looked like a dynamic programming question. However, upon closer examination, it became clear that it was a straightforward BFS/DFS traversal question.

In the question, we were given a matrix with several points or cells that needed to be covered. There were also certain constrictions on moving between the cells in the matrix. For instance, it was specified that we couldn't travel to specific cells during our traversal.

The task was to determine the starting point from which we could reach all the target places in the minimum number of steps. This required us to carefully analyse the matrix and devise a strategy for traversing it in the most efficient manner possible.

Overall, I found the experience of taking the OA test to be challenging yet rewarding. The BFS/DFS matrix traversal problem required me to think critically and apply my knowledge of algorithms to solve complex problems.
I managed to clear it & progress to the next round of the selection process.

Round 1:

My interview started with a brief discussion of questions in the Online assessment. The Solution was discussed and was asked about the time complexity and Space complexity. I considered the trade-offs between time and space complexity and sought to strike a balance between the two.

During my interview, I was asked various technical questions, including ones on trees, the properties of AVL trees, and the concept of polymorphism and encapsulation in object-oriented programming.

To approach these questions, I first explained how to add nodes to a tree and the basic properties of AVL trees. I was then asked about the concept of polymorphism and the difference between compile-time and runtime polymorphism. I provided an example of code that utilised method overriding to demonstrate my understanding of this concept.

I was also asked to write code for a virtual function and explain the concept of a virtual table. I provided an example to illustrate how this concept works in practice.

In addition to these technical questions, I was asked to solve a puzzle to test my problem-solving and analytical skills. I carefully considered the information provided and was able to come up with a solution.

Overall, I found the Interview to be a challenging but rewarding experience. I am grateful for the opportunity to have participated in the interview and look forward to applying my knowledge and skills in future professional settings.
Eventually, I was selected.

Here are some tips for you folks:

1. Practice solving coding challenges on websites like Leetcode or HackerRank
2. Review the basics of tree algorithms, as these are common topics in coding interviews
3. Brush up on your knowledge of Object Oriented Programming, as these topics may be covered in theory questions
4. Be prepared to write code on a whiteboard or online coding platform
5. Take your time and think through your solutions carefully
6. Be able to explain and defend your problem and be open to feedback and suggestions from the interviewer
7. Take your time and think through your answers carefully.
8. Good luck with your interview preparations, and I hope these tips help you succeed!