Upload Button Icon Add office photos
Engaged Employer

i

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

Dunzo Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Dunzo Software Developer Intern Interview Questions and Answers

Updated 25 May 2022

12 Interview questions

A Software Developer Intern was asked
Q. 

Asteroid Collision Problem Description

Given an array/list ASTEROIDS representing asteroids aligned in a row, each element's absolute value identifies the asteroid's size, while its sign indicates the dire...

Ans. 

Determine the state of asteroids after collisions occur.

  • Iterate through the array of asteroids and simulate collisions between adjacent asteroids.

  • Use a stack to keep track of remaining asteroids after collisions.

  • Handle cases where asteroids moving in opposite directions collide and destroy each other.

  • Handle cases where asteroids moving in the same direction do not collide.

A Software Developer Intern was asked
Q. 

Word Break II Problem Statement

Given a non-empty string 'S' containing no spaces and a dictionary of non-empty strings, generate and return all possible sentences by adding spaces in the string 'S', such ...

Ans. 

Given a string and a dictionary, generate all possible sentences by adding spaces between words from the dictionary.

  • Use backtracking to generate all possible sentences by recursively adding words from the dictionary to the current sentence.

  • Check if the current substring of the input string exists in the dictionary, if so, add it to the current sentence and continue recursively.

  • When the entire input string is proce...

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 Amazon
Q2. Fish Eater Problem Statement In a river where water flows from le ... read more
asked in Apple
Q3. Kevin and his Fruits Problem Statement Kevin has 'N' buckets, eac ... read more
asked in CommVault
Q4. Sliding Maximum Problem Statement Given an array of integers ARR ... read more
Q5. Reverse Words in a String: Problem Statement You are given a stri ... read more
A Software Developer Intern was asked
Q. 

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 ...
Ans. 

The task is to determine if a given string consisting of parentheses is balanced or not.

  • Use a stack data structure to keep track of opening parentheses

  • Iterate through the string and push opening parentheses onto the stack and pop when encountering a closing parenthesis

  • If at the end the stack is empty, the string is balanced, otherwise it is not

A Software Developer Intern was asked
Q. 

Trie Data Structure Implementation

Design and implement a Trie (Prefix Tree) which should support the following two operations:

1. Insert a word into the Trie. The operation is marked as 'insert(word)'.
2. ...
Ans. 

Implement a Trie data structure supporting insert and search operations efficiently.

  • Implement a Trie class with insert and search methods.

  • Use a nested class Node to represent each node in the Trie.

  • For insert operation, iterate through each character in the word and create nodes as needed.

  • For search operation, traverse the Trie based on the characters in the word to check for existence.

  • Return 'TRUE' if the word is ...

A Software Developer Intern was asked
Q. How would you implement undo and redo operations for MS Word?
Ans. 

Implementing undo and redo operations for MS Word

  • Maintain a stack for undo operations and another stack for redo operations

  • Whenever a change is made, push the previous state onto the undo stack

  • When undo is triggered, pop the state from undo stack and push it onto redo stack

  • When redo is triggered, pop the state from redo stack and push it onto undo stack

  • Ensure to update the document state accordingly after each und...

A Software Developer Intern was asked
Q. 

Left View of a Binary Tree

Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.

Input...

Ans. 

Print the left view of a binary tree, containing nodes visible from the left side.

  • Traverse the tree level by level, keeping track of the leftmost node at each level

  • Use a queue for level order traversal and a map to store the leftmost nodes

  • Print the values of leftmost nodes stored in the map as the left view of the tree

A Software Developer Intern was asked
Q. 

Convert Binary Tree to Mirror Tree Problem Statement

Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mirr...

Ans. 

Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.

  • Traverse the binary tree in a recursive manner and swap the left and right children of each non-leaf node.

  • Use a temporary variable to swap the children of each node.

  • Ensure to handle cases where a node may have only one child or no children.

  • Implement the function to convert the given binary tree to its mirror tree ...

Are these interview questions helpful?
A Software Developer Intern was asked
Q. 

Convert Array to Min Heap Task

Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.

