YOE: 6 yrs 4yr mobile 2 year backend
- Find longest path in a graph , no back steps. DFS + Memo
- LRU Cache
- OOD
- System Design : TicketMaster like thing.
Well , I did pretty good in all coding rounds, all solved without major blockers, all finished. But I only prepared 6 cases for BQs. and each round they will ask you 2~3 BQs. that makes me soon out of the examples I can use. I heard that is a red line since they don't think you have a good package.
System design is the biggest trap since my QPS only requires me to meet QPS < 10? really small , I confirmed multiple times and the guy said go ahead.
so I end up to be do the most cost efficiecntly way rather than an overkill.
I think this is a thing you should learn here is always NEVER NEVER NEVER do like what I did.
You need show all your understandings and drive the conversation. I would say my interviewer on this round is awful. he gave me a stupid scenario but still expect you to use all fancy approaches which I don't think you need to for such a easy system. Also he immediately start to ask dump questions on details without giving me to scale up my first draft.
LC 600+ different problems in 2019 session.
Now the 2020 session is 100+