Technical Intern Interview Questions

1,087 technical intern interview questions shared by candidates

Part 1: A rooted n-ary tree is given with n vertices each having a value. A value k is given. Find the vertex closest to the root having value greater than k. Part 2: Optimize the above solution for multiple queries of k.
avatar

Member of Technical Staff - Intern

Interviewed at Nutanix

3.8
Nov 6, 2020

Part 1: A rooted n-ary tree is given with n vertices each having a value. A value k is given. Find the vertex closest to the root having value greater than k. Part 2: Optimize the above solution for multiple queries of k.

Viewing 631 - 640 interview questions

Glassdoor has 1,087 interview questions and reports from Technical intern interviews. Prepare for your interview. Get hired. Love your job.