Samsung Electronics interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Samsung Electronics
upvote
share-icon
4 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 6 months
Topics: Data Structure, Algorithm, OOPs concepts, DBMS , Operating System and Computer Networking
Tip
Tip

Tip 1 : Try to code daily(consistency)
Tip 2 : Do not copy and paste solutions if you are not able to solve some problem, take hint or understand the approach and try to write your own code.
Tip 3 : Push your limits

Application process
Where: Campus
Eligibility: 7.5
Resume Tip
Resume tip

Tip 1 : It should be short and clean
Tip 2 : Make sure you know everything that you are putting in your Resume, try to build your Resume based on company.

Interview rounds

01
Round
Hard
Online Coding Interview
Duration180 mins
Interview date11 Sep 2019
Coding problem1

Coding Round of 3 hours having only one questions

1. Shortest path in an unweighted graph

Moderate
25m average time
70% success
0/80
Asked in companies
Morgan StanleyBNY MellonWalmart

The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a road is connecting two houses ‘X’ and ‘Y’ which means you can go from ‘X’ to ‘Y’ or ‘Y’ to ‘X’. It is guaranteed that you can reach any house from any other house via some combination of roads. Two houses are directly connected by at max one road.

A path between house ‘S’ to house ‘T’ is defined as a sequence of vertices from ‘S’ to ‘T’. Where starting house is ‘S’ and the ending house is ‘T’ and there is a road connecting two consecutive houses. Basically, the path looks like this: (S , h1 , h2 , h3 , ... T). you have to find the shortest path from ‘S’ to ‘T’.

For example
In the below map of Ninjaland let say you want to go from S=1 to T=8, the shortest path is (1, 3, 8). You can also go from S=1 to T=8  via (1, 2, 5, 8)  or (1, 4, 6, 7, 8) but these paths are not shortest.

altImage

Problem approach

I solved using DFS

Try solving now
02
Round
Medium
Face to Face
Duration60 mins
Interview date12 Sep 2019
Coding problem1

At Afternoon, Environment was good.

1. Query related questions and basic DBMS

1. What is ACID properties?

 

Problem approach

Tip 1:Prepare query related questions
 

03
Round
Medium
Face to Face
Duration50 mins
Interview date12 Sep 2019
Coding problem1

DBMS related questions

1. OS questions

1. What is a deadlock?

04
Round
Easy
HR Round
Duration20 minutes
Interview date12 Sep 2019
Coding problem1

Basics of life related questions

1. Basic HR Questions

1. Where do you see yourself after 5 years?

2. What are your strengths and weaknesses?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What does the SQL function NOW() return?

Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 4 problems
Interviewed by Samsung Electronics
673 views
0 comments
0 upvotes
SDE - 1
3 rounds | 6 problems
Interviewed by Samsung Electronics
632 views
0 comments
0 upvotes
SDE - 1
4 rounds | 7 problems
Interviewed by Samsung Electronics
875 views
0 comments
0 upvotes
company logo
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
1996 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
110296 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
54105 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
33181 views
6 comments
0 upvotes