Pergunta de entrevista da empresa PharmEasy

1. Binary tree with root, given node and value k. Find all nodes at a distance from given node. 2. Given preorder traversal construct BST 3. DP problem 4. Design CureFit 5. Resume related & accessing DB in a distributed multi-server environment