Everything

Arrays
Two Sum
Three Sum
Duplicate Number
Rotate Array
Sorting
Quick Sort
Strings
Longest Common Prefix
Group Anagrams
Edit Distances
Parentheses matching
Longest Valid Parentheses
Valid Parenthesis String
Reorganize String
string
Subarray
Maximum Subarray Sum
Best Time to Buy and Sell Stock
greedy
Best Time to Buy and Sell Stock II
greedy
Best Time to Buy and Sell Stock IV
Continuous Subarray Sum
Subarray Sum Equals K
Product of Array Except Self
Maximize Subarray Sum After Removing All Occurrences of One Element
Stack
Asteroid Collision
stack
Linked List
Reverse Linked List
linked list
Remove Nth Node From End of List
Merging Two Sorted Linked Lists
Merge K Sorted Lists
Detecting a Cycle in Linked List
Implementing LRU Cache
Sequences
Longest Consecutive Sequence
Longest Increasing Subsequence
Russian Doll
Longest Common Subsequence
Longest Palindromic Subsequence
Sum of Good Subsequences
Distinct Subsequences
Palindromes
Longest Palindromic Substring
palindromes
Count Palindromic Substrings
palindromes
Manacher Algorithm
palindromes
Palindromic Partition
palindromes
Two Pointers
Containers with Most Water
two pointers
Sliding Window
Longest Substring Without Repeating Characters
two pointers sliding window
String Compression
two pointers sliding window
Take K of Each Character From Left and Right
sliding window
Partition Labels
sliding window
Trees
Tree Traversals
In Order
Pre Order
Post Order
Level Order
Binary Tree from its Traversals
Binary Tree Maximum Path Sum
Lowest Common Ancestor
In a Binary Tree
In a Binary Search Tree
Segment Trees
Check Completeness of a Binary Tree
binary tree
Heap
Median in a Stream
heap
BFS
Shortest Path in Binary Matrix
bfs
01 Matrix
bfs
All Nodes Distance K in Binary Tree
binary tree bfs
DFS
Reconstruct Itinerary
eulerian path dfs
Single Source Shortest Path
Dijkstra Algorithm
dijkstra sssp
Cheapest Flights Within K Stops
dijkstra sssp bfs
Bellman-Ford Algorithm
Minimum Spanning Tree
Kruskals algorithm
mst
Min Cost to Connect All Points
mst
Prims Algorithm
mst
Topological Sort
topological sort
Find Eventual Safe States
topological sort
Max Flow Min Cut
Intervals
Merge Intervals
intervals
Insert Interval
intervals
Min Meeting Rooms
intervals greedy
Line Sweep Technique
line sweep
Zero Array Transformation I
line sweep
Zero Array Transformation II
line sweep binary search
Smallest Range Covering Elements from K Lists
line sweep intervals
Minimum Number of Arrows to Burst Balloons
intervals greedy
Monotonic Stack
monotonic stack
Largest Rectangle in Histogram
monotonic stack
Sum of Subarray Minimums
monotonic stack
Daily Temperatures
monotonic stack
Permutations
Next Permutation
permutation
Permutation Sequence
permutation
Sets
Constructing Powersets
DSU with Rollbacks
DSU Union-Find
Number of Connected Components in an Undirected Graph
dsu
The Earliest Moment When Everyone Become Friends
Making A Large Island
Binary Search
Binary Search in Array
Binary Search in Sorted Array
binary search
First and Last Position in a Sorted Array
binary search
Find Minimum in Rotated Sorted Array
binary search
Find Peak Element
Minimum Limit of Balls in a Bag
binary search
Split Array Largest Sum
binary search
Swim in Rising Water
binary search bfs
Greedy Approach
Gas Station
greedy
Max Chunks To Make Sorted
greedy
Jump Game
greedy
Jump Game II
greedy
Jump Game III
bfs
Maximum Swap
Backtracking
N-Queens Problem
Sudoku Solver
Knapsack
Bounded Knapsack
Unbounded Knapsack
Fractional Knapsack
Subsetsum to knapsack
Coin Change
Coin Change
knapsack
Coin Change II
knapsack
Range Queries
Range Frequency Queries
Rotate Image
Word break
trie dynamic programming
02a Optimisers
optimisers
03a Implementing Self Attention
self attention transformers