Dunzo interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Dunzo
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 Months
Topics: DSA, Backend-Development, OOPs, DBMS, SQL
Tip
Tip

Tip 1 : Consistently do DSA, no matter if you are already working. Solve atleast 2-3 Questions every day.
Tip 2 : Have a note also about your work experience, sometimes people forget some countable achievements they've got.

Application process
Where: Referral
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1 : 1 pager resume is preferred.
Tip 2 : Write development experience heavily.

Interview rounds

01
Round
Medium
Video Call
Duration60 Minutes
Interview date10 Oct 2018
Coding problem1

The machine coding round involves solving a design problem in a matter of a couple of hours. It requires designing and coding a clean, modular and extensible solution based on a specific set of requirements.

1. System Design Question

Design an exchange system. There is a list of stocks given with the following attributes –
order_id, time, stock name, type(BUY/SELL), quantity, price.
You need to output a list of stocks in the following format sell_id, buy_id, quantity, and price which will get executed.

02
Round
Medium
Video Call
Duration60 Minutes
Interview date17 Oct 2018
Coding problem2

1. Median in a stream

Hard
50m average time
50% success
0/120
Asked in companies
Disney + HotstarAmazonMakeMyTrip

Given that integers are read from a data stream. Your task is to find the median of the elements read so far.

Median is the middle value in an ordered integer list. If the size of the list is even there is no middle value. So the median is the floor of the average of the two middle values.

For example :
[2,3,4] - median is 3.
[2,3] - median is floor((2+3)/2) = 2.


Problem approach

1st- I applied brute force using sorting.
2nd- Then I used heaps to optimize further.

Try solving now

2. Course Schedule

Easy
15m average time
85% success
0/40
Asked in companies
UberAppleDunzo

You are a student of Netaji Subhas Institute of Technology. You have to take ‘N’ number of courses labelled from 1 to N to complete your B.Tech Degree.

Some courses may have prerequisites, for example, to take course 1 you have to first take course 2, which is expressed as a pair: [1, 2]. Now, your task is to find is it possible for you to finish all courses.

Note: There are no duplicate pairs in the prerequisites array.

For example-
If N = 2 and prerequisite = [[1, 2]]. Then, there are a total of 2 courses you need to take. To take course 1 you need to finish course 2. So, it is possible to complete all courses. 
Problem approach

I directly jumped to the best solution.
Did it Using DFS. I maintained two visited arrays. I explained the approach and wrote the code.

Try solving now
03
Round
Easy
HR Round
Duration50 minutes
Interview date20 Oct 2018
Coding problem1

1. Basic HR questions

In-depth discussion on projects that I am currently doing.

Why a startup? Why Dunzo?

If you want to suggest a new feature for Dunzo, what would it be?

Some behavioral questions.

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Dunzo
4463 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Dunzo
762 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Dunzo
702 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Dunzo
790 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114578 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57824 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34960 views
7 comments
0 upvotes