Samsung Interview Questions, Process, and Tips

Q1. What are your salary expectations?
Add your answer
Q2. What is your family background?
Add your answer
Q3. Share details of your previous job.
Add your answer
Q4. Why should we hire you?
Add your answer
Q5. Where do you see yourself in 5 years?
Add your answer
Q6. What are your strengths and weaknesses?
Add your answer
Q7. Tell me about yourself.
Add your answer

One question of 3 hrs with 50 test cases all needed to pass.

Q1. Core computer science concept. DS, operating system, bits
Add your answer

Q1. What is your family background?
Ans. 
My family background is diverse and multicultural, with members from different professions and backgrounds.
• My father is a doctor and my mother is a teacher.

• I have two siblings, one is an engineer and the other is a lawyer.

• We have relatives living in different countries, including the USA, India, and Australia.

• Our family gatherings are always filled with interesting conversations and cultural exchange.
Answered by AI
Add your answer
Q2. Share details of your previous job.
Ans. 
I worked as a Software Engineer at XYZ Company.
• Developed and maintained software applications using Java and Python.

• Collaborated with cross-functional teams to gather requirements and design solutions.

• Implemented unit tests and performed code reviews to ensure code quality.

• Participated in agile development processes and attended daily stand-up meetings.

• Resolved bugs and issues reported by users and provided technical s...read more
Answered by AI
Add your answer
Q3. Where do you see yourself in 5 years?
Ans. 
In 5 years, I see myself as a senior software engineer leading a team of developers, working on complex projects and contributing to the growth of the company.
• Leading a team of developers

• Working on complex projects

• Contributing to the growth of the company
Answered by AI
Add your answer
Q4. What are your strengths and weaknesses?
Ans. 
My strengths include problem-solving, attention to detail, and teamwork. My weaknesses include time management and public speaking.
• Strengths: problem-solving

• Strengths: attention to detail

• Strengths: teamwork

• Weaknesses: time management

• Weaknesses: public speaking
Answered by AI
Add your answer
Q5. Tell me about yourself.
Ans. 
I am a software engineer with experience in developing and maintaining software applications.
• I have a Bachelor's degree in Computer Science.

• I have worked on various projects using different programming languages such as Java, C++, and Python.

• I am skilled in software development methodologies like Agile and have experience with version control systems like Git.

• I have strong problem-solving and analytical skills, which h...read more
Answered by AI
Add your answer

Round duration - 120 Minutes
Round difficulty - Medium

The round had 2 coding problems to solve with varying difficulty. Each candidate had a different set of questions. The round was around 2 pm. The webcam was turned on to keep an eye on candidates.

Q1. 
Bursting Balloons Problem
Given an array ARR of size N, where each element represents the height of a balloon. The task is to destroy all balloons by shooting arrows from left to right. When an arrow hits...read more
Ans. 
Approach : 

1 )We will use a map data structure that will store the height of fired arrows.
2) Start a loop from i = 0 to i = N - 1 and for the i’th balloon if the map contains the value ARR[i] then it 
means this balloon will get hit by the previous arrow.
2.1) Therefore decrease the count of ARR[i] in the map and if it becomes 0 remove the key from the 
map.
2.2) Increase the count of ARR[i]-1 in the map bec...read more
Answered Anonymously
Add your answer
Q2. 
Count Leaf Nodes in a Binary Tree
Count the number of leaf nodes present in a given binary tree. A binary tree is a data structure where each node has at most two children, known as the left child and the...read more
Ans. 
Approach : 
1) Given a tree node ROOT, initialise a queue of nodes NODEQUEUE and COUNT by 0.
2) Push ROOT into NODEQUEUE.
3) While NODEQUEUE is not empty do:
3.1) Initialize node TEMP as NODEQUEUE.peek().
3.2) If TEMP.left is not NULL, push TEMP.left to NODEQUEUE.
3.3) If TEMP.right is not NULL, push TEMP.right to NODEQUEUE.
3.4) If TEMP.right and TEMP.left are both NULL, increase COUNT by 1.
4) Return COUNT

TC : O(N), whe
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions related to DSA. I was first asked to explain my approach with proper complexity analysis and then code the soution in any IDE that I prefer.

Q1. 
Rod Cutting Problem Statement
Given a rod of a certain length, the rod can be divided into different sizes, each with an associated cost. Your task is to determine the maximum cost that can be obtained by...read more
Ans. 
Approach : This was a very standard problem related to DP and I had already solved it in platforms like LeetCode and CodeStudio . I first gave the recursive approach and then optimised it using memoisation. The interviewer then asked me to do the same problem using iterative DP this time.

Steps : 

1) Declare an array, ‘COST’ of size ‘'N'+1’ and initialize 'COST'[0] = 0. We use this 1 D array to store the previous CO...read more
Answered Anonymously
Add your answer
Q2. 
Count Subarrays with Given XOR Problem Statement
You are given an array of integers ARR and an integer X. Your task is to determine the number of subarrays of ARR whose bitwise XOR is equal to X.
Example...read more
Ans. 
Approach 1 (Brute Force) :

1) Create a variable ans, which stores the total number of subarrays. We will set the variable ans as 0.
2) Iterate index from 0 to N - 1.
3) Iterate pos from index to M - 1.
3.1) We will maintain a variable currentXor, which will store the XOR of all elements present in the 
current subarray. We will set currentXor as 0.
4) We will traverse num from index to pos. We will update currentXor wit...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

