Samsung Interview Questions, Process, and Tips

Round duration - 45 minutes
Round difficulty - Medium

This round was scheduled in the evening hours and all the participants were required to fill a form which was shared 15 minutes prior to the start of the online coding round. This form was filled out probably for the security reasons and to ensure that no one disinterested participant gives the test.

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. Brute Force
• The most trivial approach would be to find all triplets of the array and count all such triplets whose ‘SUM’ = 'K'.
• We can find the answer using three nested loops for three different indexes and check if the values at those indexes sum up to 'K'.
• Create a set  to keep the track of triplets we have visited. Run first loop from i = 0 to i = ‘N’ - 3, second loop from j = i + 1 to j = ‘N’ - 2 and third loop ...read more
Answered Anonymously
Add your answer
Q2. 
BST to Greater Tree Conversion
Convert a given binary search tree (BST) with 'N' nodes into a Greater Tree. In this transformation, each node's data is modified to the sum of the original node's data plus...read more
Ans. Using Stack
• Using stack, we can perform the reverse inorder traversal on the BST iteratively.
• Firstly, initialize the temporary variable ‘node’ with the root node, and maintain a variable ‘sum’ with an initial value of 0.
• Loop through until the stack is empty or the node becomes null.
• Now iteratively traverse to the rightmost node of the tree and while traversing push each node onto the stack.
• Now pop an element from the st...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

Round duration - 180 minutes
Round difficulty - Easy

1) 1 coding question need to be solved in 3 hours.there will be 50 test cases, need to pass all the test cases to go to the next rounds.STL in c++ cannot be used, we need to code anything we use from scratch

2) Coding questions will mainly be based on dynamic programming, graphs and backtracking, so prepare those topics well.

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The technical interview 1 has some questions based on basics of oops, Os and one/two coding questions.
Students who clear this round have to go for another technical round

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Add your answer
Q2. 
Delete a Given Node from Doubly Linked List
Ninja is learning about doubly linked lists and wants to remove a specified element from the list. Can you assist Ninja in doing this and returning the modified...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

The interview again began with my resume but it was very exhaustive. While my friends were asked about both resume and DSA concepts, my interview focused entirely on my resume. I had done a project on distributed computing and the interviewer asked me an application question on multi-threading and synchronisation. It was quite difficult because I was trying to explain my approach and I couldn’t make out if the interviewer was happy with my approach or not. Then he asked to design a contact database without the actual use of DBMS in java. Again I tried to explain my approach but it was tough. The interview ended after asing one or more coding questions.

Q1. 
Spiral Order Traversal of a Binary Tree
Given a binary tree with N nodes, your task is to output the Spiral Order traversal of the binary tree.
Input:
The input consists of a single line containing elem...read more
Add your answer
Q2. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was about 30 minutes long interview. First, she asked introduction, after that she was very interested in my internship that I did in summer and about my interests. She asked few common questions on that.