1/10
Looks like no tags are added yet.
Graphs - BFS
e
Graphs - DFS
e
Sliding Window - Flexible
e
Sliding Window - Fixed
e
Binary Search
Monotonic Stack
Topological Sort
Only works for DAG data structures - no cycles.
Khan’s Algorithm can detect cycles
Two Pointer (Same Direction)
Two Pointers (Opposite Direction)
Interval
Greedy