leetcode
Preface
1.
Part I - Basics
2.
Basics Data Structure
2.1.
String
2.2.
Linked List
2.3.
Binary Tree
2.4.
Binary Search Tree
2.5.
Huffman Compression
2.6.
Priority Queue
3.
Basics Sorting
3.1.
Bubble Sort
3.2.
Selection Sort
3.3.
Insertion Sort
3.4.
Merge Sort
3.5.
Quick Sort
3.6.
Heap Sort
3.7.
Bucket Sort
3.8.
Counting Sort
3.9.
Radix Sort
4.
Basics Misc
4.1.
Bit Manipulation
4.2.
Knapsack
5.
Part II - Coding
6.
String
6.1.
strStr
6.2.
Two Strings Are Anagrams
6.3.
Compare Strings
6.4.
Anagrams
6.5.
Longest Common Substring
6.6.
Rotate String
6.7.
Reverse Words in a String
6.8.
Valid Palindrome
6.9.
Longest Palindromic Substring
6.10.
Space Replacement
6.11.
Wildcard Matching
6.12.
Length of Last Word
6.13.
Count and Say
7.
Integer Array
7.1.
Remove Element
7.2.
Zero Sum Subarray
7.3.
Subarray Sum K
7.4.
Subarray Sum Closest
7.5.
Recover Rotated Sorted Array
7.6.
Product of Array Exclude Itself
7.7.
Partition Array
7.8.
First Missing Positive
7.9.
2 Sum
7.10.
3 Sum
7.11.
3 Sum Closest
7.12.
Remove Duplicates from Sorted Array
7.13.
Remove Duplicates from Sorted Array II
7.14.
Merge Sorted Array
7.15.
Merge Sorted Array II
7.16.
Median
7.17.
Partition Array by Odd and Even
7.18.
Kth Largest Element
8.
Binary Search
8.1.
Binary Search
8.2.
Search Insert Position
8.3.
Search for a Range
8.4.
First Bad Version
8.5.
Search a 2D Matrix
8.6.
Find Peak Element
8.7.
Search in Rotated Sorted Array
8.8.
Find Minimum in Rotated Sorted Array
8.9.
Search a 2D Matrix II
8.10.
Median of two Sorted Arrays
8.11.
Sqrt x
8.12.
Wood Cut
9.
Math and Bit Manipulation
9.1.
Single Number
9.2.
Single Number II
9.3.
Single Number III
9.4.
O1 Check Power of 2
9.5.
Convert Integer A to Integer B
9.6.
Factorial Trailing Zeroes
9.7.
Unique Binary Search Trees
9.8.
Update Bits
9.9.
Fast Power
9.10.
Hash Function
9.11.
Count 1 in Binary
9.12.
Fibonacci
9.13.
A plus B Problem
9.14.
Print Numbers by Recursion
9.15.
Majority Number
9.16.
Majority Number II
9.17.
Majority Number III
9.18.
Digit Counts
9.19.
Ugly Number
9.20.
Plus One
10.
Linked List
10.1.
Remove Duplicates from Sorted List
10.2.
Remove Duplicates from Sorted List II
10.3.
Remove Duplicates from Unsorted List
10.4.
Partition List
10.5.
Two Lists Sum
10.6.
Two Lists Sum Advanced
10.7.
Remove Nth Node From End of List
10.8.
Linked List Cycle
10.9.
Linked List Cycle II
10.10.
Reverse Linked List
10.11.
Reverse Linked List II
10.12.
Merge Two Sorted Lists
10.13.
Merge k Sorted Lists
10.14.
Reorder List
10.15.
Copy List with Random Pointer
10.16.
Sort List
10.17.
Insertion Sort List
10.18.
Check if a singly linked list is palindrome
10.19.
Delete Node in the Middle of Singly Linked List
11.
Binary Tree
11.1.
Binary Tree Preorder Traversal
11.2.
Binary Tree Inorder Traversal
11.3.
Binary Tree Postorder Traversal
11.4.
Binary Tree Level Order Traversal
11.5.
Binary Tree Level Order Traversal II
11.6.
Maximum Depth of Binary Tree
11.7.
Balanced Binary Tree
11.8.
Binary Tree Maximum Path Sum
11.9.
Lowest Common Ancestor
11.10.
Invert Binary Tree
11.11.
Diameter of a Binary Tree
11.12.
Construct Binary Tree from Preorder and Inorder Traversal
11.13.
Construct Binary Tree from Inorder and Postorder Traversal
11.14.
Subtree
11.15.
Binary Tree Zigzag Level Order Traversal
11.16.
Binary Tree Serialization
12.
Binary Search Tree
12.1.
Insert Node in a Binary Search Tree
12.2.
Validate Binary Search Tree
12.3.
Search Range in Binary Search Tree
12.4.
Convert Sorted Array to Binary Search Tree
12.5.
Convert Sorted List to Binary Search Tree
12.6.
Binary Search Tree Iterator
13.
Exhaustive Search
13.1.
Subsets
13.2.
Unique Subsets
13.3.
Permutations
13.4.
Unique Permutations
13.5.
Next Permutation
13.6.
Previous Permuation
13.7.
Unique Binary Search Trees II
13.8.
Permutation Index
13.9.
Permutation Index II
13.10.
Permutation Sequence
13.11.
Palindrome Partitioning
13.12.
Combinations
13.13.
Combination Sum
13.14.
Combination Sum II
13.15.
Minimum Depth of Binary Tree
14.
Dynamic Programming
14.1.
Triangle
14.2.
Backpack
14.3.
Minimum Path Sum
14.4.
Unique Paths
14.5.
Unique Paths II
14.6.
Climbing Stairs
14.7.
Jump Game
14.8.
Word Break
14.9.
Longest Increasing Subsequence
14.10.
Palindrome Partitioning II
14.11.
Longest Common Subsequence
14.12.
Edit Distance
14.13.
Jump Game II
14.14.
Best Time to Buy and Sell Stock
14.15.
Best Time to Buy and Sell Stock II
14.16.
Best Time to Buy and Sell Stock III
14.17.
Best Time to Buy and Sell Stock IV
14.18.
Distinct Subsequences
14.19.
Interleaving String
14.20.
Maximum Subarray
14.21.
Maximum Subarray II
14.22.
Longest Increasing Continuous subsequence
14.23.
Longest Increasing Continuous subsequence II
15.
Graph
15.1.
Topological Sorting
16.
Data Structure
16.1.
Implement Queue by Two Stacks
16.2.
Min Stack
16.3.
Sliding Window Maximum
16.4.
Longest Words
17.
Problem Misc
17.1.
Nuts and Bolts Problem
17.2.
Heapify
17.3.
String to Integer
17.4.
Insert Interval
17.5.
Merge Intervals
17.6.
Minimum Subarray
17.7.
Matrix Zigzag Traversal
17.8.
Valid Sudoku
17.9.
Add Binary
17.10.
Reverse Integer
17.11.
Gray Code
18.
Part III - Contest
19.
Google APAC
19.1.
APAC 2015 Round B
19.1.1.
Problem A. Password Attacker
20.
Appendix I Interview and Resume
20.1.
Interview
20.2.
Resume
Powered by
GitBook
A
A
襯線體
無襯線體
白色
棕褐色
夜間
分享到 Twitter
分享到 Google
分享到 Facebook
分享到 Weibo
分享到 Instapaper
leetcode
改進此頁
Basics Miscellaneous
雜項，涉及「位操作」等。