Zomato Insight

Offer

SDE-1

1-3 Years

Jul 29, 2026

DSA

Resume Deep Dive

Interviewers conducted a thorough review of past internships and projects, focusing on the 'why' and 'how' behind technical decisions.

The candidate was pushed to justify architectural choices made in previous work experiences.

The DSA portion required optimizing solutions to O(n) time complexity with O(1) space complexity.

Given an array of positive integers and a target integer, find the length of the minimum subarray with a sum greater than or equal to the target.

ArraysSliding Window

How would the approach change if the array contained negative numbers?

ArraysAlgorithms

DSAOperating Systems

The round focused heavily on subject-matter expertise, specifically targeting Operating Systems concepts mentioned on the resume.

The DSA problem involved a Binary Search Tree (BST) traversal, with the interviewer testing edge cases such as skewed trees and negative values.

The interviewer emphasized rigorous testing of the logic against various tree structures.

Standard Binary Search Tree traversal logic.

TreesBST

BehavioralCulture Fit

The round assessed alignment with Zomato's organizational values and work culture.

The candidate was asked to provide specific examples of past challenges and problem-solving approaches.

The interviewer evaluated the candidate's motivation for joining the company and their professional mindset.

Why Zomato?

Behavioral

Provide examples of when you tackled specific issues in your previous work experience.

Behavioral

Interviewers conduct thorough research on the candidate's background before the interview; be prepared for deep dives.
Do not list projects or technologies on the resume that cannot be explained in depth.
Focus on understanding the underlying subject matter rather than just memorizing coding patterns.

Prepare to defend every technical decision and project detail listed on the resume.
Expect deep-dive questions into past work experiences rather than generic behavioral questions.
Practice optimizing DSA problems to achieve O(n) time and O(1) space complexity.
Be prepared to discuss edge cases for tree and array-based data structures.