Sitemap
All pages on LeetEye - algorithm patterns, practice problems, cheat sheets, and comparisons.
Algorithm Patterns
All Cheat Sheets
- Arrays & Hashing Cheat Sheet
- Two Pointers Cheat Sheet
- Stack Cheat Sheet
- Sliding Window Cheat Sheet
- Binary Search Cheat Sheet
- Linked List Cheat Sheet
- Trees Cheat Sheet
- Tries Cheat Sheet
- Backtracking Cheat Sheet
- Heap / Priority Queue Cheat Sheet
- Graphs Cheat Sheet
- Advanced Graphs Cheat Sheet
- 1-D DP Cheat Sheet
- 2-D DP Cheat Sheet
- Greedy Cheat Sheet
- Intervals Cheat Sheet
- Bit Manipulation Cheat Sheet
- Math & Geometry Cheat Sheet
Pattern Comparisons
- Sliding Window vs Two Pointers
- BFS vs DFS
- Dynamic Programming vs Greedy
- Hash Map vs Hash Set
- Memoization vs Tabulation
- Recursion vs Iteration
- Dijkstra's vs BFS
- Stack vs Queue
- Binary Search vs Linear Search
- Inorder vs Preorder Traversal
- 1D DP vs 2D DP
- Top-Down vs Bottom-Up DP
- Heap vs Sorted Array
- Trie vs Hash Map for Strings
- Union-Find vs DFS for Connectivity
- Backtracking vs Dynamic Programming
- Kadane's Algorithm vs Brute Force
- Floyd Cycle Detection vs Hash Set
- Monotonic Stack vs Brute Force
- Prefix Sum vs Brute Force
- Merge Sort vs Quick Sort
- Array vs Linked List
- Adjacency List vs Matrix
- BST vs Hash Map
- Topological Sort vs DFS
- Prim's vs Kruskal's Algorithm
- Bellman-Ford vs Dijkstra's
- Counting Sort vs Comparison Sort
- Fixed vs Variable Sliding Window
- Fast-Slow Pointers vs Two Pointers