1. Data Structures & Algorithms
The following is a long list of topics. If you're preparing to interview at a top tech company and don't have much time (<2 months), just go over the essentials.
Last updated
The following is a long list of topics. If you're preparing to interview at a top tech company and don't have much time (<2 months), just go over the essentials.
Last updated
Do all the Leetcode problems from the "" section. Don't worry if you're not applying to Google. And don't be a cry baby. Just do them all and you'll be in a better shape.
Be able to implement any of these from scratch
()
()
()
()
()
()
()
()
Try implementing these.
Detect cycle in an undirected graph
Detect cycle in a directed graph
Count connected components in graph
Find strongly connected components in graph
Disjoint Set
What is a Spanning tree?
Minimum Spanning Tree (Kruskal and Prim)
Explain bipartite graph (how do you check if graph is bipartite?)
Do Traveling Salesperson and other NP problems
()
()
()
()
()
()
& () - Unsigned vs signed numbers. Negative and positive number representation. Know how add and subtract works.
- Sort it in-place to get O(1) space
- Implement all three ways
()
- BFS, DFS (in-order, pre-order, post-order): Implement Recursive and Iterative
- No implementation
() - just know the concept
—— Didn’t cover in class
() - Bubble sort, insertion sort, etc.