Practice Makes Perfect!

Problems-Should-Practice-Repeatedly

33 Search in Rotated Sorted Array binary search
873 Length of Longest Fibonacci Subsequence dp
416 Partition Equal Subset Sum 0/1knapsack 1D dp
376 Wiggle Subsequence 1D dp with 0(N) time
967 Numbers with Same Consecutive Differences iterate digit manipulate
300 Longest Increasing Subsequence dp O(NlongN) Solution

Problems-Awesome-Solution-From-Discuss

1008 Construct Binary Search Tree from Preorder Traversal tree boundary

Problems-I-Think-Interesting

950 Reveal Cards In Increasing Order queue
392 Is Subsequence dp binary search

Problems-Tricky-And-Mysterious

371 Sum of Two Integers bit arithmetic

Problems-Use-Dynamic-Programming

198 House Robber classic
746 Min Cost Climbing Stairs classic
53 Maximum Subarray devide and conquer
983 Minimum Cost For Tickets interesting
650 2 Keys Keyboard interesting math
740 Delete and Earn transformation
813 Largest Sum of Averages interesting one-direction-iteration
322 Coin Change Completely 0/1 knapsack reference

Problems-Should-Use-Hint

808 Soup Servings when N>4800 just return 1.0

Impressive-Time-Optimized-Design

898 Bitwise ORs of Subarrays DP func3()
837 New 21 Game DP sliding window