-
Notifications
You must be signed in to change notification settings - Fork 13
Interview Experience 119 (Intern)
Round 1 - Online coding round There was 1 coding question based on zero sum subarray. Apart from that there were 8 MCQ questions. These questions were from topics like binary search, dynamic programming and time complexity.
Round 2 - First of all the interviewer asked me to introduce myself. Then he asked me about the projects I have done so far. 1st question was to explain the code I have written in the 1st round for the coding question. Then he asked me some small puzzles. Last question was a balanced parenthesis problem.
Round 3 - First of all the interviewer asked me to explain the questions asked in previous rounds. Then she gave a problem where the matrix was column wise and row wise sorted and we need to find a given element in the matrix. She also inquired about the time complexity of my approach. Next question was to print the postorder traversal of tree without using recursion. At the end she gave a problem where some stacks of cloths of varying height were given and we need to find a minimum level such that if we select all the clothes above that level we have at least k clothes.