Given a binary tree, each node has a null "next node" , which points to the next node in the same level (left to right). Update the given tree so that each node has a value in their "next" field. Level 2/Bonus: do it in O(1) time, using iteration instead of recursion.
No questions about coding. Only understanding the issue of a problem.
Reverse a linked list
Initially asked me how I would delegate tasks to a server for fair load balancing. Then I had to implement said method as a c++ class (using templates).
Question regarding System Design was asked and a question on Backtracking ( N - Queens Problem)
What Is the Trie ?
Asked 2 DSA question, 1st word search on leetcode hard difficulty, 2nd was 01 matrix medium difficulty, get deep into code, coded for different scenarios of Optimization as asked, gone through projects got the live demo of them
Tell us a challenge you faced in your current job
Describe the cloud to 6 years old?
They mainly asked about my previous experience and life choices.
Viewing 3301 - 3310 interview questions