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 Developer Intern Interview Questions, Process, and Tips

Updated 22 May 2022

Top Zomato Software Developer Intern Interview Questions and Answers

  • Q1. Maximize the Sum Through Two Arrays You are given two sorted arrays of distinct integers, ARR1 and ARR2 . If there is a common element in both arrays, you can switch fro ...read more
  • Q2. LFU Cache Design Problem Design and implement a Least Frequently Used (LFU) Cache with the following functionalities: 1. put(U__ID, value) : Insert the value in the cach ...read more
  • Q3. Find All Pairs Adding Up to Target Given an array of integers ARR of length N and an integer Target , your task is to return all pairs of elements such that they add up ...read more
View all 12 questions

Zomato Software Developer Intern Interview Experiences

3 interviews found

I was interviewed in May 2022.

Round 1 - Face to Face 

(2 Questions)

Round duration - 150 minutes
Round difficulty - Medium

The interview was scheduled at 6 pm and the duration of the interview was 1.5 hrs but went for around 2.5 hrs. The interviewer started with a brief intro about me. Asked me some coding questions. After coding questions he started asking questions on dbms like difference between sql and no sql, what is horizontal and vertical scaling and when we use them. Then some questions on computer networks like how web browsers works, different between http and HTTPS, what is TCP. After this he asked about my projects and the technology I worked on during the intern.

  • Q1. 

    Snake and Ladder Problem Statement

    Given a Snake and Ladder Board with 'N' rows and 'N' columns filled with numbers from 1 to N*N starting from the bottom left of the board, and alternating direction each...

  • Q2. 

    Deletion In Doubly Linked List

    You are given a Doubly Linked List with 'N' positive integers. Your task is to delete a node at a given position 'POS' in this linked list.

    Input:

    The first line of input ...
Round 2 - HR 

Round duration - 20 minutes
Round difficulty - Easy

Interview Preparation Tips

Eligibility criteriaNeed good projects in your resume.Zomato interview preparation:Topics to prepare for the interview - Dsa, computer networks, operating system, system design, dbmsTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Study all the concepts of dbms and cn deeply
Tip 2 : Zomato focus on development, so you have to do some good projects or should have previous internship experience.

Application resume tips for other job seekers

Tip 1 : Have good Projects
Tip 2 : Study all the topics deeply that u mentioned in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Aug 2021.

Round 1 - Video Call 

(5 Questions)

Round duration - 90 minutes
Round difficulty - Medium

The interview started in the evening on google meet. and extended for 90 minutes. The interviewer was very helpful and he shared a collaborative code editor to discuss several problems.

  • Q1. 

    Find All Pairs Adding Up to Target

    Given an array of integers ARR of length N and an integer Target, your task is to return all pairs of elements such that they add up to the Target.

    Input:

    The first line ...
  • Ans. 

    Step 1 : I first explained an iterative approach for the problem. The solution had O(N) complexity.
    Step 2 : Interviewer asked me to optimise the solution.
    Step 3 : Then I gave a solution that involved using binary search as the array was already in sorted order that reduced the solution complexity to O(log N) and the interviewer was happy.

  • Answered Anonymously
  • Q2. 

    Convert a Binary Tree to a Sum Tree

    Given a binary tree of integers, convert the binary tree into a sum tree where each node's value is replaced by the sum of the values of its left and right subtrees in ...

  • Ans. 

    Step 1 : I explained a solution that involves calling nodes reclusively and calculating the sum of all children and adding them together to check the condition. After calculating I returned sum of children with the node value from the function. 

    The solution has time complexity of O(N) when N is number of nodes and the interviewer was happy with my approach.

  • Answered Anonymously
  • Q3. 

    LFU Cache Design Problem

    Design and implement a Least Frequently Used (LFU) Cache with the following functionalities:

    1. put(U__ID, value): Insert the value in the cache if the key ('U__ID') is not alrea...
  • Ans. 

    I used min-heap to implement LFU , as it handles insertion, deletion, and update in logarithmic time complexity. A tie can be resolved by removing the least recently used cache block. I also used an hashmap to store the indices of the cache blocks which allows searching in constant time.

    The interviewer was happy with my solution

  • Answered Anonymously
  • Q4. Write a SQL query to find the X percentile of students.
  • Ans. 

    Tip 1 : Practice SQL queries from different websites.
    Tip 2 : Use different websites for quick revision of common SQL commands.

  • Answered Anonymously
  • Q5. Can you explain polymorphism and provide examples of real-time and run-time polymorphism?
  • Ans. 

    Tip 1 : Read OOPs concepts thoroughly.

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Electronics & Communication Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in GurgaonEligibility criteriaNo criteria as such but having good projects create an impact.Zomato interview preparation:Topics to prepare for the interview - Binary Search, Tree, Graph, Dynamic ProgrammingTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at-least 300 problems.
Tip 2 : Add at-least 2 projects and prepare them well for the interview.
Tip 3 : Practice mock interviews with your friends to learn how to explain problems.

