Nerd Algorithm

#	Problem	D0	Solution	Tags	Doc
1	Two Sum	E1	Java Python	Array, Hash Table
2	Add Two Numbers	M2	Java	Linked List, Math
3	Longest Substring Without Repeating Characters	M	Java	Hash Table, Two Pointers, String, Sliding Window
4	Median of Two Sorted Arrays	H3	Java	Array, Binary Search, Divide and Conquer
5	Longest Palindromic Substring	M	Java	String, DP
6	ZigZag Conversion	M	Java	String
7	Reverse Integer	E	Java	Math
8	String to Integer (atoi)	M	Java	Math, String
9	Palindrome Number	E	Java Python	Math
10	Regular Expression Matching	H	Java	String, DP, Backtracking
11	Container With Most Water	M	Java	Array, Two Pointers
12	Integer to Roman	M	Java	Math, String
13	Roman to Integer	E	Java	Math, String
16	3Sum Closest	M	Java Python	Array, Two Pointers
38	Count and Say	E	Python	String
39	Combination Sum	M	Java Python	Array, Backtracking
40	Combination Sum II	M	Java Python	Array, Backtracking
41	First Missing Positive	H	Java Python	Array
42	Trapping Rain Water	M	Java Python	Array, Two Pointers, Stack
43	Multiply Strings	M	Python	Math, String
46	Permutations	M	Java Python	Backtracking
47	Permutations II	M	Java Python	Backtracking
48	Rotate Image	M	Python	Array
49	Group Anagrams	M	Python	Hash Table, String
50	Pow(x, n)	M	Python	Math, Binary Search
51	N-Queens	H	Python	Backtracking
52	N-Queens II	H	Python	Backtracking
53	Maximum Subarray	E	Java Python	Array, Divide and Conquer, DP
55	Jump Game	M	Python
56	Merge Intervals	M	Python
68	Text Justification	H	Python	String
78	Subsets	M	Java Python	Array, Backtracking
90	Subsets II	M	Java Python	Array, Backtracking
94	Binary Tree Inorder Traversal	M	Python	Hash Table, Stack, Tree
136	Single Number	E	Java Python	Hash Table, Bit Manipulation
144	Binary Tree Preorder Traversal	M	Python	Stack, Tree
145	Binary Tree Postorder Traversal	M	Python	Stack, Tree
216	Combination Sum III	M	Java Python	Array, Backtracking
238	Product of Array Except Self	M	Python	Array
344	Reverse String	E	Python	Two Pointers, String
377	Combination Sum IV	M	Python	Array, Backtracking
654	Maximum Binary Tree	M	Python	Tree
771	Jewels and Stones	E	Python	Hash Table
791	Custom Sort String	M	Java Python	String
807	Max Increase to Keep City Skyline	M	Python
912	Sort an Array	M
938	Range Sum of BST	E	Python	Tree, Recursion
944	Delete Columns to Make Sorted	E	Python	Greedy
946	Validate Stack Sequences	M	Java Python	Stack
955	Delete Columns to Make Sorted II	M	Python	Greedy
959	Regions Cut By Slashes	M	Python	DFS, Union Find, Graph
960	Delete Columns to Make Sorted II	H	Python	DP
961	N-Repeated Element in Size 2N Array	E	Java Python	Hash Table
962	Maximum Width Ramp	M	Java Python	Arrauy
963	Minimum Area Rectangle II	M	Java Python	Math, Geometry
964	Least Operators to Express Number	H	Java Python	Math, DP
965	Univalued Binary Tree	E	Java Python	Tree
966	Vowel Spellchecker	M	Python	Hash Table, String
967	Numbers With Same Consecutive Differences	M	Java Python	DP
969	Pancake Sorting	M	Java Python	Array, Sort
970	Powerful Integers	E	Python	Hash Table, Math
971	Flip Binary Tree To Match Preorder Traversal	M	Java Python	Tree, DFS
972	Equal Rational Numbers	H	Python	Math
973	K Closest Points to Origin	M	Python	Divide and Conquer, Heap, Sort
974	Subarray Sums Divisible by K	M	Java Python	Array, Hash Table
975	Odd Even Jump	H		DP, Stack, Ordered Map
976	Largest Perimeter Triangle	E	Java Python	Math, Sort
977	Squares of a Sorted Array	E	Python	Array, Two Pointers
978	Longest Turbulent Subarray	M	Python	Array, DP, Sliding Window
979	Distribute Coins in Binary Tree	M	Java Python	Tree, DFS
980	Unique Paths III	H	Python	Backtracking, DFS
981	Time Based Key-Value Store	M	Java Python	Hash Table Binary Search
982	Triples with Bitwise AND Equal To Zero	H	Java Python	DP
983	Minimum Cost For Tickets	M	Java Python	DP
984	String Without AAA or BBB	M	Java Python	Greedy
988	Smallest String Starting From Leaf	M	Python	Tree, DFS
1008	Construct Binary Search Tree from Preorder Traversal	M	Python	Tree

---

LeetCode Tags

Array
Stack
Heap
Tree
Graph
Linked List
Math
Hash Table
Two Pointers
String
Sliding Window
Backtracking
Recursion
Sort
Greedy
Dynamic Programming
Binary Search
Divide and Conquer
Depth-first Search
Geometry
Ordered Map
Union Find
Bit Manipulation

Tips

D: Difficulty
E: Easy Difficulty
M: Medium Difficulty
H: Hard Difficulty