Samsung interview experience Real time questions & tips from candidates to crack your interview
SDE - Intern
Samsung
2 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1 : Regarding DSA preparation, I have a theory. 20 percent of the questions will be asked in 80 percent of the interview and 80 percent of the questions will be asked in 20 percent of the interviews. In short, some questions have a very high chance of coming up during the interviews and some have very low chance. We should focus more on the questions that have more chance of coming up in the interview. You can find these questions on Striver SDE Sheet, InterviewBit, Leetcode 100 most liked, Leetcode 100 most important.
Tip 2 : Try to find patterns in the questions. Group them according to a pattern for better understanding. Make notes in Excel, word or hand written and revise them.
Tip 3 : Try to solve the questions that have more chance of coming up in the interview with many different approaches.
Application process
Where: Campus
Eligibility: Above 8 CGPA
Tip 1 : Make Sure that your resume is simple and also try to fit all the information in only one page.
Tip 2 : Have at least 2 projects with the latest technologies,Github link of projects should be provided
Interview rounds
01
Round
Easy
Video Call
Duration45 Minutes
Interview date22 Aug 2021
Coding problem2
1. Make Maximum Number
Moderate
18m average time
85% success
0/80
Asked in companies
Given a linked list such that each node represents a digit. Construct the maximum number possible from the given digits.
You just need to print the maximum Integer that can be formed
Problem approach
Given a linked list such that each node represents a digit. Construct the maximum number possible from the given digits.
You just need to print the maximum Integer that can be formed
2. Maximum sum path from the leaf to root
Easy
10m average time
90% success
0/40
Asked in companies
You are given a binary tree of 'N' nodes.
Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the root to leaf paths.
For Example:
All the possible root to leaf paths are:
3, 4, -2, 4 with sum 9
5, 3, 4 with sum 12
6, 3, 4 with sum 13
Here, the maximum sum is 13. Thus, the output path will be 6, 3, 4.
Note:
There will be only 1 path with max sum.
Problem approach
You are given a binary tree of 'N' nodes.
Your task is to find the path from the leaf node to the root node which has the maximum path sum among all the root-to-leaf paths.
02
Round
Easy
Video Call
Duration45 minutes
Interview date22 Aug 2021
Coding problem2
1. Find Path
Hard
10m average time
90% success
0/120
Asked in companies
You are given a tree with 'N' nodes with 'N' - 1 distinct edge. You are also given two nodes 'N1' and 'N2'. You have to find and print the shortest path between 'N1' and 'N2'.
A tree data structure is a nonlinear hierarchical data structure that consists of nodes connected by edges.
Note
1. There is no cycle present in a tree.
2. All values in the tree are unique.
3. Both nodes will always exist in the tree.
Problem approach
You are given a tree with 'N' nodes with 'N' - 1 distinct edge. You are also given two nodes 'N1' and 'N2'. You have to find and print the shortest path between 'N1' and 'N2'.
A tree data structure is a nonlinear hierarchical data structure that consists of nodes connected by edges.
2. Count Leaf Nodes
Easy
10m average time
90% success
0/40
Asked in companies
You are given a Binary tree. You have to count and return the number of leaf nodes present in it.
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child
A node is a leaf node if both left and right child nodes of it are NULL.
Problem approach
You are given a Binary tree. You have to count and return the number of leaf nodes present in it.
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child
A node is a leaf node if both left and right child nodes of it are NULL.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - Intern
3 rounds | 4 problems
Interviewed by Samsung
Selected 
1351 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
Selected 918 views
0 comments
0 upvotes
SDE - Intern
2 rounds | 8 problems
Interviewed by Samsung
Selected 1056 views
0 comments
0 upvotes
SDE - Intern
3 rounds | 5 problems
Interviewed by Samsung
Selected 1616 views
1 comments
0 upvotes
Companies with similar interview experiences
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
Rejected
15605 views
4 comments
0 upvotes
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
Selected 15499 views
1 comments
0 upvotes
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
Selected 10216 views
2 comments
0 upvotes