db/feat: Add some resources from AlgoMonster

Author: mohamed-sallam

db/patterns.js

@@ -24,6 +24,11 @@ export const patterns = {
         url: "https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.0-introduction",
         site: {},
       },
+      {
+        title: "Tech Interview Pattern | Two Pointers Introduction",
+        url: "https://algo.monster/problems/two_pointers_intro",
+        site: {},
+      },
     ],
   },
   FastAndSlowPointers: {
@@ -108,7 +113,13 @@ export const patterns = {
   },
   DynamicProgramming: {
     name: "Dynamic Programming",
-    articles: [],
+    articles: [
+      {
+        title: "Dynamic Programming Introduction and Patterns",
+        url: "https://algo.monster/problems/dynamic_programming_intro",
+        site: {},
+      },
+    ],
   },
   CyclicSort: {
     name: "Cyclic Sort",
@@ -122,7 +133,13 @@ export const patterns = {
   },
   TopologicalSort: {
     name: "Topological Sort",
-    articles: [],
+    articles: [
+      {
+        title: "Topological Sort | Topological Order",
+        url: "https://algo.monster/problems/topo_intro",
+        site: {},
+      },
+    ],
   },
   Matrices: {
     name: "Matrices",
@@ -134,11 +151,23 @@ export const patterns = {
   },
   Graphs: {
     name: "Graphs",
-    articles: [],
+    articles: [
+      {
+        title: "Graph Fundamentals",
+        url: "https://algo.monster/problems/graph_intro",
+        site: {},
+      },
+    ],
   },
   TreeDepthFirstSearch: {
     name: "Tree Depth First Search",
-    articles: [],
+    articles: [
+      {
+        title: "DFS on Trees",
+        url: "https://algo.monster/problems/dfs_on_trees_intro",
+        site: {},
+      },
+    ],
   },
   TreeBreadthFirstSearch: {
     name: "Tree Breadth First Search",
@@ -148,6 +177,11 @@ export const patterns = {
         url: "https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.0-introduction",
         site: {},
       },
+      {
+        title: "Breadth First Search on Trees",
+        url: "https://algo.monster/problems/bfs_intro",
+        site: {},
+      },
     ],
   },
   Trie: {
@@ -164,15 +198,27 @@ export const patterns = {
   },
   UnionFind: {
     name: "Union Find",
-    articles: [],
+    articles: [
+      {
+        title: "Union Find | Disjoint Set Union Data Structure Introduction",
+        url: "https://algo.monster/problems/dsu_intro",
+        site: {},
+      },
+    ],
   },
   CustomDataStructures: {
     name: "Custom Data Structures",
     articles: [],
   },
   BitwiseManipulation: {
     name: "Bitwise Manipulation",
-    articles: [],
+    articles: [
+      {
+        title: "Bitmask Introduction",
+        url: "https://algo.monster/problems/bitmask_intro",
+        site: {},
+      },
+    ],
   },
   ChallengeYourself: {
     name: "Challenge Yourself",

db/problems.js

@@ -3498,7 +3498,13 @@ export const problems = [
     difficulty: Difficulty.MEDIUM,
     patterns: [patterns.DynamicProgramming],
     url: "https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/",
-    solutions: [],
+    solutions: [
+      {
+        title: "0-1 Knapsack",
+        site: {},
+        url: "https://algo.monster/problems/knapsack_intro",
+      },
+    ],
     companies: [],
     tags: ["Dynamic Programming", "Greedy"],
   },