Technical Interview Round 1:

Interviewer started off by giving a small introduction of himself and he asked me to introduce myself. In this round the interviewer asked me 2 coding problems based on data structures and algorithms.
First problem was that – we have a binary tree and we need to print the binary tree in vertical order (Vertical Order Traversal). I told him the optimized approach and also discussed space and time complexities , then he asked me to write code in ‘amazon code live’.
After this he asked me another problem – we are given N petrol pumps on a circle and at each petrol pump, distance from that petrol pump to the next petrol pump and amount of petrol at that petrol pump is given . We need to tell the first circular tour that visits all petrol pumps without losing petrol in between two petrol pumps. I explained both brute force and optimized O(N) approach and then he asked me to code optimized approach again in ‘amazon code live’.

Technical Interview Round 2:

Interview started with my introduction. And in this round also the interviewer asked me 2 coding problems. Both problems were of Dynamic Programming (DP).
First question was that – we have a N-ary tree and and we need to print kth ancestor of all nodes of binary tree .I started discussion with brute force and for further optimization I discussed Binary Lifting Technique (DP approach) to find kth ancestor and time & space complexities . After that I coded it.
Second problem was that – we are given K dice and we need to tell no. of ways to get N (sum of all dice output). I discussed DP approach (optimized ) and then he asked me to code for both DP methods – Top-down and Bottom-up .