Technical round 1:
1 I was asked to implement L.R.U.(least recently used cache) using any DS i want
2 Build a Binary Tree using inorder and preorder
Technical round 2:
1-Quick sort
2-Questions about DBMS and DS to make it more efficient
3-Find minimum and maximum number in an array with minimum number of if statements.
4-Discussion about c++
They didn’t conducted more technical rounds.