Table of Contents
Buy and sell stock with cooldown
Search in Rotated sorted array with duplicates
Flatten binary tree to linked list
Serialize and deserialize binary tree
Count of Smaller Numbers After Self
Largest Rectangle in Histogram
Substring with Concatenation of All Words
Populating Next Right Pointers in Each Node II
Best Time to Buy and Sell Stock IV
Binary_search_variations/applications
Dynamic programming collection
Combination/Permutation/Subset
Longest string subsequence/substring problems
Table of Contents
Burst Balloons 1.1
Longest increasing sequences 1.2
Sort Color 1.4
Permutations with duplicates 1.5
Buy and sell stock with cooldown 1.7
H index II 1.8
BackPack 1.9
DP - minimum adjustment cost 1.10
Search in Rotated sorted array with duplicates 1.11
Flatten binary tree to linked list 1.12
Minimum height trees 1.13
Serialize and deserialize binary tree 1.14
Find the Duplicate Number 1.15
Trapping Rain Water 1.16
Count of Smaller Numbers After Self 1.18
Largest Rectangle in Histogram 1.19
Scramble String 1.20
N-Queens 1.21
Substring with Concatenation of All Words 1.23
Populating Next Right Pointers in Each Node II 1.24
Remove Invalid Parentheses 1.25
Jump Game II 1.27
Candy 1.28
The Skyline Problem 1.29
Longest Valid Parentheses 1.30
Interleaving String 1.31
Binary Tree Maximum Path Sum 1.33
Regular Expression Matching 1.34
Palindrome Partitioning II 1.35
Shortest Palindrome 1.36
Wildcard Matching 1.37
Max Points on a Line 1.38
Sudoku Solver 1.39
Word Ladder II 1.40
Maximal Rectangle 1.42
Best Time to Buy and Sell Stock IV 1.44
Binary_search_variations/applications 2.1
Dynamic programming collection 2.4
Good tricks 2.6
Segment Tree 2.7
Blogs to study 3.1
Network 4.2
System Design 4.3
Java Syntax 4.5
Summary 5
Binary Search 5.2