Dunzo SDE-2 Interview Questions, Process, and Tips

Q1. Minimum cost to connect the ropes
Ans. 
The minimum cost to connect the ropes is calculated by repeatedly connecting the two smallest ropes until all ropes are connected.
• Sort the ropes in ascending order.

• Repeatedly connect the two smallest ropes.

• Add the cost of connecting the two ropes to the total cost.

• Continue this process until all ropes are connected.
Answered by AI
Add your answer
Q2. Max value of arr[i]+arr[j]+i-j
Ans. 
The question asks for the maximum value of arr[i]+arr[j]+i-j for given array arr.
• Iterate through all possible pairs of i and j in the array

• Calculate the value of arr[i]+arr[j]+i-j for each pair

• Keep track of the maximum value found
Answered by AI
Add your answer

It was a leetcode medium, related BFS,

Q1. Basic of android like fragment activity communication
Add your answer
Q2. Why ViewModel is necessary, how does it save state
Ans. 
ViewModel is necessary in Android development to save and manage UI-related data during configuration changes.
• ViewModel helps in retaining data during configuration changes like screen rotations

• It separates UI-related data from UI controller (Activity/Fragment)

• ViewModel survives configuration changes and can be shared between fragments

• It helps in maintaining data consistency and prevents memory leaks

• ViewModel is lifecy...read more
Answered by AI
Add your answer

Q1. Map based easy question
Add your answer
Q2. Priority based heap question
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing was around 11 am
Environment was great, it intrigued me to join Blinkit.

Q1. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Timing 11 am
Interviewer had good knowledge

Q1. Can you explain the activity lifecycle in Android development?
Add your answer
Q2. Can you explain the fragment lifecycle in Android development?
Add your answer
Q3. Can you explain the MVVM pattern?
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

This round is cultural fit round

Q1. Data Structures and Algorithms
Add your answer

Q1. Machine Coding round
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

- It was a face to face (virtually) round.
- Two questions one after one and you are expected to pass all the test cases.
- Question was Easy and Medium Easy. (tags: stack, array, bfs, dfs, array)

- Timing: Afternoon
- Interviewer: he was nice, as I was able to solve both question, he was very happy, and given me the feedback.

Q1. 
Remove Consecutive Duplicates from String
Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters and return the newly formed string.
...read more
Ans. 
The task is to remove consecutive duplicate characters from a given string and return the new string.
• Iterate through the characters of the string

• Compare each character with the next character

• If they are the same, skip the next character

• If they are different, append the current character to the new string
Answered by AI
Add your answer
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...read more
Ans. 
The task is to find the number of islands present in a 2-dimensional array filled with ones and zeroes.
• Iterate through each cell in the array

• If the cell is land (1) and not visited, perform a depth-first search to find all connected land cells

• Increment the count of islands for each connected component found
Answered by AI
Add your answer

Round duration - 135 minutes
Round difficulty - Medium

Machine Coding.

Timing: Afternoon
The interviewer was answering my questions nicely.

Round duration - 60 minutes
Round difficulty - Medium

Hiring Manager.
Interviewer: Sr Engineering Manager.
Timing: evening.

The environment was cool.

Round duration - 45 minutes
Round difficulty - Medium

Technical Interview round with questions on DSA.
Tip : Do variants of Binary Search.

Q1. 
Square Root of an Integer Challenge
Given an integer 'A', the objective is to find the largest non-negative integer whose square is less than or equal to 'A'.
The square of a number is defined as the pro...read more
Add your answer
Q2. 
Find Minimum in Rotated Sorted Array
You are presented with a sorted array that has been rotated an unknown number of times. The nature of this rotation is such that each element shifts to the right with ...read more
Add your answer