Introduction
1.
Array And String
1.1.
Merge Sorted Array
1.2.
Remove Element
1.3.
Remove Duplicates from Sorted Array
1.4.
Remove Duplicates from Sorted Array II
1.5.
Majority Element
1.6.
Rotate Array
1.7.
Best Time to Buy and Sell Stock
1.8.
Best Time to Buy and Sell Stock II
1.9.
Jump Game
1.10.
Jump Game II
1.11.
H-Index
1.12.
Trapping Rain Water
1.13.
Gas Station
2.
Two Pointers
2.1.
Valid Palindrome
2.2.
Is Subsequence
2.3.
Two Sum II - Input Array Is Sorted
2.4.
Container With Most Water
2.5.
3Sum
3.
Sliding Window
3.1.
Minimum Size Subarray Sum
3.2.
Longest Substring Without Repeating Characters
3.3.
Substring with Concatenation of All Words
3.4.
Minimum Window Substring
4.
Matrix
4.1.
Spiral Matrix
4.2.
Spiral Matrix II
4.3.
Rotate Image
4.4.
Set Matrix Zeroes
5.
Hashmap
5.1.
Two Sum
5.2.
Group Anagrams
5.3.
Longest Consecutive Sequence
6.
Intervals
6.1.
Summary Ranges
6.2.
Merge Intervals
6.3.
Insert Interval
6.4.
Minimum Number of Arrows to Burst Balloons
7.
Stack
7.1.
Valid Parentheses
7.2.
Simplify Path
7.3.
Min Stack
7.4.
Evaluate Reverse Polish Notation
8.
Linked List
8.1.
Linked List Cycle
8.2.
Add Two Numbers
8.3.
Merge Two Sorted Lists
8.4.
Copy List with Random Pointer
8.5.
LRU Cache
8.6.
Reverse Linked List II
8.7.
Remove Duplicates from Sorted List II
8.8.
Partition List
9.
Binary Tree
9.1.
General
9.1.1.
Symmetric Tree
9.1.2.
Construct Binary Tree from Preorder and Inorder Traversal
9.1.3.
Sum Root to Leaf Numbers
9.1.4.
Binary Tree Maximum Path Sum
9.2.
BFS
9.2.1.
Binary Tree Right Side View
9.2.2.
Binary Tree Level Order Traversal
9.2.3.
Binary Tree Zigzag Level Order Traversal
9.3.
BST
9.3.1.
Minimum Absolute Difference in BST
9.3.2.
Kth Smallest Element in a BST
9.3.3.
Validate Binary Search Tree
10.
Graph
10.1.
General
10.1.1.
Number of Islands
10.1.2.
Surrounded Regions
10.1.3.
Course Schedule
10.1.4.
Course Schedule II
10.2.
BFS
10.2.1.
Snakes and Ladders
10.2.2.
Word Ladder
11.
Trie
11.1.
Implement Trie (Prefix Tree)
11.2.
Word Search II
12.
Backtracking
12.1.
Letter Combinations of a Phone Number
12.2.
Combination Sum
12.3.
Word Search
13.
Divide & Conquer
13.1.
Sort List
13.2.
Merge k Sorted Lists
13.3.
Maximum Subarray
13.4.
Maximum Sum Circular Subarray
14.
Binary Search
14.1.
Search a 2D Matrix
14.2.
Search in Rotated Sorted Array
14.3.
Median of Two Sorted Arrays
14.4.
Search Insert Position
15.
Heap
15.1.
Kth Largest Element in an Array
15.2.
Find Median from Data Stream
15.3.
Find K Pairs with Smallest Sums
16.
Bit Manipulation
16.1.
Single Number
16.2.
Single Number II
17.
Math
17.1.
Factorial Trailing Zeroes
17.2.
Pow(x, n)
18.
Dynamic Programming
18.1.
1 D
18.1.1.
House Robber
18.1.2.
Coin Change
18.1.3.
Word Break
18.1.4.
Longest Increasing Subsequence
18.1.5.
Climbing Stairs
18.2.
Multi Ds
18.2.1.
Minimum Path Sum
18.2.2.
Longest Palindromic Substring
18.2.3.
Interleaving String
18.2.4.
Best Time to Buy and Sell Stock III
18.2.5.
Edit Distance
18.2.6.
Best Time to Buy and Sell Stock IV
18.2.7.
Triangle
18.2.8.
Unique Paths II
18.2.9.
Maximal Square
Light (default)
Rust
Coal
Navy
Ayu
LeetCode Practising Docs
BST