Online Assessment (70 mins) -

1. Longest Happy String -
   https://leetcode.com/problems/longest-happy-string/

2. Vertically slice two arrays such that the sum of all 4 sub-parts are equal. Find count of how many such split points are possible
   Example -

A[] = [0, 4, -1, 0, 3]
B[] = [1, 2, 0, 5, -2, 0]
	
Here if we vertically slice arrays at index k = 2, we get subarrays A[0..2], A[3..4], 
B[0..2] and B[3..5] and the sum of each is 3.	Therefore the output here is 1 as we 
only have one such slice point.

Onsite(Virtual) Round 1 (60 mins) -

1. https://leetcode.com/problems/reverse-words-in-a-string/ (Do it in place without using extra space)
2. Given an array of integers nums[] find if any 2 numbers sum upto a particular number ‘K’.
   Example -

Input => nums[] = {6, 2, -1 , 8, 3, 7}, K = 9
Output => true

Onsite(Virtual) Round 2 (60 mins) -

LLD of BookMyShow with focus on concurrent requests trying to lock the same seat of a show.
Designed model classes, controller endpoints, service methods, repository layer methods and LockProvider class to handle locking of seats.

Onsite(Virtual) Round 3 (60 mins) -

60 mins round divided in 2 half.
First half was about my experience, ways of working, technologies used and general behavioural questions.
Second half I was asked to design the HLD of google drive type of system. Had read it from an article.

Onsite(Virtual) Round 4 (60 mins) -

Behavioural questions with focus on the following aspects -

1. Discussion on the project I’m working on in my current organisation.
2. Toughest technical challenges you have done and how you approached it and learnings from that.
3. Tell me an instance when you couldn’t meet the deadline. Why it happened and learning from that.
4. Growth mindset

PS - Interviewers in all the rounds were very easy going and supportive. Enjoyed the overall interview process.