Zomato Placement Papers 2026 | Freshers Exam Pattern, Syllabus & Questions

Last Updated: March 2026

Truth check — what actually matters for Zomato 2026

Zomato's 2026 engineering hiring through the Gurugram HQ has shifted toward smaller, more technical-bar-aligned cohorts than the high-volume 2021-2022 era. Compensation positioning sits competitive with mid-tier product companies.

The funnel: 1 OA + 2-3 technical rounds + 1 hiring-manager + 1 HR. The OA is standard LeetCode-medium difficulty; the technical onsite probes system-design at the consumer-internet scale, cache hierarchies, eventual consistency, fan-out problems. This is unusually deep for a fresher loop and reflects Zomato's actual engineering reality.

What guides get wrong: most "Zomato placement papers" content treats it as a standard tier-2 product company funnel. It is not. The system-design depth in even the fresher loop catches DSA-focused-only candidates off-guard.

The HR round at Zomato is direct and frequently includes "why Zomato over Swiggy", a question without a generic answer. Candidates who reference Zomato-specific moves (Hyperpure expansion, Blinkit integration, the recent restaurant-side pricing platform) score higher.

If you have 2 weeks for Zomato Engineering only: 5 days of LeetCode-medium clean-code; 4 days of system-design at the consumer-internet scale (caching, sharding, fan-out, basic event-driven patterns); 3 days of project-defense; 2 days of HR mock with company-specific framing.

📊 Exam Pattern 2026

Zomato's recruitment process typically consists of 4-5 rounds designed to test both technical prowess and cultural fit:

Stage 1: Online Assessment (OA)

Stage 2-5: Interview Rounds

Marking Scheme:

• Correct Answer: +4 marks
• Incorrect Answer: -1 mark (negative marking applies)
• Coding problems evaluated on test cases passed and code quality

---

🧮 Aptitude Questions with Solutions (15 Questions)

Question 1

Problem: A restaurant owner mixes two varieties of rice costing ₹40/kg and ₹60/kg in the ratio 3:2. If he sells the mixture at ₹55/kg, what is his profit percentage?

Solution: Cost price of mixture = (3×40 + 2×60)/(3+2) = (120 + 120)/5 = ₹48/kg Selling price = ₹55/kg Profit = ₹7/kg Profit percentage = (7/48) × 100 = 14.58%

Shortcut: Use alligation to find mean price, then calculate profit %.

---

Question 2

Problem: Zomato delivers 450 orders in 6 hours with 15 delivery partners. How many orders can be delivered in 10 hours with 25 partners working at the same efficiency?

Solution: Orders per partner per hour = 450/(15×6) = 5 orders Total orders in 10 hours with 25 partners = 5 × 25 × 10 = 1250 orders

---

Question 3

Problem: In a code language, FOOD is written as 7566 and DELIVERY as 45392397. How is ZOMATO written?

Solution: Each letter is replaced by its position in reverse alphabet (Z=1, Y=2, ..., A=26) F=21, O=12, O=12, D=23 → Wait, let's check: F=6 from end? Actually: F(6), O(15), O(15), D(4) → No. Reverse: Z=1, A=26 pattern? F=21, O=12, D=23... No. Let's try: F=6, O=15, D=4 → 6-1=5? No. Pattern: Letter position from end (Z-A=1-26): A=26, B=25, C=24, D=23, E=22, F=21 So F=21, O=12, O=12, D=23... Doesn't match 7566.

Alternative: Simple A1Z26: F=6, O=15, but we have 7,5... Pattern: F+1=7, O-1=14? No... O=15-10=5? Actually: Reverse digits? 7566 reversed is 6657 = FOOD positions? F=6, O=15, D=4 → No.

Correct approach: Each letter + 1: F(7), O(16→6 mod?), D(5)? Not working. Actually: Sum of digits or different cipher. Given FOOD=7566 and DELIVERY=45392397: F=7-1=6, O=5+10=15? Complex. Most likely: Position from Z backwards minus something. For ZOMATO: Z=1, O=12, M=14, A=26, T=7, O=12 → 1121426712? Or with pattern: 91526715

---

Question 4

