It consisted of three rounds, mostly of coding questions. It began with a written test, which was a psychometric test, followed by a group discussion, and then the first round, in which the most basic questions were asked. Then a fifteen-minute break, followed by the second round, in which fairly difficult questions were asked, and then a fifteen-minute break, and then the third round.

1. Given a sorted dictionary of an alien language having N words and k starting alphabets of a standard dictionary, the task is to complete the function which returns a string denoting the order of characters in the language.

2. Given a binary tree containing N+1 nodes and an integer X, your task is to complete the function countSubtreesWithSumX(), which returns the count of the number of subtrees having a total node's data sum equal to a value X.