Applied online and then received a HackerRank coding link with one coding question for 30 minutes. Within two weeks, a recruiter contacted me and scheduled an hour-long phone interview.

After this, I was called for an on-site round, which included three technical rounds and lunch. The first round was coding. The second round was to write test cases and debug existing code for failing test cases. It was followed by a Hiring Manager round that included questions on my past experiences, the design of one of the projects I worked on in the past, and some behavioral questions. For all coding and debugging rounds, there was a detailed discussion on time complexity analysis.

The entire interview process was very smooth and quick.

Three Sum with Duplicates

s = [abcdef, ghij, klmnop] (There can be many rows like this) w = [3, 4, 4]

Result would be: abc|ghij|klmn| def| |op |

This was the first question: print the above. Then, a 'w' array was given. Create a 'w' array such that the height of the max row is minimized.

New stock prices are coming every hour. Design a data structure to store stock prices and getMaxStock() to get the max stock price at that instance for the last K hours. K will be known from the beginning. Stock prices may not come every hour.