Message on Whatsapp 8879355057 for DSA(OA + Interview) + Fullstack Dev Training + 1-1 Personalized Mentoring to get 10+LPA Job
0 like 0 dislike
1,087 views
in Online Assessments by Expert (34,270 points) | 1,087 views

1 Answer

0 like 0 dislike

Section-1:-
Q1. Given an array rotate the array to the left so the minimum element come at the 0th index. Print the rotated array. Simple variaton of Rotate the array by k position .

 

Q2. Given a genric tree, you need to return the max depth of the tree. The input was as follows:-
N (integer) next N-1 lines shows the edge between two nodes. So we need to build the adjacency matrix. Simple dfs problem.

by Expert (34,270 points)