Resources
- DFS
- Ordered Set
- Union Find
- LFU Cache
- Dynamic Programming Patterns
- Quick Sort
- Good Blog Post Resources about Algorithm and Data Structures - Codeforces
- Dynamic Programming Patterns
- https://codingchallenges.fyi/
Notes
Whenever we encounter a problem in finding the shortest path in a graph, we will apply BFS to solve it because BFS will guarantee us to be the shortest path.