Location : Hyderabad
Position : SDE-1
Advice : Too much focus on LP. Interviews are medium level only. So, plan everything that
can be asked to you as a part of LP. HR advised me to take care of LP part a lot. You will be rejected even if you solve all the problems based on your answer to LP questions.
Round 1. Online coding (two problems (easy level) , remember DP one only)
DP (count ways to reach the nth stair using any step from the given array)
Interviews: A lot of focus was on multithreading and operating system.
Listing DSA problems :
Round 2
1. A variant of topological sort in a graph. 2. Find smallest +ve missing integer from given array without extra space.
(follow up : Array can contain both positive and negative numbers).
Ex : ar [1,9,8] output :2
Some questions on cs subjects as mentioned above.
Round 3. (More graph problems :-P)
You have locking suitcase system (the one in which there will be number codes). Find the minimum number of steps to reach from given number to target number. You can move any place digit at a time. (for n-digit codes, discuss complexity). Ex : start : 0-0-1
Target : 1-0-0 min steps = 2 …..changing an xth place digit by b will be counted as b steps.
follow -up...what if you are not allowed to use certain numbers(not digits but whole number )(given as array)
Ex: [100,234,115]
One-dfs based problem (had to apply it in a matrix, easy IMO)
Round 4.
More theoretical round….too much cs subject questions with some on database working (maybe because I work in database company).
Check whether given infix expression is correct or not based on some conditions.
I felt interviewer was expecting me to use stacks but I gave a recursive solution and used memoization kind of approach to optimize. He didn’t ask for correctness too. I guess he was looking how I am approaching this only.
Round 5.
Bar Raiser
You should know multithreading and OS for passing this round IMO. Coding question was straight forward.
-
minimum number of platforms required at a railwaybus station(famous problem)