Byju’s Interview Experience

Coding round: Base62 String question and a minimum number of jumps.
Round 1: I was interviewed with vice-president of engineering at Byju. The interviewer asked me about a Dynamic-programming problem-

• Given 1500 numbers of trains and 2000 platforms find the number of trains, one person has to change to get from one location to another. 
• Note you have to take the input on your own and it was on pen-paper. It can be solved by recursion by taking input as List<List>.
• After which I was asked to convert a binary tree to binary search tree. 
• I gave the approach of sorting the in-order traversal of a binary tree. But he wanted the solution in O(1) space. So I converted the binary tree to linked list and the sort it using quick-sort after with I converted back to binary tree from linked list.

Round 2: The second round was based on LLD in which I was asked to design chess which got me rejected.