Samsung Interview Experience by Jatin Sood

New update is available. Click here to update.

SDE - 1

Samsung

3 rounds | 7 Coding problems

Jatin Sood

Fresher | Jul 2019

Selected

1688 views

0 comments

10 upvotes

Interview preparation journey

Preparation

Duration: 2 months

Topics: Data Structures and Algorithms

Tip

For Samsung do prepare for recursion with backtracking problems and also graph-related algorithms problems as these are most important parts of interview in Samsung. Also, you can find topic wise Data Structures and Algorithms problems on Codezen or Geeks For Geeks. You may refer them as I personally use these portals and they helped me a lot.

Application process

Where: Campus

Eligibility: 7

Resume tip

Interview rounds

Round

Easy

Online Coding Test

Duration 180 minutes

Interview date29 Jul 2020

Problems1

Minimum Time in Wormhole Network

There is a source (S) and destination (D) and a spacecraft has to go from S to D. There are N number of wormholes in between which has the following properties:

Each wormhole has an entry and an exit.

Each wormhole is bi-directional i.e. one can enter and exit from any of the ends.

The time to cross the wormhole is given and the space craft may or may not use the wormhole to r...

Problem approach

I simply used recursion with the backtracking approach here and iterated over each wormhole and call recursion with that wormhole as starting point and calculated the minimum answer.

Try solving now

Round

Easy

Face to Face

Duration30 minutes

Interview date29 Jul 2020

Problems4

What are stack and heap?

Problem approach

I simply gave him a definition of both the data structures with their particular operations and their properties.

Loot House

Find maximum possible stolen value from houses

There are n houses build in a line, each of which contains some value in it. A thief is going to steal the maximal value of these houses, but he can’t steal in two adjacent houses because the owner of the stolen houses will tell his two neighbours left and right side. What is the maximum stolen value?

Examples:

...

Problem approach

I explained this question to the interviewer through the Dynamic programming approach by including the current element or excluding the current element and finding the maximum in both cases.

Try solving now

Components of android.

Problem approach

I explained to him all the components of android with their usage in my projects.

Discussion on the project(Tell me about your project)

Problem approach

I started by explaining to him the features and working of my projects by giving the database schema and other details. Then draw to him the basic workflow of both my projects to him.
After this discussion, the interviewer was happy with my response.

Round

Easy

HR Round

Duration20 minutes

Interview date29 Jul 2019

Problems2

Tell me about yourself and your family.

Problem approach

I gave him my brief introduction with the short information about my family members.

The architecture of android.

Problem approach

I draw the proper architecture of android and explained him properly with working of each component.
Finally, after evaluation I got offer from the company.