the next quetsion was supposed you have been given some dbms queries like 1000 queries now if you fetch 100 queries each time it takes 11 attempts as in the last attempt(11th) you will come to know that you do not have any query remaining. So now you are supposed to modify this process such that you do not have to use one additional query.
Tree / Graph questions, each one build on the previous
add two number in array,
They asked probably a medium level leetcode.
What are the 3 ways to print a binary search tree
The first one was mostly based on my resume, and for the second one, I was asked a question that involved graph traversal.
What do you do when you feel stuck with a problem?
Have you ever had to give up?
Q: Give an example where a linked list will work better than a binary search tree
Tell me about yourself and what have you learnt throughout your studies
Viewing 1981 - 1990 interview questions