Loading Question...
This was an online coding assessment where we have to solve 3 coding question in 90 minutes.
Question is similar to rotten oranges problem where we have to apply multisource BFS in 1-D array.
This is medium graph based DFS problem.
Sliding Window problem similar to minimum window substring (leetcode).
Many students were able to solve 3 questions. InMobi gave weightage to the time in which candidates solved the questions . Around 40 were shortlisted for interview.
This round was conducted on MS teams.
It started with a introduction from interviewer side and then he asked me to introduce myself. We had a discussion on my projects and resume around 15mins and then he asked me two coding question.
Again started with a short intro from both sides. Then he asked me 4–5 questions on Oops,Dbms and hashing .Then he asked me 2 coding question.
1.Given a 2D grid containing values 1(affected with virus) and 0 (not affected with virus) at each position of grid. Each second the cell affected with virus will infect adjacent cells (left,right,up,down). A man is standing at given position inside the grid. We have to find whether this man will safely(without affected) come out from grid by moving 1 steps in 1 second. I solved using multisource BFS and he was satisfied with my approach.