SDE - 1
Samsung
4 rounds | 8 Coding problems
2513 views
Interview preparation journey
Journey
I was unaware of this coding stuff till my school life. I got to know about the field of computer science in my class 11th. I found it intresting and decided that I will pursue my career in the field of computer science. I took admission in B.Tech CSE and learned the various concepts like DSA and all.
Application story
It was the peak placement season, and every student of 4th year were waiting for any company to visit the campus. I was informed that Samsung was going to visit our campus, and I was very excited as I was confident in my coding skills. As, I got 10 days to revise everything, so I did 120 question DSA sheet and revised some basic concepts. I went through interview process, and finally, I was selected at last.
Why selected/rejected for the role?
I was confident during the full interview process. Actually, I worked a lot on my communications skills and I think they were the main reasons for me getting par the selection process.
Preparation
Duration: 3 months
Topics: Only Data Structures and Algorithms.
Tip

Be real during the interview and don’t show off. Also, practice Data Structures and Algorithms based problems as only through practice you will be able to solve questions quickly during the interview. Also prepare for theory subjects like Object-Oriented Programming System, Database Management System, Computer networks, etc.

Application process
Where: Campus
Eligibility: CGPA above 7.5
Resume tip

Keep your resume simple. Prefer LaTeX. Don't use colourful templates. They are too common and very unprofessional. Keep it black and white and keep your content richer. Keep it of 1 page and 2 pages only if you have achieved a lot. Don’t use fillers. Any unwanted information on the resume leaves a bad impact on the interviewer.

Interview rounds
01
Round
Easy
Online Coding Test
Duration60 minutes
Interview date29 Jul 2019
Problems2
Print leaf nodes of Binary Tree

Given a binary tree, we need to write a program to print all leaf nodes of the given binary tree from left to right. That is, the nodes should be printed in the order they appear from left to right in the given tree.

Problem approach
• I used tree traversal approach to solve the question and check the left and right children of the node if they both are NULL then just print that node. It passed all test cases.
Minimum Operations

Find the minimum operations you would require to convert a string to its given permutation. Take a character from anywhere and put it in the end - this is the only operation which is allowed.

Problem approach
• I tried solving it using Dp approach but not able to pass test cases.
02
Round
Easy
Coding Test - Pen and paper
Duration30 minutes
Interview date19 Aug 2019
Problems1
m*n grid with 0s and 1s in it

You are given an m*n grid with 0s and 1s in it. Consider a 3*3 block in it. 111 010 111 Represents character I. Similarly, 101 111 101 Represents character H. You can similarly think of how to represent T. Count the number of Hs, Is, and Ts assuming they don't share any edge or are attached to each other in any way. They are disconnected from each other.

Problem approach
• Firstly I told the interviewer brute force approach. Search every 3*3 cell. To optimize it I gave the DFS approach and push all the coordinates of 1s in a vector as a connected component and using simple if and else tests, one can check if the connected component is H or I or T. He was pretty much satisfied by my approach.
03
Round
Easy
Face to Face
Duration60 minutes
Interview date19 Aug 2019
Problems3
Spiral order traversal of a bnary tree

Print the binary Tree in spiral order.

Problem approach
• I used the approach based on using two stacks. We can use one stack for printing from left to right and another stack for printing from right to left. In every iteration, we have nodes of one level in one of the stacks. We print the nodes and push nodes of the next level in another stack.

Merge Sort On A Linked List.

Problem approach
• For sorting I explained the interviewer merge sort in linked list which divides the linked list into two halves and then merge them.  wrote a fully commented code for him in good handwriting. I calculated mid point through slow and fast pointer approach as well.
Calculate XoR

Given an integer N, find value of XoR of all integers from 1 to N.

Sample Case:-                                       &n...

view more
Problem approach
• I explained him simple brute force approach through the loop but the interviewer was expecting a more efficient solution that I couldn‘t crack up.
04
Round
Easy
HR Round
Duration45 minutes
Interview date19 Aug 2019
Problems2
Problem approach

Just gave the interviewer a basic introduction about me with the CGPA and other internship experiences.

Problem approach
• I explained the basic working of my projects and technology stack on which my projects were developed. Then he asked me for flow chart for one of my projects and I explained to him properly, the flow chart of, my project with all the necessary details.
Join the Discussion
Saby_S |Level 6
8 Dec 2021

0 replies
Similar interview experiences
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
1730 views
SDE - Intern
2 rounds | 4 problems
Interviewed by Samsung
56 views
SDE - 1
3 rounds | 9 problems
Interviewed by Samsung
24 views
SDE - Intern
3 rounds | 5 problems
Interviewed by Samsung
13 views
Companies with similar interview experiencs
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
57324 views