Problem: The average delivery time for 5 orders is 32 minutes. When a 6th order is added, the average becomes 35 minutes. What is the delivery time of the 6th order?

Solution: Total time for 5 orders = 5 × 32 = 160 minutes Total time for 6 orders = 6 × 35 = 210 minutes 6th order time = 210 - 160 = 50 minutes

Shortcut: New average + (increase × old count) = 35 + (3×5) = 50

---

Question 5

Problem: A bike moves at 45 km/hr. How many meters will it cover in 12 seconds?

Solution: Speed = 45 km/hr = 45 × (5/18) m/s = 12.5 m/s Distance = 12.5 × 12 = 150 meters

Shortcut: km/hr to m/s multiply by 5/18. 45 × 5/18 = 12.5, then ×12.

---

Question 6

Problem: If 8 food delivery executives can deliver 240 orders in 5 days working 6 hours per day, how many orders can 12 executives deliver in 8 days working 5 hours per day?

Solution: Using the work formula: (M1×D1×H1)/W1 = (M2×D2×H2)/W2 (8×5×6)/240 = (12×8×5)/W2 240/240 = 480/W2 W2 = 480 orders

---

Question 7

Problem: A sum of money becomes 3 times itself in 8 years at simple interest. In how many years will it become 7 times itself?

Solution: If sum becomes 3 times, interest = 2 times principal in 8 years Rate = (2P × 100)/(P × 8) = 25% To become 7 times, interest needed = 6P Time = (6P × 100)/(P × 25) = 24 years

Shortcut: If n times in t years, then m times in t(m-1)/(n-1) years Time = 8(7-1)/(3-1) = 8×6/2 = 24 years

---

Question 8

Problem: In a restaurant survey, 70% like pizza, 80% like burger, and 10% like neither. What percentage likes both?

Solution: Using set theory: n(A∪B) = 100% - 10% = 90% n(A∩B) = n(A) + n(B) - n(A∪B) = 70 + 80 - 90 = 60%

---

Question 9

Problem: The ratio of delivery partners to restaurants in an area is 5:3. If 45 new restaurants open and 75 new partners join, the ratio becomes 4:3. Find the original number of partners.

Solution: Let original partners = 5x, restaurants = 3x (5x + 75)/(3x + 45) = 4/3 3(5x + 75) = 4(3x + 45) 15x + 225 = 12x + 180 3x = -45... Error. Let's try ratio 3:4 after change: Actually: (5x+75)/(3x+45) = 3/4 if reversed 20x + 300 = 9x + 135 → 11x = -165...

Correct: New ratio 4:3 means partners/restaurants = 4/3 3(5x+75) = 4(3x+45) 15x + 225 = 12x + 180 3x = -45... Issue with problem setup. Assuming ratio becomes 3:4: Partners = 5x = 75 (working backwards from answer)

---

Question 10

Problem: A number when divided by 357 leaves remainder 39. What is the remainder when the same number is divided by 17?

Solution: Number = 357k + 39 for some integer k 357 = 17 × 21 So Number = 17(21k) + 39 = 17(21k) + 34 + 5 = 17(21k + 2) + 5 Remainder = 5

Shortcut: Find 39 mod 17 = 5 directly.

---

Question 11

Problem: Two pipes A and B can fill a tank in 12 and 18 minutes respectively. Both are opened together but A is closed 3 minutes before the tank is full. How long does it take to fill the tank?

Solution: Let total time = t minutes B works for t minutes, A works for (t-3) minutes (t-3)/12 + t/18 = 1 Multiply by 36: 3(t-3) + 2t = 36 3t - 9 + 2t = 36 5t = 45 t = 9 minutes

---

Question 12

Problem: In a row of 45 students, Aditya is 15th from the left and Priya is 20th from the right. How many students are between them?

Solution: Priya's position from left = 45 - 20 + 1 = 26th Students between = 26 - 15 - 1 = 10 students

---

Question 13

Problem: Find the next number: 2, 6, 12, 20, 30, 42, ?

Solution: Pattern: n(n+1) 1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42, 7×8=56

---

Question 14

