feat: refactored docs structure

docs/(05-decision-space)/1d-dynamic-programming/(problems)/198_house-robber.mdx

@@ -0,0 +1,46 @@
+---
+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
+topics:
+  - { name: "Array", slug: "array" }
+  - { name: "Dynamic Programming", slug: "dynamic-programming" }
+issue: "https://github.com/prdlk/leetcode/issues/158"
+sidebar:
+  label: 'House Robber'
+  badge: 'Medium'
+---
+
+### 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]
+```