From 9164bba4de6147736bf614ae4ee8dd054794fbc9 Mon Sep 17 00:00:00 2001
From: Sean Prashad <13009507+SeanPrashad@users.noreply.github.com>
Date: Wed, 21 Jun 2023 06:50:33 -0400
Subject: [PATCH] Add Is Subsequence to Two Pointers pattern
Fixes #269
---
src/data/questions.json | 744 ++++++++++------------------------------
1 file changed, 182 insertions(+), 562 deletions(-)
diff --git a/src/data/questions.json b/src/data/questions.json
index 5a421a79..12dd8185 100644
--- a/src/data/questions.json
+++ b/src/data/questions.json
@@ -5,9 +5,7 @@
"id": 0,
"title": "Contains Duplicate",
"slug": "contains-duplicate",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -72,10 +70,7 @@
"id": 1,
"title": "Missing Number",
"slug": "missing-number",
- "pattern": [
- "Arrays",
- "Bit Manipulation"
- ],
+ "pattern": ["Arrays", "Bit Manipulation"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -125,9 +120,7 @@
"id": 2,
"title": "Find All Numbers Disappeared in an Array",
"slug": "find-all-numbers-disappeared-in-an-array",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -142,10 +135,7 @@
"id": 3,
"title": "Single Number",
"slug": "single-number",
- "pattern": [
- "Arrays",
- "Bit Manipulation"
- ],
+ "pattern": ["Arrays", "Bit Manipulation"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -190,9 +180,7 @@
"id": 4,
"title": "Product of Array Except Self",
"slug": "product-of-array-except-self",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -282,11 +270,7 @@
"id": 5,
"title": "Find the Duplicate Number",
"slug": "find-the-duplicate-number",
- "pattern": [
- "Arrays",
- "Binary Search",
- "Two Pointers"
- ],
+ "pattern": ["Arrays", "Binary Search", "Two Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -326,9 +310,7 @@
"id": 6,
"title": "Find All Duplicates in an Array",
"slug": "find-all-duplicates-in-an-array",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -353,9 +335,7 @@
"id": 7,
"title": "Set Matrix Zeroes",
"slug": "set-matrix-zeroes",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -400,9 +380,7 @@
"id": 8,
"title": "Spiral Matrix",
"slug": "spiral-matrix",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -482,9 +460,7 @@
"id": 9,
"title": "Rotate Image",
"slug": "rotate-image",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -564,9 +540,7 @@
"id": 10,
"title": "Word Search",
"slug": "word-search",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -636,9 +610,7 @@
"id": 11,
"title": "First Missing Positive",
"slug": "first-missing-positive",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -713,9 +685,7 @@
"id": 12,
"title": "Longest Consecutive Sequence",
"slug": "longest-consecutive-sequence",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -765,9 +735,7 @@
"id": 13,
"title": "Letter Case Permutation",
"slug": "letter-case-permutation",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -782,9 +750,7 @@
"id": 14,
"title": "Subsets",
"slug": "subsets",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -834,9 +800,7 @@
"id": 15,
"title": "Subsets II",
"slug": "subsets-ii",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -876,9 +840,7 @@
"id": 16,
"title": "Permutations",
"slug": "permutations",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -938,9 +900,7 @@
"id": 17,
"title": "Permutations II",
"slug": "permutations-ii",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -960,9 +920,7 @@
"id": 18,
"title": "Combinations",
"slug": "combinations",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -982,9 +940,7 @@
"id": 19,
"title": "Combination Sum",
"slug": "combination-sum",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1054,9 +1010,7 @@
"id": 20,
"title": "Combination Sum II",
"slug": "combination-sum-ii",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1081,9 +1035,7 @@
"id": 21,
"title": "Combination Sum III",
"slug": "combination-sum-iii",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1098,9 +1050,7 @@
"id": 22,
"title": "Generate Parentheses",
"slug": "generate-parentheses",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1210,10 +1160,7 @@
"id": 23,
"title": "Target Sum",
"slug": "target-sum",
- "pattern": [
- "DFS",
- "Dynamic Programming"
- ],
+ "pattern": ["DFS", "Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1228,9 +1175,7 @@
"id": 24,
"title": "Palindrome Partitioning",
"slug": "palindrome-partitioning",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1260,9 +1205,7 @@
"id": 25,
"title": "Letter Combinations of a Phone Number",
"slug": "letter-combinations-of-a-phone-number",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1337,9 +1280,7 @@
"id": 26,
"title": "Generalized Abbreviation",
"slug": "generalized-abbreviation",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Medium",
"premium": true,
"companies": []
@@ -1348,9 +1289,7 @@
"id": 27,
"title": "Sudoku Solver",
"slug": "sudoku-solver",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -1385,9 +1324,7 @@
"id": 28,
"title": "N-Queens",
"slug": "n-queens",
- "pattern": [
- "Backtracking"
- ],
+ "pattern": ["Backtracking"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -1432,9 +1369,7 @@
"id": 29,
"title": "Climbing Stairs",
"slug": "climbing-stairs",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -1494,9 +1429,7 @@
"id": 30,
"title": "House Robber",
"slug": "house-robber",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1561,9 +1494,7 @@
"id": 31,
"title": "Best Time to Buy and Sell Stock",
"slug": "best-time-to-buy-and-sell-stock",
- "pattern": [
- "Greedy"
- ],
+ "pattern": ["Greedy"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -1688,9 +1619,7 @@
"id": 32,
"title": "Maximum Subarray",
"slug": "maximum-subarray",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1785,9 +1714,7 @@
"id": 33,
"title": "Range Sum Query - Immutable",
"slug": "range-sum-query-immutable",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Easy",
"premium": false,
"companies": []
@@ -1796,9 +1723,7 @@
"id": 34,
"title": "House Robber II",
"slug": "house-robber-ii",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1843,9 +1768,7 @@
"id": 35,
"title": "Coin Change",
"slug": "coin-change",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1910,9 +1833,7 @@
"id": 36,
"title": "Maximum Product Subarray",
"slug": "maximum-product-subarray",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -1972,9 +1893,7 @@
"id": 37,
"title": "Longest Increasing Subsequence",
"slug": "longest-increasing-subsequence",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2034,9 +1953,7 @@
"id": 38,
"title": "Longest Palindromic Substring",
"slug": "longest-palindromic-substring",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2151,9 +2068,7 @@
"id": 39,
"title": "Word Break",
"slug": "word-break",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2218,9 +2133,7 @@
"id": 40,
"title": "Combination Sum IV",
"slug": "combination-sum-iv",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2240,9 +2153,7 @@
"id": 41,
"title": "Decode Ways",
"slug": "decode-ways",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2317,9 +2228,7 @@
"id": 42,
"title": "Unique Paths",
"slug": "unique-paths",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2384,10 +2293,7 @@
"id": 43,
"title": "Jump Game",
"slug": "jump-game",
- "pattern": [
- "Dynamic Programming",
- "Greedy"
- ],
+ "pattern": ["Dynamic Programming", "Greedy"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2442,9 +2348,7 @@
"id": 44,
"title": "Palindromic Substrings",
"slug": "palindromic-substrings",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2494,9 +2398,7 @@
"id": 45,
"title": "Number of Longest Increasing Subsequence",
"slug": "number-of-longest-increasing-subsequence",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2511,9 +2413,7 @@
"id": 46,
"title": "Partition Equal Subset Sum",
"slug": "partition-equal-subset-sum",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2548,9 +2448,7 @@
"id": 47,
"title": "Partition to K Equal Sum Subsets",
"slug": "partition-to-k-equal-sum-subsets",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2580,9 +2478,7 @@
"id": 48,
"title": "Best Time to Buy and Sell Stock with Cooldown",
"slug": "best-time-to-buy-and-sell-stock-with-cooldown",
- "pattern": [
- "Dynamic Programming"
- ],
+ "pattern": ["Dynamic Programming"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2597,10 +2493,7 @@
"id": 49,
"title": "Counting Bits",
"slug": "counting-bits",
- "pattern": [
- "Dynamic Programming",
- "Bit Manipulation"
- ],
+ "pattern": ["Dynamic Programming", "Bit Manipulation"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -2630,9 +2523,7 @@
"id": 50,
"title": "Linked List Cycle",
"slug": "linked-list-cycle",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -2672,9 +2563,7 @@
"id": 51,
"title": "Middle of the Linked List",
"slug": "middle-of-the-linked-list",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -2724,9 +2613,7 @@
"id": 65,
"title": "Reverse Linked List",
"slug": "reverse-linked-list",
- "pattern": [
- "In-place reversal of a linked list"
- ],
+ "pattern": ["In-place reversal of a linked list"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -2786,9 +2673,7 @@
"id": 52,
"title": "Palindrome Linked List",
"slug": "palindrome-linked-list",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -2858,9 +2743,7 @@
"id": 53,
"title": "Remove Linked List Elements",
"slug": "remove-linked-list-elements",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -2885,9 +2768,7 @@
"id": 54,
"title": "Remove Duplicates from Sorted List",
"slug": "remove-duplicates-from-sorted-list",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -2927,9 +2808,7 @@
"id": 55,
"title": "Linked List Cycle II",
"slug": "linked-list-cycle-ii",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -2944,9 +2823,7 @@
"id": 56,
"title": "Add Two Numbers",
"slug": "add-two-numbers",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3031,9 +2908,7 @@
"id": 57,
"title": "Remove Nth Node From End of List",
"slug": "remove-nth-node-from-end-of-list",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3098,9 +2973,7 @@
"id": 58,
"title": "Sort List",
"slug": "sort-list",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3150,9 +3023,7 @@
"id": 59,
"title": "Reorder List",
"slug": "reorder-list",
- "pattern": [
- "Fast & Slow Pointers"
- ],
+ "pattern": ["Fast & Slow Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3197,11 +3068,7 @@
"id": 60,
"title": "Clone Graph",
"slug": "clone-graph",
- "pattern": [
- "BFS",
- "DFS",
- "Graph"
- ],
+ "pattern": ["BFS", "DFS", "Graph"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3231,10 +3098,7 @@
"id": 61,
"title": "Pacific Atlantic Water Flow",
"slug": "pacific-atlantic-water-flow",
- "pattern": [
- "BFS",
- "DFS"
- ],
+ "pattern": ["BFS", "DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3274,11 +3138,7 @@
"id": 62,
"title": "Number of Islands",
"slug": "number-of-islands",
- "pattern": [
- "BFS",
- "DFS",
- "Union Find"
- ],
+ "pattern": ["BFS", "DFS", "Union Find"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3383,12 +3243,7 @@
"id": 63,
"title": "Graph Valid Tree",
"slug": "graph-valid-tree",
- "pattern": [
- "BFS",
- "DFS",
- "Graph",
- "Union Find"
- ],
+ "pattern": ["BFS", "DFS", "Graph", "Union Find"],
"difficulty": "Medium",
"premium": true,
"companies": [
@@ -3418,12 +3273,7 @@
"id": 64,
"title": "Number of Connected Components in an Undirected Graph",
"slug": "number-of-connected-components-in-an-undirected-graph",
- "pattern": [
- "BFS",
- "DFS",
- "Graph",
- "Union Find"
- ],
+ "pattern": ["BFS", "DFS", "Graph", "Union Find"],
"difficulty": "Medium",
"premium": true,
"companies": [
@@ -3448,9 +3298,7 @@
"id": 66,
"title": "Reverse Linked List II",
"slug": "reverse-linked-list-ii",
- "pattern": [
- "In-place reversal of a linked list"
- ],
+ "pattern": ["In-place reversal of a linked list"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3485,9 +3333,7 @@
"id": 67,
"title": "Rotate List",
"slug": "rotate-list",
- "pattern": [
- "In-place reversal of a linked list"
- ],
+ "pattern": ["In-place reversal of a linked list"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3522,9 +3368,7 @@
"id": 68,
"title": "Swap Nodes in Pairs",
"slug": "swap-nodes-in-pairs",
- "pattern": [
- "In-place reversal of a linked list"
- ],
+ "pattern": ["In-place reversal of a linked list"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3559,9 +3403,7 @@
"id": 69,
"title": "Odd Even Linked List",
"slug": "odd-even-linked-list",
- "pattern": [
- "In-place reversal of a linked list"
- ],
+ "pattern": ["In-place reversal of a linked list"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3601,9 +3443,7 @@
"id": 70,
"title": "Reverse Nodes in k-Group",
"slug": "reverse-nodes-in-k-group",
- "pattern": [
- "In-place reversal of a linked list"
- ],
+ "pattern": ["In-place reversal of a linked list"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -3658,9 +3498,7 @@
"id": 71,
"title": "Merge Two Sorted Lists",
"slug": "merge-two-sorted-lists",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -3735,10 +3573,7 @@
"id": 72,
"title": "Kth Smallest Element in a Sorted Matrix",
"slug": "kth-smallest-element-in-a-sorted-matrix",
- "pattern": [
- "Binary Search",
- "Heap"
- ],
+ "pattern": ["Binary Search", "Heap"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3773,9 +3608,7 @@
"id": 73,
"title": "Find K Pairs with Smallest Sums",
"slug": "find-k-pairs-with-smallest-sums",
- "pattern": [
- "Heap"
- ],
+ "pattern": ["Heap"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -3795,9 +3628,7 @@
"id": 74,
"title": "Merge k Sorted Lists",
"slug": "merge-k-sorted-lists",
- "pattern": [
- "Heap"
- ],
+ "pattern": ["Heap"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -3887,9 +3718,7 @@
"id": 75,
"title": "Smallest Range Covering Elements from K Lists",
"slug": "smallest-range-covering-elements-from-k-lists",
- "pattern": [
- "Heap"
- ],
+ "pattern": ["Heap"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -3909,9 +3738,7 @@
"id": 76,
"title": "Meeting Rooms",
"slug": "meeting-rooms",
- "pattern": [
- "Intervals"
- ],
+ "pattern": ["Intervals"],
"difficulty": "Easy",
"premium": true,
"companies": [
@@ -3936,9 +3763,7 @@
"id": 77,
"title": "Merge Intervals",
"slug": "merge-intervals",
- "pattern": [
- "Intervals"
- ],
+ "pattern": ["Intervals"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4088,9 +3913,7 @@
"id": 78,
"title": "Interval List Intersections",
"slug": "interval-list-intersections",
- "pattern": [
- "Intervals"
- ],
+ "pattern": ["Intervals"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4115,9 +3938,7 @@
"id": 79,
"title": "Non-overlapping Intervals",
"slug": "non-overlapping-intervals",
- "pattern": [
- "Intervals"
- ],
+ "pattern": ["Intervals"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4142,10 +3963,7 @@
"id": 80,
"title": "Meeting Rooms II",
"slug": "meeting-rooms-ii",
- "pattern": [
- "Heap",
- "Intervals"
- ],
+ "pattern": ["Heap", "Intervals"],
"difficulty": "Medium",
"premium": true,
"companies": [
@@ -4225,10 +4043,7 @@
"id": 81,
"title": "Task Scheduler",
"slug": "task-scheduler",
- "pattern": [
- "Greedy",
- "Heap"
- ],
+ "pattern": ["Greedy", "Heap"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4273,9 +4088,7 @@
"id": 82,
"title": "Minimum Number of Arrows to Burst Balloons",
"slug": "minimum-number-of-arrows-to-burst-balloons",
- "pattern": [
- "Greedy"
- ],
+ "pattern": ["Greedy"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4290,9 +4103,7 @@
"id": 83,
"title": "Insert Interval",
"slug": "insert-interval",
- "pattern": [
- "Intervals"
- ],
+ "pattern": ["Intervals"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4327,10 +4138,7 @@
"id": 84,
"title": "Employee Free Time",
"slug": "employee-free-time",
- "pattern": [
- "Heap",
- "Greedy"
- ],
+ "pattern": ["Heap", "Greedy"],
"difficulty": "Hard",
"premium": true,
"companies": [
@@ -4355,9 +4163,7 @@
"id": 85,
"title": "Binary Search",
"slug": "binary-search",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -4402,9 +4208,7 @@
"id": 86,
"title": "Find Smallest Letter Greater Than Target",
"slug": "find-smallest-letter-greater-than-target",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -4424,9 +4228,7 @@
"id": 87,
"title": "Peak Index in a Mountain Array",
"slug": "peak-index-in-a-mountain-array",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4466,9 +4268,7 @@
"id": 88,
"title": "Find Minimum in Rotated Sorted Array",
"slug": "find-minimum-in-rotated-sorted-array",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4523,9 +4323,7 @@
"id": 89,
"title": "Find Peak Element",
"slug": "find-peak-element",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4575,9 +4373,7 @@
"id": 90,
"title": "Search in Rotated Sorted Array",
"slug": "search-in-rotated-sorted-array",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4657,9 +4453,7 @@
"id": 91,
"title": "Search in Rotated Sorted Array II",
"slug": "search-in-rotated-sorted-array-ii",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4679,9 +4473,7 @@
"id": 92,
"title": "Search a 2D Matrix",
"slug": "search-a-2d-matrix",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4736,9 +4528,7 @@
"id": 93,
"title": "Search a 2D Matrix II",
"slug": "search-a-2d-matrix-ii",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4778,9 +4568,7 @@
"id": 94,
"title": "Find K Closest Elements",
"slug": "find-k-closest-elements",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4835,9 +4623,7 @@
"id": 95,
"title": "Count of Range Sum",
"slug": "count-of-range-sum",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Hard",
"premium": false,
"companies": []
@@ -4846,9 +4632,7 @@
"id": 96,
"title": "Minimum Size Subarray Sum",
"slug": "minimum-size-subarray-sum",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4878,9 +4662,7 @@
"id": 97,
"title": "Fruit Into Baskets",
"slug": "fruit-into-baskets",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4900,9 +4682,7 @@
"id": 98,
"title": "Permutation in String",
"slug": "permutation-in-string",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4932,9 +4712,7 @@
"id": 99,
"title": "Longest Repeating Character Replacement",
"slug": "longest-repeating-character-replacement",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -4974,9 +4752,7 @@
"id": 100,
"title": "Sliding Window Maximum",
"slug": "sliding-window-maximum",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -5056,9 +4832,7 @@
"id": 101,
"title": "Longest Substring Without Repeating Characters",
"slug": "longest-substring-without-repeating-characters",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5228,9 +5002,7 @@
"id": 102,
"title": "Minimum Number of K Consecutive Bit Flips",
"slug": "minimum-number-of-k-consecutive-bit-flips",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Hard",
"premium": false,
"companies": []
@@ -5239,9 +5011,7 @@
"id": 103,
"title": "Count Unique Characters of All Substrings of a Given String",
"slug": "count-unique-characters-of-all-substrings-of-a-given-string",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -5256,9 +5026,7 @@
"id": 104,
"title": "Minimum Window Substring",
"slug": "minimum-window-substring",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -5328,9 +5096,7 @@
"id": 105,
"title": "Substring with Concatenation of All Words",
"slug": "substring-with-concatenation-of-all-words",
- "pattern": [
- "Sliding Window"
- ],
+ "pattern": ["Sliding Window"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -5350,9 +5116,7 @@
"id": 106,
"title": "Kth Smallest Element in a BST",
"slug": "kth-smallest-element-in-a-bst",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5397,9 +5161,7 @@
"id": 107,
"title": "K Closest Points to Origin",
"slug": "k-closest-points-to-origin",
- "pattern": [
- "Heap"
- ],
+ "pattern": ["Heap"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5429,9 +5191,7 @@
"id": 108,
"title": "Top K Frequent Elements",
"slug": "top-k-frequent-elements",
- "pattern": [
- "Heap"
- ],
+ "pattern": ["Heap"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5506,9 +5266,7 @@
"id": 109,
"title": "Sort Characters By Frequency",
"slug": "sort-characters-by-frequency",
- "pattern": [
- "Heap"
- ],
+ "pattern": ["Heap"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5528,10 +5286,7 @@
"id": 110,
"title": "Kth Largest Element in an Array",
"slug": "kth-largest-element-in-an-array",
- "pattern": [
- "Heap",
- "QuickSelect"
- ],
+ "pattern": ["Heap", "QuickSelect"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5601,10 +5356,7 @@
"id": 111,
"title": "Reorganize String",
"slug": "reorganize-string",
- "pattern": [
- "Greedy",
- "Heap"
- ],
+ "pattern": ["Greedy", "Heap"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5654,10 +5406,7 @@
"id": 112,
"title": "Rearrange String k Distance Apart",
"slug": "rearrange-string-k-distance-apart",
- "pattern": [
- "Greedy",
- "Heap"
- ],
+ "pattern": ["Greedy", "Heap"],
"difficulty": "Hard",
"premium": true,
"companies": []
@@ -5666,10 +5415,7 @@
"id": 113,
"title": "Course Schedule III",
"slug": "course-schedule-iii",
- "pattern": [
- "Greedy",
- "Heap"
- ],
+ "pattern": ["Greedy", "Heap"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -5684,10 +5430,7 @@
"id": 114,
"title": "Maximum Frequency Stack",
"slug": "maximum-frequency-stack",
- "pattern": [
- "Bucket Sort",
- "Heap"
- ],
+ "pattern": ["Bucket Sort", "Heap"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -5722,12 +5465,7 @@
"id": 115,
"title": "Course Schedule",
"slug": "course-schedule",
- "pattern": [
- "BFS",
- "DFS",
- "Graph",
- "Topological Sort"
- ],
+ "pattern": ["BFS", "DFS", "Graph", "Topological Sort"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5802,12 +5540,7 @@
"id": 116,
"title": "Course Schedule II",
"slug": "course-schedule-ii",
- "pattern": [
- "BFS",
- "DFS",
- "Graph",
- "Topological Sort"
- ],
+ "pattern": ["BFS", "DFS", "Graph", "Topological Sort"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5867,11 +5600,7 @@
"id": 117,
"title": "Minimum Height Trees",
"slug": "minimum-height-trees",
- "pattern": [
- "BFS",
- "Graph",
- "Topological Sort"
- ],
+ "pattern": ["BFS", "Graph", "Topological Sort"],
"difficulty": "Medium",
"premium": false,
"companies": []
@@ -5880,10 +5609,7 @@
"id": 118,
"title": "Alien Dictionary",
"slug": "alien-dictionary",
- "pattern": [
- "Graph",
- "Topological Sort"
- ],
+ "pattern": ["Graph", "Topological Sort"],
"difficulty": "Hard",
"premium": true,
"companies": [
@@ -5918,10 +5644,7 @@
"id": 119,
"title": "Sequence Reconstruction",
"slug": "sequence-reconstruction",
- "pattern": [
- "Graph",
- "Topological Sort"
- ],
+ "pattern": ["Graph", "Topological Sort"],
"difficulty": "Medium",
"premium": true,
"companies": []
@@ -5930,9 +5653,7 @@
"id": 120,
"title": "Binary Tree Level Order Traversal II",
"slug": "binary-tree-level-order-traversal-ii",
- "pattern": [
- "BFS"
- ],
+ "pattern": ["BFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -5947,9 +5668,7 @@
"id": 121,
"title": "Average of Levels in Binary Tree",
"slug": "average-of-levels-in-binary-tree",
- "pattern": [
- "BFS"
- ],
+ "pattern": ["BFS"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -5964,10 +5683,7 @@
"id": 122,
"title": "Minimum Depth of Binary Tree",
"slug": "minimum-depth-of-binary-tree",
- "pattern": [
- "BFS",
- "DFS"
- ],
+ "pattern": ["BFS", "DFS"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -5982,9 +5698,7 @@
"id": 123,
"title": "Binary Tree Level Order Traversal",
"slug": "binary-tree-level-order-traversal",
- "pattern": [
- "BFS"
- ],
+ "pattern": ["BFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6019,9 +5733,7 @@
"id": 124,
"title": "Binary Tree Zigzag Level Order Traversal",
"slug": "binary-tree-zigzag-level-order-traversal",
- "pattern": [
- "BFS"
- ],
+ "pattern": ["BFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6076,9 +5788,7 @@
"id": 125,
"title": "Populating Next Right Pointers in Each Node",
"slug": "populating-next-right-pointers-in-each-node",
- "pattern": [
- "BFS"
- ],
+ "pattern": ["BFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6118,9 +5828,7 @@
"id": 126,
"title": "Populating Next Right Pointers in Each Node II",
"slug": "populating-next-right-pointers-in-each-node-ii",
- "pattern": [
- "BFS"
- ],
+ "pattern": ["BFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6145,10 +5853,7 @@
"id": 127,
"title": "Binary Tree Right Side View",
"slug": "binary-tree-right-side-view",
- "pattern": [
- "BFS",
- "DFS"
- ],
+ "pattern": ["BFS", "DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6193,10 +5898,7 @@
"id": 128,
"title": "All Nodes Distance K in Binary Tree",
"slug": "all-nodes-distance-k-in-binary-tree",
- "pattern": [
- "BFS",
- "DFS"
- ],
+ "pattern": ["BFS", "DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6241,9 +5943,7 @@
"id": 129,
"title": "Same Tree",
"slug": "same-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -6283,9 +5983,7 @@
"id": 130,
"title": "Path Sum",
"slug": "path-sum",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -6315,9 +6013,7 @@
"id": 131,
"title": "Maximum Depth of Binary Tree",
"slug": "maximum-depth-of-binary-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -6352,9 +6048,7 @@
"id": 132,
"title": "Diameter of Binary Tree",
"slug": "diameter-of-binary-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -6389,9 +6083,7 @@
"id": 133,
"title": "Merge Two Binary Trees",
"slug": "merge-two-binary-trees",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Easy",
"premium": false,
"companies": []
@@ -6400,9 +6092,7 @@
"id": 134,
"title": "Lowest Common Ancestor of a Binary Search Tree",
"slug": "lowest-common-ancestor-of-a-binary-search-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6442,9 +6132,7 @@
"id": 135,
"title": "Subtree of Another Tree",
"slug": "subtree-of-another-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -6459,9 +6147,7 @@
"id": 136,
"title": "Invert Binary Tree",
"slug": "invert-binary-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -6496,9 +6182,7 @@
"id": 137,
"title": "Path Sum II",
"slug": "path-sum-ii",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6528,9 +6212,7 @@
"id": 138,
"title": "Path Sum III",
"slug": "path-sum-iii",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6565,9 +6247,7 @@
"id": 139,
"title": "Lowest Common Ancestor of a Binary Tree",
"slug": "lowest-common-ancestor-of-a-binary-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6642,9 +6322,7 @@
"id": 140,
"title": "Maximum Binary Tree",
"slug": "maximum-binary-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": []
@@ -6653,9 +6331,7 @@
"id": 141,
"title": "Maximum Width of Binary Tree",
"slug": "maximum-width-of-binary-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6685,9 +6361,7 @@
"id": 142,
"title": "Construct Binary Tree from Preorder and Inorder Traversal",
"slug": "construct-binary-tree-from-preorder-and-inorder-traversal",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6732,9 +6406,7 @@
"id": 143,
"title": "Validate Binary Search Tree",
"slug": "validate-binary-search-tree",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6799,10 +6471,7 @@
"id": 144,
"title": "Implement Trie (Prefix Tree)",
"slug": "implement-trie-prefix-tree",
- "pattern": [
- "Design",
- "Trie"
- ],
+ "pattern": ["Design", "Trie"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -6832,9 +6501,7 @@
"id": 145,
"title": "Binary Tree Maximum Path Sum",
"slug": "binary-tree-maximum-path-sum",
- "pattern": [
- "DFS"
- ],
+ "pattern": ["DFS"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -6909,9 +6576,7 @@
"id": 146,
"title": "Serialize and Deserialize Binary Tree",
"slug": "serialize-and-deserialize-binary-tree",
- "pattern": [
- "Design"
- ],
+ "pattern": ["Design"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -6976,10 +6641,7 @@
"id": 147,
"title": "Word Search II",
"slug": "word-search-ii",
- "pattern": [
- "DFS",
- "Trie"
- ],
+ "pattern": ["DFS", "Trie"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7044,9 +6706,7 @@
"id": 148,
"title": "Find Median from Data Stream",
"slug": "find-median-from-data-stream",
- "pattern": [
- "Heap"
- ],
+ "pattern": ["Heap"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7106,9 +6766,7 @@
"id": 149,
"title": "Sliding Window Median",
"slug": "sliding-window-median",
- "pattern": [
- "Heap"
- ],
+ "pattern": ["Heap"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7133,9 +6791,7 @@
"id": 150,
"title": "Two Sum",
"slug": "two-sum",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -7315,9 +6971,7 @@
"id": 151,
"title": "Squares of a Sorted Array",
"slug": "squares-of-a-sorted-array",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -7357,9 +7011,7 @@
"id": 152,
"title": "Backspace String Compare",
"slug": "backspace-string-compare",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -7384,9 +7036,7 @@
"id": 153,
"title": "3Sum",
"slug": "3sum",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -7476,9 +7126,7 @@
"id": 154,
"title": "3Sum Closest",
"slug": "3sum-closest",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -7523,9 +7171,7 @@
"id": 155,
"title": "Subarray Product Less Than K",
"slug": "subarray-product-less-than-k",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": []
@@ -7534,9 +7180,7 @@
"id": 156,
"title": "Sort Colors",
"slug": "sort-colors",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -7591,9 +7235,7 @@
"id": 157,
"title": "Trapping Rain Water",
"slug": "trapping-rain-water",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7673,9 +7315,7 @@
"id": 158,
"title": "Container With Most Water",
"slug": "container-with-most-water",
- "pattern": [
- "Two Pointers"
- ],
+ "pattern": ["Two Pointers"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -7735,9 +7375,7 @@
"id": 159,
"title": "Longest Word in Dictionary",
"slug": "longest-word-in-dictionary",
- "pattern": [
- "Trie"
- ],
+ "pattern": ["Trie"],
"difficulty": "Medium",
"premium": false,
"companies": []
@@ -7746,9 +7384,7 @@
"id": 160,
"title": "Index Pairs of a String",
"slug": "index-pairs-of-a-string",
- "pattern": [
- "Trie"
- ],
+ "pattern": ["Trie"],
"difficulty": "Easy",
"premium": true,
"companies": []
@@ -7757,9 +7393,7 @@
"id": 161,
"title": "Maximum XOR of Two Numbers in an Array",
"slug": "maximum-xor-of-two-numbers-in-an-array",
- "pattern": [
- "Trie"
- ],
+ "pattern": ["Trie"],
"difficulty": "Medium",
"premium": false,
"companies": [
@@ -7774,9 +7408,7 @@
"id": 162,
"title": "Concatenated Words",
"slug": "concatenated-words",
- "pattern": [
- "Trie"
- ],
+ "pattern": ["Trie"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7791,9 +7423,7 @@
"id": 163,
"title": "Prefix and Suffix Search",
"slug": "prefix-and-suffix-search",
- "pattern": [
- "Trie"
- ],
+ "pattern": ["Trie"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7808,9 +7438,7 @@
"id": 164,
"title": "Palindrome Pairs",
"slug": "palindrome-pairs",
- "pattern": [
- "Trie"
- ],
+ "pattern": ["Trie"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7835,9 +7463,7 @@
"id": 165,
"title": "Design Search Autocomplete System",
"slug": "design-search-autocomplete-system",
- "pattern": [
- "Trie"
- ],
+ "pattern": ["Trie"],
"difficulty": "Hard",
"premium": true,
"companies": [
@@ -7877,9 +7503,7 @@
"id": 166,
"title": "Word Squares",
"slug": "word-squares",
- "pattern": [
- "Trie"
- ],
+ "pattern": ["Trie"],
"difficulty": "Hard",
"premium": true,
"companies": []
@@ -7888,11 +7512,7 @@
"id": 167,
"title": "Sort Items by Groups Respecting Dependencies",
"slug": "sort-items-by-groups-respecting-dependencies",
- "pattern": [
- "DFS",
- "Graph",
- "Topological Sort"
- ],
+ "pattern": ["DFS", "Graph", "Topological Sort"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7907,9 +7527,7 @@
"id": 168,
"title": "Median of Two Sorted Arrays",
"slug": "median-of-two-sorted-arrays",
- "pattern": [
- "Binary Search"
- ],
+ "pattern": ["Binary Search"],
"difficulty": "Hard",
"premium": false,
"companies": [
@@ -7994,9 +7612,7 @@
"id": 169,
"title": "Majority Element",
"slug": "majority-element",
- "pattern": [
- "Sorting"
- ],
+ "pattern": ["Sorting"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -8041,9 +7657,7 @@
"id": 170,
"title": "Convert 1D Array Into 2D Array",
"slug": "convert-1d-array-into-2d-array",
- "pattern": [
- "Arrays"
- ],
+ "pattern": ["Arrays"],
"difficulty": "Easy",
"premium": false,
"companies": []
@@ -8052,10 +7666,7 @@
"id": 171,
"title": "Move Zeroes",
"slug": "move-zeroes",
- "pattern": [
- "Arrays",
- "Two Pointers"
- ],
+ "pattern": ["Arrays", "Two Pointers"],
"difficulty": "Easy",
"premium": false,
"companies": [
@@ -8115,6 +7726,15 @@
"frequency": 2
}
]
+ },
+ {
+ "id": 172,
+ "title": "Is Subsequence",
+ "slug": "is-subsequence",
+ "pattern": ["Two Pointers"],
+ "difficulty": "Easy",
+ "premium": false,
+ "companies": []
}
]
-}
\ No newline at end of file
+}