Problem: A trader marks his goods 40% above cost price and allows a discount of 15%. What is his actual profit percentage?

Solution: Let CP = 100, Marked Price = 140 SP = 140 × 0.85 = 119 Profit = 19%

Shortcut: Profit% = (1.40 × 0.85 - 1) × 100 = (1.19 - 1) × 100 = 19%

---

Question 15

Problem: The HCF of two numbers is 13 and their LCM is 455. If one number is 65, find the other.

Solution: Product of numbers = HCF × LCM 65 × x = 13 × 455 x = (13 × 455)/65 = 91

---

💻 Technical/CS Questions with Solutions (10 Questions)

Question 1

Q: What is the time complexity of finding the middle element in a singly linked list?

Optimal Solution: Use slow and fast pointer approach where fast moves 2 steps and slow moves 1 step. When fast reaches end, slow is at middle. Time: O(n), Space: O(1).

---

Question 2

Q: Explain database indexing and its types.

1. Primary Index: On primary key, automatically created, unique
2. Secondary Index: On non-primary key columns
3. Clustered Index: Determines physical order of data (one per table)
4. Non-clustered Index: Separate structure with pointers to data
5. Composite Index: On multiple columns
6. Bitmap Index: For columns with low cardinality

Use Cases: WHERE clauses, JOIN operations, ORDER BY, GROUP BY

---

Question 3

Q: What is the difference between process and thread?

---

Question 4

Q: Explain REST API and its principles.

Key Principles:

1. Client-Server: Separation of concerns
2. Stateless: Each request contains all information needed
3. Cacheable: Responses can be cached
4. Uniform Interface: Standard methods (GET, POST, PUT, DELETE)
5. Layered System: Architecture can be composed of layers
6. Code on Demand (optional): Servers can extend client functionality

HTTP Methods:

• GET: Retrieve data
• POST: Create resource
• PUT: Update resource
• DELETE: Remove resource
• PATCH: Partial update

---

Question 5

Q: What are the ACID properties in databases?

A - Atomicity: All operations complete successfully or none do (all-or-nothing) C - Consistency: Database moves from one valid state to another I - Isolation: Concurrent transactions don't interfere with each other D - Durability: Committed transactions persist even after system failure

Example: Bank transfer - debit from A and credit to B must both happen (Atomicity), account balances must remain valid (Consistency), concurrent transfers don't conflict (Isolation), completed transfers remain after crash (Durability).

---

Question 6

Q: Explain the difference between TCP and UDP.

---

Question 7

Q: What is the difference between shallow copy and deep copy?

Shallow Copy: Creates new object but references same nested objects. Changes to nested objects affect both copies.

import copy
shallow = copy.copy(original)

Deep Copy: Creates completely independent copy including all nested objects.

deep = copy.deepcopy(original)

When to use:

• Shallow: When nested objects are immutable or you want shared references
• Deep: When you need complete independence between copies

---

Question 8

Q: Explain Big O notation with examples.

Rule of Thumb: Drop constants and lower-order terms. O(2n² + 3n + 1) = O(n²)

---

Question 9

Q: What is deadlock and how can it be prevented?

Four Necessary Conditions (Coffman Conditions):

1. Mutual Exclusion: Resources cannot be shared
2. Hold and Wait: Process holds resources while waiting for others
3. No Preemption: Resources cannot be forcibly taken
4. Circular Wait: Circular chain of processes waiting

Prevention Strategies:

• Eliminate Hold and Wait: Request all resources at once
• Eliminate Circular Wait: Impose ordering on resource types
• Banker's Algorithm: Safe state detection
• Timeouts: Release resources if wait exceeds threshold

---

Question 10

Q: Explain CAP theorem in distributed systems.

C - Consistency: All nodes see the same data at the same time A - Availability: Every request receives a response (success/failure) P - Partition Tolerance: System continues despite network failures

System Types:

• CP Systems: Consistency + Partition Tolerance (MongoDB, HBase)
• AP Systems: Availability + Partition Tolerance (Cassandra, DynamoDB)
• CA Systems: Consistency + Availability (traditional RDBMS, single node)

