Dunzo Lead Talent Acquisition Interview Questions and Answers

Round duration - 90 mintues
Round difficulty - Easy

Nice environment everything went good.

Q1. 
Sum of LCM Problem Statement
Given an integer 'N', calculate and print the sum of the least common multiples (LCM) for each integer from 1 to N with N.
The sum is represented as:
LCM(1, N) + LCM(2, N) + ....read more
Ans. 
Calculate and print the sum of least common multiples (LCM) for each integer from 1 to N with N.
• Iterate from 1 to N and calculate LCM of each pair with N

• Sum up all the calculated LCMs to get the final result

• Implement a function to calculate LCM of two numbers
Answered by AI
Add your answer
Q2. 
Vertical Order Traversal Problem Statement
Given a binary tree, return the vertical order traversal of the values of the nodes in the tree.
In a vertical order traversal, for each node at position (X, Y)...read more
Ans. 
Vertical order traversal of binary tree is obtained by running a vertical line from -∞ to +∞ and adding node values in top to bottom order, sorted by decreasing Y coordinates.
• Implement a function to perform vertical order traversal of a binary tree

• Maintain a map to store nodes at each vertical level

• Sort the nodes at each level by their Y coordinates in decreasing order

• Handle cases where two nodes share the same positio
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

It was a tough round focus on the key concepts

Q1. 
Stack with getMin Operation
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...read more
Ans. 
Implement a stack with getMin operation in O(1) time complexity without using extra space.
• Use two stacks - one to store the actual elements and another to store the minimum values encountered so far.

• When pushing an element, check if it is smaller than the current minimum and if so, push it onto the minimum stack.

• When popping an element, check if it is the current minimum and if so, pop from the minimum stack as well.

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