Dunzo Interview Questions, Process, and Tips

Q1. Where do you see yourself in 5 years?
Add your answer
Q2. What are your salary expectations?
Add your answer
Q3. Tell me about yourself.
Add your answer

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...read more
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...read more
Answered by AI
Add your answer
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...read more
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
Add your answer
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...read more
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
Add your answer

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...read more
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
Add your answer
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...read more
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
Add your answer

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...read more
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
Add your answer
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
Add your answer

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...read more
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
Add your answer
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....read more
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
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Container with Most Water Problem Statement
Given a sequence of 'N' space-separated non-negative integers A[1], A[2], ..., A[i], ..., A[n], where each number in the sequence represents the height of a lin...read more
Ans. 
Find two lines to form a container with maximum water area on a Cartesian plane.
• Iterate through the array from both ends to find the maximum area.

• Calculate the area using the formula: (min(height[left], height[right]) * (right - left)).

• Update the pointers based on the height of the lines to maximize the area.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Q1. 
Anagram Substring Search
Given two strings 'STR' and 'PTR', identify all starting indices of 'PTR' anagram substrings in 'STR'. Two strings are anagrams if one can be rearranged to form the other.
Input:
...read more
Ans. 
Identify starting indices of anagram substrings of 'PTR' in 'STR'.
• Use a sliding window approach to check for anagrams of 'PTR' in 'STR'.

• Create a frequency map of characters in 'PTR' and 'STR' to compare.

• Slide the window along 'STR' and check if the frequency maps match.

• Return the starting indices where anagrams are found.
Answered by AI
Add your answer
Q2. 
Maximum Size Rectangle Binary Sub-Matrix with All 1s
Given a binary-valued matrix of size N x M, your task is to determine the largest area of a submatrix that contains only 1's.
Input:
The first line c...read more
Ans. 
Find the largest area of a submatrix containing only 1's in a binary matrix.
• Iterate over each cell in the matrix and calculate the maximum area of submatrix with all 1's ending at that cell.

• Use dynamic programming to keep track of the maximum area ending at each cell.

• Update the maximum area as you iterate through the matrix.

• Return the overall maximum area found in the matrix.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Number of Subsequences with Even and Odd Sum
Your task is to determine the number of subsequences with odd sums and the number of subsequences with even sums from a given array of positive integers. As res...read more
Ans. 
Count the number of subsequences with odd and even sums in a given array of positive integers modulo 10^9 + 7.
• Use dynamic programming to keep track of the count of subsequences with odd and even sums.

• Consider the parity of each element in the array to determine the count of subsequences with odd and even sums.

• Apply modulo 10^9 + 7 to handle large resulting numbers.

• Example: For input [1, 2, 3], there are 3 subsequences
Answered by AI
Add your answer
Q2. 
Minimum Cost to Reduce Array Problem Statement
You are given an array ARR containing N positive integers. Your task is to reduce the size of this array to 1 by repetitively merging adjacent elements. Each...read more
Ans. 
Find the minimum cost to reduce an array to a single element by merging adjacent elements with their sum.
• Iteratively merge adjacent elements to minimize total cost

• Choose pairs to merge strategically to reduce cost

• Calculate sum of adjacent elements and update array size
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Next Greater Element Problem Statement
You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...read more
Ans. 
The task is to find the next greater element for each element in an array to its right, if no greater element exists return -1.
• Use a stack to keep track of elements for which the next greater element is not found yet.

• Iterate through the array from right to left, popping elements from the stack until a greater element is found.

• Store the next greater element for each element in a separate array.
Answered by AI
Add your answer