Inmobi

Role: SDE-I

College: Not Specified (On-campus)

Interview Date: Not Specified (December 2021)

Interview Type: On-Campus, Full-Time

Result: Not Specified (Implied positive, as candidate detailed all rounds)

Difficulty: Medium-Hard

Rounds: 4 rounds

Topics Asked: Data Structures, Algorithms, OOPS, DBMS, OS, Hashing, Projects, Behavioral

Experience:

The selection process for SDE-I at InMobi involved four elimination rounds.

Round 1 (Coding Round): This was an online coding assessment with 3 questions to be solved in 90 minutes. Questions were similar to: "Rotten Oranges" (multi-source BFS in a 1-D array), a medium graph-based DFS problem, and a "Sliding Window" problem similar to "Minimum Window Substring" (LeetCode). InMobi gave weightage to the time taken to solve the questions. Around 40 candidates were shortlisted.

Round 2 (Technical Round - 60 min): Conducted on MS Teams, this round started with introductions and a 15-minute discussion on projects and the resume. Two coding questions followed: "Unique Paths" (LeetCode), where recursive, memoized, and iterative solutions were discussed, along with a follow-up involving obstacles; and a problem to find the number of ways a batsman could score a target using 1s, 4s, and 6s (recursive and iterative).

Round 3 (Technical Round - 60 min): This round also began with introductions. The interviewer asked 4-5 questions on OOPS, DBMS, and hashing. Then, two more coding questions were presented: one involving a 2D grid with virus infection spread (multi-source BFS), and another related to "Longest Valid Parentheses" (LeetCode), where brute force, stack-based O(N), and space-optimized solutions were discussed.

Round 4 (Managerial+HR - 45 min): The interviewer started with an introduction, followed by a 30-minute discussion on projects mentioned in the resume. After that, behavioral and situational-based questions were asked.