db/fix: Remove duplicates

Author: mohamed-sallam

db/problems.js

@@ -647,32 +647,6 @@ export const problems = [
     ],
     tags: ["Array", "Stack"],
   },
-  {
-    id: "L378",
-    title: "Kth Smallest Element in a Sorted Matrix",
-    difficulty: Difficulty.MEDIUM,
-    patterns: [patterns.K_wayMerge],
-    url: "https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix",
-    solutions: [],
-    companies: [
-      "Adobe",
-      "Amazon",
-      "Apple",
-      "Facebook",
-      "Google",
-      "Microsoft",
-      "Twitter",
-      "Uber",
-      "Walmart Labs",
-    ],
-    tags: [
-      "Array",
-      "Binary Search",
-      "Sorting",
-      "Heap (Priority Queue)",
-      "Matrix",
-    ],
-  },
   {
     id: "L424",
     title: "Longest Repeating Character Replacement",
@@ -811,15 +785,38 @@ export const problems = [
     ],
   },
   {
-    id: "L1371",
+    id: "L1249",
     title: "Minimum Remove to Make Valid Parentheses",
     difficulty: Difficulty.MEDIUM,
     patterns: [patterns.Stacks],
     url: "https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses",
-    solutions: [],
+    solutions: [
+      {
+        title:
+          "Minimum Remove to Make Valid Parentheses - Leetcode 1249 - Python",
+        site: sites.yt,
+        url: "https://www.youtube.com/watch?v=mgQ4O9iUEbg",
+      },
+    ],
     companies: ["Microsoft"],
     tags: ["String", "Stack"],
   },
+  {
+    id: "G2",
+    title: "Minimum Window Subsequence",
+    difficulty: Difficulty.HARD,
+    patterns: [patterns.SlidingWindow],
+    url: "https://www.geeksforgeeks.org/problems/minimum-window-subsequence",
+    solutions: [
+      {
+        title: "Solution: Minimum Window Subsequence",
+        site: {},
+        url: "https://algo.monster/liteproblems/727",
+      },
+    ],
+    companies: ["Amazon", "Bloomberg", "eBay", "Google", "Houzz", "Microsoft"],
+    tags: ["String", "Sliding Window", "Dynamic Programming"],
+  },
   {
     id: "L234",
     title: "Palindrome Linked List",
@@ -850,47 +847,6 @@ export const problems = [
     ],
     tags: ["Linked List", "Two Pointers", "Stack", "Recursion", "Grind75"],
   },
-  {
-    id: "L76",
-    title: "Minimum Window Substring",
-    difficulty: Difficulty.HARD,
-    patterns: [patterns.SlidingWindow],
-    url: "https://leetcode.com/problems/minimum-window-substring",
-    solutions: [
-      {
-        title:
-          "Minimum Window Substring - Airbnb Interview Question - Leetcode 76",
-        site: sites.yt,
-        url: "https://www.youtube.com/watch?v=jSto0O4AJbM",
-      },
-    ],
-    companies: [
-      "Adobe",
-      "Airbnb",
-      "Amazon",
-      "Apple",
-      "Bloomberg",
-      "Cohesity",
-      "Deutsche Bank",
-      "Facebook",
-      "GoDaddy",
-      "Goldman Sachs",
-      "Google",
-      "LinkedIn",
-      "Lyft",
-      "Microsoft",
-      "Nutanix",
-      "Oracle",
-      "Snapchat",
-      "Twitter",
-      "Uber",
-      "Visa",
-      "VMware",
-      "Walmart Labs",
-      "Yahoo",
-    ],
-    tags: ["Hash Table", "String", "Sliding Window", "Blind75", "Grind75"],
-  },
   {
     id: "L908",
     title: "Middle of the Linked List",
@@ -1280,39 +1236,6 @@ export const problems = [
     ],
     tags: ["Linked List", "Recursion", "Grind75"],
   },
-  {
-    id: "L116",
-    title: "Populating Next Right Pointers in Each Node",
-    difficulty: Difficulty.MEDIUM,
-    patterns: [patterns.TreeBreadthFirstSearch],
-    url: "https://leetcode.com/problems/populating-next-right-pointers-in-each-node",
-    solutions: [
-      {
-        title:
-          "Populating Next Right Pointers in Each Node - Leetcode 116 - Python",
-        site: sites.yt,
-        url: "https://www.youtube.com/watch?v=U4hFQCa1Cq0",
-      },
-    ],
-    companies: [
-      "Amazon",
-      "Apple",
-      "Bloomberg",
-      "Facebook",
-      "Google",
-      "Microsoft",
-      "Nutanix",
-      "Oracle",
-      "VMware",
-    ],
-    tags: [
-      "Linked List",
-      "Tree",
-      "Depth-First Search",
-      "Breadth-First Search",
-      "Binary Tree",
-    ],
-  },
   {
     id: "L242",
     title: "Valid Anagram",
@@ -4130,19 +4053,12 @@ export const problems = [
     tags: ["Depth-First Search", "Breadth-First Search", "Union Find", "Graph"],
   },
   {
-    id: "L1249",
+    id: "L1146",
     title: "Snapshot Array",
     difficulty: Difficulty.MEDIUM,
     patterns: [patterns.CustomDataStructures],
     url: "https://leetcode.com/problems/snapshot-array",
-    solutions: [
-      {
-        title:
-          "Minimum Remove to Make Valid Parentheses - Leetcode 1249 - Python",
-        site: sites.yt,
-        url: "https://www.youtube.com/watch?v=mgQ4O9iUEbg",
-      },
-    ],
+    solutions: [],
     companies: ["Amazon", "Bloomberg", "Facebook"],
     tags: ["Array", "Hash Table", "Binary Search", "Design"],
   },
@@ -4913,40 +4829,6 @@ export const problems = [
     companies: ["Uber"],
     tags: ["Array", "Hash Table", "String", "Trie"],
   },
-  {
-    id: "L621",
-    title: "Task Scheduler",
-    difficulty: Difficulty.MEDIUM,
-    patterns: [patterns.TwoHeaps],
-    url: "https://leetcode.com/problems/task-scheduler",
-    solutions: [
-      {
-        title: "Task Scheduler - Leetcode 621 - Python",
-        site: sites.yt,
-        url: "https://www.youtube.com/watch?v=s8p8ukTyA2I",
-      },
-    ],
-    companies: [
-      "Amazon",
-      "Apple",
-      "Facebook",
-      "Google",
-      "Microsoft",
-      "Nutanix",
-      "Oracle",
-      "Uber",
-      "VMware",
-    ],
-    tags: [
-      "Array",
-      "Hash Table",
-      "Greedy",
-      "Sorting",
-      "Heap (Priority Queue)",
-      "Counting",
-      "Grind75",
-    ],
-  },
   {
     id: "L1095",
     title: "Two City Scheduling",