The interview process started with a written round which consisted of 4 aptitude questions and 3 coding questions. The aptitude questions were- 1-> Find the time complexity of a code snippet. 2-> Find the output of a given string after the code completes.(It was a tricky question) as recursion and multiple iterations were involved along with replacement of characters. 3-> find the output after the recursive calls to a function. 4-> find the total no. of memory faults using LRU approach (OS) 5-> Data structure to be used for storing appointments as per the calendar and its reason ; The second part was ds required for storing dictionary words and its reason and the time complexity required for doing certain operations on the mentioned ds. Coding round had 3 questions: 1.Put all the zeroes present in an array at the end. 2. Print all the nodes in a tree at distance k from the root node. 3. Island problem- 2D array is given(n x n) and all the cells are filled with 1's and 0's 1 represents land and 0 water . Find the total no. of islands. F2F(1st Round) They asked me to explain all the three codes. and gave few questions on Linked Lists and string. Sort a linked list. reverse 3 characters at a time in a string . reverse a linked list... F2F(2nd Round) Explain all the codes once again. Stack . Validate a given expression with parenthesis. SQL Injection. Ways to avoid injection. Explain the procedure what happens behind the scenes when you type a URL in the browser. Given a text which contains french equivalent words for english words. Given a sentence how can you convert an english sentence to a french equivalent efficiently. F2F(3rd Round HR Round) Given a 2D array which represents a chess board- white color army numbered 0-15, black colored army numbered 16-31 . Co-ordinates for the white horse is given . Find all the possible moves for the white knight in the most efficient way possible. Normal HR Questions.