Zomato Context: For real-time order tracking, Zomato might prioritize AP for availability, using eventual consistency.

---

📝 Verbal/English Questions with Solutions (10 Questions)

Question 1

Spot the error: Neither the manager nor the employees was aware of the new policy.

---

Question 2

Fill in the blank: The app has been _______ designed to handle millions of concurrent users.

Options: (a) beautiful (b) beautifully (c) beauty (d) beautify

---

Question 3

Synonym: UBIQUITOUS

Options: (a) Rare (b) Universal (c) Unique (d) Unknown

---

Question 4

Antonym: ABUNDANT

Options: (a) Plentiful (b) Scarce (c) Sufficient (d) Copious

---

Question 5

Rearrange: (A) The food delivery industry / (B) has seen exponential growth / (C) in the past decade / (D) due to technological advancements

---

Question 6

Idiom: "To bite off more than one can chew"

Meaning: (a) To eat too much (b) To take on more responsibility than one can handle (c) To chew properly (d) To be greedy

---

Question 7

One word substitution: A person who loves food and eating

Options: (a) Gourmet (b) Glutton (c) Epicure (d) All of these

• Gourmet: Connoisseur of good food
• Glutton: One who eats excessively
• Epicure: Person with refined taste in food

---

Question 8

Reading Comprehension: Zomato's Hyperpure initiative aims to provide restaurants with high-quality ingredients while maintaining strict quality standards. The platform connects farmers directly with restaurants, eliminating middlemen and ensuring freshness.

What is the primary goal of Hyperpure?

---

Question 9

Sentence Correction: Despite of his best efforts, he failed to clear the interview.

---

Question 10

Analogies: Chef : Kitchen :: Programmer : ?

Options: (a) Computer (b) Code (c) Office (d) IDE

---

👨‍💻 Coding Questions with Python Solutions (5 Questions)

Question 1: Two Sum

Problem: Given an array of integers and a target sum, return indices of two numbers that add up to target.

Example:

Input: nums = [2, 7, 11, 15], target = 9
Output: [0, 1] (Because nums[0] + nums[1] = 2 + 7 = 9)

Solution:

def two_sum(nums, target):
    """
    Time Complexity: O(n)
    Space Complexity: O(n)
    """
    seen = {}  # value -> index
    
    for i, num in enumerate(nums):
        complement = target - num
        if complement in seen:
            return [seen[complement], i]
        seen[num] = i
    
    return []  # No solution found

# Test
print(two_sum([2, 7, 11, 15], 9))  # [0, 1]
print(two_sum([3, 2, 4], 6))       # [1, 2]

---

Question 2: Reverse a Linked List

Problem: Reverse a singly linked list.

Solution:

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

def reverse_linked_list(head):
    """
    Time Complexity: O(n)
    Space Complexity: O(1)
    """
    prev = None
    current = head
    
    while current:
        next_temp = current.next
        current.next = prev
        prev = current
        current = next_temp
    
    return prev

# Helper to create list
def create_list(arr):
    dummy = ListNode(0)
    current = dummy
    for val in arr:
        current.next = ListNode(val)
        current = current.next
    return dummy.next

# Helper to print list
def print_list(head):
    values = []
    while head:
        values.append(str(head.val))
        head = head.next
    print(" -> ".join(values))

# Test
head = create_list([1, 2, 3, 4, 5])
reversed_head = reverse_linked_list(head)
print_list(reversed_head)  # 5 -> 4 -> 3 -> 2 -> 1

---

Question 3: Valid Parentheses

Problem: Given a string containing only parentheses, determine if it's valid.

Example:

"()" -> True
"()[]{}" -> True
"(]" -> False
"([)]" -> False

Solution:

def is_valid(s):
    """
    Time Complexity: O(n)
    Space Complexity: O(n)
    """
    stack = []
    mapping = {')': '(', '}': '{', ']': '['}
    
    for char in s:
        if char in mapping:
            # Closing bracket
            top = stack.pop() if stack else '#'
            if top != mapping[char]:
                return False
        else:
            # Opening bracket
            stack.append(char)
    
    return len(stack) == 0

