Naukri Order Management Specialist Interview Questions and Answers

Q1. Tell me about yourself
Add your answer
Q2. Why you want to join us
Add your answer

Q1. Face to face ggggggggggg
Add your answer
Q2. BA from MDU rohtak hhhjh
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

This round consist of two questions and we have to solve both the questions to qualify for the next round.

Round duration - 40 minutes
Round difficulty - Easy

A single coding question was asked that had a lot of corner cases.

Round duration - 45 minutes
Round difficulty - Easy

It had 3 coding questions followed by basic concepts of DP.

Q1. How do you find the maximum difference between a node and its descendant in the same path in a binary tree?
Ans. 
To find the maximum difference between a node and its descendant in the same path in a binary tree, we can perform a depth-first search while keeping track of the minimum value encountered so far.
• Perform a depth-first search on the binary tree, keeping track of the minimum value encountered so far in the path.

• At each node, calculate the difference between the current node value and the minimum value encountered so far ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It had 2 coding questions which were of good level.

Q1. How can you find a Minimum Spanning Tree (MST) from a given graph using Kruskal’s algorithm?
Ans. 
Kruskal's algorithm finds MST by sorting edges, adding smallest edge that doesn't create a cycle, repeat until all vertices are connected.
• Sort all edges in non-decreasing order of their weights.

• Initialize an empty graph to store the MST.

• Iterate through sorted edges and add the smallest edge that doesn't create a cycle in the MST.

• Repeat until all vertices are connected in the MST.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This was the last round.