A min-binary heap is a complete binary tree where each internal node's val...

Ans. 

Convert the given array into a min-binary heap by following min-heap properties.

  • Iterate through the array and heapify each node starting from the last non-leaf node to the root.

  • For each node, compare it with its children and swap if necessary to maintain min-heap property.

  • Continue this process until the entire array satisfies the min-heap property.

A Software Developer Intern was asked
Q. 

Bipartite Graph Problem Statement

Given an undirected graph of 'V' vertices (labeled 0, 1, ..., V-1) and 'E' edges, the task is to determine whether the graph is bipartite.

Explanation:

A bipartite graph...

Ans. 

The task is to determine whether a given undirected graph is bipartite or not.

  • Create a function to check if the graph can be colored using two colors without any adjacent vertices sharing the same color.

  • Use graph coloring algorithms like BFS or DFS to determine if the graph is bipartite.

  • Check for odd-length cycles in the graph, as a bipartite graph cannot have odd-length cycles.

  • Consider using a boolean array to ke...

A Software Developer Intern was asked
Q. 

Longest Common Subsequence Problem Statement

Given two strings STR1 and STR2, determine the length of their longest common subsequence.

A subsequence is a sequence that can be derived from another sequenc...

Ans. 

The problem involves finding the length of the longest common subsequence between two given strings.

  • Use dynamic programming to solve the problem efficiently.

  • Create a 2D array to store the lengths of common subsequences of substrings.

  • Iterate through the strings to fill the array and find the length of the longest common subsequence.

  • Return the length of the longest common subsequence for each test case.

Dunzo Software Developer Intern Interview Experiences

3 interviews found

I appeared for an interview in Oct 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This was a DS/Algo round.
Timing was 4:00pm-5:00pm IST.
The interviewer was very friendly.
He asked for my introduction.

  • Q1. 

    Asteroid Collision Problem Description

    Given an array/list ASTEROIDS representing asteroids aligned in a row, each element's absolute value identifies the asteroid's size, while its sign indicates the dir...

  • Ans. 

    Determine the state of asteroids after collisions occur.

    • Iterate through the array of asteroids and simulate collisions between adjacent asteroids.

    • Use a stack to keep track of remaining asteroids after collisions.

    • Handle cases where asteroids moving in opposite directions collide and destroy each other.

    • Handle cases where asteroids moving in the same direction do not collide.

  • Answered by AI
  • Q2. 

    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...
  • Ans. 

    The task is to determine if a given string consisting of parentheses is balanced or not.

    • Use a stack data structure to keep track of opening parentheses

    • Iterate through the string and push opening parentheses onto the stack and pop when encountering a closing parenthesis

    • If at the end the stack is empty, the string is balanced, otherwise it is not

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

Timing was 3:00pm-4:00pm IST
Interviewer was friendly
He asked for my introduction. We dry run the code for the question.

  • Q1. 

    Word Break II Problem Statement

    Given a non-empty string 'S' containing no spaces and a dictionary of non-empty strings, generate and return all possible sentences by adding spaces in the string 'S', such...

  • Ans. 

    Given a string and a dictionary, generate all possible sentences by adding spaces between words from the dictionary.

    • Use backtracking to generate all possible sentences by recursively adding words from the dictionary to the current sentence.

    • Check if the current substring of the input string exists in the dictionary, if so, add it to the current sentence and continue recursively.

    • When the entire input string is processed,...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Bharati Vidyapeeth's College of Engineering. Eligibility criteriaNoDunzo interview preparation:Topics to prepare for the interview - Recursion, stack, graph, backtracking, stringTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1: Do not be nervous
Tip 2 : Ask questions from the interviewer if you are confused

Application resume tips for other job seekers

Tip 1 : Mention your coding achievement in the resume
Tip 2 : You should have at least one good project on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before May 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

