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 Interview Questions and Answers

Updated 24 May 2022

Dunzo Software Developer Interview Experiences

1 interview found

I appeared for an interview in Jan 2022.

Round 1 - Video Call 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

It was strictly a DSA round where 2 coding problems asked from me.

  • Q1. 

    Distance To Nearest 1 in a Binary Matrix Problem

    Given a binary matrix MAT containing only 0s and 1s of size N x M, find the distance of the nearest cell containing 1 for each cell in the matrix.

    The dis...

  • Ans. 

    Given a binary matrix, find the distance of the nearest cell having 1 in the matrix for each cell.

    • Use BFS to traverse the matrix and find the nearest cell having 1 for each cell.

    • Initialize the output matrix with maximum possible distance.

    • If the current cell has 1, distance is 0, else update distance based on the nearest cell having 1.

  • Answered by AI
  • Q2. 

    Arithmetic Subarrays Problem Statement

    You are provided with an array A of length N. Your task is to determine the number of arithmetic subarrays present within the array A.

    Explanation:

    An arithmetic s...

  • Ans. 

    Count the number of arithmetic subarrays in an array.

    • An arithmetic subarray has 3 or more elements with the same difference between consecutive elements.

    • Loop through the array and check for all possible subarrays with 3 or more elements.

    • If the difference between consecutive elements is the same, increment the count.

    • Return the count for each test case.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

Again it was a DSA round.

  • Q1. 

    Maximum Coins Collection Problem

    Imagine a two-dimensional grid with 'N' rows and 'M' columns, where each cell contains a certain number of coins. Alice and Bob want to maximize the total number of coins ...

  • Ans. 

    Given a matrix of coins, Alice and Bob have to collect maximum coins with certain conditions.

    • Alice starts from top left corner and Bob starts from top right corner

    • They can move to (i+1, j+1) or (i+1, j-1) or (i+1, j)

    • They have to collect all the coins that are present at a cell

    • If Alice has already collected coins of a cell, then Bob gets no coins if goes through that cell again

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNoDunzo interview preparation:Topics to prepare for the interview - Data Structures like Trees, Linked Lists, Binary Search, DP, Graphs,OOPS, OS, DBMSTime required to prepare for the interview - 3 MonthsInterview preparation tips for other job seekers

Tip 1 : Read last year interview experiences of the company you apply for.
Tip 2 : In the last 2-3 days before your interview, just revise your concepts and problems.

Application resume tips for other job seekers

Tip 1 : Keep it simple and clean. Don't make it flashy. 
Tip 2 : Highlight your experiences and projects.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview questions from similar companies

I appeared for an interview before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 150 Minutes
Round difficulty - Medium

3 coding questions and 20 mcq's

  • Q1. 

    Maximum Sum of Two Non-Overlapping Subarrays

    Given an integer array ARR and a positive integer K, your task is to determine two non-overlapping subarrays of length K that yield the maximum combined sum.

    ...

  • Ans. 

    The task is to find two non-overlapping subarrays of length K in an array, such that their sum is maximum.

    • Iterate through the array and calculate the sum of each subarray of length K

    • Store the maximum sum obtained from the first subarray

    • Iterate again and calculate the sum of each subarray of length K, excluding the previous subarray

    • Store the maximum sum obtained from the second subarray

    • Return the sum of the two maximum

  • Answered by AI
  • Q2. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    The task is to find the count of distinct subsequences in a given string.

    • Use dynamic programming to solve the problem.

    • Create a 2D array to store the count of distinct subsequences for each prefix of the string.

    • Initialize the first row of the array with 1, as there is only one subsequence of an empty string.

    • For each character in the string, calculate the count of distinct subsequences by considering two cases: including...

  • Answered by AI
  • Q3. 

    Array Intersection Problem Statement

    Given two integer arrays/ lists ARR1 and ARR2 of sizes N and M respectively, you are required to determine their intersection. An intersection is defined as the set of...

  • Ans. 

    The task is to find the intersection of two integer arrays/lists.

    • Read the number of test cases

    • For each test case, read the size and elements of the first array/list

    • Read the size and elements of the second array/list

    • Find the intersection of the two arrays/lists

    • Print the intersection elements in the order they appear in the first array/list

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

