- Two Pointers
- Sliding Window
- Fast and Slow Pointers
- Merge Intervals
- In-place Reversal of LinkedList
- Breadth First Search (BFS)
- Depth First Search (DFS)
- Subsets
- Top 'K' Elements
- Dynamic Programming (DP)
- Toplogical Sort (Graphs)
- Minimize the maximum/Maximize the minimum (Utilizes a binary search)
- Morris Traversal (O(1) space complexity binary tree traversal)
Known as auxillary data structure if used to solve an algorithm. Something you might use to solve a given problem and is terminated after the problem is solved.
- HashMap
- TreeMap
- Linked List
- Array
- 2d Array
- ArrayList
- HashSet
- Trie
- Stack
- Queue
- Deque
- Binary Tree
- Binary Search Tree
- Heap
- PriorityQueue
- Graph
Solved with: Java