- 2 ptr / 3 ptr / Sliding Window: usually any O(n^2) can be simplified using sliding window
- Binary Search
- Heaps
- Hash
- DFS
- BFS
- Recursion
- https://hackernoon.com/14-patterns-to-ace-any-coding-interview-question-c5bb3357f6ed
- https://github.com/codepath/compsci_guides/wiki/
- NeetCode:Top 6 Coding Interview Concepts Data Structures & Algorithms
-
⭐ BLIND-75 PLAYLIST:
• Two Sum - Leetcode 1 - HashMap - Python -
🌲 TREE PLAYLIST:
• Invert Binary Tree - Depth First Sear... -
💡 GRAPH PLAYLIST:
• Course Schedule - Graph Adjacency Lis... -
💡 BACKTRACKING PLAYLIST:
• Word Search - Backtracking - Leetcode... -
💡 SLIDING WINDOW PLAYLIST:
• Sliding Window: Best Time to Buy and ... -
💡 BINARY SEARCH PLAYLIST:
• Binary Search
https://leetcode.com/explore/featured/card/recursion-i/
https://leetcode.com/explore/learn/card/recursion-ii/470/divide-and-conquer/2897/