LoanUnbox.com Interview Experience

I want to share my LoanUnbox.com interview experience to support aspiring ones.
Complete rounds – 6 (2 Professional on-site telephone + 2 Professional on-site + 1 CIO + 1 HR)
Duration: Spanned for 10 days

ROUND 1:
Q1 – Have an appropriate algorithm to figure out if the value of each node is equal to the sum of the left + right node.
My Ans – Almost Postorder
Q2 – Send a suitable DS to get a minimum of My Ans – Min-Heap & something else (doesn’t remember) Q3 – Best DS to store and manipulate huge numbers My Ans – Related List

ROUND 2:
Q1 – Given a million strings, get a count of input string anagrams among the millions for the input string. O(1) solution required My Ans – Changed Trie + Back Pointer Q2 – Efficient Algo to find the second shortest path in a graph given edges part of the shortest path My Ans – Nice to do with removing edge by edge from Shortest, find best second quickest so far.

ROUND 3:
went tough
Q1 – Efficient Algo for Tower of Hanoi, Trace function, Time complexity derivation As a build-up to this, given more than one auxiliary rod how you can adjust the algorithm for better results and drive/prove it My Ans – Use DP to derive the new Time Complexity

ROUND 4:
Q1 – Effective working code for crossing tree level by level and for printing odd levels from left to right, even from right to left.
My Response – Two stacks use for easy level traversal.
Q2 – Efficient code for finding an element, given a sorted rotated array.
My Ans-Sime Binary Search + Special Reports

ROUND 5 and 6:
Typical HR, Why LoanUnbox? Usual ones Of all the issues, I got all right except the Hanoi Tower (had stuck).

GeeksForGeeks thanks a lot! your question set helped me a lot, in fact, some of them are straight away the same.