u/michaelnovati replied ·
I would know DFS and BFS like the back of your hand, many tree problems start with one or the other as the base and you can then focus your time on applying them to the problem.
Also strings, arrays, and hashtables.
You'll have 3 interviews: 2x DS&A similar to the phone screen, and 1x behavioral.
DS&A:
\- 2 medium level problems
\- 45 mins to solve them
\- no small talk
\- whiteboard style/noncompilable code requirement, be able to walk through throught process without running and guessing and checking.
Behavioral:
\- looking for red flags
\- try to show more unique things you've done in school projects or outside of school and not the same old thing they hear 10 times a day
(I worked at Meta 2009 to 2017 and did 400+ interviews and a lot of on campus recruiter)