Ho presentato la mia candidatura tramite l'università. Ho sostenuto un colloquio presso Zomato (Gurgaon, Haryana) nel mese di nov 2024
Colloquio
the interview consists of first round where you have an OA where you have 2 questions, both based of DP and graphs, codeforces level questions are asked and require CP experience. the second round is an interview with their SDE's consisting of a mix of DSA, System Design and CSE fundamentals.
Altre recensioni di colloqui per Software Development Engineer (SDE) presso Zomato
Ho sostenuto un colloquio presso Zomato (Gurgaon, Haryana)
Colloquio
The process was easy flowing and clear. The team was co operative and responsive. The interviwer was friendly and the process was co ordinated succesfully. Overall, it was a good experience
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 3 giorni. Ho sostenuto un colloquio presso Zomato (Gurgaon, Haryana) nel mese di ott 2025
Colloquio
The interview started with in depth project discussion , followed by OS , CN , DBMS and some basic DSA , they mostly focus on your dev skills , DSA question asked in the interview is easy-medium level
Domande di colloquio [1]
Domanda 1
Explain different OSI layers and diff between TCP vs UDP
Ho presentato la mia candidatura online. La procedura ha richiesto 4 mesi. Ho sostenuto un colloquio presso Zomato (Bengaluru) nel mese di set 2025
Colloquio
- Initial phone screening. The call arrived almost 4 months after my initial application.
- First round was technical screening round.
- I was asked to first describe the product I was working on the role I played. Questions about the tech stack followed as and when I mentioned them
- The second half of the interview was a DSA question. Fairly straightforward, if you have your basics revised. The interviewer was helpful and gave hints all along.
Domande di colloquio [1]
Domanda 1
this was the DSA question I got.
An array is called neat if it can be obtained by the concatenation of an arbitrary number of blocks (possibly zero). Note that an empty array is always neat.
You are given an array a consisting of n integers. Find the length of its longest neat subsequence.
A sequence c is a subsequence of a sequence a if c can be obtained from a by the deletion of several (possibly zero or all) elements from arbitrary positions.
