Process started with phone screening round + proper 4 rounds of technical interviews.

1. Phone Screening
2. 2 Rounds of DS/Algo questions
3. ML Round
4. Googlyness

After phone screening, second round was conducted
Question
N = 7
A = [20,10,2,5,50,15,13]
K = 3

dont remember the exact question but with given K=3 we have to write an algorithm where a person can travel max distance which is given in array, and N=7 is number of days.
work - 20 k = 2 -----> 30 k = 1 -----> 32 k = 0
K will decrease by 1 if the person works i.e distance covered, if it rests than k will increase by 1

with given k need to figure out max distance that can be travelled.

I tried to solve the problem and was able to provide the bruteforce approach, but unfortunately didn't came up with optimized approach. For the second problem i dont remember the exact question it was backtracking question.
Lots of cross questions were asked related to the problem, interviewer was very friendly and helpful.

After the interview recuiter reached out and shared the feedback, it was okay but needed a bit of preparation to optimize the problem.