Application resume tips for other job seekers

Tip 1 : Follow some standard resume format and add 2-3 projects with explanations in point, also include technologies used in the project.
Tip 2 : Make sure you add all the technologies you are aware of in your resume and also, add links to competitive profiles (if you have good coding profiles).
Tip 3 : Add your achievements in the resume in points.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum of Maximum and Minimum Elements Problem Statement Given an ar ... read more
asked in Groww
Q2. Minimum and Maximum Candy Cost Problem Ram is in Ninjaland, visit ... read more
Q3. Nth Element Of Modified Fibonacci Series Given two integers X and ... read more
Q4. Fibonacci Membership Check Given an integer N, determine if it is ... read more
asked in Google
Q5. Hotel Room Booking Problem You are managing a hotel with 10 floor ... read more

I was interviewed before Sep 2020.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

The overall interview experience was quite smooth and the interviewers were very kind.
I was asked 2 coding questions.

  • Q1. 

    Reverse Doubly Linked List in Groups Problem

    You are provided with a Doubly Linked List consisting of integers and a positive integer 'K', which represents the size of the group. Your task is to modify th...

  • Ans. Recursion

    The idea is very simple. We will process ‘K’ nodes at a time. Firstly, we will reverse the first ‘K’ nodes of the doubly linked list and then we will do this recursively for the remaining linked list.

    Algorithm:

    • If the node does not exist, simply return ‘NULL’.
    • ‘HEAD’ is pointing to the first node of the linked list.
    • If there are less than ‘K’ nodes, just reverse them and return the reversed linked list. Else reve...
  • Answered Anonymously
  • Q2. 

    Largest Rectangle in Histogram Problem Statement

    You are given an array/list HEIGHTS of length N, where each element represents the height of a histogram bar. The width of each bar is considered to be 1.

    ...
  • Ans. Brute Force

    Our intuition is to consider each and every rectangle once so that we can calculate which rectangle has the maximum area.

     

    A simple solution to this problem is to one by one consider all bars as starting points and calculate the area of all rectangles starting with every bar and iterating towards the end of the array/list. Finally, return the maximum of all possible areas.

    Space Complexity: O(1)Explanatio...
  • Answered Anonymously
Round 2 - Video Call 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

3 coding questions were asked and 1 on system design.

  • Q1. 

    Maximize the Sum Through Two Arrays

    You are given two sorted arrays of distinct integers, ARR1 and ARR2. If there is a common element in both arrays, you can switch from one array to the other.

    Your task...

  • Ans. Recursive

    In this problem, our primary focus is on the common elements i.e. an element that is present in both the arrays. Then, we have to decide whether we have to make a switch. So for that, first we store all the elements of ‘ARR1’ and ‘ARR2’ into ‘MAP1’ and ‘MAP2’ respectively. 

     

    Now we call our ‘maximiseSumHelper’ function. We call this function for both cases i.e starting with ‘ARR1’ and starting with ‘A...

  • Answered Anonymously
  • Q2. 

    Number of Islands Problem Statement

    You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...

  • Ans. Flood Fill Algorithm

    We can use the flood fill algorithm to check for all connected 1s.

     

    • We create two arrays, dx, and dy, in which we store the unit vectors for all eight directions. Thus, when we are at a given cell, we can easily check for all its adjacent cells by simply looping over the two arrays, adding their values to the current position, and checking for this new position recursively.
    • We will also create a ...
  • Answered Anonymously
  • Q3. How would you design Instagram?
Round 3 - HR 

Round duration - 15 Minutes
Round difficulty - Medium

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Vellore Institute of Technology. I applied for the job as SDE - Intern in DelhiEligibility criteria7 CGPAZomato interview preparation:Topics to prepare for the interview - Data Structures , Algorithms ,JAVA, .Computer Networking, Data BaseTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Practice previous interview questions from LeetCode, GeeksForGeeks.
Tip 2 : Revise Computer Science subjects like DBMS, OOPS etc
Tip 3 : Confidence is a key of success