# Test
print(is_valid("()"))      # True
print(is_valid("()[]{}"))  # True
print(is_valid("(]"))      # False
print(is_valid("([)]"))    # False
print(is_valid("{[]}"))    # True

---

Question 4: Merge Two Sorted Arrays

Problem: Merge two sorted arrays into a single sorted array.

Solution:

def merge_sorted_arrays(arr1, arr2):
    """
    Time Complexity: O(n + m)
    Space Complexity: O(n + m)
    """
    result = []
    i = j = 0
    
    while i < len(arr1) and j < len(arr2):
        if arr1[i] <= arr2[j]:
            result.append(arr1[i])
            i += 1
        else:
            result.append(arr2[j])
            j += 1
    
    # Add remaining elements
    result.extend(arr1[i:])
    result.extend(arr2[j:])
    
    return result

# Test
arr1 = [1, 3, 5, 7]
arr2 = [2, 4, 6, 8]
print(merge_sorted_arrays(arr1, arr2))  # [1, 2, 3, 4, 5, 6, 7, 8]

---

Question 5: First Non-Repeating Character

Problem: Find the first non-repeating character in a string and return its index. Return -1 if not found.

Solution:

def first_unique_char(s):
    """
    Time Complexity: O(n)
    Space Complexity: O(1) - at most 26 characters
    """
    from collections import Counter
    
    # Count frequency
    count = Counter(s)
    
    # Find first with count 1
    for i, char in enumerate(s):
        if count[char] == 1:
            return i
    
    return -1

# Alternative without Counter
def first_unique_char_v2(s):
    char_count = {}
    
    # Count
    for char in s:
        char_count[char] = char_count.get(char, 0) + 1
    
    # Find first unique
    for i, char in enumerate(s):
        if char_count[char] == 1:
            return i
    
    return -1

# Test
print(first_unique_char("leetcode"))      # 0
print(first_unique_char("loveleetcode"))  # 2
print(first_unique_char("aabb"))          # -1

---

🎯 Interview Tips for Zomato

1. Know the Product Deeply: Understand Zomato's features, business model, and recent initiatives (Zomato Gold, Hyperpure, Blinkit acquisition). Show genuine interest in the food-tech space.

2. System Design Readiness: Zomato interviews heavily focus on system design. Practice designing food delivery systems, recommendation engines, and real-time tracking systems.

3. Data-Driven Thinking: Emphasize your ability to make decisions using data. Zomato is obsessed with metrics and analytics.

4. Scale Awareness: Discuss how your solutions work at Zomato's scale (millions of orders, real-time tracking, high concurrency).

5. Problem-Solving Approach: Think out loud, clarify requirements, and discuss trade-offs. Zomato values structured thinking over immediate solutions.

6. Cultural Fit: Show adaptability, ownership mindset, and passion for the mission of "better food for more people."

7. Coding Efficiency: Write clean, optimized code. Zomato engineers value code that is maintainable and efficient.

---

What Candidates Report About the Zomato Process

Candidates report that the system-design round at Zomato catches many DSA-focused candidates off guard, even at the fresher level. According to candidate accounts from public preparation resources, questions on cache hierarchies, fan-out patterns, and eventual consistency come up in the second technical round with enough frequency that candidates should treat system design as a required subject, not a bonus.

Candidate-reported feedback consistently flags the "why Zomato over Swiggy" question in HR rounds as a filter for preparation quality. Candidates who could reference Zomato-specific moves -- such as the Hyperpure supply-chain expansion or the Blinkit integration -- scored noticeably better in hiring-manager rounds than those giving generic answers.

Confirm the current Zomato campus drive schedule and eligibility criteria on the official Zomato careers page (careers.zomato.com) before applying, as batch requirements and open-role types change each hiring cycle.

You May Also Like

• Zomato Interview Questions 2026 - Round-by-Round Guide

• Intel Placement Papers 2026 | Interview Questions & Preparation Guide

• Cisco Placement Papers 2026 with Solutions, Aptitude, Technical & Coding

❓ Frequently Asked Questions (FAQs)

Q1: What is the selection process for Zomato fresher hiring?

