Meta onsite interview is in 1.5 weeks. I solved around 50LCs (easy + mid) and definitely don't feel like I'm ready. Does Meta frequently ask graph algorithms other than good ol' DFS, BFS? I'm talking about algos like topological sort, shortest path, union find etc I'm trying to decide what to spend my limited time, those type of questions vs system design vs top 100 FB tagged LC Note: I know they are not really advanced algorithms, but I wanted to add advanced keyword to differentiate them from DFS, BFS because almost all companies ask those traversal algorithms #software #engineering #swe #graph #meta #faceboook #faang
The graph algorithms you mentioned are elementary. You usually won't be asked about max-flow-min-cut or planarity test algorithms.
I mean shortest path is just bfs with a priority queue right? Topological sort is just bfs where you track the degrees. Never seen union find asked but anything is possible if you get unlucky enough (not that it's particularly hard either, just uncommon). I wouldn't practice LC for these btw, just understand the intuition and then use your actual programming skills to code them up if you need to
Well Dijkstra doesn't work negative edges or negative cycles. Also there is a clever/tricky dfs way to solve topsort as well apart from kahns algorithm.
The ones you mentioned are pretty standard and you should know them. Include things like dijkstras, kruskals, and prims in there as well. You don’t need anything past that though like a*.
It doesn’t sound like you’re prepared. It’s totally okay to postpone this until you can solve 2 mediums in effectively 35 mins. That includes BFS, DFS etc.
For one and half week its not at all eniugh time to go through 100s of fb top tags itself.. given you do need to be perfecting sys design and behavioral stories too I’d focus on fundamental 2-3 question per pattern and try to get the pattern. Good luck!!