Application resume tips for other job seekers

Tip 1 : Mention those things which your confident about
Tip 2 : Add projects and Internships

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Mar 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Graphs ,arrays , Hashmaps and Heaps

Round 2 - One-on-one 

(2 Questions)

  • Q1. Graphs related dfs
  • Q2. Changes on graph structure
  • Ans. 

    Changes on graph structure involve adding, removing, or modifying nodes and edges.

    • Adding a new node to the graph

    • Removing an existing node from the graph

    • Modifying the weight of an edge in the graph

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Design parking lot app
  • Ans. 

    A parking lot app to help users find available parking spots and pay for parking.

    • Include a map feature to show available parking spots in real-time

    • Allow users to reserve parking spots in advance

    • Integrate payment options for users to pay for parking

    • Provide notifications for parking expiration or availability of nearby spots

  • Answered by AI
  • Q2. Design parking lot app for blind people
  • Ans. 

    A parking lot app designed for blind people to easily navigate and find available parking spots.

    • Include voice-guided navigation to direct users to available parking spots

    • Use sensors to detect empty parking spaces and relay information to the app

    • Provide audio alerts for obstacles or other vehicles in the parking lot

    • Include a feature for users to easily locate their parked vehicle when returning

  • Answered by AI

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Not Selected

I applied via campus placement at Malviya National Institute of Technology (NIT), Jaipur and was interviewed in Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

It consists of aptitude and 2 easy coding questions

Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell about your project
  • Ans. 

    Developed a web application for managing inventory

    • Used HTML, CSS, and JavaScript for the frontend

    • Implemented a RESTful API using Node.js and Express.js for the backend

    • Utilized a PostgreSQL database for storing inventory data

    • Implemented authentication and authorization using JSON Web Tokens (JWT)

    • Implemented features like adding, updating, and deleting inventory items

  • Answered by AI
  • Q2. Some basic SQL question

Interview Preparation Tips

Topics to prepare for PolicyBazaar Software Developer Intern interview:
  • DSA
  • SQL
  • Web Development

I was interviewed in Feb 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

