Upload Button Icon Add office photos
Premium Employer

i

This company page is being actively managed by Zomato Team. If you also belong to the team, you can get access from here

Zomato Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Zomato Software Development Engineer Interview Questions and Answers

Updated 1 Dec 2024

Zomato Software Development Engineer Interview Experiences

3 interviews found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

3 coding questions, medium

Round 2 - Technical 

(2 Questions)

  • Q1. Related to string and prefix sum
  • Q2. How priority queue works and its implementation using min heap
  • Ans. 

    Priority queue is a data structure that stores elements based on their priority, allowing for efficient retrieval of the highest priority element.

    • Priority queue can be implemented using a min heap, where the root node always contains the minimum element.

    • Insertion: Add the new element to the end of the heap and then heapify up to maintain the min heap property.

    • Deletion: Remove the root node (minimum element), move the l...

  • Answered by AI

Skills evaluated in this interview

I appeared for an interview in Jan 2021.

Interview Questionnaire 

1 Question

  • Q1. Questions on specifically on data structures and algorithms and on system design too

Interview Preparation Tips

Interview preparation tips for other job seekers - Include at least one link from any programming platform preferably, Hackerrank. Focus more on problem solving rather than giving contests. At least that worked for me.

Software Development Engineer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Given an acyclic graph of a city where each edge represents a roa ... read more
asked in Hike
Q2. You have application which shows list of all contacts, the Name c ... read more
asked in Amazon
Q3. Given a m * n matrix filled with '0's and 'x's at random position ... read more
asked in Samsung
Q4. puzzle-There are 1000 wine bottles. One of the bottles contains p ... read more
asked in Accenture
Q5. Have you worked on cloud technology? Architecture of cloud

I appeared for an interview in Aug 2016.

Interview Preparation Tips

Round: Resume Shortlist
Experience: Around 180-200 students applied for the position. 45 students were selected for the coding test.

Round: Test
Experience: There were 3 questions. The difficulty level was moderate. I did 2 questions and got selected for the next round. 13 students were selected for the skype interview.
Duration: 1 hour 30 minutes
Total Questions: 3

Round: Technical Interview
Experience: This skype round basically checks our strength in the computer science basics. There were questions on data structures, databases, algorithms. They were moderate to difficult in nature. 7 people went into the next skype round which is also technical in nature.

Round: Technical Interview
Experience: In this round, first, there was a coding question which I needed to write and execute in a shared environment. Then, there was basically a detailed testing of the concepts I had used in projects. As the majority of my projects were on Android, I was interviewed in Android from here on. There were some questions on software design principles as well. 2 students were selected from this round for the final round.

Round: Technical + HR Interview
Experience: In this final round, there was a brief discussion about my projects and some questions in between about my projects. After this discussion, I was told to showcase my skills other than technical. I was made to pitch my startup idea with the interviewer being my probable customer. So, one can expect his management or leadership skills also to be tested in this round. Both the candidates were selected.

College Name: The LNM Institute Of Information Technology, Jaipur

Interview questions from similar companies

I applied via Campus Placement and was interviewed in Jan 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. Heavily focused on DSA with emphasis on DP

Interview Preparation Tips

Interview preparation tips for other job seekers - PrepLook at previous years Flipkart Questions on GFG. Questions don't repeat but you will see the tyes of questions they will ask

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

Round duration - 60 minutes
Round difficulty - Easy

Round 2 - Face to Face 

Round duration - 50 minutes
Round difficulty - Easy

Round 3 - Face to Face 

Round duration - 60 minutes
Round difficulty - Easy

At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.

Round 4 - Face to Face 

Round duration - 40 minutes
Round difficulty - Easy

 

The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.

Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer asked me some Com­puter Sci­ence‍ fundamentals in this round as well as some behavioural questions.

  • Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
  • Ans. 

    Implement a Trie data structure with insert and search functions.

    • Create a TrieNode class with children and isEndOfWord attributes.

    • Implement insert function to add words by iterating through characters.

    • Implement search function to check if a word exists by traversing the Trie.

    • Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in HyderabadEligibility criteria 7 CGPA Amazon interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Operating System, Database Management System, Object-Oriented Programming SystemTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Do lot of hard work and practice of  Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.

Application resume tips for other job seekers

Make your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Coding Test 

Round duration - 90 minutes
Round difficulty - Medium

 Around 65-70 people sat for the test. 15 people were shortlisted. It consisted of the following to be done in 90 minutes.

- 28 MCQs based on core CS 

