Navi | SDE 1 | Aug 2026
Summary
I interviewed for an SDE I (Frontend) role at Navi and cleared the first round, with the second round pending.
Full Experience
I applied through a LinkedIn post for SDE I (Frontend). HR contacted over call, discussed further rounds.
Round 1 (PS-DS Round) (1hr)
Two DSA medium questions were asked, I was able to solve both of them within time limit (~40 mins). Interviewer was helpful and provided hints.
- Q1. https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/description/
- Q2. https://leetcode.com/problems/ones-and-zeroes/description/
Explain brute force, then optimise, also be ready to explain TC & SC of your solutions.
Verdict: Cleared
Round 2 (Technical Screening Round) (30 mins)
Resume deep dive, justify your work & metrics. Most challenging work, followed by questions to explain alternate solution and optimisation.
Verdict: waiting for response
Interview Questions (2)
Lowest Common Ancestor of a Binary Search Tree
Given the root of a binary search tree (BST) and two nodes, find their lowest common ancestor (LCA) in the tree.
Ones and Zeroes
Given an array of binary strings and two integers m and n, find the size of the largest subset of strings such that the total number of 0's in the subset is at most m and the total number of 1's is at most n.