Skip to content

Dynamic Programming

Jump to bottom
Cenk Canarslan edited this page Oct 4, 2023 · 13 revisions
PROBLEM DESCR. SOLUTION DIFFICULTY RELATED TOPICS ADDITIONAL INFO
LeetCode 53. Maximum Subarray 🟢Easy Array, Divide and Conquer, Dynamic Programming Problem Set / Algorithms
LeetCode 64. Minimum Path Sum 🟠Medium Array, Dynamic Programming Problem Set / Algorithms
LeetCode 70. Climbing Stairs 🟢Easy Math, Dynamic Programming, Memoization Problem Set / Algorithms
LeetCode 118. Pascal's Triangle 🟢Easy Array, Dynamic Programming Problem Set / Algorithms
LeetCode 121. Best Time to Buy and Sell Stock 🟢Easy Array, Dynamic Programming Problem Set / Algorithms
LeetCode 124. Binary Tree Maximum Path Sum 🔴Hard Dynamic Programming, Tree, Depth-first Search, Binary Tree Problem Set / Algorithms
LeetCode 139. Word Break 🟠Medium Hash Table, String, Dynamic Programming, Trie, Memoization Problem Set / Algorithms
LeetCode 198. House Robber 🟠Medium Array, Dynamic Programming Problem Set / Algorithms
LeetCode 213. House Robber II 🟠Medium Array, Dynamic Programming Problem Set / Algorithms
LeetCode 300. Longest Increasing Subsequence 🟠Medium Array, Binary Search, Dynamic Programming Problem Set / Algorithms
LeetCode 509. Fibonacci Number 🟢Easy Math, Dynamic Programming, Recursion, Memoization Problem Set / Algorithms
LeetCode 518. Coin Change II 🟠Medium Array, Dynamic Programming Problem Set / Algorithms
LeetCode 746. Min Cost Climbing Stairs 🟢Easy Array, Dynamic Programming Problem Set / Algorithms
LeetCode 1137. N-th Tribonacci Number 🟢Easy Math, Dynamic Programming, Memoization Problem Set / Algorithms
LeetCode 1143. Longest Common Subsequence 🟠Medium String, Dynamic Programming Problem Set / Algorithms
Misc 0/1 Knapsack Problem 🟠Medium Dynamic Programming Problem Set / Algorithms
👈 Wiki Home 👆 Algorithms Main Page 👤 cenkc
Clone this wiki locally