docs(content): add issue URLs to problem pages and restructure guides into appendix

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

@@ -5,6 +5,7 @@ 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'

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

@@ -8,6 +8,7 @@ topics:
   - { name: "Breadth-First Search", slug: "breadth-first-search" }
   - { name: "Knapsack Problem", slug: "knapsack-problem" }
   - { name: "Complete Knapsack", slug: "complete-knapsack" }
+issue: "https://github.com/prdlk/leetcode/issues/159"
 sidebar:
   label: 'Coin Change'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/1d-dynamic-programming/70-climbing-stairs.mdx

@@ -6,6 +6,7 @@ topics:
   - { name: "Math", slug: "math" }
   - { name: "Dynamic Programming", slug: "dynamic-programming" }
   - { name: "Memoization", slug: "memoization" }
+issue: "https://github.com/prdlk/leetcode/issues/157"
 sidebar:
   label: 'Climbing Stairs'
   badge: 'Easy'

apps/docs/content/(05-decision-space)/backtracking/39-combination-sum.mdx

@@ -5,6 +5,7 @@ icon: dot
 topics:
   - { name: "Array", slug: "array" }
   - { name: "Backtracking", slug: "backtracking" }
+issue: "https://github.com/prdlk/leetcode/issues/150"
 sidebar:
   label: 'Combination Sum'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/backtracking/46-permutations.mdx

@@ -5,6 +5,7 @@ icon: dot
 topics:
   - { name: "Array", slug: "array" }
   - { name: "Backtracking", slug: "backtracking" }
+issue: "https://github.com/prdlk/leetcode/issues/151"
 sidebar:
   label: 'Permutations'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/backtracking/78-subsets.mdx

@@ -6,6 +6,7 @@ topics:
   - { name: "Array", slug: "array" }
   - { name: "Backtracking", slug: "backtracking" }
   - { name: "Bit Manipulation", slug: "bit-manipulation" }
+issue: "https://github.com/prdlk/leetcode/issues/149"
 sidebar:
   label: 'Subsets'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/greedy/134-gas-station.mdx

@@ -5,6 +5,7 @@ icon: dot
 topics:
   - { name: "Array", slug: "array" }
   - { name: "Greedy", slug: "greedy" }
+issue: "https://github.com/prdlk/leetcode/issues/176"
 sidebar:
   label: 'Gas Station'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/greedy/53-maximum-subarray.mdx

@@ -6,6 +6,7 @@ topics:
   - { name: "Array", slug: "array" }
   - { name: "Divide and Conquer", slug: "divide-and-conquer" }
   - { name: "Dynamic Programming", slug: "dynamic-programming" }
+issue: "https://github.com/prdlk/leetcode/issues/174"
 sidebar:
   label: 'Maximum Subarray'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/greedy/55-jump-game.mdx

@@ -6,6 +6,7 @@ topics:
   - { name: "Array", slug: "array" }
   - { name: "Dynamic Programming", slug: "dynamic-programming" }
   - { name: "Greedy", slug: "greedy" }
+issue: "https://github.com/prdlk/leetcode/issues/175"
 sidebar:
   label: 'Jump Game'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/intervals/435-non-overlapping-intervals.mdx

@@ -7,6 +7,7 @@ topics:
   - { name: "Dynamic Programming", slug: "dynamic-programming" }
   - { name: "Greedy", slug: "greedy" }
   - { name: "Sorting", slug: "sorting" }
+issue: "https://github.com/prdlk/leetcode/issues/183"
 sidebar:
   label: 'Non-overlapping Intervals'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/intervals/56-merge-intervals.mdx

@@ -6,6 +6,7 @@ topics:
   - { name: "Array", slug: "array" }
   - { name: "Sorting", slug: "sorting" }
   - { name: "Quicksort", slug: "quicksort" }
+issue: "https://github.com/prdlk/leetcode/issues/182"
 sidebar:
   label: 'Merge Intervals'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/intervals/57-insert-interval.mdx

@@ -4,6 +4,7 @@ description: You are given an array of non-overlapping intervals intervals where
 icon: dot
 topics:
   - { name: "Array", slug: "array" }
+issue: "https://github.com/prdlk/leetcode/issues/181"
 sidebar:
   label: 'Insert Interval'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/multi-d-grid-dp/1143-longest-common-subsequence.mdx

@@ -6,6 +6,7 @@ topics:
   - { name: "String", slug: "string" }
   - { name: "Dynamic Programming", slug: "dynamic-programming" }
   - { name: "Longest Common Subsequence", slug: "longest-common-subsequence" }
+issue: "https://github.com/prdlk/leetcode/issues/168"
 sidebar:
   label: 'Longest Common Subsequence'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/multi-d-grid-dp/62-unique-paths.mdx

@@ -6,6 +6,7 @@ topics:
   - { name: "Math", slug: "math" }
   - { name: "Dynamic Programming", slug: "dynamic-programming" }
   - { name: "Combinatorics", slug: "combinatorics" }
+issue: "https://github.com/prdlk/leetcode/issues/166"
 sidebar:
   label: 'Unique Paths'
   badge: 'Medium'

apps/docs/content/(05-decision-space)/multi-d-grid-dp/64-minimum-path-sum.mdx

@@ -6,6 +6,7 @@ topics:
   - { name: "Array", slug: "array" }
   - { name: "Dynamic Programming", slug: "dynamic-programming" }
   - { name: "Matrix", slug: "matrix" }
+issue: "https://github.com/prdlk/leetcode/issues/167"
 sidebar:
   label: 'Minimum Path Sum'
   badge: 'Medium'