This round contained two coding questions. I was also asked some basic android development questions as I had mentioned a couple of projects around android.

  • Q1. 

    Convert Binary Tree to Mirror Tree Problem Statement

    Given a binary tree, convert this binary tree into its mirror tree. A binary tree is a tree in which each parent node has at most two children. The mir...

  • Ans. 

    Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.

    • Traverse the binary tree in a recursive manner and swap the left and right children of each non-leaf node.

    • Use a temporary variable to swap the children of each node.

    • Ensure to handle cases where a node may have only one child or no children.

    • Implement the function to convert the given binary tree to its mirror tree in pl...

  • Answered by AI
  • Q2. How would you implement undo and redo operations for MS Word?
  • Ans. 

    Implementing undo and redo operations for MS Word

    • Maintain a stack for undo operations and another stack for redo operations

    • Whenever a change is made, push the previous state onto the undo stack

    • When undo is triggered, pop the state from undo stack and push it onto redo stack

    • When redo is triggered, pop the state from redo stack and push it onto undo stack

    • Ensure to update the document state accordingly after each undo or ...

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

I was asked two coding questions, some questions around OOPs concepts and DBMS.

  • Q1. 

    Left View of a Binary Tree

    Given a binary tree, your task is to print the left view of the tree. The left view of a binary tree contains the nodes visible when the tree is viewed from the left side.

    Inpu...

  • Ans. 

    Print the left view of a binary tree, containing nodes visible from the left side.

    • Traverse the tree level by level, keeping track of the leftmost node at each level

    • Use a queue for level order traversal and a map to store the leftmost nodes

    • Print the values of leftmost nodes stored in the map as the left view of the tree

  • Answered by AI
  • Q2. 

    Trie Data Structure Implementation

    Design and implement a Trie (Prefix Tree) which should support the following two operations:

    1. Insert a word into the Trie. The operation is marked as 'insert(word)'.
    2....
  • Ans. 

    Implement a Trie data structure supporting insert and search operations efficiently.

    • Implement a Trie class with insert and search methods.

    • Use a nested class Node to represent each node in the Trie.

    • For insert operation, iterate through each character in the word and create nodes as needed.

    • For search operation, traverse the Trie based on the characters in the word to check for existence.

    • Return 'TRUE' if the word is found...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from DA-IICT. I applied for the job as SDE - Intern in BangaloreEligibility criteriaNo criteriaDunzo interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Basics of android, OOPs, DBMSTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Focussing on DSA is essential for freshers, most of the companies' interview process will contain DSA questions. 
Tip 2 : Stay stick to the basic concepts and don't feel overwhelmed by the advance concepts, most of the companies' will judge you on your foundation/basics. 

Application resume tips for other job seekers

Tip 1 : Resume should be one pager document which enables user to understand your background. Understand the difference between CV and resume.
Tip 2 : Be as honest as you can on your resume. However, writing that you are a beginner for this particular skill is fine.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview before Nov 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

1. 90 min , can do anytime between a designated 4 hr window
2. was on Hackerrank, and I was familiar with the platform
3. had 3 coding questions

  • Q1. 

    Bipartite Graph Problem Statement

    Given an undirected graph of 'V' vertices (labeled 0, 1, ..., V-1) and 'E' edges, the task is to determine whether the graph is bipartite.

    Explanation:

    A bipartite grap...

  • Ans. 

    The task is to determine whether a given undirected graph is bipartite or not.

    • Create a function to check if the graph can be colored using two colors without any adjacent vertices sharing the same color.

    • Use graph coloring algorithms like BFS or DFS to determine if the graph is bipartite.

    • Check for odd-length cycles in the graph, as a bipartite graph cannot have odd-length cycles.

    • Consider using a boolean array to keep tr...

  • Answered by AI
  • Q2. 

    Longest Common Subsequence Problem Statement

    Given two strings STR1 and STR2, determine the length of their longest common subsequence.

    A subsequence is a sequence that can be derived from another sequen...

  • Ans. 

    The problem involves finding the length of the longest common subsequence between two given strings.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the lengths of common subsequences of substrings.

    • Iterate through the strings to fill the array and find the length of the longest common subsequence.

    • Return the length of the longest common subsequence for each test case.

  • Answered by AI
  • Q3. 

    Convert Array to Min Heap Task

    Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.

    A min-binary heap is a complete binary tree where each internal node's va...

  • Ans. 

    Convert the given array into a min-binary heap by following min-heap properties.

    • Iterate through the array and heapify each node starting from the last non-leaf node to the root.

    • For each node, compare it with its children and swap if necessary to maintain min-heap property.

    • Continue this process until the entire array satisfies the min-heap property.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Hard

