chore: clean up content phase organization

apps/docs/content/(05-decision-space)/1d-dynamic-programming/198-house-robber.mdx

@@ -0,0 +1,44 @@
+---
+title: '198. House Robber'
+description: You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night
+icon: dot
+sidebar:
+  label: 'House Robber'
+  badge: 'Medium'
+---
+
+<Badge variant="accent">Array</Badge>
+
+### Example 1:
+- Input: `nums = [1,2,3,1]`
+- Output: `4`
+- Explanation: Rob house `1` (money = `1`) and then rob house `3` (money = `3`). Total amount you can rob = `1 + 3 = 4`.
+
+### Example 2:
+- Input: `nums = [2,7,9,3,1]`
+- Output: `12`
+- Explanation: Rob house `1` (money = `2`), rob house `3` (money = `9`) and rob house `5` (money = `1`). Total amount you can rob = `2 + 9 + 1 = 12`.
+
+### Constraints:
+
+- `1 <= nums.length <= 100`
+- `0 <= nums[i] <= 400`
+
+## Solution
+
+```py
+class Solution:
+    def rob(self, nums: list[int]) -> int:
+        n = len(nums)
+        if n == 0:
+            return 0
+        if n <= 2:
+            return max(nums)
+
+        dp = [0] * n
+        dp[0] = nums[0]
+        dp[1] = max(nums[0], nums[1])
+        for i in range(2, n):
+            dp[i] = max(dp[i - 1], dp[i - 2] + nums[i])
+        return dp[-1]
+```

apps/docs/content/(05-decision-space)/1d-dynamic-programming/322-coin-change.mdx

@@ -0,0 +1,60 @@
+---
+title: '322. Coin Change'
+description: You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money
+icon: dot
+sidebar:
+  label: 'Coin Change'
+  badge: 'Medium'
+---
+
+<Badge variant="accent">Array</Badge>
+
+### Example 1:
+- Input: `coins = [1,2,5], amount = 11`
+- Output: `3`
+- Explanation: `11 = 5 + 5 + 1`
+
+### Example 2:
+- Input: `coins = [2], amount = 3`
+- Output: `-1`
+
+### Example 3:
+- Input: `coins = [1], amount = 0`
+- Output: `0`
+
+### Constraints:
+
+- `1 <= coins.length <= 12`
+- `1 <= coins[i] <= 2^31 - 1`
+- `0 <= amount <= 10^4`
+
+## Solution
+
+```py
+from math import inf
+
+
+class Solution:
+    def coinChange(self, coins: list[int], amount: int) -> int:
+        n = len(coins)
+        memo = [[-1] * (amount + 1) for _ in range(n + 1)]
+
+        def min_coins(coins, i, amount, memo):
+            if amount == 0:
+                return 0
+            if i == 0 or amount < 0:
+                return inf
+            if memo[i][amount] != -1:
+                return memo[i][amount]
+
+            skip = min_coins(coins, i - 1, amount, memo)
+            use = min_coins(coins, i, amount - coins[i - 1], memo)
+            if use != inf:
+                use += 1
+
+            memo[i][amount] = min(skip, use)
+            return memo[i][amount]
+
+        result = min_coins(coins, n, amount, memo)
+        return result if result != inf else -1  # pyright: ignore[reportReturnType]
+```