
Synthesized from 11 candidate submissions for ALL.
Navi’s hiring process is rigorous and role-specific, with a strong emphasis on problem-solving, system design, and behavioral fit. The process varies significantly across roles, from coding-heavy assessments for SDE-1/New Grad candidates to multi-dimensional evaluations for SDE-2 and above, including system design, product thinking, and managerial rounds. Feedback from candidates highlights variability in interviewer quality and communication, with some reporting positive experiences and others citing poor conduct or lack of clarity.
The candidate went through five rounds, including project discussions, technical rounds on SQL and data warehousing, a machine coding challenge, a hiring manager round, and a culture fit round. The candidate was selected for the SDE2 Data Platform role at NAVI.
The first round was a discussion about the candidate's current role and projects, where the candidate acted as the driver while the interviewer asked follow-up questions.
The candidate was asked to write a SQL query to find the third ranker from each region using two tables: student(id, marks, school, subject) and school(school, region). The round also included other data warehousing-related questions.
Write a query to get the third ranker of each region using the given tables: student(id, marks, school, subject) and school(school, region).
The candidate was given a 2-hour machine coding problem from Geektrust (https://www.geektrust.in/coding-problem/backend/ledger-co) and asked to upload the full working code on a platform.
Solve the Geektrust machine coding problem: https://www.geektrust.in/coding-problem/backend/ledger-co
The hiring manager round involved a deep dive into the candidate's resume and projects, which went well.
The final round focused on cultural fit, with questions like 'Why NAVI?'
Why NAVI?
The candidate faced a coding round with two problems of medium and hard difficulty, respectively. The outcome is not explicitly mentioned.
The coding round consisted of two LeetCode problems to solve within the allotted time.
https://leetcode.com/problems/ugly-number-ii/
https://leetcode.com/problems/maximum-frequency-stack/description/