Samsung Software Engineer Interview Questions and Answers

Detecting a loop in a linked list

• Use two pointers, one moving at double the speed of the other

• If there is a loop, the two pointers will eventually meet

• Use Floyd's Cycle Detection Algorithm for efficient solution

Reversing a linked list involves changing the direction of the pointers between nodes.

• Iterative approach: Use three pointers (prev, current, next) to reverse the links.

• Example: For list 1 -> 2 -> 3, after reversal it becomes 3 -> 2 -> 1.

• Recursive approach: Reverse the rest of the list and adjust the pointers.

• Example: For list 4 -> 5 -> 6, recursively reverse to get 6 -> 5 -> 4.

A junction point in a Y-type linked list is where two linked lists converge into one.

• A Y-type linked list consists of two separate linked lists that merge at a common node.

• The junction point is the node where the two lists meet, allowing traversal from either list.

• Example: List A: 1 -> 2 -> 3; List B: 4 -> 5; Junction at node 6: 3 -> 6 -> 7 -> 8.

• To find the junction point, you can use two pointer...read more

I want to join Samsung to contribute to innovative technology, work in a dynamic environment, and grow alongside industry leaders.

• Samsung is a leader in technology innovation, and I want to be part of that cutting-edge environment.

• The company's commitment to sustainability aligns with my values, and I want to contribute to eco-friendly projects.

• Working at Samsung offers opportunities for professional growth and de...read more

Implementing a search feature that filters app names based on user input in real-time.

• Use a list or array to store app names like ['Settings', 'Samsung Wallet', 'Search', 'Security'].

• Implement a function that takes user input and filters the app list based on the input string.

• For example, if input is 'S', return ['Settings', 'Samsung Wallet', 'Search'].

• If input is 'SE', return ['Settings', 'Security'].

Quick sort is a divide and conquer algorithm that sorts an array by partitioning it into two sub-arrays.

• Choose a pivot element from the array

• Partition the array around the pivot element

• Recursively apply the above steps to the sub-arrays

• Combine the sorted sub-arrays to get the final sorted array