With manager 
1. DS/algo
2. Networking
3, basic project stuff
4. Google meet
3. was in the afternoon

  • Q1. 

    Wildcard Pattern Matching Problem Statement

    Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.

    The wildcard pattern may include the...

  • Ans. 

    Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.

    • Create a dynamic programming matrix to store intermediate results

    • Handle cases for '?' and '*' characters separately

    • Check if the characters match or '*' can be used to match any sequence of characters

  • Answered by AI
  • Q2. 

    Left View of a Binary Tree Problem Statement

    Given a binary tree, your task is to print the left view of the tree.

    Example:

    Input:
    The input will be in level order form, with node values separated by a...
  • Ans. 

    Print the left view of a binary tree given in level order form.

    • Traverse the tree level by level and print the first node of each level (leftmost node)

    • Use a queue to keep track of nodes at each level

    • Time complexity should be O(n) where n is the number of nodes in the tree

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from IIT Jammu. I applied for the job as SDE - Intern in BangaloreEligibility criteriaNODunzo interview preparation:Topics to prepare for the interview - DS and Algo , System design , Networking , DBMS , OSTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Interview Preparation is different from competitive coding. One has not to be a master, to ace faang interviews. CP is like solving puzzles. 
Tip 2 : In interview be as descriptive as you can. Try to demonstrate the what you are thinking and the path you took to reach the solution ( whether or not it is correct )
Tip 3 : Try to improve your communication skills ( Trust me it matters a lot )

Application resume tips for other job seekers

Tip 1 : Have a master resume and align it with the company requirements and position you are applying 
Tip 2 : Include the projects that you actually worked on or have the knowledge about it

Final outcome of the interviewSelected

Skills evaluated in this interview

Top trending discussions