Q1. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
Approach : I solved this problem using Multisource-BFS as I had solved questions similar to this while preparing for my interviews.

Steps :

1) Initialize ‘TIME’ to 0.
2) Declare a Queue data structure and a 2D boolean array ‘VISITED’.
3) Push all cells with rotten orange to the queue.
4) Loop till queue is not empty
4.1) Get the size of the current level/queue.
4.2) Loop till the 'LEVEL_SIZE' is zero:
i) Get the front cell of ...read more
Answered Anonymously
Add your answer
Q2. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. 
Approach 1(Using Hashing) :

We are going to maintain a lookup table(a Hashmap) that basically tells if we have already visited a node or not,
during the course of traversal.

Steps :
1) Visit every node one by one, until null is not reached.
2) Check if the current node is present in the loop up table, if present then there is a cycle and will return
true, otherwise, put the node reference into the lookup table and repeat the...read more
Answered Anonymously
Add your answer
Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Ans. 
If we light a stick, it takes 60 minutes to burn completely. What if we light the stick from both sides? It will take exactly half the original time, i.e. 30 minutes to burn completely.

1) 0 minutes – Light stick 1 on both sides and stick 2 on one side.
2) 30 minutes – Stick 1 will be burnt out. Light the other end of stick 2.
3) 45 minutes – Stick 2 will be burnt out. Thus 45 minutes is completely measured.
Answered Anonymously
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their
approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

Q1. 
Longest Palindromic Substring Problem Statement
You are provided with a string STR of length N. The task is to find the longest palindromic substring within STR. If there are several palindromic substring...read more
Ans. 
Approach :

1) Create a 2-D dp boolean vector(with all false initially) where dp[i][j] states whether s[i...j] is a palindrome or not and initilialise a variable ans=1 which will store the final answer.

2) Base Case : For every i from 0 to n-1 fill dp[i][i]=1 ( as a single character is always a palindrome ) .

3) Now, run 2 loops first one from i=n-1 to i=0 (i.e., tarverse from the back of the string) and the second one fro...read more
Answered Anonymously
Add your answer
Q2. 
Quick Sort Problem Statement
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...read more
Ans. 
Approach :

1) Select any splitting value, say L. The splitting value is also known as Pivot.
2) Divide the stack of papers into two. A-L and M-Z. It is not necessary that the piles should be equal.
3) Repeat the above two steps with the A-L pile, splitting it into its significant two halves. And M-Z pile, split into its halves. The process is repeated until the piles are small enough to be sorted easily.
4) Ultimately, the...read more
Answered Anonymously
Add your answer
Q3. What are friend functions in C++?
Ans. 
Answer :

1) Friend functions of the class are granted permission to access private and protected members of the class in C++. They are defined globally outside the class scope. Friend functions are not member functions of the class.

2) A friend function is a function that is declared outside a class but is capable of accessing the private and protected members of the class.

3) There could be situations in programming wher...read more
Answered Anonymously
Add your answer
Q4. What is the difference between Early Binding and Late Binding in C++?
Ans. 
Answer : 

OOP is used commonly for software development. One major pillar of OOP is polymorphism. Early Binding and Late Binding are related to that. Early Binding occurs at compile time while Late Binding occurs at runtime. In method overloading, the bonding happens using the early binding. In method overriding, the bonding happens using the late binding. The difference between Early and Late Binding is that Early...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was coding round and was conducted on Cocubes platform. It is not IDE but kind of white board coding platform. C/C++, Java and Python were only allowed languages.

Round duration - 30 minutes
Round difficulty - Easy

This was pen and paper round. Total 40 shortlisted candidates were grouped into 8 groups (each of 5). Each group was given a coding question which they have to solve on paper and explain it to the recruiter. 2 to 3 from each group were selected for the next round.

Round duration - 60 minutes
Round difficulty - Easy

This was general face to face Data Structures and Algorithms based round.

Q1. How do you perform a spiral order traversal of a binary tree? Please provide an explanation or code to print the binary tree in spiral order.
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

It was the last round.

Round duration - 180 Minutes
Round difficulty - Medium

Round was held in the morning at 10 am.

Q1. 
M - Coloring Problem Statement
Given an undirected graph with 'N' nodes in the form of an adjacency matrix and an integer 'M', determine if it is possible to color the vertices of the graph using at most ...read more
Ans. Naive Approach
• We will generate all possible combinations of colors possible for coloring the given graph.
• This can be done recursively by assigning a node each color from 1 to M and doing the same for all nodes.
• We further check if the adjacent vertices don’t have the same color.
• If we find such a combination of vertices, we return “Yes”. Otherwise, we return “No”.
Space Complexity: O(n)Explanation:
O(N), where N is the nu...read more
Answered Anonymously
Add your answer

Round duration - 40 Minutes
Round difficulty - Medium

The round was held in the evening

Q1. 
Trie Data Structure Implementation
Design and implement a Trie (prefix tree) to perform the following operations:
• insert(word): Add a string "word" to the Trie.
• search(word): Verify if the string "w...read more
Ans. Hashmap/Dictionary Approach
Firstly we have defined the node class of Trie having members:
• child  - storing the address of child nodes (hashmap of character number and address of Trie Node)
• isEnd - a bool variable for marking this node as an end of some word.
Then we have defined our Trie Class having members:
• root - The root node for whole Trie, every word starts from this node.
• insert(word) - To insert a string "word"...read more
Answered Anonymously
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

Was held in the morning around 9 am