After a phone screen with HR, I had a one-hour phone interview that included an algorithm question. This was followed by an on-site interview.

I was expecting two engineering interviews, each with two questions. The first interview featured LeetCode medium questions related to Candy Crush and condensing a linked list.

The second interviewer presented a variation of the Knapsack NP-hard problem. However, they complained about my exponential runtime, and surprisingly, didn't seem to know what the Knapsack problem was. Not surprisingly, they walked me out of the office, and I did not receive an offer.

1-Dimensional Candy Crush to condense the row as much as possible.