How to crack Zomato: The SDE 1 interview, from real experiences
Zomato (Eternal) SDE 1 interview guide for India campus hiring: the online assessment, two technical rounds, HR, and real questions candidates reported.
On this page
Last reviewed November 17, 2026.
For final-year students in India interviewing for SDE 1 at Zomato (Eternal), on campus or through a referral.
Built by the Codinzhub team from Zomato and Eternal SDE 1 online assessments and interview experiences that students shared on Codinzhub, mostly from the 2026 campus season, plus older campus reports from 2021 to 2024. Each report is one person's memory of their own process. Use this guide as a map, not a promise.
Other Zomato roles: SDE 1 · Product Analyst
The 30-second version. This Zomato SDE 1 interview guide follows the reported campus process. Zomato is now run by its parent company, Eternal, so your campus listing may say Eternal. Students first take an online assessment (OA), a timed test taken on a computer, with 3 coding questions and, in most 2026 reports, 12 to 20 multiple-choice questions on computer science basics. Shortlisted students then face two technical interviews. The first mixes your resume, core subjects (operating systems, databases, networks, OOP) and one or two coding questions. The second goes deeper into your projects, system design and harder follow-ups. A short HR round ends the day, and several students heard the result within an hour. The most useful habit: know every line of your resume and explain core concepts in your own words, because interviewers drilled both.
Important things to know before the interview
Zomato and Eternal are the same hiring process for this role. In 2025 the parent company was renamed Eternal. 2026 students posted the same SDE 1 drive under both names. If you search Codinzhub, search for both.
The OA is the hardest filter, and it is competitive programming style. One IIT Kharagpur student who was selected called the three OA questions "definitely not easy". 2026 papers included trees, graph infection spread, and splitting an array into exactly K parts. Practise timed contest problems, not only easy and medium list problems.
Interviews may be on paper. At MANIT Bhopal (2026), the first round was offline: three coding questions on pen and paper with the interviewer watching, for about two hours. A 2024 campus student also wrote Maximal Square on paper. Practise writing full code by hand, without autocomplete or a compiler.
Core subjects carry as much weight as coding. An IIT Mandi student rejected in 2026 wrote that interviewers "drill you on every point" of operating systems, databases and security. An LPU student gave the same advice. Treat OS, DBMS, networks and OOP as a full round, not an afterthought.
Your resume decides your questions. Students were asked to design their own internship project, write pseudocode for a fuzzy search feature on their CV, and explain the Karatsuba algorithm from a project. If something is on your resume, expect to defend it.
What this guide covers
This guide is for the SDE 1 (Software Development Engineer 1) full-time role at Zomato in India. Most of the evidence comes from on-campus drives in 2026 at IIT Bombay, IIT Guwahati, IIT (ISM) Dhanbad, IIT Gandhinagar, IIT Hyderabad, IIT Roorkee, IIT Mandi, IIT Patna, IIT Kharagpur, MANIT Bhopal, IIT BHU and LPU. Older campus reports (2021, 2023, 2024) and a few referral-based reports from working engineers fill in gaps. We say which is which.
You will learn what each stage looks like, real questions from each round, what topics come up again and again, and what to do differently in each round.
These are individual experiences, not an official process. The format changes between colleges and years. Ask your placement cell or recruiter for the current format.
Internship-only drives, product analyst roles and frontend-specific roles are not mixed in here.
Round-by-round breakdown
Stage 1: Application, where candidates applied
| Channel | What candidates reported |
|---|---|
| Campus placement drive | Most 2026 reports. Zomato or Eternal visited the college and students applied through the placement cell (called TPO or CDC on many campuses). |
| Employee referral | Working engineers with 1 to 2.5 years of experience applied through referrals in 2024 and 2025. One of them believed Zomato "primarily hires through referrals" for experienced SDE 1 roles. That is one person's opinion. |
| Intern-to-full-time | An IIT Patna student (2026) sat a combined 6-month internship plus full-time drive. |
Stage 2: Shortlisting, how candidates moved forward
On campus, the shortlist for interviews came from the OA. Some students also reported a resume screen before the OA:
- One IIT student (2023) reported about 500 applicants, 164 shortlisted on resume, internships, projects and competitive programming ratings, then 18 called to interviews after the OA.
- A 2024 campus student reported 220 OA takers and 18 shortlisted, then 8 after the first interview and 3 in the final round.
- A 2021 campus student said students who solved about 2.5 of the questions were also shortlisted.
These numbers are from single campuses in single years. Your campus may differ. No 2026 report gave a cut-off.
Stage 3: Online assessment (OA)
How it works. The OA is a timed online test. You solve coding problems against hidden test cases, which are inputs the checker runs but you cannot see. In most 2026 papers there was also a set of multiple-choice questions (MCQs) on computer science basics. One 2024 student said it ran on HackerRank. Your score decides whether you reach interviews.
At a glance
- Duration: 90 minutes in most reports. IIT Roorkee (2026) reported 75 minutes of coding plus 25 minutes of MCQs. IIT Kharagpur (2026) reported three coding questions in one hour.
- Questions per round: 3 coding questions. MCQs varied: 12 (MANIT Bhopal), 13 (IIT ISM Dhanbad), 15 (IIT ISM Dhanbad), 20 (IIT Roorkee, IIT Gandhinagar).
- Topics: trees, graphs, greedy, dynamic programming (DP), binary search, arrays, strings. MCQs covered OS, DBMS, networks, OOP and data structures.
- Reported examples: splitting an array into exactly K parts, choosing items with a budget and coupons, infection spread on a graph, BFS order on a tree.
Reported questions (2026 campus, coding)
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| Split an array into exactly K contiguous parts, where a part's cost depends on its end values. Find the smallest and largest total cost. | Greedy, sorting | Not reported | SDE, IIT Roorkee and IIT Hyderabad, 2026 | Smallest and largest total cost of K partitions · Minimum and maximum cost of array partitioning · Divide disks into K clusters |
| Pick fruits with a money limit and K discount coupons to get the most nutrition. | DP (knapsack with an extra dimension) | Not reported | SDE, IIT (ISM) Dhanbad, 2026 | Maximum nutrition |
| Find the second most frequent distinct element, with a tie-breaking rule. | Hashing, counting | Not reported | SDE, IIT (ISM) Dhanbad, 2026 | Eternal OA, IIT (ISM) Dhanbad |
| Assign non-negative values to tree nodes, some fixed, so the sum is smallest while each edge meets a difference rule. | Trees, DFS | Not reported | SDE, IIT (ISM) Dhanbad, 2026 | Eternal OA, IIT (ISM) Dhanbad |
| Some graph nodes are infected and the infection spreads. Remove at most one node so the fewest nodes get infected. | Graphs, connected components | Not reported | FTE, IIT Guwahati and IIT Roorkee, 2026 | Remove at most one node · Minimize malware spread |
| For every index, find the smallest index anywhere in the array with a larger value. | Sorting, monotonic stack | Not reported | FTE, IIT Guwahati, 2026 | First greater element in the entire array |
| In a tree where each node is +1 or −1, find for every node the best sum of a connected piece containing it. | Tree DP, rerooting | Not reported | FTE, IIT Guwahati, 2026 | Maximum connected value for every node · Maximum white subtree |
| Place K buildings or offices on a grid so the farthest empty cell is as close as possible. | Search over placements, BFS | Not reported | SDE, IIT Roorkee, 2026 | Minimum distance houses · Farm · Optimal placement of buildings |
| Count triplets of tree nodes that do not lie on one simple path. | Trees, counting | Not reported | SDE, IIT Roorkee, 2026 | Triplets not on a simple path · Avoid straight line |
| Shuffle a playlist of (title, artist) songs by artist priority rules. | Sorting, hashing | Not reported | IIT Guwahati (on campus) and IIT BHU (off campus), 2026 | Shuffled playlist · Get shuffled playlist |
| Pair 2n employees into teams with an efficiency rule. | Math, greedy | Not reported | IIT Guwahati, 2026 | Team efficiency |
| Check which of several given orders is a valid BFS order of a rooted tree. | BFS, trees | Not reported | Zomato OA, 2026 | Valid BFS traversal |
| Move characters through a stack-like middle string to build the smallest possible string. | Greedy, stack | Not reported | Zomato OA, 2026 | Lexicographically smallest string |
| Circular values from 1 to K: find the fewest +1/−1 steps to make all equal. | Prefix sums, circular arrays | Not reported | MANIT Bhopal, 2026 | Minimum steps to equalize array elements |
| Flip at most K bits of a binary string to get the fewest inversions. | Greedy, prefix counts | Not reported | MANIT Bhopal, 2026 | Minimum inversions with at most K flips |
More questions. The full papers, with MCQs, are on Codinzhub: IIT Gandhinagar coding, IIT Gandhinagar MCQs set 1, set 2, IIT Bombay, IIT Guwahati, IIT (ISM) Dhanbad, and the IIT (ISM) Dhanbad SDE paper Q1, Q2, Q3.
Older OA examples. A 2023 IIT student reported one easy parsing question, one binary search question and one hard Dijkstra (shortest path) question in 90 minutes. A 2021 campus student reported four questions, including "next smallest palindrome" and a question on Euler's totient function.
Stage 4: Technical interview 1
How it works. This is usually a one-on-one round of about an hour, online or in person. It starts with your introduction and resume. Then it moves into core subjects and ends with one or two coding questions. At MANIT Bhopal (2026), this first round was instead three coding questions on paper for about two hours. Interviewers judged your approach, time and space complexity (how running time and memory grow with input size), correct code, and how clearly you explained.
At a glance
- Duration: about 1 hour in most reports, up to 2 hours at MANIT Bhopal
- Questions per round: 1 to 3 coding questions, plus many short theory questions
- Topics: resume and internship, DBMS and SQL, OS, networks, OOP, standard DSA
- Reported examples: Koko eating bananas, LRU cache, largest rectangle of 1s in a grid, Maximal Square
Reported questions: coding
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| Koko eating bananas: find the slowest eating speed that finishes all piles in H hours. | Binary search on the answer | Not reported | SDE 1, IIT Mandi, 2026 | IIT Mandi experience |
| Design an LRU cache, which removes the least recently used item when full. | Hash map plus doubly linked list | "All follow-up questions" (not listed) | SDE 1, LPU, 2026 | LPU experience |
| Find the largest rectangle of 1s in a binary 2D grid. | Monotonic stack, histogram | Not reported | SDE 1, IIT Kharagpur, 2026 | IIT Kharagpur experience |
| From city A, find the cheapest way to reach any city in a preferred list. Then A to B to the list, and A to the list to B. | Shortest paths (Dijkstra), multi-source | The two route variants were the follow-ups | Intern + FTE drive, IIT Patna, 2026 | IIT Patna experience |
| Maximal Square: largest square of 1s in a grid, written on paper. | 2D DP | Edge cases and optimisation | SDE 1, campus, 2024 | Plain text: older campus report |
| Count islands in a grid, then code two different solutions. | DFS and BFS on a grid | Compare complexities | FTE, IIT campus, 2023 | Plain text: older campus report |
| Shuffle a playlist so each song plays once at random, and support "previous song". | Hashing, random swaps | Code the SHUFFLE function | FTE, IIT campus, 2023 | Plain text: older campus report |
| Convert a binary tree to a doubly linked list in inorder. | Tree recursion | Not reported | SDE 1, IIT campus, 2021 | Plain text: older campus report |
| Find all anagrams of a pattern inside a string. | Sliding window, hash map | Brute force first, then optimise | SDE 1, IIT campus, 2021 | Plain text: older campus report |
| Maximum product subarray. | DP with min and max | Test with zeros and negatives | SDE 1, IIT campus, 2021 | Plain text: older campus report |
Reported questions: core subjects
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| Normalise a given SQL table to the highest form you can. | DBMS normalisation | Pros and cons of higher normal forms; sharding | SDE 1, IIT Mandi, 2026 | IIT Mandi experience |
| How do you stop a DDoS attack on a 6-digit OTP system? | Security, rate limiting | Not reported | SDE 1, IIT Mandi, 2026 | IIT Mandi experience |
| Process vs thread; what happens when RAM is full; thrashing; scheduling. | Operating systems | Cost of process switching | SDE 1, IIT Mandi, 2026 | IIT Mandi experience |
| Semaphores, mutex and multithreading. | Operating systems | Not reported | SDE 1, LPU, 2026 | LPU experience |
| Four pillars of OOP; the diamond problem; shallow vs deep copy; virtual pointers. | OOP, C++ | Detailed vptr discussion | SDE 1, IIT Kharagpur, 2026 | IIT Kharagpur experience |
| TCP vs UDP; the OSI model and its layers. | Computer networks | Which is more secure, and why (IIT Patna) | IIT Kharagpur and IIT Patna, 2026 | IIT Kharagpur experience |
| Write SQL for the second highest salary, then the Nth highest. | SQL | How to speed up a slow query | IIT Patna, 2026 | IIT Patna experience |
| What are ACID properties and how do SQL databases ensure them? SQL vs NoSQL. How does a database index work and which data structure does it use? | DBMS | Not reported | IIT Patna, 2026 | IIT Patna experience |
| What happens when you type Zomato's web address in a browser? How is a DNS query resolved? | Networks, web basics | DNS, HTTPS request, load balancer, server | IIT Patna, 2026 | IIT Patna experience |
| Git vs GitHub and common Git commands; Google OAuth vs NextAuth; basic Linux commands. | Resume tools | Not reported | IIT Kharagpur, 2026 | IIT Kharagpur experience |
Stage 5: Technical interview 2 (advanced)
How it works. Students who clear the first interview often get the second one within the hour. It is usually led by a more senior engineer (an SDE 3 at MANIT Bhopal). It goes deeper: high-level design (HLD), which means sketching the big parts of a system and how they talk to each other, plus your projects, more OS or OOP, and sometimes a harder coding question with several rounds of optimisation. The IIT Kharagpur interviewer asked the student not to give textbook definitions and to explain in simple words.
At a glance
- Duration: about 1 to 1.5 hours at MANIT Bhopal; up to 2 hours in a 2023 report
- Questions per round: one design problem or one hard coding problem, plus many follow-ups
- Topics: HLD of your own project, rate limiting, caching with Redis, OS, OOP in C++, projects, basic GenAI and ML if on your resume
- Reported examples: design your internship system, fuzzy search pseudocode, search in a spiral-sorted grid
Reported questions
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| Design the candidate onboarding platform you built in your internship. | HLD | What if someone attacks, what if the DB fails, what if payment succeeds but the user is not notified; why Redis; which rate-limiter algorithm and the downside of a window limiter; what an API gateway is; request metadata; preventing SQL injection | SDE 1, IIT Mandi, 2026 | IIT Mandi experience |
| What is RAII? What are the rule of three and the rule of five? | C++ OOP | Not reported | SDE 1, IIT Mandi, 2026 | IIT Mandi experience |
| Write pseudocode for the fuzzy search feature on your resume. | Strings, project depth | Not reported | SDE 1, IIT Kharagpur, 2026 | IIT Kharagpur experience |
| Search for a target in a grid whose values increase in a spiral towards the centre. | Binary search on index mapping | Brute force first, then optimise to O(log(n×m)) | SDE 1, IIT Kharagpur, 2026 | IIT Kharagpur experience |
| Process vs thread; deadlocks with real-life examples; when to use a mutex. | Operating systems | "Explain in simple words" | SDE 1, IIT Kharagpur, 2026 | IIT Kharagpur experience |
| Project architecture, HLD, DBMS, OS, OOP and GenAI basics, tailored to the resume. | Projects, core subjects | Networks skipped when the student said they were weak in it | SDE, MANIT Bhopal, 2026 | MANIT Bhopal experience |
| Write backend request logic in Go, using goroutines and channels. | Concurrency | Timeouts and edge cases | SDE 1, campus, 2024 | Plain text: older campus report |
| Design a scalable system for Zomato and Blinkit. | HLD | Challenges and trade-offs | SDE 1, campus, 2024 | Plain text: older campus report |
| RAG pipeline, how a neural network trains, Word2Vec; Docker, Kubernetes, Redis scaling, consistent hashing. | ML and DevOps from resume | Not reported | SDE 1, campus, 2024 (first technical round) | Plain text: older campus report |
Stage 6: HR round and decision
How it works. A short, friendly conversation. In several reports the decision was already made. At MANIT Bhopal, HR said "you are selected" as the student walked in. A 2023 IIT student was told they were selected right after round 2. At IIT Kharagpur, the result came in about 20 minutes.
At a glance
- Duration: 5 to 15 minutes in most reports
- Questions per round: a handful of personal questions
- Topics: you, your goals, location, why Eternal
Reported questions
| Question summary | Skill or pattern | Reported follow-up | Level / scope | Codinzhub question or experience |
|---|---|---|---|---|
| What is the most important thing you learned at your college? | Reflection | Not reported | SDE 1, IIT Kharagpur, 2026 | IIT Kharagpur experience |
| What has been your biggest failure? | Behavioural | Not reported | SDE 1, IIT Kharagpur, 2026 | IIT Kharagpur experience |
| What do you expect from Eternal? | Motivation | Not reported | SDE 1, IIT Kharagpur, 2026 | IIT Kharagpur experience |
| What are your interests outside the college curriculum? | Personality | Not reported | SDE 1, IIT Mandi, 2026 | IIT Mandi experience |
| Where are you from, and what are your location preferences? | Logistics | Not reported | SDE 1, IIT Mandi, 2026 | IIT Mandi experience |
Zomato experiences shared on Codinzhub
| College or background | Role and reported outcome | What was asked | Experience |
|---|---|---|---|
| IIT Kharagpur | SDE 1, selected | OA of 3 questions in 1 hour; Git, OAuth, OOP, TCP/UDP, largest rectangle; fuzzy search, OS, spiral grid search; HR | Read it |
| MANIT Bhopal | SDE, selected | 3 DSA questions on paper; projects, HLD, DBMS, OS, GenAI, OOP; HR | Read it |
| IIT Mandi | SDE 1, rejected after round 2 | Normalisation, OTP DDoS, OS, Koko eating bananas; HLD of internship project, RAII | Read it |
| IIT Patna | SDE intern + FTE, rejected | Karatsuba project, shortest path with preferred cities, SQL, ACID, DNS | Read it |
| LPU | SDE 1, rejected | Projects, LRU cache, semaphores and mutex | Read it |
The Codinzhub next-round playbook
These are our editorial recommendations, based on what the reports show.
To prepare for the OA
- Solve the 2026 papers linked above under a 90-minute timer. Three questions in 90 minutes leaves about 25 minutes each plus MCQs.
- Practise "split into exactly K parts" and "choose with a budget" problems. Both appeared at more than one campus.
- Revise tree DFS until you can write it without thinking. Tree questions appeared at Dhanbad, Guwahati, Roorkee and MANIT.
- Leave 10 to 15 minutes for MCQs. They cover OS, DBMS, networks and OOP, so your core revision helps here too.
- Test edge cases yourself: one element, all equal values, K equal to N. Hidden test cases are where partial scores are lost.
To prepare for technical interview 1
- Write two-page notes for each core subject in your own words. The IIT Mandi student's advice was to focus on core concepts over very hard LeetCode.
- Practise SQL by hand: second and Nth highest salary, joins, GROUP BY.
- Practise standard problems on paper: LRU cache, binary search on the answer, grid DFS. Then do a dry run, which means checking the code by hand with a small sample input.
- Prepare a 2-minute walk-through of each internship and project.
To prepare for technical interview 2
- Draw the architecture of each project on your resume: clients, servers, database, cache, queues. Be ready to say why each piece exists.
- Learn the basics of rate limiters (token bucket, fixed and sliding window), Redis caching, load balancers and API gateways. They came up in the IIT Mandi design grilling.
- For any hard coding question, say the brute force first, then improve step by step. That is how the IIT Kharagpur student reached the final answer.
- If you list C++, revise RAII, the rule of three and five, virtual functions and copy semantics.
To prepare for HR
- Prepare honest answers to "biggest failure", "most important learning" and "why Eternal".
- Know your location preferences before you walk in.
Variations within this role
| Variation | What was reported |
|---|---|
| Campus, 2026 | OA (3 coding, usually with MCQs), two technical rounds, short HR. Results the same day. |
| Paper vs computer | MANIT Bhopal ran round 1 offline on paper. Others were online or through the placement office. |
| Referral, working engineers (2024–2025) | No OA mentioned. Two technical rounds with SQL, projects and binary search or DP, then a culture-fit or hiring-manager round with a VP or senior manager. One 2025 Blinkit report included a system design round led by an SDE 3. |
| Older campus (2021–2024) | Same overall shape. Round 2 often included Go concurrency and system design. |
Do's and don'ts
| Do | Don't | Why it matters |
|---|---|---|
| Explain concepts in your own words, with an example. | Recite textbook definitions. | One interviewer asked for "no textbook definitions". |
| Know every tool and line on your resume. | List a technology you cannot defend. | Students were questioned on Git, OAuth, Redis and their own algorithms. |
| Start with brute force, then optimise aloud. | Sit silently until you have the perfect answer. | Interviewers watched the approach, not only the final code. |
| Practise coding on paper. | Rely on an IDE to catch syntax. | At least one 2026 campus round was pen and paper. |
| Say honestly if a subject is weak. | Bluff. | At MANIT Bhopal, networks was skipped when the student said they were weak in it. |
| Check edge cases before you say you are done. | Submit after one sample passes. | OA scoring uses hidden test cases. |
Most-asked topics
Frequency below is based on the 5 Codinzhub interview experiences and about 25 OA question records for this role. We do not give percentages.
| Topic | What it means | Evidence-backed priority | Reported examples | Codinzhub practice |
|---|---|---|---|---|
| Trees and graphs | Data made of nodes joined by edges; trees have no cycles | High in the OA (5 campuses) | Tree DP, infection spread, valid BFS | Maximum connected value |
| Operating systems | How a computer runs programs, shares memory and CPU | High in interviews (4 of 5 experiences) | Process vs thread, mutex, deadlock, thrashing | IIT Mandi experience |
| DBMS and SQL | How data is stored, queried and kept correct | High in interviews | Normalisation, ACID, Nth salary, indexes | IIT Patna experience |
| Projects and resume | Your own work, explained in depth | High in every experience | Design your internship system, fuzzy search | IIT Kharagpur experience |
| Greedy and partitioning | Making the best local choice; splitting arrays | Repeated in the OA | K partitions at Roorkee and Hyderabad | Array partition cost |
| Dynamic programming | Breaking a problem into smaller repeated subproblems and saving answers | Present in the OA and older interviews | Fruit coupons, Maximal Square | Maximum nutrition |
| Networks | How computers talk over the internet | Medium | TCP vs UDP, DNS, OSI | IIT Kharagpur experience |
| System design (HLD) | Planning the big parts of a software system | Medium, mostly in round 2 | Rate limiter, Redis, API gateway | IIT Mandi experience |
The question patterns that keep coming back
Split an array into exactly K parts
How it appears. You split an array into K contiguous pieces, and each piece's cost depends on its first and last values. You find the smallest and the largest total. It appeared at IIT Roorkee and IIT Hyderabad in 2026.
What to recognise. The cut points are what matter. Each cut adds the values on both sides of it. Sort those pair sums and take the smallest or largest K−1.
Practise. Smallest and largest total cost of K partitions, then Divide disks into K clusters.
Tree DFS with a value at every node
How it appears. Assign values, find best connected sums, or count node groups. These appeared at Dhanbad, Guwahati, Roorkee and MANIT Bhopal.
What to recognise. Most of these need one DFS from the root to collect answers from children. Some need a second pass from the root down. That technique is called rerooting.
Practise. Maximum white subtree and Maximum path sum in a tree.
Spread on a graph
How it appears. Infected nodes spread to neighbours. You remove one node to limit the damage.
What to recognise. Find connected groups with union-find or BFS. A group with exactly one infected node is the one worth saving.
Practise. Minimize malware spread.
Core subject drill-down
How it appears. One simple question ("process vs thread") turns into five follow-ups ("what if RAM is full", "what does switching cost").
What to recognise. The interviewer is checking depth, not memory. Answer the first question in one sentence, then give a real example.
Practise. Read the IIT Mandi experience and answer each follow-up aloud.
Design your own project
How it appears. "Design the system you built in your internship", then failure cases: attacks, database failure, payment without notification.
What to recognise. Start simple: client, server, database. Add a load balancer, cache, rate limiter and queue only when you can say what problem each solves.
Practise. Sketch your own project and list three failure cases with fixes.
Preparing for the HR and culture round
Campus HR at Zomato was short and conversational in every 2026 report. Prepare two or three true stories using a simple shape: the situation, what you did, what happened, and what you learned. People often call this the STAR method. Have one story about a failure and one about learning something hard. Referral candidates reported a longer culture-fit chat with a VP or senior manager about working at a fast-moving company. That round may not happen on campus.
Practice problems that match the experiences
These are practice analogues: similar problems for practice, not proof that Zomato asked the exact LeetCode problem, unless the row says the same name was reported.
| # | Practice problem | Pattern | Related reported question or variant |
|---|---|---|---|
| 1 | Koko Eating Bananas (LeetCode) | Binary search on answer | Same problem name reported at IIT Mandi |
| 2 | LRU Cache (LeetCode) | Hash map + linked list | Same problem reported at LPU |
| 3 | Maximal Rectangle (LeetCode) | Monotonic stack | Largest rectangle in a 0-1 grid, IIT Kharagpur |
| 4 | Maximal Square (LeetCode) | 2D DP | Same problem name, 2024 campus |
| 5 | Number of Islands (LeetCode) | Grid DFS/BFS | "Similar to number of islands", 2023 |
| 6 | Put Marbles in Bags (LeetCode) | Greedy on cut points | K partitions min and max cost |
| 7 | Minimize Malware Spread (LeetCode) | Union-find | Remove one node to limit infection |
| 8 | Binary Tree Maximum Path Sum (LeetCode) | Tree DP | Tree value questions in the OA |
| 9 | Using a Robot to Print the Lexicographically Smallest String (LeetCode) | Greedy + stack | Lexicographically smallest string OA |
| 10 | Find All Anagrams in a String (LeetCode) | Sliding window | Anagram substring search, 2021 |
| 11 | Maximum Product Subarray (LeetCode) | DP | Same problem name, 2021 |
| 12 | Nth Highest Salary (LeetCode) | SQL | Nth highest salary, IIT Patna |
How to handle a question you have never seen
- Repeat the problem in your own words and ask about input size and edge cases.
- Work through one small example by hand.
- Say the simplest correct approach and its complexity, even if it is slow.
- Find the slow step and name a better tool: sorting, hashing, binary search, DFS, DP.
- Write clean code. On paper, leave space between lines for fixes.
- Dry-run your code with the example, then an edge case such as an empty or one-element input.
- When the interviewer adds a follow-up, restate how the new rule changes your approach before coding.
Why candidates were rejected
No report included official feedback for a campus rejection. Here is what candidates said themselves:
- IIT Mandi (2026): rejected after the design round. The student's own advice afterwards was to prepare core concepts much more deeply.
- LPU (2026): rejected after one round of projects, LRU cache and OS. No reason was given. The student advised focusing on core CS and projects.
- A working engineer (2024, referral): rejected after a DSA round with a "not fit for the role at the moment" email. The candidate believed the interviewer misjudged their solution. That is their interpretation.
If you remember only five things
- Zomato and Eternal are the same SDE 1 process, so practise both companies' Codinzhub papers.
- The OA has 3 hard coding questions, often with MCQs. Train with a timer on trees, graphs and greedy partitioning.
- Core subjects are drilled hard. Explain OS, DBMS, networks and OOP in your own words.
- Your resume decides your design round. Draw and defend every project.
- Practise writing code on paper and dry-running it.
FAQ
Is the Zomato OA the same as the Eternal OA?
For 2026 campus SDE hiring, yes. Students posted the same drive under both names. Papers still differed between colleges and dates.
How many questions are in the Zomato SDE 1 OA?
Three coding questions in every 2026 report. Most also had 12 to 20 MCQs. IIT Kharagpur reported coding only, in one hour.
Is system design asked for freshers?
Yes, in round 2 at IIT Mandi and MANIT Bhopal, usually built around your own project. Expect HLD basics, not a full large-scale design.
Do I need very hard LeetCode problems?
The OA is contest-level. Interview coding was mostly standard (LRU cache, Koko eating bananas), with one harder optimisation question at IIT Kharagpur. One rejected student advised spending more time on core subjects than on very hard problems.
Which language should I use?
No report mentioned a language restriction. Interviewers asked C++ questions when students used C++, and one older round asked for Go. Use the language you know best and confirm with your placement cell.
When do results come out?
In the 2026 campus reports, the same day, sometimes within 20 minutes of the HR round.
About this guide
The Codinzhub team wrote this guide from 5 Zomato and Eternal SDE interview experiences and about 25 OA question records shared on Codinzhub between June and November 2026. We also used older campus and referral experiences from 2021 to 2025 in our collection, and searched public candidate forums for this role. Questions are short paraphrases in our own words. Practice problems are similar problems we picked for each pattern, not exact matches unless marked.
You can help other students by sharing your Zomato experience on Codinzhub.
Interview processes change by college, year and team. Your placement cell or recruiter can confirm the current format.
Other company and role guides
Keep track of what you’ve learned.