SDE-1
Interview Date
13-08-2026
Result
Selected
Difficulty
Medium
Rounds
01
Drive Type
Off-Campus
Topics asked
Detailed experience
Find the longest subarray of a given array where the sum of its elements is divisible by an integer k. A multi-source Breadth-First Search (BFS) problem, similar to LeetCode's "Rotting Oranges," but presented with a different narrative context. Find the Lowest Common Ancestor (LCA) of two employees in an organizational hierarchy. This can be solved using either a brute-force approach or binary lifting.