Algorithms Collection
Introduction
1.
Unsolved problems
1.1.
Burst Balloons
1.2.
Longest increasing sequences
1.3.
Top K words in a document
1.4.
Sort Color
1.5.
Permutations with duplicates
1.6.
Find Kth node in BST
1.7.
Buy and sell stock with cooldown
1.8.
H index II
1.9.
BackPack
1.10.
DP - minimum adjustment cost
1.11.
Search in Rotated sorted array with duplicates
1.12.
Flatten binary tree to linked list
1.13.
Minimum height trees
1.14.
Serialize and deserialize binary tree
1.15.
Find the Duplicate Number
1.16.
Trapping Rain Water
1.17.
First Missing Positive
1.18.
Count of Smaller Numbers After Self
1.19.
Largest Rectangle in Histogram
1.20.
Scramble String
1.21.
N-Queens
1.22.
Minimum Window Substring
1.23.
Substring with Concatenation of All Words
1.24.
Populating Next Right Pointers in Each Node II
1.25.
Remove Invalid Parentheses
1.26.
Distinct Subsequences
1.27.
Jump Game II
1.28.
Candy
1.29.
The Skyline Problem
1.30.
Longest Valid Parentheses
1.31.
Interleaving String
1.32.
Expression Add Operators
1.33.
Binary Tree Maximum Path Sum
1.34.
Regular Expression Matching
1.35.
Palindrome Partitioning II
1.36.
Shortest Palindrome
1.37.
Wildcard Matching
1.38.
Max Points on a Line
1.39.
Sudoku Solver
1.40.
Word Ladder II
1.41.
Create Maximum Number
1.42.
Maximal Rectangle
1.43.
Reverse Nodes in k-Group
1.44.
Best Time to Buy and Sell Stock IV
2.
Code Bases
2.1.
Binary_search_variations/applications
2.2.
Binary Tree Traversal
2.3.
Remove Duplicates
2.4.
Dynamic programming collection
2.5.
Bit manipulations
2.6.
Good tricks
2.7.
Segment Tree
3.
Good blogs
3.1.
Blogs to study
3.2.
Leetcode Frequency
4.
Knowledge Bases
4.1.
OS: Process, thread
4.2.
Network
4.3.
System Design
4.4.
Java data structures
4.5.
Java Syntax
5.
Summary
5.1.
Binary Search Tree
5.2.
Binary Search
5.3.
Expression evaluation
5.4.
Combination/Permutation/Subset
5.5.
Longest string subsequence/substring problems
Powered by
GitBook
Algorithms Collection
Summary