Me postulé a través de una facultad o universidad. Acudí a una entrevista en Zomato (Gurgaon, Haryana) en nov 2024
Entrevista
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.
Otras evaluaciones sobre las entrevistas para el cargo de Software Development Engineer (SDE) en Zomato
Acudí a una entrevista en Zomato (Gurgaon, Haryana)
Entrevista
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
Me postulé a través de una facultad o universidad. El proceso tomó 3 días. Acudí a una entrevista en Zomato (Gurgaon, Haryana) en oct 2025
Entrevista
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
Preguntas de entrevista [1]
Pregunta 1
Explain different OSI layers and diff between TCP vs UDP
Me postulé en línea. El proceso tomó 4 meses. Acudí a una entrevista en Zomato (Bengaluru) en sep 2025
Entrevista
- 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.
Preguntas de entrevista [1]
Pregunta 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.
