The level of coding questions in the coding round was on the tougher side. There were two questions on graph of which one was a modification of finding the diameter of the graph. The technical round was on the easy to moderate side. There were three questions on data structures and algorithms and one SQL query to find the second highest employee salary from an employees table. One question was a variation of peak finding. Another one was a variation of Kadane's algorithm and last one was an open ended question on reading data from a file and finding frequency of elements. This led to the discussion on hash maps and collisions and multiple prevention strategies. There was a hiring manager round where I was tested on CS fundamentals and some behavioural questions. I was asked to explain the entire journey of a HTTP request and the OSI network model. There was a discussion on paging and memory management. I was also asked to explain types of polymorphism.