View All
Interview Tips & Stories
5d (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about Dunzo?
Ask anonymously on communities.

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
6-8 weeks
Result
No response

I applied via Campus Placement and was interviewed in Jan 2024. There were 4 interview rounds.

Round 1 - Coding Test 

Easy to medium level of leet code

Round 2 - Technical 

(1 Question)

  • Q1. 1. Fibonacci series with recursion and without recursion 2. String Palindrome 3. Count all repeated numbers from the array
  • Ans. 

    Answering questions related to Fibonacci series, string palindrome, and counting repeated numbers in an array.

    • For Fibonacci series with recursion, write a function that calls itself to calculate the next number in the series.

    • For Fibonacci series without recursion, use a loop to calculate the series.

    • For string palindrome, compare characters from start and end of the string.

    • To count all repeated numbers from the array, u...

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. 1.Given an array(0-based indexing), you have to find the max sum of i*A[i] where A[i] is the element at index i in the array. The only operation allowed is to rotate(clock-wise or counter clock-wise) the ...
  • Ans. 

    Rotate array to find max sum of i*A[i]

    • Rotate array to bring maximum element to front

    • Calculate sum of i*A[i] for each rotation

    • Keep track of maximum sum found

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. 1.Oops concepts 2.Oops code 2.About Java Spring 3. Array stack questions 4.Project discussion

Interview Preparation Tips

Interview preparation tips for other job seekers - Solve leet code question, clear concept of DSA.

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Sep 2023. There was 1 interview round.

Round 1 - Coding Test 

3 Questions were asked out of which if you did 2 you were shortlisted for next round. Questions were mostly from topics like array, string and greedy

Interview Preparation Tips

Interview preparation tips for other job seekers - There were 3 rounds after the initial round, 1st round asked 2 questions, one was based on sorting an array in a way that an element would always have it's left element smaller than itself and right element always greater than itself. Second question was a bit lengthy where I was given a linked list question. Next round i was asked 2 questions both based on greedy problems and final round was the interview where they would test your knowledge to the depths. Advanced questions on OOP, System Architecture, Database Management System and Research Work was focused on.
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via LinkedIn and was interviewed in Dec 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. System design, coding and debugging
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I appeared for an interview in May 2025, where I was asked the following questions.

  • Q1. They gave the advanced DSA question based on the matrix
  • Q2. A small self Intro

Interview Preparation Tips

Interview preparation tips for other job seekers - Work smart
Are these interview questions helpful?
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. It was based on dynamic programming

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare DSA very well

I appeared for an interview in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

  • Q1. 

    Lowest Common Ancestor of a Binary Tree III

    The structure of a binary tree has been modified so that each node includes a reference to its parent node.

    Problem Statement

    You are provided with two nodes,...

  • Ans. 

    This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.

    • Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

    • Compare the two lists and find the last common node.

    • Return the last common node as the lowest common ancestor.

  • Answered by AI
  • Q2. 

    Maximum Subarray Problem Statement

    Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.

    A subarray 'A' is considered greater than a...

  • Ans. 

    The problem is to find a subarray with the maximum sum in a given array.

    • Iterate through the array and keep track of the maximum sum and the current sum.

    • If the current sum becomes negative, reset it to 0.

    • Update the maximum sum if the current sum is greater.

    • Also keep track of the start and end indices of the subarray with the maximum sum.

    • Return the subarray using the start and end indices.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

  • Q1. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. 

    The task is to find the next greater element for each element in an array.

    • Iterate through the array from right to left.

    • Use a stack to keep track of the elements that have a greater element to their right.

    • For each element, pop elements from the stack until a greater element is found or the stack is empty.

    • If a greater element is found, it is the next greater element for the current element.

    • If the stack becomes empty, the...

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    The question asks to find the total amount of rainwater that can be trapped in the given elevation map.

    • Iterate through the array and find the maximum height on the left and right side of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

    • Sum up the amount of water trapped at each bar to get the total amo...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BengaluruEligibility criteriawith resumeSwiggy interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Puzzles, Project, Mock Interviews, etcTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well 
Tip 3 : focus on basics

Application resume tips for other job seekers

Tip 1 : Try to make a single-page resume. 
Tip 2 : Don't write unnecessary details like hobbies, family, etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Recruitment Consulltant and was interviewed in Sep 2021. There were 2 interview rounds.

Round 1 - Aptitude Test 

Apti and coding

Round 2 - Technical 

(1 Question)

  • Q1. Questions on java a d sql

Interview Preparation Tips

Interview preparation tips for other job seekers - Bogus interview . Doesnt matter how you give the interview , they will choose some random guy who is not worthy maybe

Tell us how to improve this page.

Interview Questions from Similar Companies

Swiggy Interview Questions
3.7
 • 474 Interviews
Meesho Interview Questions
3.7
 • 368 Interviews
Udaan Interview Questions
3.9
 • 347 Interviews
BlackBuck Interview Questions
3.7
 • 194 Interviews
Tata 1mg Interview Questions
3.6
 • 187 Interviews
Digit Insurance Interview Questions
3.8
 • 158 Interviews
Paisabazaar.com Interview Questions
3.4
 • 154 Interviews
Urban Company Interview Questions
3.4
 • 143 Interviews
Collegedunia Interview Questions
3.0
 • 103 Interviews
Ninjacart Interview Questions
3.9
 • 100 Interviews
View all
Store Manager
109 salaries
unlock blur

₹3.8 L/yr - ₹7 L/yr

Community Operations Specialist
100 salaries
unlock blur

₹2.7 L/yr - ₹4.3 L/yr

Procurement Manager
96 salaries
unlock blur

₹3.5 L/yr - ₹7 L/yr

Inward Executive
93 salaries
unlock blur

₹1.8 L/yr - ₹3.5 L/yr

Delivery Boy
89 salaries
unlock blur

₹0.5 L/yr - ₹4.5 L/yr

Explore more salaries
Compare Dunzo with

Swiggy

3.7
Compare

Zepto

3.5
Compare

Porter

3.8
Compare

Rapido

3.7
Compare
write
Share an Interview