Round 1) Sort hashmap by values. Print matrix in spiral form. There are "n" numbers in an array. There is a number "p" given. Find out if sum of subset of numbers in array equals "p". Round 2) Projects Round 3) Monty Hall Problem. In an array, find the length of longest increasing sequence. For ex : Array {10,11,12, 1,2,3,4,5}. There are 2 sequences , 10,11,12 and 1,2,3,4,5. So, answer would be 5. Write recursive as well as iterative code. Javascript theory questions. Round 4) There are 2 databases, A and B. A is stage DB and B is production DB which clients are using. You have to transfer 2 billion data from A to B in less than 10 HOURS. How? Also, there is a refresh planned every 2 weeks. 2 billion records are transferred every 2 weeks. There is no downtime. How would you make sure that clients don't face any interruptions during the refresh. Java/Javascript theory questions Round 5) ​Director round. ​ Why ServiceNow. Why Hyderabad. Family backgrounds. Etc, etc. Compensation discussion.

Javascript and Binary Trees related questions