LeetCode
Introduction
1.
Backtracking
1.1.
Letter Combinations of a Phone Number
1.2.
Generate Parentheses
1.3.
Restore IP Addresses
1.4.
Regular Expression Matching
1.5.
Combination Sum
1.6.
Combination Sum II
1.7.
Permutations
1.8.
Combinations
1.9.
Subsets
1.10.
Word Search
1.11.
Subsets II
1.12.
Palindrome Partitioning
2.
Math
2.1.
Add Binary
2.2.
Add Two Numbers
2.3.
Reverse Integer
2.4.
Palindrome Number
2.5.
Integer to Roman
2.6.
Divide Two Integers
2.7.
Multiply Strings
2.8.
Pow(x, n)
2.9.
Plus One
2.10.
Sqrt(x)
3.
String
3.1.
Longest Substring Without Repeating Characters
3.2.
String to Integer
3.3.
Regular Expression Matching
3.4.
Longest Palindromic Substring
3.5.
Integer to Roman
3.6.
Longest Common Prefix
3.7.
Implement strStr()
3.8.
Count and Say
3.9.
Multiply Strings
3.10.
Group Anagrams
3.11.
Length of Last Word
3.12.
Simplify Path
3.13.
Reverse Words in a String
3.14.
String to Integer (atoi)
4.
Dynamic Programming
4.1.
Decode Ways
4.2.
Longest Palindromic Substring
4.3.
Maximum Subarray
4.4.
Unique Paths
4.5.
Unique Paths II
4.6.
Minimum Path Sum
4.7.
Climbing Stairs
4.8.
Triangle
4.9.
Best Time to Buy and Sell Stock
4.10.
Best Time to Buy and Sell Stock II
4.11.
Best Time to Buy and Sell Stock III
4.12.
Word Break
4.13.
Maximum Product Subarray
4.14.
House Robber
4.15.
House Robber II
5.
Hash Table
5.1.
Two Sum
5.2.
Valid Sudoku
5.3.
Group Anagrams
5.4.
Single Number
5.5.
Happy Number
5.6.
Isomorphic Strings
5.7.
Contains Duplicate
5.8.
Contains Duplicate II
6.
Two Pointers
6.1.
Longest Substring Without Repeating Characters
6.2.
Container With Most Water
6.3.
3Sum
6.4.
3Sum Closest
6.5.
4Sum
6.6.
Remove Nth Node From End of List
6.7.
Remove Duplicates from Sorted Array
6.8.
Remove Element
6.9.
Implement strStr()
6.10.
Rotate List
6.11.
Sort Colors
6.12.
Remove Duplicates from Sorted Array II
6.13.
Merge Sorted Array
6.14.
Minimum Size Subarray Sum
7.
Binary Search
7.1.
Median of Two Sorted Arrays
7.2.
Search in Rotated Sorted Array
7.3.
Search for a Range
7.4.
Search Insert Position
7.5.
Search a 2D Matrix
7.6.
Search in Rotated Sorted Array II
7.7.
Find Minimum in Rotated Sorted Array
7.8.
Find Peak Element
7.9.
Find Minimum in Rotated Sorted Array II
8.
Stack
8.1.
Valid Parentheses
8.2.
Simplify Path
8.3.
Evaluate Reverse Polish Notation
9.
Linked List
9.1.
Merge Two Sorted Lists
9.2.
Swap Nodes in Pairs
9.3.
Remove Duplicates from Sorted List
9.4.
Remove Duplicates from Sorted List II
9.5.
Partition List
9.6.
Reverse Linked List
9.7.
Reverse Linked List II
9.8.
Linked List Cycle
9.9.
Linked List Cycle II
9.10.
Reorder List
9.11.
Insertion Sort List
9.12.
Sort List
9.13.
Remove Linked List Elements
9.14.
Palindrome Linked List
9.15.
Delete Node in a Linked List
10.
Misc
10.1.
Next Permutation
10.2.
Rotate Image
10.3.
Spiral Matrix
10.4.
Length of Last Word
10.5.
Spiral Matrix II
10.6.
Set Matrix Zeroes
10.7.
Gray Code
10.8.
Majority Element
11.
Greedy
11.1.
Jump Game
11.2.
Gas Station
12.
Tree
12.1.
Binary Tree Inorder Traversal
12.2.
Unique Binary Search Trees
12.3.
Unique Binary Search Trees II
12.4.
Validate Binary Search Tree
12.5.
Same Tree
12.6.
Symmetric Tree
12.7.
Binary Tree Level Order Traversal
12.8.
Binary Tree Zigzag Level Order Traversal
12.9.
Maximum Depth of Binary Tree
12.10.
Construct Binary Tree from Preorder and Inorder Traversal
12.11.
Construct Binary Tree from Inorder and Postorder Traversal
12.12.
Binary Tree Level Order Traversal II
12.13.
Convert Sorted Array to Binary Search Tree
12.14.
Convert Sorted List to Binary Search Tree
12.15.
Balanced Binary Tree
12.16.
Minimum Depth of Binary Tree
12.17.
Path Sum
12.18.
Path Sum II
12.19.
Flatten Binary Tree to Linked List
12.20.
Populating Next Right Pointers in Each Node
12.21.
Sum Root to Leaf Numbers
12.22.
Binary Tree Preorder Traversal
12.23.
Binary Tree Right Side View
12.24.
Invert Binary Tree
12.25.
Lowest Common Ancestor of a Binary Search Tree
Powered by
GitBook
A
A
Serif
Sans
White
Sepia
Night
Share on Twitter
Share on Google
Share on Facebook
Share on Weibo
Share on Instapaper
LeetCode