
Synthesized from 41 candidate submissions for ALL.
Round Breakdown:
Key Questions:
Round Breakdown:
Key Questions:
OA Format: 60-90 minutes covering 2-3 DSA problems, often utilizing brute-force or optimized solutions to gauge core algorithmic thinking.
Round Breakdown:
Key Questions:
OA Format: Typically 60-90 minutes, featuring 3-4 DSA problems ranging from medium to hard difficulty (e.g., Dynamic Programming, Graphs, Data Structures). Shortlisting is competitive, often requiring a strong profile (CGPA, platform ratings).
Round Breakdown:
Key Questions:
Round Breakdown:
Key Questions:
Round Breakdown:
Key Questions:
The candidate received an offer from Zomato for the SDE1 role but rejected it due to location preference. The interview process included a technical round focused on DSA and project discussions, followed by a hiring manager round with detailed project and behavioral questions.
A 1.5-hour technical interview that extended to 2 hours. The round focused on DSA questions around Merge Intervals problems. There was an in-depth discussion of projects worked on in the candidate's current organization, along with behavioral questions about leaving the current organization.
DSA questions around Merge Intervals problems
A 1.5-hour discussion with the hiring manager about the role and work of the team the candidate would join. The round involved an in-depth discussion of the candidate's previous projects and detailed questions about the technologies used in these projects. Behavioral questions about why the candidate wanted to join Zomato were also asked.
The candidate faced a single technical round with an engineering manager for a 6-month SDE intern position at Zomato. The round lasted 1 hour and 10 minutes and included discussions on projects, DSA problems, OOPs concepts, and SQL. The candidate successfully solved all problems with optimized solutions.
The interviewer started with questions about the candidate's projects and followed up with detailed counter-questions. Then, the candidate was asked two DSA problems: one involving generating all subsets under specific conditions and another being a tweaked version of the Longest Common Subsequence (LCS) problem, which the candidate solved optimally. Towards the end, the interviewer asked in-depth questions on OOPs concepts and SQL/relational database concepts.
Generating all subsets under specific conditions
A tweaked version of the Longest Common Subsequence (LCS) problem using dynamic programming
In-depth OOPs concepts
SQL or relational database questions