The round was conducted on the HackerRank platform. It was conducted in the morning from 12:00 pm to 1:30 pm.
The only requirement was a stable internet connection.

  • Q1. 

    Valid Parentheses Problem Statement

    Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.

    Input:

    The first line contains an...
  • Q2. 

    Date Reformatting

    You have a string 'S' representing a date in the "Day Month Year" format, where:

    • Day is one of {"1st", "2nd", "3rd", ..., "29th", "30th", "31st"}.
    • Month is one of {"Jan", "Feb", "M...
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was conducted in the morning, at around 8 am, and was conducted on the Blue Jeans Platform. It was an online video interview, where the interviewer asked me 2 questions related to DSA.

  • Q1. 

    Distinct Islands Problem Statement

    Given a two-dimensional array/list consisting of integers 0s and 1s, where 1 represents land and 0 represents water, determine the number of distinct islands. A group of...

  • Q2. 

    Count and Say Sequence Problem

    The 'Count and Say' sequence is a series of strings in which each consecutive term is generated by describing the previous term. The sequence begins with '1'.

    Your task is ...

Round 3 - Video Call 

(1 Question)

Round duration - 30 minutes
Round difficulty - Medium

This round was conducted after the first round in the morning. It was conducted at 10:00 am.

  • Q1. 

    Distribute Items Problem Statement

    Calculate the number of ways to distribute a given number of items 'N' among three people such that each person gets at least one item, and only one person receives the ...

Round 4 - HR 

Round duration - 45 minutes
Round difficulty - Medium

This was an HR round and was conducted on the same day at around 12:00 pm

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Punjab Engineering College(Deemed To be University). Eligibility criteriaNo criteriaExpedia Group interview preparation:Topics to prepare for the interview - Data Structures, Dynamic Programming, Stacks, Algorithms, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Consistency is the key, be it only one or two questions daily, but be consistent.
Tip 2 : Be thorough with the concepts and do note rote learn them.
Tip 3 : Even if you have successfully solved a question, do see other approaches
Tip 4 : Have at least two good projects with which you are thorough.

Application resume tips for other job seekers

Tip 1 : Resume should be concise, yet impactful.
Tip 2 : Keep only genuine content on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Add Two Numbers Represented by Linked Lists

    Your task is to find the sum list of two numbers represented by linked lists and return the head of the sum list.

    Explanation:

    The sum list should be a linked...

  • Ans. Recursive approach

    One way is to recursively add the two linked lists. Keep the nodes in the recursion stack and add the last nodes first and then second last and so on. Initially, find the size of both the linked lists. If both the linked lists are of the same size, add them using recursion. Else if their sizes differ, move the head pointer of the larger linked list forward K times, where K is the difference between th...

  • Answered Anonymously
  • Q2. 

    Check If Linked List Is Palindrome

    Given a singly linked list of integers, determine if the linked list is a palindrome.

    Explanation:

    A linked list is considered a palindrome if it reads the same forwar...

  • Ans. Using Stack

    The idea is to store the list values in a stack and then compare the values in the list with the values in the stack.
     

    Algorithm:

    1. Traverse the list from head to tail and push every node in the stack.
    2. Make a pointer ‘cur’ which initially points to the head node.
    3. If value at ‘cur’ is not equal to the top element of the stack, then the given list is not a palindrome
    4. Else, move the ‘cur’ pointer to its next node...

  • Answered Anonymously
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

  • Q1. 

    Square Root with Decimal Precision Problem Statement

    You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...

  • Ans. Bruteforce
    • We will find the integer part and decimal part of the answer separately.
    • First, we will find an integral part.
    • We will declare the answer variable where we will store the answer.
    • Your answer could be between 1 and N so we will iterate through all the numbers from 1 to N.
      • Let’s say we are currently at number i.
      • If i ^ 2 = N then i is the exact answer so we will return i.
      • If i ^ 2 < N then i could be a possible an...
  • Answered Anonymously
  • Q2. 

    Alien Dictionary Problem Statement

    You are provided with a sorted dictionary (by lexical order) in an alien language. Your task is to determine the character order of the alien language from this dictiona...

  • Ans. Permutations Approach

    Approach:

    • Find all the distinct characters present in all the words.
    • Generate all permutations of these distinct characters.
    • Treat each of the permutations as a correct sequence of alphabets. Now check if the given words are sorted according to this sequence. In order to do this, we will:-
      • For all words from 1 to n - 1, let the current word be ‘currWord’ and the next word be ‘nextWord’.
      • One by one compa...
  • Answered Anonymously

Interview Preparation Tips

Eligibility criteriaNo Backlog and above 6 CGPAAmazon interview preparation:Topics to prepare for the interview - Algorithms, C++, aptitude and reasoning, Database Management System, Operating System, Java, Object Oriented programming language, Computer Networks, Data StructureTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : The most fundamental and important thing to prepare are Data Structures and Algorithms. Be very much clear on your basics and skills.
Tip 2 : Revise OOPS thoroughly.
Tip 3 : Practice DSA (minimum 200), aptitude and reasoning questions regularly.

Application resume tips for other job seekers

Tip 1 : The resume should not be more than 1 page. Be brief and write only those skills, projects or achievements which you have completed yourselves and have thorough knowledge. Avoid unnecessary details like hobbies, parent's name, photo, etc.
Tip 2 : Add a link to your LinkedIn, GitHub, website etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Campus Placement and was interviewed in Jul 2021. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Multi-Level LinkedList sorting
  • Q2. Replacement of blank space with %20 in string without using any new string.
  • Ans. 

    Replace blank space with %20 in string without using new string.

    • Loop through string and replace blank space with %20 in place.

    • Use two pointers, one for original string and one for modified string.

    • Use ASCII value of %20 to replace blank space in place.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Work on your DSA a lot, for any fresher DSA matters the most to get into PBCs along with your CS Core subjects like OS, CN, DBMS.

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:30 PM.

  • Q1. 

    Meeting Rescheduling Challenge

    Ninja is tasked with organizing a meeting in an office that starts at time ‘0’ and ends at time ‘LAST’. There are ‘N’ presentations scheduled with given start and end times....

  • Ans. Brute Force Approach

    Algorithm:

     

    • The idea here is to find the maximum sum subarray of size ‘K+1’, where the array will contain empty slots.
    • First, we create an array named emptySlots[], to store the time duration in which there is no presentation.
    • Run a loop to traverse all presentations, and in each iteration, add START[i] - END[i-1] (which gives a free slot between the ith presentation) into the array emptySlots[].
    • N...
  • Answered Anonymously
  • Q2. 

    Total Unique Paths Problem Statement

    You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...

  • Ans. Recursive Approach

    We can easily count the total number of paths by making a recursive algorithm.

     

    The steps are as follows:

     

    1. We are given a function UNIQUEPATHS(), which takes two integers ‘M’ and ‘N’ as parameters and returns a single integer. This will be the definition of our recursive function too.
    2. As our base condition, we will check if our number of rows (‘M’) or a number of columns (‘N’) is equal to 1. If...
  • Answered Anonymously
Round 2 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Medium

This round was coding round with discussion .
The interviewer tried to trick the questions and wanted to test how we respond if something is asked out of preparation.
The code we ran on Google Docs was checked on Online IDE if it ran for sample inputs.
Timing : 12:00 PM to 1:30 PM

  • Q1. 

    Minimum Operations to Connect a Graph

    You are given a graph with 'N' vertices labeled from 1 to 'N' and 'M' edges. In one operation, you can shift an edge from being between two directly connected vertice...

  • Ans. Breadth First Search.

    For a graph with ‘N’ vertices to be connected, there must be at least ‘N’ - 1 edges in the graph. If a graph has less than ‘N' - 1 edges it is impossible to make the graph connected. Otherwise, it is always possible to make graph connected. As we need to find the minimum number of operations to make the graph connected we will think greedily. We will find the total number of connected components in...

  • Answered Anonymously
  • Q2. 

    Snake and Ladder Problem Statement

    Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...

  • Ans. BFS

    We will use Breadth-First Search to find the shortest path from cellNumber 1 to cellNumber N*N.

    1. We will maintain a queue of cellNumber where the front of the queue will always contain a cell which can be reached by minimum dice throw from starting cell (cellNumber = 1).
    2. Create a minDiceThrow array of size N*N initialise it with the maximum value (INT_MAX)
    3. Start with pushing cellNumber 1 and updating minDiceThrow[1] = 0...
  • Answered Anonymously
Round 3 - Coding Test 

(1 Question)

Round duration - 75 minutes
Round difficulty - Hard

This was a problem solving round and lasted for 75 minutes. The interviewer gave me a very complicated question.
The round was held on Google Meet and I was supposed to tell him the approach and write code on shared Google Docs.

  • Q1. 

    XOR Query Problem Statement

    Assume you initially have an empty array called ARR. You are required to return the updated array after executing Q number of queries on this array.

    There are two types of que...

  • Ans. Brute Force

    Approach:

    • It is a brute force approach where we will create an empty array initially of size 10^5 + 1.
    • Now, whenever we have a query of type 1 we will insert the value of VAL in the array. And when the query of type 2 comes then we will iterate through our array and perform an XOR operation with VAL to every value present in our array.
    • Finally, we will return our array.

     

    Algorithm:

    • Create an array ans.
    • Now it...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - Intern in BangaloreEligibility criteriaAbove 6 CGPAUber interview preparation:Topics to prepare for the interview - Dynamic Programming, OOPs, Computer Network, Operating System, Game TheoryTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : prepare all Topics from Coding Ninjas of Course Competitive Programming. Also I practiced atleast one question everyday from sites like Leetcode,Interviewbit and also took part in Codeforces Contest.
Tip 2 : Though Data Structure is the base for any tech interview, one must know some other subjects as well like Operating System, Networking, and Database Management System for which I took help from Coding Ninja’s notes and from GeeksforGeeks.

Application resume tips for other job seekers

Tip 1 : Keep your resume up to date and mention 2-3 good level projects which will give a good impression to the interviewer .
Tip 2 : Don't put false things on the resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Tell us how to improve this page.

Zomato Software Developer Intern Reviews and Ratings

based on 2 reviews

3.6/5

Rating in categories

3.6

Skill development

2.8

Work-life balance

2.7

Salary

2.7

Job security

3.6

Company culture

3.6

Promotions

3.0

Work satisfaction

Explore 2 Reviews and Ratings
Delivery Boy
1k salaries
unlock blur

₹0.4 L/yr - ₹5 L/yr

Key Account Manager
919 salaries
unlock blur

₹4.5 L/yr - ₹14.2 L/yr

Business Analyst
585 salaries
unlock blur

₹7 L/yr - ₹20 L/yr

Accounts Manager
296 salaries
unlock blur

₹4 L/yr - ₹13.2 L/yr

Senior Associate
277 salaries
unlock blur

₹2.8 L/yr - ₹10 L/yr

Explore more salaries
Compare Zomato with

Swiggy

3.8
Compare

Amazon

4.1
Compare

Dunzo

3.4
Compare

Flipkart

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