Zomato interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Zomato
upvote
share-icon
1 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Journey
When I first began preparing for this role, I had very little beyond curiosity and a willingness to learn. I didn’t come from a top-tier background, nor did I have any big-name projects to showcase at the start. What I did have, however, was the mindset that consistency beats intensity. I started by mastering the basics—strengthening my foundations in data structures, algorithms, and core concepts related to the role I was aiming for. Instead of rushing through topics, I made it a point to understand the “why” behind everything I learned. That made a huge difference later when solving complex problems. There were moments of self-doubt, especially when I’d compare myself to others who seemed ahead of me. But over time, I realized that everyone has their own pace—and my journey didn’t have to look like anyone else’s. I focused on improving just 1% every day. Slowly but surely, I began to build confidence, one topic, one mock interview, and one late-night bug-fix at a time. What helped me the most was building a routine and sticking to it—even on the tough days. I also surrounded myself with a circle of peers who were equally driven. We pushed each other, discussed concepts, and celebrated small wins together. That support system made a huge difference. Finally, when the interview opportunity came, I didn’t try to be perfect. I focused on being prepared and authentic. I treated it like a conversation rather than a performance—and that helped me stay calm and clear. Looking back, it wasn’t one big breakthrough that got me here. It was a hundred little efforts that added up. If I can do it, so can you. Stay consistent, trust your journey, and never underestimate the power of small, steady progress.
Application story
The opportunity came through my college placement drive. As soon as I saw the company on the placement list, I knew I wanted to go for it. I began preparing early, focusing on the specific skills and topics that were commonly tested during campus interviews. I also attended pre-placement talks and tried to understand what the company was looking for in a candidate. Once the application process began, I made sure my resume was polished and reflected the projects and experiences most relevant to the role. Getting shortlisted was just the beginning—I kept my focus on preparation and gave it my best shot during interview round.
Why selected/rejected for the role?
I believe I was selected because of a combination of strong fundamentals, a clear thought process while solving problems, and the ability to communicate my approach effectively. I didn’t just focus on getting the right answer—I made sure to explain how I was thinking and why I was making certain choices. That helped the interviewers understand my problem-solving mindset. Another key factor was preparation—I had practiced similar problems, worked on real-world projects, and stayed calm under pressure. I was honest about what I knew and didn’t try to bluff through questions I wasn’t sure about. I think that authenticity worked in my favour. Looking back, the biggest learning is that interviews aren’t about being perfect—they’re about showing potential. Even if you don’t know everything, being clear, curious, and coachable can go a long way.
Preparation
Duration: 12 months
Topics: DSA, System Design, OOPS, SQL and Databases, Computer Networks
Tip
Tip

Tip 1: Practice consistently every day, even if it's just for an hour—consistency builds confidence.
Tip 2: Mock interviews and peer discussions are incredibly helpful to identify blind spots and improve communication skills.

Application process
Where: Campus
Eligibility: Above 7 CGPA (Salary package: 20 LPA)
Resume Tip
Resume tip

Tip 1: Keep your resume clear, concise, and limited to one page—highlight only the most relevant skills and experiences.
Tip 2: Use action verbs and quantify your achievements wherever possible to show impact (e.g., “Improved performance by 30%” instead of “Worked on performance”).

Interview rounds

01
Round
Easy
Face to Face
Duration50 minutes
Interview date1 Dec 2021
Coding problem2

It was the DSA round, I was given two coding problems that tested both my problem-solving skills and understanding of core data structures.

The first question was of medium difficulty and involved implementing logic using arrays and hash maps. It mainly tested my ability to optimize for time and space.

The second question was more challenging and required the use of advanced data structures like trees or graphs. It evaluated not only my logic but also how I approached edge cases and explained my solution.

Throughout the round, the focus was on writing clean, efficient code and clearly explaining the thought process behind the solution. Time management was crucial, as both problems had to be solved within the allotted time.

1. Subarray With Given Sum

Moderate
15m average time
85% success
0/80
Asked in companies
Thought WorksAdobeInfo Edge India (Naukri.com)

Given an array of integers and a target sum, find a contiguous subarray that adds up to the given sum.

Problem approach

Step 1:
Initialize two pointers:

start = 0 (beginning of the window)

curr_sum = 0 (current sum of the window)

Step 2:
Loop through the array using an index end from 0 to n-1:

At each step, add arr[end] to curr_sum.

Step 3:
If curr_sum > target_sum,
keep removing elements from the start (i.e., subtract arr[start] and increment start)
until curr_sum <= target_sum.

Step 4:
If curr_sum == target_sum,
we’ve found the subarray!
Return start and end.

Try solving now

2. LCA Of Binary Tree

Moderate
10m average time
90% success
0/80
Asked in companies
GrabDisney + HotstarShareChat

Given a binary tree and two nodes n1 and n2, find their Lowest Common Ancestor (LCA)—the lowest node in the tree that has both n1 and n2 as descendants.

Problem approach

Step 1:
Start from the root of the tree.

Step 2:
If the current node is None, return None.

Step 3:
If the current node matches either n1 or n2, return that node. (We found one of the nodes.)

Step 4:
Recursively search the left and right subtrees.

Step 5:
If both left and right recursive calls return non-null, the current node is the LCA.
If only one side is non-null, return that one upwards.
If both sides are null, return None.

Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
SDE - 1
2 rounds | 4 problems
Interviewed by Zomato
2312 views
0 comments
0 upvotes
SDE - 1
2 rounds | 0 problems
Interviewed by Zomato
6924 views
1 comments
0 upvotes
SDE - 1
2 rounds | 5 problems
Interviewed by Zomato
2650 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Zomato
1620 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes