The DS round had two questions one was a modification of insertion sort and another was on heaps. The resume based round went into the depths of development and I was asked questions on JS Promises and Asynchronous Programming. Also dived a bit into cryptography.
Tell us about this project
Discussion about approaches to all questions in test.
Create doubly linked list from scratch.
Tree, Queues, SQL , OS, DBMS
The interview was simple. They asked me to discuss questions they asked on my online application, which consisted of 30 mins and asked me what is dynamic programming and what is recursion.
DSA, got asked stack questions but heard there was a lot of trees, tries, graphs, arrays, BFS, DFS. PROCESS was OA -> One round interview -> Offer. Overall super positive experience and interviewer was also really nice Stack question was what they asked me, but I heard a lot of people got trees/arrays
There was no unexpected question as such. One of them involved searching in a matrix sorted row wise. The other one involved finding the exponent of a number in an efficient manner. I figured the exponentiation by squaring method and wrote the pseudo code for that which was correct. All in all, nothing unexpected and the questions can be answered with a little bit of practice.
I was given a tree with arbitrary no. of children.The leaves of the tree fell out at every level (leaf nodes) .we had to store the nodes that fell off at every level until we reach root node that also falls off
Algorithm Problem Solving at the end.
Viewing 831 - 840 interview questions