Dynamic Programming

No.	Title	Solution	Difficulty	TimeComplexity	SpaceComplexity	Favorite	Acceptance
0042	Trapping Rain Water		Hard				50.8%
0053	Maximum Subarray		Easy	O(n)	O(n)		47.6%
0062	Unique Paths		Medium	O(n^2)	O(n^2)		55.7%
0063	Unique Paths II		Medium	O(n^2)	O(n^2)		35.2%
0064	Minimum Path Sum		Medium	O(n^2)	O(n^2)		56.0%
0070	Climbing Stairs		Easy	O(n)	O(n)		48.5%
0091	Decode Ways		Medium	O(n)	O(n)		26.3%
0095	Unique Binary Search Trees II		Medium				42.2%
0096	Unique Binary Search Trees		Medium	O(n)	O(n)		54.2%
0120	Triangle		Medium	O(n^2)	O(n)		45.5%
0121	Best Time to Buy and Sell Stock		Easy	O(n)	O(1)		51.3%
0131	Palindrome Partitioning		Medium				51.5%
0152	Maximum Product Subarray		Medium	O(n)	O(1)		32.7%
0174	Dungeon Game		Hard				33.2%
0198	House Robber		Medium	O(n)	O(n)		42.8%
0213	House Robber II		Medium	O(n)	O(n)		37.4%
0300	Longest Increasing Subsequence		Medium	O(n log n)	O(n)		43.7%
0303	Range Sum Query - Immutable		Easy				47.2%
0309	Best Time to Buy and Sell Stock with Cooldown		Medium	O(n)	O(n)		48.1%
0322	Coin Change		Medium	O(n)	O(n)		37.0%
0337	House Robber III		Medium				51.7%
0338	Counting Bits		Medium	O(n)	O(n)		70.3%
0343	Integer Break		Medium	O(n^2)	O(n)		51.1%
0354	Russian Doll Envelopes		Hard				36.1%
0357	Count Numbers with Unique Digits		Medium	O(1)	O(1)		48.8%
0392	Is Subsequence		Easy	O(n)	O(1)		49.5%
0410	Split Array Largest Sum		Hard				46.1%
0416	Partition Equal Subset Sum		Medium	O(n^2)	O(n)		44.8%
0474	Ones and Zeroes		Medium				43.5%
0494	Target Sum		Medium				45.8%
0638	Shopping Offers		Medium				52.7%
0714	Best Time to Buy and Sell Stock with Transaction Fee		Medium	O(n)	O(1)		55.9%
0718	Maximum Length of Repeated Subarray		Medium				50.2%
0746	Min Cost Climbing Stairs		Easy	O(n)	O(1)		50.9%
0838	Push Dominoes		Medium	O(n)	O(n)		49.7%
0887	Super Egg Drop		Hard				27.0%
0898	Bitwise ORs of Subarrays		Medium				34.0%
0920	Number of Music Playlists		Hard				47.7%
0968	Binary Tree Cameras		Hard				38.5%
0978	Longest Turbulent Subarray		Medium				46.6%
1025	Divisor Game		Easy	O(1)	O(1)		66.2%
1049	Last Stone Weight II		Medium				45.0%
1074	Number of Submatrices That Sum to Target		Hard				61.5%
1105	Filling Bookcase Shelves		Medium				57.7%
1235	Maximum Profit in Job Scheduling		Hard				47.0%
1463	Cherry Pickup II		Hard				69.4%
1641	Count Sorted Vowel Strings		Medium				77.3%
1654	Minimum Jumps to Reach Home		Medium				26.2%
1655	Distribute Repeating Integers		Hard				40.5%
1659	Maximize Grid Happiness		Hard				35.3%
1664	Ways to Make a Fair Array		Medium				60.7%
1690	Stone Game VII		Medium				47.0%
------------	-------------------------------------------------------	-------	----------------	---------------	-------------	-------------	-------------