Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 3eddf9d

Browse files
db/fix: Remove duplicates
1 parent 8d169f4 commit 3eddf9d

File tree

1 file changed

+27
-145
lines changed

1 file changed

+27
-145
lines changed

‎db/problems.js

Lines changed: 27 additions & 145 deletions
Original file line numberDiff line numberDiff line change
@@ -647,32 +647,6 @@ export const problems = [
647647
],
648648
tags: ["Array", "Stack"],
649649
},
650-
{
651-
id: "L378",
652-
title: "Kth Smallest Element in a Sorted Matrix",
653-
difficulty: Difficulty.MEDIUM,
654-
patterns: [patterns.K_wayMerge],
655-
url: "https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix",
656-
solutions: [],
657-
companies: [
658-
"Adobe",
659-
"Amazon",
660-
"Apple",
661-
"Facebook",
662-
"Google",
663-
"Microsoft",
664-
"Twitter",
665-
"Uber",
666-
"Walmart Labs",
667-
],
668-
tags: [
669-
"Array",
670-
"Binary Search",
671-
"Sorting",
672-
"Heap (Priority Queue)",
673-
"Matrix",
674-
],
675-
},
676650
{
677651
id: "L424",
678652
title: "Longest Repeating Character Replacement",
@@ -811,15 +785,38 @@ export const problems = [
811785
],
812786
},
813787
{
814-
id: "L1371",
788+
id: "L1249",
815789
title: "Minimum Remove to Make Valid Parentheses",
816790
difficulty: Difficulty.MEDIUM,
817791
patterns: [patterns.Stacks],
818792
url: "https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses",
819-
solutions: [],
793+
solutions: [
794+
{
795+
title:
796+
"Minimum Remove to Make Valid Parentheses - Leetcode 1249 - Python",
797+
site: sites.yt,
798+
url: "https://www.youtube.com/watch?v=mgQ4O9iUEbg",
799+
},
800+
],
820801
companies: ["Microsoft"],
821802
tags: ["String", "Stack"],
822803
},
804+
{
805+
id: "G2",
806+
title: "Minimum Window Subsequence",
807+
difficulty: Difficulty.HARD,
808+
patterns: [patterns.SlidingWindow],
809+
url: "https://www.geeksforgeeks.org/problems/minimum-window-subsequence",
810+
solutions: [
811+
{
812+
title: "Solution: Minimum Window Subsequence",
813+
site: {},
814+
url: "https://algo.monster/liteproblems/727",
815+
},
816+
],
817+
companies: ["Amazon", "Bloomberg", "eBay", "Google", "Houzz", "Microsoft"],
818+
tags: ["String", "Sliding Window", "Dynamic Programming"],
819+
},
823820
{
824821
id: "L234",
825822
title: "Palindrome Linked List",
@@ -850,47 +847,6 @@ export const problems = [
850847
],
851848
tags: ["Linked List", "Two Pointers", "Stack", "Recursion", "Grind75"],
852849
},
853-
{
854-
id: "L76",
855-
title: "Minimum Window Substring",
856-
difficulty: Difficulty.HARD,
857-
patterns: [patterns.SlidingWindow],
858-
url: "https://leetcode.com/problems/minimum-window-substring",
859-
solutions: [
860-
{
861-
title:
862-
"Minimum Window Substring - Airbnb Interview Question - Leetcode 76",
863-
site: sites.yt,
864-
url: "https://www.youtube.com/watch?v=jSto0O4AJbM",
865-
},
866-
],
867-
companies: [
868-
"Adobe",
869-
"Airbnb",
870-
"Amazon",
871-
"Apple",
872-
"Bloomberg",
873-
"Cohesity",
874-
"Deutsche Bank",
875-
"Facebook",
876-
"GoDaddy",
877-
"Goldman Sachs",
878-
"Google",
879-
"LinkedIn",
880-
"Lyft",
881-
"Microsoft",
882-
"Nutanix",
883-
"Oracle",
884-
"Snapchat",
885-
"Twitter",
886-
"Uber",
887-
"Visa",
888-
"VMware",
889-
"Walmart Labs",
890-
"Yahoo",
891-
],
892-
tags: ["Hash Table", "String", "Sliding Window", "Blind75", "Grind75"],
893-
},
894850
{
895851
id: "L908",
896852
title: "Middle of the Linked List",
@@ -1280,39 +1236,6 @@ export const problems = [
12801236
],
12811237
tags: ["Linked List", "Recursion", "Grind75"],
12821238
},
1283-
{
1284-
id: "L116",
1285-
title: "Populating Next Right Pointers in Each Node",
1286-
difficulty: Difficulty.MEDIUM,
1287-
patterns: [patterns.TreeBreadthFirstSearch],
1288-
url: "https://leetcode.com/problems/populating-next-right-pointers-in-each-node",
1289-
solutions: [
1290-
{
1291-
title:
1292-
"Populating Next Right Pointers in Each Node - Leetcode 116 - Python",
1293-
site: sites.yt,
1294-
url: "https://www.youtube.com/watch?v=U4hFQCa1Cq0",
1295-
},
1296-
],
1297-
companies: [
1298-
"Amazon",
1299-
"Apple",
1300-
"Bloomberg",
1301-
"Facebook",
1302-
"Google",
1303-
"Microsoft",
1304-
"Nutanix",
1305-
"Oracle",
1306-
"VMware",
1307-
],
1308-
tags: [
1309-
"Linked List",
1310-
"Tree",
1311-
"Depth-First Search",
1312-
"Breadth-First Search",
1313-
"Binary Tree",
1314-
],
1315-
},
13161239
{
13171240
id: "L242",
13181241
title: "Valid Anagram",
@@ -4130,19 +4053,12 @@ export const problems = [
41304053
tags: ["Depth-First Search", "Breadth-First Search", "Union Find", "Graph"],
41314054
},
41324055
{
4133-
id: "L1249",
4056+
id: "L1146",
41344057
title: "Snapshot Array",
41354058
difficulty: Difficulty.MEDIUM,
41364059
patterns: [patterns.CustomDataStructures],
41374060
url: "https://leetcode.com/problems/snapshot-array",
4138-
solutions: [
4139-
{
4140-
title:
4141-
"Minimum Remove to Make Valid Parentheses - Leetcode 1249 - Python",
4142-
site: sites.yt,
4143-
url: "https://www.youtube.com/watch?v=mgQ4O9iUEbg",
4144-
},
4145-
],
4061+
solutions: [],
41464062
companies: ["Amazon", "Bloomberg", "Facebook"],
41474063
tags: ["Array", "Hash Table", "Binary Search", "Design"],
41484064
},
@@ -4913,40 +4829,6 @@ export const problems = [
49134829
companies: ["Uber"],
49144830
tags: ["Array", "Hash Table", "String", "Trie"],
49154831
},
4916-
{
4917-
id: "L621",
4918-
title: "Task Scheduler",
4919-
difficulty: Difficulty.MEDIUM,
4920-
patterns: [patterns.TwoHeaps],
4921-
url: "https://leetcode.com/problems/task-scheduler",
4922-
solutions: [
4923-
{
4924-
title: "Task Scheduler - Leetcode 621 - Python",
4925-
site: sites.yt,
4926-
url: "https://www.youtube.com/watch?v=s8p8ukTyA2I",
4927-
},
4928-
],
4929-
companies: [
4930-
"Amazon",
4931-
"Apple",
4932-
"Facebook",
4933-
"Google",
4934-
"Microsoft",
4935-
"Nutanix",
4936-
"Oracle",
4937-
"Uber",
4938-
"VMware",
4939-
],
4940-
tags: [
4941-
"Array",
4942-
"Hash Table",
4943-
"Greedy",
4944-
"Sorting",
4945-
"Heap (Priority Queue)",
4946-
"Counting",
4947-
"Grind75",
4948-
],
4949-
},
49504832
{
49514833
id: "L1095",
49524834
title: "Two City Scheduling",

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /