2 Questions

Q1: Maze Runner - Pretty much same as Shortest Path in Binary Matrix - return the path, not a boolean

Q2: Continous Sequence Sum - Given an array find the maximum sum of any sequence in the array

Q1: Honestly threw me off a little bit for such a big question to start with. My last full loop attempt, every interview started with an easy string problem to warm up. I took a bulk of the interview time for this question and only got about 4 minutes for the Q2. I wish the interviewer cut me off earlier.

Q2: With only 3 minutes to spare, I knew it was an easier question, but the sliding window technique syntax slipped my mind. So i verbalized the approach but with 2 minutes or less to code I wasn't able to put down the correct implementation.

Next day reject email.

For the future I would start prepping earlier - probably 6 months of practice to internalize the algorithms and techniques until they become almost boilerplate code in your mind - Practicing/Memorizing the top 50 tagged within 30 days or less (what I did) is not the optimal strategy & I do not recommend it becuase if it worked for you.. you probably got lucky