Off campus- Delhi drive (SDE-1 Bangalore)

**1st round: f2f**

Tell me about yourself.

Most challenging task.

http://www.geeksforgeeks.org/connect-leaves-doubly-linked-list/

http://www.geeksforgeeks.org/check-for-balanced-parentheses-in-an-expression/

Small modification in it. Parenthesis pairs are given in a separate list. You have to optimize the problem by suggesting the method you will need to store the pairs.

**2nd round: Hiring manager**

What is the angle between hour and minute hand at 12:15. I said 90’ but corrected myself immediately.

So he told me the importance that for huge no of clients this small mistake can create a blunder.

He asked me a scenario where I faced this thing and thereby improved the time complexity.

Lot of behavioural questions like conflicts with manager, team collaboration etc.

**3rd round: f2f**

http://www.geeksforgeeks.org/level-order-traversal-in-spiral-form/

He asked me if have heard of nut and bolt problem. I didn’t so he moved to next question.

Given an array. Find the maximum number of groups of size of 2 or 3 that can be formed such that sum of the numbers in group is divisible by 3. No number can be reused.

**4rd round: Bar raiser**

Convert an integer to its roman. He asked me to consider cases with integers containing 4 and 9. I didn’t understand properly.

He asked me if I I did anything extraordinary apart from my daily work in the office and what challenges I faced.

http://www.geeksforgeeks.org/largest-subarray-with-equal-number-of-0s-and-1s/

He did not accept this solution and asked me to optimize. This round didn’t go well, so I was not selected.

**
Tips:** Solve all the data structures related problems from geeksforgeeks and start practicing to write perfect code for any problem.

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