There was an online coding test.

Later, I was called for a face-to-face round.

Three interviews were conducted, each with two interviewers. The interviews were more or less on the same lines, meaning there were no distinct parameter separations.

There would have been three to four more rounds if I had cleared the subsequent ones.

Longest palindrome in a string.

Alternative odd/even numbers using 2 threads.

Lift question: Less starvation and maximum utilization.

Longest subarray having unique characters.

Stock prices from different vendors are coming in. Get the best prices at any point in time. What happens if a new price from a vendor comes up? It should still give the best price at that time.

• USE 2 stacks:
  • For every input in stack 1, place the minimum element at that time in stack 2.
  • If the same vendor comes again with a new price, just place it on stack 1 and get the minimum value at that time, then place it in stack 2.