Dunzo Manager SCM Interview Questions and Answers

Q1. What are your strengths and weaknesses?
View 2 more answers
Q2. Why should we hire you?
Add your answer
Q3. Why are you looking for a change?
Add your answer
Q4. Where do you see yourself in 5 years?
Add your answer
Q5. Tell me about yourself.
Add your answer
Q6. Excel formulas and mail body test
Add your answer

How to maintain control spillage

Q1. Details explantion of f&v stages
Ans. 
F&V stages refer to the different stages of fruits and vegetables from harvesting to consumption.
• The first stage is harvesting, where the produce is picked from the plant.

• The second stage is grading, where the produce is sorted based on quality and size.

• The third stage is packaging, where the produce is packed for transportation and storage.

• The fourth stage is transportation, where the produce is transported to the mar...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round had 2 coding problems and we had to code it on hackerearth only.
The use of Outside IDE was forbidden.
The timing of test was 12:00 PM to 1:30 PM.

Q1. 
Meeting Rescheduling Challenge
Ninja is tasked with organizing a meeting in an office that starts at time ‘0’ and ends at time ‘LAST’. There are ‘N’ presentations scheduled with given start and end times....read more
Ans. 
Reschedule at most K presentations to maximize gap without overlap.
• Iterate through presentations and calculate the gaps between them

• Sort presentations by end time and reschedule K presentations to maximize gap

• Return the longest gap achieved
Answered by AI
Add your answer
Q2. 
Total Unique Paths Problem Statement
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...read more
Ans. 
Calculate total unique paths from top-left to bottom-right corner of a matrix by moving only right or down.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the number of unique paths for each cell.

• Initialize the first row and first column with 1 as there is only one way to reach them.

• For each cell, the number of unique paths is the sum of paths from the cell above and the cell to the...read more
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

This round was coding round with discussion .
The interviewer tried to trick the questions and wanted to test how we respond if something is asked out of preparation.
The code we ran on Google Docs was checked on Online IDE if it ran for sample inputs.
Timing : 12:00 PM to 1:30 PM

Q1. 
Minimum Operations to Connect a Graph
You are given a graph with 'N' vertices labeled from 1 to 'N' and 'M' edges. In one operation, you can shift an edge from being between two directly connected vertice...read more
Ans. 
Determine the minimum number of operations to connect a graph by shifting edges between disconnected vertices.
• Use a disjoint set union (DSU) data structure to keep track of connected components.

• Count the number of connected components in the graph.

• The minimum number of operations required is equal to the number of connected components minus 1.
Answered by AI
Add your answer
Q2. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Ans. 
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
• Use Breadth First Search (BFS) algorithm to find the shortest path on the board.

• Create a mapping of each cell to its corresponding row and column on the board.

• Consider the presence of snakes and ladders while calculating the next possible moves.

• Handle the case where the last cell is unreachable by returning -1.

• Optimize ...read more
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Hard

This was a problem solving round and lasted for 75 minutes. The interviewer gave me a very complicated question.
The round was held on Google Meet and I was supposed to tell him the approach and write code on shared Google Docs.

Q1. 
XOR Query Problem Statement
Assume you initially have an empty array called ARR. You are required to return the updated array after executing Q number of queries on this array.
There are two types of que...read more
Ans. 
Implement a function to update an array based on XOR queries.
• Create an empty array to store the elements.

• Iterate through each query and update the array accordingly.

• Use bitwise XOR operation to update the elements.

• Ensure to handle both types of queries - insert and XOR operation.
Answered by AI
Add your answer

Round duration - 90 mintues
Round difficulty - Medium

Goes good no problem at all exam is between 10 to 11:30.

Q1. 
Game of Dominoes Problem Statement
Rafiq loves to play with piles of dominoes, especially when they are of equal heights. His father gifted him 'N' piles of dominoes, each with a positive number of stacke...read more
Ans. 
Calculate minimum cost to make consecutive windows of domino piles equal in height.
• Iterate through each window of size 'K' and calculate the minimum cost to make all piles in that window equal in height.

• Keep track of the running sum of domino heights in each window to minimize cost.

• Return the minimum cost for each window as the output.
Answered by AI
Add your answer
Q2. 
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
Ans. 
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
• Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.

• If the complement exists, add the pair (current element, complement) to the result list.

• Sort the result list based on the first element of each pair, and then based on the second element if the first elements are eq
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Goes good no problem at all exam at same time between 10 to 11:30.

Q1. What problems did you face in your project and how did you deal with them?
Add your answer
Q2. 
Ninja and Sorted Arrays Problem
You are given two sorted integer arrays, ARR1 and ARR2, with sizes M and N, respectively. Merge these arrays into ARR1 as a single sorted array. Assume ARR1 has a size equa...read more
Ans. 
Merge two sorted arrays into one sorted array in place.
• Iterate from the end of both arrays and compare elements, placing the larger element at the end of ARR1

• Continue this process until all elements from ARR2 are merged into ARR1

• Ensure to handle cases where one array is fully merged before the other
Answered by AI
Add your answer