Round 1 - - Given x boys and y girls, seperate them into smallest groups each, in a linear seating arrangement, return the largest number in a group Round 2 - 60 minutes - Resume Review (The most important part) - 2 Questions- - Given an array, find the pair of (arr[i], arr[j]) with maximum sum such that i<j Round 3 - 50 minutes - Resume Review (Again, very very important) - Given a partially sorted array with k elements unsorted in n (k<<n), give the most optimum sorting algorithm. - Say k=2, n=100 and the two elements are actually swapped from their sorted positions, optimize for this scenario - Database related questions related to project, normalisation, optimisation for search etc. Round 4 - 15 minutes - How many HTTP Requests are needed to render a webpage? - Are those HTTP Requests serial or parallel - A check on web dev skills, asked to tinker with some existing elements on my project (from CV)