Online video call based round, Timing was 10-11 AM
Interview started with basic greetings, post that i explained by projects in brief and then we jumped right into dsa questoins.

  • Q1. 

    Number of Islands Problem Statement

    You are given a non-empty grid that consists of only 0s and 1s. Your task is to determine the number of islands in this grid.

    An island is defined as a group of 1s (re...

  • Ans. 

    The task is to find the number of islands in a grid consisting of 0s and 1s.

    • An island is a group of 1s connected horizontally, vertically, or diagonally

    • The grid is surrounded by 0s on all four edges

    • Use a depth-first search (DFS) or breadth-first search (BFS) algorithm to traverse the grid and count the number of islands

    • Initialize a visited array to keep track of visited cells

    • For each unvisited cell with a value of 1, p...

  • Answered by AI
  • Q2. 

    Arrangement Problem Statement

    Determine the number of permutations of list A = [1, 2, ..., N] such that for every index i, either A[i] is divisible by i or i is divisible by A[i].

    Input:

    The input start...
  • Ans. 

    The goal is to find the number of permutations of a list satisfying certain conditions.

    • Iterate through all permutations of the list

    • Check if each permutation satisfies the given conditions

    • Count the number of permutations that satisfy the conditions

    • Return the count for each test case

  • Answered by AI
  • Q3. 

    Idempotent Matrix Verification

    Determine if a given N * N matrix is an idempotent matrix. A matrix is considered idempotent if it satisfies the following condition:

    M * M = M

    Input:

    The first line cont...
  • Ans. 

    An idempotent matrix is a square matrix that remains unchanged when multiplied by itself.

    • Check if the given matrix satisfies the property M*M = M

    • Iterate through each element of the matrix and perform the matrix multiplication

    • Compare the result with the original matrix

    • If they are equal, return true; otherwise, return false

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 120 Minutes
Round difficulty - Easy

This was EM round, started with me explaining my projects in deep and facing some counter questions on that, proceeded to os, dbms basic questions and some low level designing and lastly a puzzle to end interview.

  • Q1. Can you design an attendance management system?
  • Ans. 

    Design attendance management system

    • Create a database to store employee information

    • Implement a user interface for employees to mark their attendance

    • Develop a system to track and record attendance data

    • Generate reports and analytics based on attendance data

  • Answered by AI
Round 4 - HR 

Round duration - 20 Minutes
Round difficulty - Easy

This was formality round, HR came and explained what meesho does and told my joining dates and compensation details.

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNo criteriaMeesho interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, DBMS, Dynamic Programming, Low level designTime required to prepare for the interview - 5 MonthsInterview preparation tips for other job seekers

Tip 1 : Do medium level queustions
Tip 2 : Learn basic system design for startup interviews.

Application resume tips for other job seekers

Tip 1 : Put things on your resume that you know by your heart, otherwise will have a lot of difficulty in the HM round.
Tip 2 : Do not mention co-curricular activities on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

I applied via Campus Placement and was interviewed in Jul 2023. There were 3 interview rounds.

Round 1 - Coding Test 

3 Moderate questions were asked. I managed to solve 2 completely and 1 partially.

Round 2 - Technical 

(2 Questions)

  • Q1. Question related to system design were asked.
  • Q2. He asked me to design some functions of facebook.
Round 3 - HR 

(1 Question)

  • Q1. Introduction type questions were asked. In this it will prefer only CS students
Interview experience
4
Good
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Basic coding only not to worry much

Round 2 - One-on-one 

(2 Questions)

  • Q1. Tell me about ur self
  • Ans. 

    I am a passionate software developer with experience in Java, Python, and web development.

    • Experienced in Java, Python, and web development technologies

    • Strong problem-solving skills

    • Excellent team player with good communication skills

  • Answered by AI
  • Q2. What is ur projects
  • Ans. 

    I have worked on various projects including a web-based inventory management system and a mobile app for tracking fitness goals.

    • Developed a web-based inventory management system using React and Node.js

    • Created a mobile app for tracking fitness goals using Flutter

    • Implemented RESTful APIs for communication between frontend and backend systems

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - all the best do well!
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Sorting of an array and aptitude

Round 2 - Technical 

(1 Question)

  • Q1. BFS graph traversal
Round 3 - Technical 

(1 Question)

  • Q1. Binary tree question

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 minutes
Round difficulty - Medium

The test was conducted in the evening from 5:00 pm to 6:30 pm. Because of the covid situation, all the students attempted the test from their homes. But it was a webcam-based test to avoid any kind of cheating.
There were 3 coding problems to be done in 90 minutes.
After resume based shortlisting, 70 candidates were selected to appear for the test out of which 30 were shortlisted for interviews.

  • Q1. 

    Amazing Strings Problem Statement

    Determine if the third string contains all the characters from both the first and second strings in any order. If so, return "YES"; otherwise, return "NO".

    Input:

    Line ...
  • Ans. 

    Check if the third string contains all characters from the first and second strings in any order.

    • Create a frequency map for characters in the first and second strings.

    • Check if all characters in the third string are present in the frequency map.

    • Ensure the count of characters in the third string matches the count in the frequency map.

    • Return 'YES' if all conditions are met, otherwise return 'NO'.

  • Answered by AI
  • Q2. 

    Shortest Path Visiting All Nodes

    You are given a connected undirected unweighted graph comprising 'N' nodes and 'M' edges. In this graph, each pair of connected nodes is linked by exactly one undirected e...

  • Ans. 

    Find the length of the shortest path visiting all nodes in a connected undirected unweighted graph.

    • Use Breadth First Search (BFS) to find the shortest path that visits all nodes at least once.

    • Maintain a bitmask to keep track of visited nodes and their states.

    • Consider all possible permutations of nodes to find the shortest path length.

  • Answered by AI
  • Q3. 

    Meeting Rooms Allocation Problem Statement

    Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...

  • Ans. 

    Determine the minimum number of conference rooms required for scheduling meetings.

    • Sort the meetings by start time.

    • Iterate through the meetings and keep track of rooms needed based on overlapping times.

    • Use a priority queue to efficiently allocate rooms.

    • Example: For meetings (1pm-4pm), (3pm-5pm), (4pm-6pm), 2 rooms are required.

    • Ensure linear time complexity by optimizing the room allocation process.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Medium

This round started at 9 am and went till 4 pm.
Out of 70 students that appeared in online coding test, 30 were shortlisted for the first round (this round) of interviews.
In this round, everyone was asked one moderate level coding question. The interviewer provided the link to an IDE, where I wrote my code.
The interview started with the introduction being followed by 1 coding problem. In the end, the interviewer asked me if I wanted to ask any questions. To which I asked him my feedback so that I can improve my wear areas.
Of the 30 candidates, 17 were selected for the final interview round.

  • Q1. 

    Print All Subsets Challenge

    Given an array arr containing 'N' distinct integers, your task is to generate all possible non-empty subsets of this array.

    Note: While the elements within each subset should ...

  • Ans. 

    Generate all possible non-empty subsets of an array of distinct integers.

    • Use recursion to generate all subsets by including or excluding each element in the array.

    • Maintain a current subset and add it to the result when reaching the end of the array.

    • Ensure elements within each subset are in increasing order.

    • Handle the input and output format as specified in the question.

  • Answered by AI
Round 3 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Easy

This was a technical + HR round. Started in the evening at 4:30 pm, this round went till 9:30 pm.
17 students were shortlisted for this final round of interview.
This interview was also virtual and involved both technical and HR-related questions. The interview started with an introduction and then questions based on my resume were asked.
Out of 17 candidates, 8 candidates got a full-time offer from Urban Company.

  • Q1. 

    Find Row With Maximum 1's in a Sorted 2D Matrix

    You are provided with a 2D matrix containing only the integers 0 or 1. The matrix has dimensions N x M, and each row is sorted in non-decreasing order. Your...

  • Ans. 

    Find the row with the maximum number of 1's in a sorted 2D matrix.

    • Iterate through each row of the matrix and count the number of 1's in each row.

    • Keep track of the row index with the maximum number of 1's seen so far.

    • Return the index of the row with the maximum number of 1's.

    • If multiple rows have the same number of 1's, return the row with the smallest index.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPA and more than 70% in 10th and 12thUrban Clap interview preparation:Topics to prepare for the interview - Object-Oriented Programming, Data Structures, Dynamic Programming, Operating System, Database Management System, System DesignTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Coding Problems are asked from DSA, so a good practice of standard problems is a must. Revisit these problems before the interview to ace and crack the interview.
Tip 2 : To tackle the conceptual questions, you need to have thorough knowledge about the concepts, so to prepare for OS and DBMS, read one standard book.
Tip 3 : Have proper and clear knowledge about your project. Basic but tricky questions are asked based on the internship experience and the projects you have done.

Application resume tips for other job seekers

Tip 1 : The best way to ace an interview is to take command of your interview in your hands. And this is done by having a balanced resume. Projects give direction to the interview and increase the probability of selection. So add at least 2 projects.
Tip 2 : Urban Company seeks team players and not just good coders. So add your achievements outside the academics to get shortlisted.

Final outcome of the interviewRejected

Skills evaluated in this interview

I appeared for an interview in Oct 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 75 minutes
Round difficulty - Medium

The test had 3 questions which had to solved in 75 minutes.The test was of medium difficulty.

  • Q1. 

    Meeting Rooms Allocation Problem Statement

    Stark Industry is planning to organize meetings for various departments in preparation for Stark Expo. Due to limited rooms in Stark Tower, the goal is to alloca...

  • Ans. 

    Determine the minimum number of conference rooms needed to schedule meetings without overlap.

    • Sort the meetings by start time.

    • Iterate through the meetings and keep track of the rooms in use.

    • If a meeting starts after another ends, it can reuse the same room.

    • If a meeting starts before another ends, a new room is needed.

    • Return the maximum number of rooms in use at any point.

  • Answered by AI
  • Q2. 

    Maximize XOR Value

    You are provided with an integer X and are tasked with identifying an integer Y such that the bitwise XOR operation between X and Y yields the maximum possible value. The condition is t...

  • Ans. 

    Find an integer Y such that XOR operation with X yields maximum value within given constraints.

    • Iterate from the most significant bit to find the highest bit that can be toggled to maximize XOR value.

    • To maximize XOR value, toggle the highest bit of X to 0 and all lower bits to 1.

    • Ensure the final Y does not exceed (2^61) - 1.

    • Example: For X = 3, the highest bit to toggle is at position 61, so Y = 2305843009213693950.

    • Examp...

  • Answered by AI
  • Q3. 

    Minimize Maximum Difference Between Adjacent Elements

    You are provided with a non-decreasing array and an integer K. Your task is to remove exactly K elements from this array so that the maximum differenc...

  • Ans. 

    Remove K elements from a non-decreasing array to minimize the maximum difference between adjacent elements.

    • Sort the array in non-decreasing order.

    • Iterate through the array and calculate the difference between adjacent elements.

    • Remove elements to minimize the maximum difference.

    • Return the minimized maximum difference.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interview was taken by SDE2 and she was very friendly. All the questions asked were related to DS and algo. The first 10 minutes were used for introductions and the last 5 minutes were reserved for any questions that I have. Always try to ask meaningful questions at the end of the interview.

  • Q1. 

    Frequency in a Sorted Array Problem Statement

    Given a sorted array ARR and a number X, your task is to determine the count of occurrences of X within ARR.

    Note:

    • If X is not found in the array, return...
  • Ans. 

    Count occurrences of a number in a sorted array efficiently.

    • Use binary search to find the first and last occurrence of the target number in the array.

    • Calculate the count of occurrences by subtracting the indices of the last and first occurrences.

    • Handle cases where the target number is not found in the array.

    • Time complexity: O(log(N)), Space complexity: O(1).

  • Answered by AI
  • Q2. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases such as no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process neighboring oranges

  • Answered by AI
  • Q3. 

    Clone Linked List with Random Pointer Problem Statement

    Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...

  • Ans. 

    Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.

    • Use a hashmap to store the mapping between original nodes and cloned nodes.

    • Iterate through the original linked list to create the cloned linked list by mapping the random pointers using the hashmap.

    • Time complexity of this approach is O(N) where N is the number of nodes in the linked list.

  • Answered by AI
Round 3 - Video Call 

Round duration - 60 minutes
Round difficulty - Medium

The focus of this round was mainly on my projects and internships. It was taken by a Senior SDE and it more of a technical interaction. I was asked in-depth about my projects and most of the questions asked around OS/DBMS were based on my projects.
The interviewer wanted to judge whether I have core knowledge about subjects like OS and DBMS and also about the projects that I had done.

Round 4 - HR 

Round duration - 60 minutes
Round difficulty - Easy

It was the culture fit round taken by the Director of Engineering.

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Delhi Technological University. I applied for the job as SDE - 1 in GurgaonEligibility criteriaNoneUrban Clap interview preparation:Topics to prepare for the interview - Data Structures, OOPS, Dynamic programming, Algorithms, DBMS, OSTime required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : Learn the concepts, not the solutions.
Tip 2 : You should have deep knowledge about the projects mentioned in your resume.

Application resume tips for other job seekers

Tip 1 : Resume should be only 1 page.
Tip 2 : Try to tell a story through your resume. For eg - always mention the impact or scale of your projects/internship.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

Majorily on SQL and Databases

Round 2 - Technical 

(2 Questions)

  • Q1. Align two images in a page with same width and same height
  • Ans. 

    Use CSS to align two images with same width and height on a page

    • Set both images to have the same width and height using CSS

    • Use flexbox or grid layout to align the images horizontally or vertically

    • Adjust margins or padding to fine-tune the alignment

  • Answered by AI
  • Q2. Array related question
Round 3 - HR 

(2 Questions)

  • Q1. Situation based question
  • Q2. Majorily focused on project

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Technical 

(2 Questions)

  • Q1. Coding questions medium level
  • Q2. Coding questions hard
Round 2 - Technical 

(2 Questions)

  • Q1. Coding questions
  • Q2. Questions related to oops, operating system,DBMS , SQL
Round 3 - HR 

(2 Questions)

  • Q1. General questions about zepto
  • Q2. Questions related to resume
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via Referral and was interviewed in Mar 2024. There were 3 interview rounds.

Round 1 - Coding Test 

There were 2 questions.
1. Knapsack
2. Median in an array

Round 2 - One-on-one 

(1 Question)

  • Q1. LLD(machine coding) of Google meet
Round 3 - One-on-one 

(1 Question)

  • Q1. In depth discussion on my projects and resume

Tell us how to improve this page.

Dunzo Software Developer Salary
based on 8 salaries
₹17 L/yr - ₹37 L/yr
173% more than the average Software Developer Salary in India
View more details

Dunzo Software Developer Reviews and Ratings

based on 5 reviews

3.1/5

Rating in categories

2.7

Skill development

3.1

Work-life balance

3.4

Salary

1.3

Job security

2.2

Company culture

2.9

Promotions

2.9

Work satisfaction

Explore 5 Reviews and Ratings
Community Operations Specialist
116 salaries
unlock blur

₹2.6 L/yr - ₹4.3 L/yr

Key Account Manager
106 salaries
unlock blur

₹4 L/yr - ₹12 L/yr

Store Manager
104 salaries
unlock blur

₹3.8 L/yr - ₹7 L/yr

Procurement Manager
104 salaries
unlock blur

₹3.5 L/yr - ₹7 L/yr

Delivery Boy
91 salaries
unlock blur

₹0.5 L/yr - ₹4.5 L/yr

Explore more salaries
Compare Dunzo with

Swiggy

3.8
Compare

Zepto

3.5
Compare

Porter

3.9
Compare

Rapido

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