CodeNotes
Introduction
1.1.
Introduction
Binary Search
2.1.
Binary Search
2.2.
First Position of Target
2.3.
Last Position of Target
2.4.
Search for a Range
2.5.
K Closest Numbers In Sorted Array
2.6.
Sqrt(x)
2.7.
Search in a Big Sorted Array
2.8.
Divide Two Integers
2.9.
Search a 2D Matrix
2.10.
Search a 2D Matrix II
2.11.
Wood Cut
2.12.
Copy Books
2.13.
Find Peak Element
2.14.
Find Minimum in Rotated Sorted Array
2.15.
Find Minimum in Rotated Sorted Array II
2.16.
Search in Rotated Sorted Array
2.17.
Search in Rotated Sorted Array II
2.18.
Flatten Binary Tree to Linked List
2.19.
Smallest Rectangle Enclosing Black Pixels
Binary Tree
3.1.
Binary Tree
3.2.
Symmetric Binary Tree
3.3.
Subtree
3.4.
Lowest Common Ancestor
3.5.
Lowest Common Ancestor III
3.6.
Complete Binary Tree
3.7.
Subtree with Maximum Average
3.8.
Maximum Depth of Binary Tree
3.9.
Binary Tree Maximum Path Sum
3.10.
Binary Tree Maximum Path Sum II
3.11.
Binary Search Tree Iterator
3.12.
Validate Binary Search Tree
3.13.
Search Range in Binary Search Tree
3.14.
Inorder Successor in Binary Search Tree
3.15.
Binary Tree Zigzag Level Order Traversal
3.16.
Construct Binary Tree from Preorder and Inorder Traversal
3.17.
Construct Binary Tree from Inorder and Postorder Traversal
3.18.
Remove Node in Binary Search Tree
3.19.
Subtree with Maximum Average
3.20.
Binary Tree Longest Consecutive Sequence
3.21.
Flatten Binary Tree to Linked List
3.22.
Binary Tree Paths
Array
4.1.
Sort
4.1.1.
QuickSort
4.1.2.
MergeSort
4.1.3.
Counting Sort
4.1.4.
Rainbow Sort
4.1.5.
Bucket Sort
4.1.6.
Radix Sort
4.2.
Sort Ext
4.2.1.
Merge Intervals
4.2.2.
Reverse Pairs
4.2.3.
Intersection of Two Arrays II
4.3.
Quick Select
4.3.1.
Kth Largest Element
4.3.2.
Kth Smallest Numbers in Unsorted Array
4.4.
Prefix Sum
4.4.1.
Maximum Subarray
4.4.2.
Maximum Product Subarray
4.4.3.
Subarray Sum Closest
4.4.4.
Maximum Subarray II
4.4.5.
Maximum Subarray Difference
4.4.6.
Best Time to Buy and Sell Stock III
4.5.
Two Pointers
4.5.1.
Two Sum
4.5.2.
Two Sum Closest
4.5.3.
Three Sum
4.5.4.
Two Sum II
4.5.5.
Triangle Count
4.5.6.
Three Sum Closest
4.5.7.
Sort Colors
4.5.8.
Ugly Number II
4.5.9.
Super Ugly Number
4.5.10.
Trapping Rain Water
4.5.11.
Valid Palindrome
4.5.12.
Container With Most Water
4.5.13.
Nuts & Bolts Problem
4.5.14.
Interleaving Positive and Negative Numbers
4.5.15.
Longest Palindromic Substring
4.6.
Sliding window Two Pointers
4.6.1.
Minimum Size Subarray Sum
4.6.2.
Longest Substring Without Repeating Characters
4.6.3.
Longest Substring with At Most K Distinct Characters
4.6.4.
Minimum Window Substring
4.7.
Others
4.7.1.
Median of two Sorted Arrays
Linked List
5.1.
Sort List
5.2.
Intersection of Two Linked Lists
5.3.
Reverse Linked List II
5.4.
Linked List Cycle II
5.5.
Copy List with Random Pointer
5.6.
Remove Duplicates from Sorted List II
Dynamic Programming
6.1.
Coordinates DP
6.2.
Sequence DP
6.2.1.
House Robber
6.3.
Double Sequence DP
6.3.1.
Longest Common Subsequence
6.3.2.
Longest Repeating Subsequence
6.3.3.
Sliding Window Matrix Maximum
6.3.4.
Maximal Square
6.3.5.
Longest Increasing Continuous subsequence II
6.4.
Split DP
6.4.1.
Post Office Problem
6.5.
Backpack DP
6.5.1.
Number of Ways to Represent N Cents
6.6.
Interval DP
6.6.1.
Drop Eggs II
6.7.
Game DP
6.7.1.
Coins in a Line
6.7.2.
Coins in a Line II
6.7.3.
Coins in a Line III
Data Structure
7.1.
Stack
7.1.1.
Stack Sorting
7.1.2.
Min Stack
7.1.3.
Implement Queue by Two Stacks
7.1.4.
Implement Three Stacks by Single Array
7.1.5.
Expression Evaluation
7.1.6.
Convert Expression to Polish Notation
7.1.7.
Convert Expression to Reverse Polish Notation
7.2.
Queue
7.2.1.
Top k Largest Numbers II
7.2.2.
Top K Frequent Words
7.2.3.
Largest Rectangle in Histogram
7.2.4.
Kth Smallest Sum In Two Sorted Arrays
7.2.5.
Kth Smallest Number in Sorted Matrix
7.2.6.
Merge k Sorted Arrays
7.2.7.
Trapping Rain Water II
7.3.
Two Queue
7.3.1.
Animal Shelter
7.3.2.
Data Stream Median
7.3.3.
Sliding Window Median
7.4.
Sweep Line
7.4.1.
Number of Airplanes in the Sky
7.4.2.
Building Outline
7.5.
Deque
7.5.1.
Sliding Window Maximum
7.6.
Hash
7.6.1.
LRU Cache
7.6.2.
LFU Cache
7.6.3.
Longest Consecutive Sequence
7.7.
Segment Tree
7.7.1.
Count of Smaller Number before itself
7.7.2.
Interval Sum II
7.8.
Trie
7.8.1.
Add and Search Word
7.8.2.
Word Search II
7.9.
UnionFInd
7.9.1.
Graph Valid Tree
7.9.2.
Number of Islands II
Graph
8.1.
Find the Connected Component in the Undirected Graph
8.2.
Topological Sorting
8.3.
BFS
8.3.1.
Number of Islands
8.3.2.
Six Degrees
8.3.3.
Clone Graph
8.3.4.
Knight Shortest Path
8.3.5.
Build Post Office II
8.4.
Topological Sort
8.4.1.
Course Schedule II
8.4.2.
Sequence Reconstruction
Search
9.1.
N-Queens II
9.2.
Find the Missing Number II
9.3.
Subsets
9.4.
Subsets II
9.5.
Combination Sum
9.6.
Combination Sum II
9.7.
Palindrome Partitioning
9.8.
Word Ladder II
9.9.
k Sum II
9.10.
Word Search
9.11.
Permutations II
Bit manipulation
10.1.
Single Number
10.2.
Find the Missing Number
10.3.
Update Bits
Math
11.1.
Sqrt(x) II
11.2.
Pow(x, n)
11.3.
Fast Power
Interesting
12.1.
Lexicographical Numbers
12.2.
Drop Eggs
12.3.
Next Permutation
12.4.
Previous Permutation
12.5.
String Permutation II
Powered by
GitBook
Introduction
All coding questions are from
Lintcode
or
Leetcode
.
results matching "
"
No results matching "
"