# Samsung Bangalore (SRI-B) Interview Experience

Round 1:

Round 1 was an online coding round. Only one question was asked and 50 test cases were given.Only those students who cleared all 50 test cases were shortlisted for next round. The Question was fishery problem (it was previously asked). Make sure that you go through all the previously asked written problems of Samsung. The question was :

Fishing Spots: 1 to N

3 Gates with gate position and number of fishermen waiting to get in

Distance between consecutive spots = distance between gate and nearest spot = 1 m.

Fishermen are waiting at the gates to get in and occupy nearest fishing spot. Only 1 gate can be opened at a time and all fishermen of that gate must occupy spots before next gate is open.

There could be 2 spots closest to the gate. Assign only 1 spot to the last fisherman in such a way that we get minimum walking distance. For rest of the fishermen, ignore and assign any one.

Write a program to return sum of minimum distance need to walk for fishermen.

The problem can be solved using Recursion and Backtracking by considering all possible combinations. Time allotted was 3 hours. 13 students were shortlisted.

Tip : Make sure you have solved all previously asked problems.

Round 2:

The duration of this round was between 30-45 mins.

Tip : Make sure you have worked well on your projects and internships(if any) and you have sound knowledge about your core subjects.

Round 3:

https://www.geeksforgeeks.org/union-find-algorithm-set-2-union-by-rank/

https://www.geeksforgeeks.org/kruskals-minimum-spanning-tree-algorithm-greedy-algo-2/

Then he gave me a problem. The problem statement was something like that:

Given a matrix. The matrix consists of some randomly placed n dustbins represented by (xn, yn)(coordinates were given). If 1 in a cell represents dirt and 0 means clean. Moving to each cell takes 1 amount of work. Now you need you calculate minimum amount of work in moving all the dirt to the dustbin. I told him a solution using BFS and then he added one more constraint that max capacity of dustbin is there. Now we need to calculate the most optimal amount of work to move all the dirt to dustbin. If not possible return -1. I thought about backtracking solution and optimized it by calculating distances of dirt from every dustbin.

This round lasted about 1.5 hours. Interviewer was very interactive.

Tip : Make sure to cover the graph data structure and graph related problems.

Round 4:

He just called me and asked about company and since I am from ECE background, he asked me that why I want to join an IT company. It was just a 5-10 min round.

After all the rounds, 4 students were shortlisted and I was one of them.

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.

Article Tags :
Practice Tags :

1

Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.