questions_review
Introduction
1.
求和问题
1.1.
2 sum模板
1.2.
2 sum问题
1.3.
4 sum
2.
Math
2.1.
plus one
2.2.
arbitrary precision integers
2.3.
power of 3
2.4.
palindrome integer
2.5.
Count Primes
2.6.
Random generator
2.7.
Basic Calculator
2.8.
sudoku solver
2.9.
Excel Column
2.10.
Strobogrammatic number
3.
Array
3.1.
Max Distance
3.2.
intervals
3.2.1.
insert interval
3.2.2.
Merge interval
3.2.3.
Meeting rooms II
3.3.
Majority Number
3.4.
remove elements in array
3.5.
Sort Color
3.6.
滑雪问题
3.7.
Set Matrix zero
3.8.
Rearrange array
3.9.
longest consecutive sequence
4.
recursion
4.1.
strobogrammatic number 2
4.2.
strobogrammatic number 3
5.
BackTracking
5.1.
permutation
5.1.1.
permutation
5.1.2.
permutation index
5.1.3.
permutation sequence
5.1.4.
next permutation
5.1.5.
letter combination
6.
Divide and Conquer
7.
Sort
7.1.
First Missing Number
7.2.
merge sort
7.3.
quick sort
7.4.
quick select
7.5.
wiggle sort
7.6.
wiggle sort II
7.7.
median of 2 sorted array
8.
Hash Table
8.1.
isomorphic string
8.2.
distinct numbers in window
8.3.
group shift string
8.4.
LRU
8.5.
Min window substring
8.6.
Max points on a line
8.7.
Equal, pairwise sum
8.8.
palindrome pairs
9.
Linked List
9.1.
sorted list to binary tree
10.
Two Pointer
10.1.
max continusour 1
11.
Strings
11.1.
strstr
11.2.
longest common prefix
11.3.
reverse words
11.4.
roman to interger
11.5.
string math
11.5.1.
multiply strings
11.5.2.
power of 2
11.6.
string parsing
11.6.1.
compare version number
11.6.2.
Restore IP Address
11.7.
Tricks
11.7.1.
Longest Palindrome Substring
11.7.2.
encode decode strings
11.8.
Pretty print
11.8.1.
justify text
11.8.2.
zigzag conversion
11.9.
Longest Palindrom substring
12.
Bit Manipulation
12.1.
swap bits
12.2.
x power to y
12.3.
single number
12.4.
bitwise_and_of_range
13.
stack
13.1.
trapping water
14.
Heap
14.1.
data stream median
14.2.
sliding window max
14.3.
super ugly number
14.4.
merge k sorted lists
15.
Queue
15.1.
Circular Queue
16.
greedy
16.1.
jump game
16.2.
jump game 2
16.3.
patch array
16.4.
create max number
17.
Graph
17.1.
implementation
17.2.
BFS
17.3.
DFS
17.4.
knight tour
17.5.
shortest path
17.6.
strongly conectted graph
17.7.
word ladder
17.8.
topological sort
17.8.1.
alien dictionary
17.8.2.
course schedule
17.8.3.
course schedule 2
17.8.4.
Min height tree
18.
Topological Sort
19.
DFS
19.1.
number of islands
19.2.
reconstruct itinery
19.3.
topological sort
19.4.
word search
20.
BFS
21.
Tree
22.
Binary Tree
22.1.
simple operation
22.1.1.
Balanced Tree
22.1.2.
Invert Binary Tree
22.2.
Traversal
22.2.1.
level order
22.2.2.
2 sum bst
22.2.3.
find kth smallest element in bst
22.2.4.
lowest common ancestor
22.2.5.
binary search tree iterator
22.3.
construction
22.3.1.
inorder preorder
22.3.2.
inorder postorder
22.4.
Vertical Order Traversal
22.5.
verify preorder sequence
22.6.
verify preorder serialization
22.7.
binary tree serialize/deserialize
22.8.
0303
22.8.1.
Unique Binary Search Tree
23.
Binary Search
23.1.
fast power
23.2.
closest value in bst
23.3.
kth smallest element in bst
23.4.
allocate book
23.5.
median of 2 sorted array
23.6.
painter partition problem
23.7.
find peak element
24.
Binary Search Tree
24.1.
successor
25.
Trie
25.1.
word search 2
25.2.
add search word
25.3.
shortest unique prefix
26.
Interval
27.
Dynamic Programming
27.1.
house robber
27.2.
word break
27.3.
word break II
27.4.
Paint fence
27.5.
flip game II
27.6.
Regular Expression
27.7.
decode ways
27.8.
Edit Distance
27.9.
Burst Balloon
27.10.
sotck with cooldown
28.
Union Find
28.1.
Number of Islands
29.
Segment Tree
29.1.
Implementation
29.2.
Order of people heights
30.
Binary Indexed Tree
30.1.
Implementation
30.2.
flip cards
30.3.
count of smaller number after self
30.4.
range sum query - mutable
30.5.
Range Sum Query 2D - Mutable
31.
Window Substring
31.1.
min window substring
31.2.
min size subarray sum
31.3.
max size subarray sum equal k
31.4.
sliding window maximum
31.5.
substring with concatenation of all words
32.
line sweep
32.1.
number of airlines
Powered by
GitBook
questions_review
2 sum问题
2 sum
3 sum
3 sum closest
3 sum smaller
这几个问题都可以转换为2 sum的2 pointers的做法，那么3 sum的时间复杂度是
O(nlogn + n^2)