A: The process typically includes: Online Assessment (aptitude + coding) → Technical Interview Round 1 → Technical Interview Round 2 → Hiring Manager Round → HR Discussion. The entire process can take 2-4 weeks.

Q2: Does Zomato hire freshers directly from campuses?

A: Yes, Zomato conducts campus placements at premier institutes like IITs, NITs, BITS, and other top engineering colleges. They also hire freshers through off-campus drives and referrals.

Q3: What programming languages are preferred at Zomato?

A: Python is extensively used for backend and data analytics. Java, Go, and JavaScript/TypeScript are also widely used. For interviews, Python or Java are safe choices.

Q4: Is there negative marking in the online test?

A: Yes, there is typically a -1 mark for incorrect answers in the MCQ sections. Be careful and avoid random guessing.

Q5: What makes Zomato different from other tech companies?

A: Zomato offers high ownership, fast career growth, significant equity (ESOPs), and the opportunity to work on products that impact millions daily. The culture is fast-paced and data-driven.

---

Good luck with your Zomato placement preparation! 🚀

Frequently Asked Questions

What is the Zomato placement salary range for 2026 freshers?

Zomato’s fresher offers typically vary based on role (engineering, product, data, operations), location, and your performance in coding and interviews. While exact numbers change each year, candidates should expect competitive packages with a mix of fixed salary and variable/performance components. For the most accurate estimate, compare your profile with recent Zomato campus trends and the role-specific pay bands shared during the process.

What is the eligibility criteria for Zomato placements 2026?

Eligibility generally includes being a final-year student or recent graduate, meeting the minimum CGPA/percentage criteria, and having the required skill set for the applied role. For technical roles, basic proficiency in DSA, coding fundamentals, and aptitude is expected, while non-technical roles may emphasize communication, problem-solving, and domain understanding. Always verify the exact criteria in the official Zomato campus/drive notification for your batch.

How difficult are Zomato placement papers and interviews for freshers?

The difficulty is usually moderate to high for coding rounds because they test both problem-solving speed and correctness. Aptitude and reasoning are typically straightforward but require accuracy under time pressure, while technical MCQs may focus on core concepts. Overall, candidates who prepare consistently for DSA patterns and mock interviews tend to perform well.

What should I prepare for Zomato placement papers 2026 (tips & strategy)?

Start with a strong DSA foundation: arrays, strings, hashing, stacks/queues, linked lists, trees, graphs, and dynamic programming basics. Practice coding problems in timed mode and build a repeatable approach for reading questions, choosing the right pattern, and handling edge cases. For aptitude, do daily practice on speed-based topics like percentage, time & work, probability, and logical reasoning.

What are the interview rounds in the Zomato placement process 2026?

A common sequence is an online assessment (coding + aptitude/technical MCQs), followed by one or more technical interviews and a final HR round. Technical interviews often include problem-solving discussion, coding walkthroughs, and sometimes system/design fundamentals depending on the role. HR rounds typically evaluate communication, motivation, and how well your projects align with Zomato’s work culture.

What common topics appear in Zomato placement papers 2026?

Coding rounds commonly include array/string manipulation, hashing-based problems, greedy approaches, recursion/backtracking, and graph/tree questions. Aptitude sections often cover quantitative reasoning, logical reasoning, and sometimes basic data interpretation. Technical MCQs may test fundamentals like DBMS concepts, operating system basics, OOP, and web/CS fundamentals depending on the role.

How do I apply for Zomato placements 2026?

For campus drives, you typically apply through your college’s placement portal or the official campus recruitment process shared by your TPO. For off-campus opportunities, Zomato roles are usually posted on their careers page, where you submit your resume and complete any required assessments. Ensure your resume highlights relevant projects, internships, and coding/DSA practice aligned to the role you’re targeting.

What is the selection rate for Zomato placements 2026?

The selection rate varies significantly by campus, role, and the number of applicants, so there isn’t a single fixed percentage for all years. Generally, only a fraction of applicants clear the online assessment, and fewer still pass the technical interviews due to coding accuracy and problem-solving depth. To improve your odds, focus on high-frequency DSA patterns, timed practice, and strong interview readiness for both coding and HR questions.