Samsung Interview Experience | On-campus 2019 for Samsung Research Institute, Delhi

Campus: NIT Raipur


Round 1: Online Coding Round

You’ll be given a grid as below:



                       0 1 0 2 0 --> Non highlighted part
                       0 2 2 2 1
                       0 2 1 1 1
                       1 0 1 0 0
                       0 0 1 2 2
                       1 1 0 0 1
                       x x S x x  -->highlighted yellow
 In the grid above,     

1: This cell has a coin.
2: This cell has an enemy.
0: It contains nothing.
The highlighted(yellow) zone is the control zone. S is a spaceship that we need to control so that we can get maximum coins.
Now, S’s initial position will be at the center and we can only move it right or left by one cell or do not move. At each time, the non-highlighted part of the grid will move down by one unit.
We can also use a bomb but only once. If we use that, all the enemies in the 5×5 region above the control zone will be killed.
If we use a bomb at the very beginning, the grid will look like this:

0 1 0 2 0  --> Non highlighted part
0 0 0 0 1
0 0 1 1 1
1 0 1 0 0
0 0 1 0 0
1 1 0 0 1
x x S x x  --> highlighted yellow
As soon as, the spaceship encounters an enemy or the entire grid has come down, the game ends.     
For example,    
At the very first instance, if we want to collect a coin we should move left **( coins=1)**. This is because when the grid comes down by 1 unit we have a coin on the second position and by moving left we can collect that coin. Next, we should move right to collect another coin **( coins=2)** .
After this, remain at the same position **( coins=4)**.
This is the current situation after collecting 4 coins.
 0 1 0 2 0                 0 1 0 0 0
0 2 2 2 1 -->after using  0 0 0 0 1
x x S x x -->bomb         x x S x x

Now, we can use the bomb to get out of this situation. After this, we can collect at most 1 coin. So maximum coins=5.

Code : https://ide.geeksforgeeks.org/tiyLThcuSN

37 students were selected after this round

Tip : Practice backtracking as much as possible, don’t go for optimizing your code rather focus on the logic. Also, try coding without STL as no such functionality is available during the test. Practice more of Graph and Backtracking and you’ll be able to clear the coding round.

Round 2: Technical Interview

The Round started with the interviewer introducing himself, and then he asked me to introduce myself and asked my interests. He then asked me to solve a puzzle (Tip : Solve all the puzzles present in GeeksforGeeks). I took my time and was able to solve it. Then he gave me 3 basic coding questions to solve in a white paper :

1. Implement Queue using two Stacks

2. Merge two Sorted Linked Lists

3. Find the Count of Maximum element in Array


Then he asked me questions from OS :

a) What is difference between Process and Thread ?

b) What is multi-threading ?

c) How will you identify a thread ?

d) Application of threading, its feasibility ?

e) Difference between Semaphore and Mutex and their applications in real life.

Round 3: HR Interview

HR was very friendly. She asked me,

  1. Tell me about yourself.
  2. What technologies have you learnt recently and what was the outcome ?
  3. Tell me about your Family.
  4. What are your expectations from Samsung ? What is your future goal ?
  5. Do you know what kind of work we do at SRI Delhi ?
  6. Give me an innovative idea or feature that can be added on our TVs.
  7. Do you have any plans for MS ?
  8. Do you have any questions for me ?

Finally 12 students were selected including me 🙂

Tip : Show that you are the desirable person for the job,  Never mention any negative points about yourself or anyone during HR Interview.
All The Best 🙂

Write your Interview Experience or mail it to contribute@geeksforgeeks.org



My Personal Notes arrow_drop_up

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.