Samsung interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Samsung
2 rounds | 7 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 6
Topics: Data Structure, Algorithm, OOPS, OS, Computer Network, DBMS.
Tip 1: Focus More on Linked List and Tree.
Tip 2: Prepare your project well.
Tip 3: Practice DSA in a regular manner.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1: Focus More on Linked List and Tree.
Tip 2: Prepare your project well.
Tip 3: Practice DSA in a regular manner.
Interview rounds
01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date31 Dec 2021
Coding problem3
OA was given during the evening slot at around 5 PM for a duration of 90 minutes. The platform was cocubes .
1. Right View
Moderate
35m average time
65% success
0/80
Asked in companies
Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom.
Problem approach
Step 1: I traverse the Tree in the root, right, and left manner using recursion.
Step 2: I take a variable for level and keep updating when the level increased.
Step 3: Store all right view elements in the vector.
2. Find number of Islands
Moderate
34m average time
60% success
0/80
Asked in companies
You have been given a non-empty grid consisting of only 0s and 1s. You have to find the number of islands in the given grid.An island is a group of 1s (representing land) connected horizontally, vertically, or diagonally. You can assume that all four edges of the grid are surrounded by 0s (representing water).
Problem approach
I used the DFS approach.
3. K Most Frequent Words
Moderate
36m average time
65% success
0/80
Asked in companies
You have been given an array/list 'WORDS' of 'N' non-empty words, and an integer 'K'. Your task is to return the 'K' most frequent words sorted by their frequency from highest to lowest.
Note:
If two words have the same frequency then the lexicographically smallest word should come first in your answer.
Follow up:
Can you solve it in O(N * logK) time and O(N) extra space?
Problem approach
I solved this problem using a map and priority queue data structure.
02
Round
Medium
Video Call
Duration60
Interview date10 Nov 2022
Coding problem4
It was a technical Interview round for 1 hour.
1. Merge Two Sorted Linked Lists
Moderate
15m average time
80% success
0/80
Asked in companies
You are given two sorted linked lists. You have to merge them to produce a combined sorted linked list. You need to return the head of the final linked list.
Problem approach
I solved this problem using two pointer approach.
2. Find LCA of Two Nodes in a BST
Moderate
15m average time
85% success
0/80
Asked in companies
You are given a binary search tree of integers with N nodes. You are also given references to two nodes P and Q from this BST. Your task is to find the lowest common ancestor(LCA) of these two given nodes.
Problem approach
First I tell the brute force approach after that Interviewer asked optimized approach. I was able to answer the optimized solution and then write pseudo code in google doc.
3.
What is the ACID in DBMS?
4.
What is Deadlock and how to handle Deadlock?
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 - 1
4 rounds | 6 problems
Interviewed by Samsung
Selected 
1921 views
0 comments
0 upvotes
SDE - 1
3 rounds | 4 problems
Interviewed by Samsung
Selected 1221 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Samsung
Rejected
2230 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Samsung
Rejected
419 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes