Solutions

one dimension

Exponentiation by Squaring
Permutation
Combination with Repetition
Top-Down Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming with MiniMax
Bottom-Up Dynamic Programming with MiniMax
Bottom-Up Dynamic Programming by Reverse Thinking
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming from back
Bottom-up Dynamic Programming with Knapsack
Top-Down Dynamic Programming with Bitmasks

two dimensions

Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming with Heap
Bottom-Up Dynamic Programming with Sort, O(MN) Time If Use Quickselect
Top-Down Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Counts on Pairs
General Solution of Counting on Pairs
Bottom-Up Dynamic Programming
Utilize LeetCode 84
Top-Down Dynamic Programming with Bitmasks
Top-Down Dynamic Programming

advanced

Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Bottom-Up Dynamic Programming
Two Pointers
Top-Down Dynamic Programming by Reverse Thinking
Bottom-Up Dynamic Programming

--

--