My LeetCode Solutions

This is an ongoing project, and by far they are written in Jupyter Notebooks. These notebooks are public in my GitHub, but here for better view, they are rendered on by the nbviewer directly.

Feel free click the Code button above, or here:

nbviewer is an open source project under the larger Project Jupyter. If you see warning message on phone, please change to Chrome browser / or view it on desktop.

Some categories (not all listed):

Dynamic Programming

Records:

Table 1: Process
Count	Number	Name	Section
0	49	Group Anagrams	Array and Hashing
1	128	Longest Consecutive Sequence	Array and Hashing
2	17	Letter Combinations of a Phone Number	Backtracking
3	22	Generate Parentheses	Backtracking
4	39	Combination Sum	Backtracking
5	40	Combination Sum II	Backtracking
6	46	Permutations	Backtracking
7	47	Permutations II	Backtracking
8	78	Subsets	Backtracking
9	780	Reaching Points	Backtracking
10	33	Search in Rotated Sorted Array	Binary Search
11	34	Find First and Last Position of Element in Sorted Array	Binary Search
12	200	Number of Islands	DFS
13	207	Course Schedule	DFS
14	3	Longest Substring Without Repeating Characters	Double Pointers
15	11	Container With Most Water	Double Pointers
16	15	3Sum	Double Pointers
17	75	Sort Colors	Double Pointers
18	142	Linked List Cycle II	Double Pointers
19	167	Two Sum II	Double Pointers
20	283	Move Zeroes	Double Pointers
21	287	Find the Duplicate Number	Double Pointers
22	713	Subarray Product Less Than K	Double Pointers
23	-1	0-1 Knap Sack Problem	Dynamic Programming
24	5	Longest Palindromic Substring	Dynamic Programming
25	64	Minimum Path Sum	Dynamic Programming
26	139	Word Break	Dynamic Programming
27	152	Maximum Product Subarray	Dynamic Programming
28	198	House Robber	Dynamic Programming
29	221	Maximal Square	Dynamic Programming
30	279	Perfect Squares	Dynamic Programming
31	300	Longest Increasing Subsequence	Dynamic Programming
32	309	Best Time to Buy and Sell Stock with Cooldown	Dynamic Programming
33	322	Coin Change	Dynamic Programming
34	377	Combination Sum IV	Dynamic Programming
35	416	Partition Equal Subset Sum	Dynamic Programming
36	494	Target Sum	Dynamic Programming
37	647	Palindromic Substrings	Dynamic Programming
38	1049	Last Stone Weight II	Dynamic Programming
39	1143	Longest Common Subsequence	Dynamic Programming
40	1387	Sort Integers by The Power Value	Dynamic Programming
41	2218	Maximum Value of K Coins From Piles	Dynamic Programming
42	347	Top K Frequent Elements	Heap
43	56	Merge Intervals	Misc
44	136	Single Number	Misc
45	189	Rotate Array	Misc
46	204	Count Primes	Misc
47	238	Product of Array Except Self	Misc
48	384	Shuffle an Array	Misc
49	470	Implement Rand10	Misc
50	496	Next Greater Element I	Monotonic Stack
51	739	Daily Temperatures	Monotonic Stack
52	304	Range Sum Query 2D	Prefix Sum
53	370	Range Addition	Prefix Sum
54	215	Kth Largest Element in an Array	Quick Selection
55	209	Minimum Size Subarray Sum	Sliding Window
56	239	Sliding Window Maximum	Sliding Window
57	424	Longest Repeating Character Replacement	Sliding Window

LeetCode