Education - Tier 1 , Non-CS background
YOE- 1Yr with product based startup

Applied through a referal. Interview was scheduled for the next week.

Round 1 -

Que - Design a 2048 game (i did a mini project on expectiminimax search).
Que - Given a list of cities , you have k weeks. In each city you can only stay for some day on the ith week. You can only move from one city to another only once a week. Find the maximum number of days that you can stay in k weeks. I gave a dp approach and he was satisfied.

This round went very well and the I was scheduled for the next 2 rounds for the next day.

Round 2 -

Que - Given a complete tree, insert any element in such a way that the resultant tree is also complete.
O(logn) complexity was required. I was able to code it with some hints.

Round 3 -

Que - Given an array of size n, you have to make m bookings. Bookings should be in contiguous manner. Some index of the array maybe blocked. You have to select that seat which minimizes the maximum distance between that seat and any of the other m-1 seat .

Not sure what happend but was not able to solve this que even after the hints. Bombed this interview round and was expecting a rejection call. A week later i got a rejection email. Overall the questions were really good and the interviewers were super friendly.