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

SDE - 1

Dunzo
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I was not good at coding at the start of my career, but I practised a lot of questions from Code Studio. This helped me excel in my career and perform well in coding exams.
Application story
This company visited our campus to hire for the FTE. From there, I have applied for this job opportunity.
Why selected/rejected for the role?
I was rejected because I was not able to give a proper explanation for the questions which are asked.
Preparation
Duration: 4 months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip
Tip

Tip 1: Practice 5 problems daily from coding platforms.

Tip 2: Participate in coding contests.

Tip 3: Attend mock interviews and develop good communication skills.

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

Tip 1: Maintain at least 2 different projects and write a powerful summary statement.

Tip 2: List skills relevant to the job description and include relevant experience.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date30 Dec 2022
Coding problem2

1. Number of Islands

Moderate
34m average time
60% success
0/80
Asked in companies
MicrosoftAmazonUber

You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.

A cell is said to be connected to another cell, if one cell lies immediately next to the other cell, in any of the eight directions (two vertical, two horizontal, and four diagonals).

A group of connected cells having value 1 is called an island. Your task is to find the number of such islands present in the matrix.

Problem approach

I used DFS to find the number of distinct components.

Try solving now

2. Add First and Second Half

Moderate
35m average time
65% success
0/80
Asked in companies
DunzoAmazonMicrosoft

You are given a Singly Linked List of N nodes such that each node represents a single digit.

Your task is to return a node 'X', where 'X' represents the head of the Linked List storing the digits of the sum(most significant digit at the head) formed by adding the 1st half and 2nd half of the given Linked List.

Note:

1. When N is odd consider the middle element to be part of 1st half.

2. The sum should not contain any leading zero, except the number 0 itself.
For Example:
Given Linked List: 1-2-3-4-5-5-6

First half: 1-2-3-4    
Second half: 5-5-6

Output Linked List: 1-7-9-0 = (1234 + 556 = 1790)

Follow Up:

Can you add both halves without finding the length of Linked List and in O(1) space?
Try solving now
02
Round
Easy
Video Call
Duration45 minutes
Interview date30 Dec 2022
Coding problem2

1. Next Greater Element

Easy
10m average time
90% success
0/40
Asked in companies
IBMInfo Edge India (Naukri.com)Amazon

You are given an array 'a' of size 'n'.



The Next Greater Element for an element 'x' is the first element on the right side of 'x' in the array, which is greater than 'x'.


If no greater elements exist to the right of 'x', consider the next greater element as -1.


For example:
Input: 'a' = [7, 12, 1, 20]

Output: NGE = [12, 20, 20, -1]

Explanation: For the given array,

- The next greater element for 7 is 12.

- The next greater element for 12 is 20. 

- The next greater element for 1 is 20. 

- There is no greater element for 20 on the right side. So we consider NGE as -1.
Problem approach

Solved using stack.

Try solving now

2. Word Break

Moderate
15m average time
85% success
0/80
Asked in companies
IntuitExpedia GroupWalmart

You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.

Note :
You can use any string of A multiple times.
Examples :
A =[“coding”, ”ninjas”, “is”, “awesome”]  target = “codingninjas”
Ans = true as we use “coding” and “ninjas” to form “codingninjas”
Problem approach

Paraphrasing the solution in my words

Let's take an example. s="catsand" and wordDict = ["cat", "cats", "and", "sand"].

The solution starts by taking the string S( "catsand") initially finding whether a whole string is present or not. In this case it is not present in the dict.

Now breaking the string and then finding
s.substr( i) gives the substring from the ith index till the end. so string word goes as

atsand // not present
tsand // not present

sand //present then the remainder is calculated which is a cat in this case and a recursive function is called and the same thing is done with a cat which will return the cat and also store the result in the unordered map. Now comes the combine part where both the strings are combined and pushed in the result " cat sand".

and // then comes and which is present so now again wordbreak called on remainder which is cats now and this will return cats. Now both strings are combined and inserted into the result. result = {. "cat sand", "cats and"}; Now after the loop ends the result is returned and also stored in the map.

Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date30 Dec 2022
Coding problem1

1. Basic HR Questions

  1. Tell me about yourself.
  2. Give me an example of your creativity.
  3. How long would you expect to work for us if hired?
  4. Are you not overqualified for this position?
  5. Describe your ideal company, location, and job.

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
763 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Dunzo
856 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Dunzo
702 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
114579 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
57825 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
34961 views
7 comments
0 upvotes