ladder_base
My Awesome Notes
Defining Methods
0_Outline
0_Skeleton
1 strStr & Coding style
strStr
Subsets_dup
Subsets II_dup
Permutation
Permutation II
2 Binary Search
Search Insert Position
Search a 2D Matrix
First Position of Target
Search in a Big Sorted Array(Ladder)
Wood Cut
Find Minimum in Rotated Sorted Array
Find Peak Element
First Bad Version
Search in Rotated Sorted Array
Search for a Range
Total Occurrence of Target(Ladder)
Closest Number in Sorted Array(Ladder)
Last Position of Target(Ladder)
Classical Binary Search(Ladder)
K Closest Numbers In Sorted Array(Ladder)
Find Minimum in Rotated Sorted Array II
Search in Rotated Sorted Array II
Search a 2D Matrix II
Drop Eggs(Ladder)
Maximum Number in Mountain Sequence (Ladder)
Divide Two Integers
3 Binary Tree & Divide Conquer
Maximum Depth of Binary Tree
Balanced Binary Tree
Binary Tree Preorder Traversal
Binary Tree Maximum Path Sum II (Ladder)
Inorder Successor In Binary Search Tree (Ladder)
Validate Binary Search Tree
Binary Tree Maximum Path Sum
Lowest Common Ancestor
Binary Tree Level Order Traversal
Binary Search Tree Iterator
Binary Tree Path Sum (Ladder)
Lowest Common Ancestor II (Ladder)
Tweaked Identical Binary Tree (Ladder)
Identical Binary Tree
Symmetric Binary Tree (Ladder)
Complete Binary Tree (Ladder)
Minimum Depth of Binary Tree
Insert Node in a Binary Search Tree
Binary Tree Postorder Traversal
Binary Tree Inorder Traversal
Construct Binary Tree From Preorder and Inorder
Construct Binary Tree From Inorder and Postorder
Binary Tree Zigzag Level Order Traversal
Binary Tree Level Order Traversal II
Search Range in Binary Search Tree
Binary Tree Serialization
Remove Node in Binary Search Tree
Expression Expand (Ladder)
4 Dynamic Programming Basic
Unique Paths II
Unique Paths
Climbing Stairs
Minimum Path Sum
Triangle
Jump Game II
Jump Game
Longest Increasing Sub sequence
5 Dynamic Programming Normal
Edit Distance
Distinct Subsequences
Word Break
Palindrome Partitioning II
Longest Common Substring
Longest Common Subsequence
Interleaving String
Decode Ways
Backpack II
Backpack
Minimum Adjustment Cost
Wildcard Matching
k Sum
Drop Eggs II (ladder)
Word Break II (Ladder)
6 Linked List
Remove Nth Node From End of List
Partition List
Remove Duplicates from Sorted List II
Convert Sorted List to Balanced BST
Copy List Wirh Random Pointer
Merge k Sorted Lists
Reorder List
Sort List
Reverse Linked List II
Linked List Cycle II
Middle of Linked List (ladder)
Remove Linked List Elements
Remove Duplicates from Unsorted List (ladder)
Swap Nodes in Pairs
Delete Node in the Middle of Singly Linked List
Insertion Sort List
Add Two Numbers
Nth to Last Node in List
Merge Two Sorted Lists
Remove Duplicates from Sorted List
Reverse Linked List
Swap Two Nodes in Linked List
Add Two Numbers II (Ladder)
Palindrome Linked List
Convert Binary Search Tree to Doubly Linked List (Ladder)
Rotate List
Linked List Cycle
Reverse Nodes in k-Group
7 Arrays & Numbers
Intersection of Two Arrays
Subarray Sum
Merge Sorted Array
Maximum Subarray
Two Sum Closest (Ladder)
Sort Colors
Subarray Sum Closest
Two Sum
Partition Array
Median of two Sorted Arrays
Minimum Subarray
Merge Two Sorted Arrays
Maximum Product Subarray
Best Time to Buy and Sell Stock III
Best Time to Buy and Sell Stock II
Best Time to Buy and Sell Stock
Sort Colors II
4 Sum
3 Sum
Sort Letters by Case
Maximum Subarray II
Best Time to Buy and Sell Stock IV
Maximum Subarray III
8 Data Structure
Hash Function
Top k Largest Numbers (Ladder)
Merge k Sorted Arrays (Ladder)
Rehashing
Implement Queue by Two Stacks
Min Stack
Ugly Number II
LRU Cache
Largest Rectangle in Histogram
Implement Stack (Ladder)
Implement Stack by Two Queues (Ladder)
Implement Queue by Linked List II (Ladder)
Implement Queue by Linked List (Ladder)
Top k Largest Numbers II (Ladder)
Stack Sorting (Ladder)
Top k Frequent Words (Ladder)
Heapify
Longest Consecutive Sequence
Animal Shelter (Ladder)
LFU Cache (Ladder)
Max Tree (Ladder)
Implement Three Stacks by Single Array (Ladder)
9 Graph & Search
Six Degrees (Ladder)
Palindrome Partitioning
Find the Connected Component in the Undirected Graph (Ladder)
Clone Graph
Combination Sum
Topological Sorting
N Queens II
Subsets II
Permutations II
*Word Ladder II
String Permutation II (Ladder)
Word Ladder
k Sum II
N Queens
Subsets
Permutations
10 Seleted Problems in Past Examinations
Climbing Stairs II(ladder)
Lowest Common Ancestor III(ladder)
Find the Missing Number II(ladder)
Number of Ways to Represent N Cents(ladder)
Number of Ways to Represent N Cents II
Find the Weak Connected Component in the Directed Graph (ladder)
Add and Search Word
233 Add Easy
Fibonacci
Powered by
GitBook
My Awesome Notes
My Awesome Notes
The whole set of pages are the notes for learning algothrim in cpp.
results matching "
"
No results matching "
"