- 2 Coding questions – everyone had different and random questions. Most questions were custom logic based (easy level) including some standard questions – LCS, LIS, topological sort.

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Interviewer was very friendly. It started with the standard – tell me about yourself / introduce yourself type of question. Then he proceeded and asked two coding questions

  • Q1. 

    Remove Duplicates from a Sorted Linked List

    Your friend has homework to complete. Help him by removing duplicates from a sorted linked list.

    You are given the 'Head' of a sorted linked list. Modify the l...

  • Ans. 

    Remove duplicates from a sorted linked list without adjacent duplicates.

    • Traverse the linked list while comparing current and next nodes.

    • If they are equal, skip the next node by updating the current node's next pointer.

    • Repeat until the end of the list is reached.

  • Answered by AI
  • Q2. 

    Course Schedule Problem Statement

    You are enrolled as a student and must complete N courses, numbered from 1 to N, to earn your degree.

    Some courses have prerequisites, which means that to take course i,...

  • Ans. 

    Check if it is feasible to complete all courses with prerequisites.

    • Create a graph representing the prerequisites with courses as nodes and edges as prerequisites.

    • Perform a topological sort on the graph to check if there is a cycle (if there is, then it's not feasible to complete all courses).

    • If there is no cycle, then it is feasible to complete all courses.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Medium

This round had only 1 question. The interviewer introduced himself. And he advised me to clearly understand the problem before proceeding.

  • Q1. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree of distinct integers, along with two nodes, ‘X’ and ‘Y’. Your task is to determine the Lowest Common Ancestor (LCA) of ‘X’ and ‘Y’.

    The LC...

  • Ans. 

    Find the Lowest Common Ancestor of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the Lowest Common Ancestor.

    • Implement a recursive function to efficiently find the LCA.

    • Handle cases where one node is an ancestor of the other.

    • Consider edge cases like when X or Y is the root node.

  • Answered by AI
Round 4 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Pretty Good Round. Fast Paced. We covered a lot of ground.

  • Q1. 

    Binary Search Tree Iterator Problem Statement

    Design and implement a class BSTIterator to perform an in-order traversal over a Binary Search Tree (BST). Your implementation should include the following me...

  • Ans. 

    Design and implement a class BSTIterator to perform in-order traversal over a Binary Search Tree (BST).

    • Implement a parameterized constructor to initialize the iterator with the root of the BST.

    • Implement a method 'next()' to return the next smallest element in in-order traversal.

    • Implement a method 'hasNext()' to check if there exists a next smallest element in traversal.

    • Ensure the output is the in-order traversal of the

  • Answered by AI
  • Q2. 

    Maximum Consecutive Ones Problem Statement

    Given a binary array 'ARR' of size 'N', your task is to determine the maximum length of a sequence consisting solely of 1’s that can be obtained by converting at...

  • Ans. 

    Find the maximum length of a sequence of 1's by converting at most K zeroes into ones in a binary array.

    • Iterate through the array and keep track of the current window of 1's and zeroes.

    • Use a sliding window approach to find the maximum length of consecutive 1's by flipping at most K zeroes.

    • Update the window based on the number of zeroes flipped and keep track of the maximum length found so far.

    • Return the maximum length ...

  • Answered by AI
  • Q3. 

    BFS in Graph Problem Statement

    You are given an undirected and disconnected graph G(V, E) having V vertices numbered from 0 to V-1 and E edges. Your task is to print its BFS traversal starting from the 0t...

  • Ans. 

    BFS traversal of an undirected and disconnected graph starting from vertex 0.

    • Start BFS traversal from vertex 0 and visit all connected nodes in sorted order.

    • Use a queue to keep track of nodes to visit next.

    • Keep a visited array to avoid revisiting nodes.

    • Print the BFS traversal path as the nodes are visited.

    • Example: For input V=5, E=4 and edges 0-1, 0-2, 1-3, 2-4, the BFS traversal will be [0, 1, 2, 3, 4].

  • Answered by AI
  • Q4. 

    Dijkstra's Shortest Path Problem Statement

    Given an undirected graph with V vertices (labeled 0, 1, ..., V-1) and E edges, each edge connects two nodes X and Y with a specified weight representing the dis...

  • Ans. 

    Dijkstra's algorithm is used to find the shortest path distance from a source node to all other nodes in an undirected graph.

    • Implement Dijkstra's algorithm to find the shortest path distance from node 0 to all other nodes in the graph.

    • Use a priority queue to efficiently select the next node with the shortest distance.

    • Initialize distances to all nodes as infinity, except for the source node which is 0.

    • Update distances t...

  • Answered by AI
Round 5 - Face to Face 

(1 Question)

Round duration - 60 minutes
Round difficulty - Hard

Bar Raised Round. Definitely felt the difficulty.

  • Q1. 

    First Non-Repeating Character Problem Statement

    You are given a string consisting of English alphabet characters. Your task is to identify and return the first character in the string that does not repeat...

  • Ans. 

    Identify and return the first non-repeating character in a string, or the first character if all characters repeat.

    • Iterate through the string to count the frequency of each character

    • Iterate through the string again to find the first character with frequency 1

    • If no such character is found, return the first character of the string

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaAmazon interview preparation:Topics to prepare for the interview - Linked Lists, Trees, BFS, DFS, Backtracking, Graphs.Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 250 Questions, Give yourself enough time for preparation. Cramming won't take you very far. In books, I really liked Elements of Programming Interviews. 
Tip 2 : Make sure to brush up your basics - coding style, OOPs, Language features. They help in making an impression.
Tip 3 : Don't worry about solving the question in the interview. Learn to tackle any random problem with the best of your ability. More often than not, that'd be enough.

Application resume tips for other job seekers

Tip 1 : Keep your resume clean - no graphics, no multiple fonts. Keep it one page.
Tip 2 : Don't go over board in mentioning skills, only mention the things you are truly confident about.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Mar 2019. There were 5 interview rounds.

Interview Questionnaire 

9 Questions

  • Q1. Find shortest path to reach from one point to another in a 2d matrix. Link - -----/
  • Ans. 

    Shortest path in 2D matrix

    • Use BFS or Dijkstra's algorithm

    • Create a visited matrix to avoid revisiting cells

    • Keep track of distance and path

    • Consider obstacles or blocked cells

  • Answered by AI
  • Q2. Vertical order traversal of tree. Link - -----/
  • Ans. 

    Vertical order traversal of tree

    • Vertical order traversal means printing nodes of a binary tree in vertical order

    • We can use a map to store nodes at each horizontal distance from the root

    • Then we can traverse the map and print nodes in each horizontal distance

  • Answered by AI
  • Q3. Sliding window maximum. Link- -----/
  • Q4. Number of binary strings of length N, not containing consecutive 1s. Link: - -----/
  • Ans. 

    The number of binary strings of length N without consecutive 1s.

    • Use dynamic programming to solve the problem.

    • Create an array to store the number of valid strings for each length.

    • Initialize the array with base cases.

    • Iterate through the array and calculate the number of valid strings for each length.

    • Return the value at the Nth index of the array.

  • Answered by AI
  • Q5. Next greater permutation. Link:- -----/
  • Q6. LRU cache. Link:- -----/
  • Q7. Minimum time required to rot all oranges. Link:- -----/
  • Q8. A complete binary is defected because it has a level at which difference between heights of left and right subtree is more than 1. Find the first such level from top.
  • Ans. 

    Find the first level in a complete binary tree where the height difference between left and right subtrees is more than 1.

    • Traverse the binary tree level by level using breadth-first search

    • For each level, calculate the height difference between the left and right subtrees

    • Return the level number when the height difference is more than 1

  • Answered by AI
  • Q9. In last round only project related discussion.

Interview Preparation Tips

Interview preparation tips for other job seekers - I highly recommend practicing on InterviewBit, other sites are also good but I found this platform as most helpful.

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in Oct 2020. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Datastructure and algorithms,Linkedlist,arrays,dynamic programming,recursion,design patterns,Trees

Interview Preparation Tips

Interview preparation tips for other job seekers - There will be four technical interviews
1.hackerearth round
2.problem solving round-1
3.problem solving round-2
4.Design round- where you will be asked to design an application with given requirements

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 Minutes
Round difficulty - Medium

Interview started at 11:00 am. It was an online round. During the coding round I submitted optimized solution and got full acceptance of the solutions.

  • Q1. 

    Detect Cycle in a Directed Graph

    You are provided with a directed graph composed of 'N' nodes. You have a matrix called 'EDGES' with dimensions M x 2, which specifies the 'M' edges in the graph. Each edge...

  • Ans. 

    Detect cycle in a directed graph using depth-first search (DFS) algorithm.

    • Use DFS to traverse the graph and detect back edges indicating a cycle.

    • Maintain a visited array to keep track of visited nodes during traversal.

    • If a node is visited again during traversal and it is not the parent node, then a cycle exists.

    • Return true if a cycle is detected, false otherwise.

  • Answered by AI
Round 2 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 10:00 am. Interview went well, I was able to connect with the interviewer and enjoyed the whole interview

  • Q1. 

    Next Smallest Palindrome Problem Statement

    Find the next smallest palindrome strictly greater than a given number 'N' represented as a string 'S'.

    Explanation:

    You are given a number in string format, a...

  • Ans. 

    Find the next smallest palindrome greater than a given number represented as a string.

    • Convert the string to an integer, find the next greater palindrome, and convert it back to a string.

    • Handle cases where the number is a palindrome or has all digits as '9'.

    • Consider both odd and even length numbers when finding the next palindrome.

  • Answered by AI
Round 3 - Face to Face 

(1 Question)

Round duration - 80 Minutes
Round difficulty - Medium

Interview started at 11:00 am. Interview went well.

  • Q1. 

    Boundary Traversal of a Binary Tree

    Given a binary tree of integers, your task is to return the boundary nodes of the tree in Anti-Clockwise direction starting from the root node.

    Input:

    The first line ...
  • Ans. 

    Return the boundary nodes of a binary tree in Anti-Clockwise direction starting from the root node.

    • Traverse the left boundary nodes in a top-down manner

    • Traverse the leaf nodes from left to right

    • Traverse the right boundary nodes in a bottom-up manner

    • Handle cases where duplicates occur in the boundary nodes

    • Implement the function without printing as printing is already managed

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaGood knowledge of Data Structures, Some great projects which are used by the usersAmazon interview preparation:Topics to prepare for the interview - Data Structures, Web development, System Design, Algorithms, Dynamic Programming, Database, OS, Networking, OOPS, DevOpsTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

Tip 1 : For Data Structures number of questions doesn't matter. Try to understand the logic behind them and try to apply them in creating multiple scenario's. Learn them by heart. 
Tip 2 : For Web.Development Try to learn full stack development. See which part interests you more, Increase your knowledge horizon, Always try to build a system a system considering It will be served to millions of customers. By doing this 1-2 projects will increase and cover all the major things which one should learn in their career/college.

Application resume tips for other job seekers

Tip 1 : Always try to make it a single page 
Tip 2 : Always make resume company specific. eg. Data Structures part more if you are applying for MNC's eg. Amazon, Google, DE Shaw, browserstack.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Easy

This was MCQ+Coding round.

  • Q1. How can you check if two strings are anagrams of each other?
  • Ans. 

    Check if two strings are anagrams by comparing the sorted versions of the strings.

    • Sort both strings and compare if they are equal.

    • Use a hashmap to store the frequency of characters in each string and compare the maps.

    • Ignore spaces and punctuation when comparing the strings.

  • Answered by AI
Round 2 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Round 3 - Face to Face 

Round duration - 90 minutes
Round difficulty - Easy

This was face to face interview round.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from National Institute Of Technology, Silchar, Assam. I applied for the job as SDE - 1 in SiddharthnagarEligibility criteria6 CGPAAmazon interview preparation:Topics to prepare for the interview - Basic Computer Science backgroundTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Participate in live contests on websites like Codechef, Codeforces etc as much as possible.
Tip 2 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 3 : Revise Computer Science subjects like DBMS, OOPS thoroughly.

Application resume tips for other job seekers

Add projects and Internships if you have done any and add only those things which you really know.

Final outcome of the interviewSelected

Skills evaluated in this interview

Zomato Interview FAQs

How many rounds are there in Zomato Software Development Engineer interview?
Zomato interview process usually has 2 rounds. The most common rounds in the Zomato interview process are Coding Test and Technical.
What are the top questions asked in Zomato Software Development Engineer interview?

Some of the top questions asked at the Zomato Software Development Engineer interview -

  1. How priority queue works and its implementation using min h...read more
  2. Questions on specifically on data structures and algorithms and on system desig...read more
  3. Related to string and prefix ...read more

Tell us how to improve this page.

Zomato Software Development Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
Zomato Software Development Engineer Salary
based on 39 salaries
₹12 L/yr - ₹36 L/yr
95% more than the average Software Development Engineer Salary in India
View more details

Zomato Software Development Engineer Reviews and Ratings

based on 6 reviews

1.3/5

Rating in categories

2.4

Skill development

1.3

Work-life balance

3.0

Salary

1.1

Job security

1.3

Company culture

2.5

Promotions

1.5

Work satisfaction

Explore 6 Reviews and Ratings
Key Account Manager
951 salaries
unlock blur

₹4.5 L/yr - ₹13.9 L/yr

Delivery Boy
908 salaries
unlock blur

₹0.4 L/yr - ₹5.4 L/yr

Business Analyst
578 salaries
unlock blur

₹5 L/yr - ₹20 L/yr

Senior Associate
307 salaries
unlock blur

₹3.2 L/yr - ₹11.1 L/yr

Accounts Manager
292 salaries
unlock blur

₹4 L/yr - ₹13.2 L/yr

Explore more salaries
Compare Zomato with

Swiggy

3.8
Compare

Amazon

4.0
Compare

Dunzo

3.4
Compare

Flipkart

3.9
Compare
Did you find this page helpful?
Yes No
write
Share an Interview