Panda Guru LogoPanda
Guru

Oracle OA SDE Intern

Round 1

Questions: Given an undirected connected graph of g_nodes and M connections, traverse all nodes at least once, and store the order of traversal in A. Now create the lexicographically largest array B which is a permutation of A.

Example:

Test Case 1:

Test Case 2:

MCQs Breakdown:

Others got programming questions based on graphs and binary search on answer.

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.