diff --git a/src/data/questions.json b/src/data/questions.json index 7afbcc7a..5c116ae1 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": [ @@ -62,10 +60,7 @@ "id": 1, "title": "Missing Number", "slug": "missing-number", - "pattern": [ - "Arrays", - "Bit Manipulation" - ], + "pattern": ["Arrays", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -120,9 +115,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": [ @@ -137,10 +130,7 @@ "id": 3, "title": "Single Number", "slug": "single-number", - "pattern": [ - "Arrays", - "Bit Manipulation" - ], + "pattern": ["Arrays", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -200,9 +190,7 @@ "id": 4, "title": "Product of Array Except Self", "slug": "product-of-array-except-self", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -307,11 +295,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": [ @@ -391,9 +375,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": [ @@ -423,9 +405,7 @@ "id": 7, "title": "Set Matrix Zeroes", "slug": "set-matrix-zeroes", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -485,9 +465,7 @@ "id": 8, "title": "Spiral Matrix", "slug": "spiral-matrix", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -587,9 +565,7 @@ "id": 9, "title": "Rotate Image", "slug": "rotate-image", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -679,9 +655,7 @@ "id": 10, "title": "Word Search", "slug": "word-search", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -771,9 +745,7 @@ "id": 11, "title": "First Missing Positive", "slug": "first-missing-positive", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Hard", "premium": false, "companies": [ @@ -858,9 +830,7 @@ "id": 12, "title": "Longest Consecutive Sequence", "slug": "longest-consecutive-sequence", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -940,9 +910,7 @@ "id": 13, "title": "Letter Case Permutation", "slug": "letter-case-permutation", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -957,9 +925,7 @@ "id": 14, "title": "Subsets", "slug": "subsets", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1029,9 +995,7 @@ "id": 15, "title": "Subsets II", "slug": "subsets-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1076,9 +1040,7 @@ "id": 16, "title": "Permutations", "slug": "permutations", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1148,9 +1110,7 @@ "id": 17, "title": "Permutations II", "slug": "permutations-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1175,9 +1135,7 @@ "id": 18, "title": "Combinations", "slug": "combinations", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1212,9 +1170,7 @@ "id": 19, "title": "Combination Sum", "slug": "combination-sum", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1284,9 +1240,7 @@ "id": 20, "title": "Combination Sum II", "slug": "combination-sum-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1331,9 +1285,7 @@ "id": 21, "title": "Combination Sum III", "slug": "combination-sum-iii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1353,9 +1305,7 @@ "id": 22, "title": "Generate Parentheses", "slug": "generate-parentheses", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1450,11 +1400,7 @@ "id": 23, "title": "Target Sum", "slug": "target-sum", - "pattern": [ - "Backtracking", - "DFS", - "Dynamic Programming" - ], + "pattern": ["Backtracking", "DFS", "Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1489,9 +1435,7 @@ "id": 24, "title": "Palindrome Partitioning", "slug": "palindrome-partitioning", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1541,9 +1485,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": [ @@ -1628,9 +1570,7 @@ "id": 26, "title": "Generalized Abbreviation", "slug": "generalized-abbreviation", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": true, "companies": [] @@ -1639,9 +1579,7 @@ "id": 27, "title": "Sudoku Solver", "slug": "sudoku-solver", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Hard", "premium": false, "companies": [ @@ -1706,9 +1644,7 @@ "id": 28, "title": "N-Queens", "slug": "n-queens", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Hard", "premium": false, "companies": [ @@ -1773,9 +1709,7 @@ "id": 29, "title": "Climbing Stairs", "slug": "climbing-stairs", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Easy", "premium": false, "companies": [ @@ -1885,9 +1819,7 @@ "id": 30, "title": "House Robber", "slug": "house-robber", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2002,9 +1934,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": [ @@ -2204,9 +2134,7 @@ "id": 32, "title": "Maximum Subarray", "slug": "maximum-subarray", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2326,9 +2254,7 @@ "id": 33, "title": "Range Sum Query - Immutable", "slug": "range-sum-query-immutable", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Easy", "premium": false, "companies": [ @@ -2353,9 +2279,7 @@ "id": 34, "title": "House Robber II", "slug": "house-robber-ii", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2425,9 +2349,7 @@ "id": 35, "title": "Coin Change", "slug": "coin-change", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2512,9 +2434,7 @@ "id": 36, "title": "Maximum Product Subarray", "slug": "maximum-product-subarray", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2594,9 +2514,7 @@ "id": 37, "title": "Longest Increasing Subsequence", "slug": "longest-increasing-subsequence", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2706,9 +2624,7 @@ "id": 38, "title": "Longest Palindromic Substring", "slug": "longest-palindromic-substring", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2838,9 +2754,7 @@ "id": 39, "title": "Word Break", "slug": "word-break", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2925,9 +2839,7 @@ "id": 40, "title": "Combination Sum IV", "slug": "combination-sum-iv", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2942,9 +2854,7 @@ "id": 41, "title": "Decode Ways", "slug": "decode-ways", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3014,9 +2924,7 @@ "id": 42, "title": "Unique Paths", "slug": "unique-paths", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3081,10 +2989,7 @@ "id": 43, "title": "Jump Game", "slug": "jump-game", - "pattern": [ - "Dynamic Programming", - "Greedy" - ], + "pattern": ["Dynamic Programming", "Greedy"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3164,9 +3069,7 @@ "id": 44, "title": "Palindromic Substrings", "slug": "palindromic-substrings", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3221,9 +3124,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": [ @@ -3238,9 +3139,7 @@ "id": 46, "title": "Partition Equal Subset Sum", "slug": "partition-equal-subset-sum", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3290,9 +3189,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": [ @@ -3332,9 +3229,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": [ @@ -3359,10 +3254,7 @@ "id": 49, "title": "Counting Bits", "slug": "counting-bits", - "pattern": [ - "Dynamic Programming", - "Bit Manipulation" - ], + "pattern": ["Dynamic Programming", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3392,9 +3284,7 @@ "id": 50, "title": "Linked List Cycle", "slug": "linked-list-cycle", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3439,9 +3329,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": [ @@ -3481,9 +3369,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": [ @@ -3558,9 +3444,7 @@ "id": 52, "title": "Palindrome Linked List", "slug": "palindrome-linked-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3620,9 +3504,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": [ @@ -3647,9 +3529,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": [ @@ -3684,9 +3564,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": [ @@ -3716,9 +3594,7 @@ "id": 56, "title": "Add Two Numbers", "slug": "add-two-numbers", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3808,9 +3684,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": [ @@ -3865,9 +3739,7 @@ "id": 58, "title": "Sort List", "slug": "sort-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3912,9 +3784,7 @@ "id": 59, "title": "Reorder List", "slug": "reorder-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3965,63 +3835,11 @@ } ] }, - { - "id": 60, - "title": "Clone Graph", - "slug": "clone-graph", - "pattern": [ - "BFS", - "DFS", - "Graph" - ], - "difficulty": "Medium", - "premium": false, - "companies": [ - { - "name": "Facebook", - "slug": "facebook", - "frequency": 32 - }, - { - "name": "Amazon", - "slug": "amazon", - "frequency": 4 - }, - { - "name": "Microsoft", - "slug": "microsoft", - "frequency": 3 - }, - { - "name": "ThousandEyes", - "slug": "thousandeyes", - "frequency": 3 - }, - { - "name": "Docusign", - "slug": "docusign", - "frequency": 2 - }, - { - "name": "Adobe", - "slug": "adobe", - "frequency": 2 - }, - { - "name": "TikTok", - "slug": "tiktok", - "frequency": 2 - } - ] - }, { "id": 61, "title": "Pacific Atlantic Water Flow", "slug": "pacific-atlantic-water-flow", - "pattern": [ - "BFS", - "DFS" - ], + "pattern": ["BFS", "DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4061,11 +3879,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": [ @@ -4235,12 +4049,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": [ @@ -4270,12 +4079,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": [ @@ -4295,9 +4099,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": [ @@ -4352,9 +4154,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": [ @@ -4399,9 +4199,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": [ @@ -4456,9 +4254,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": [ @@ -4503,9 +4299,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": [ @@ -4580,9 +4374,7 @@ "id": 71, "title": "Merge Two Sorted Lists", "slug": "merge-two-sorted-lists", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -4677,10 +4469,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": [ @@ -4720,9 +4509,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": [ @@ -4742,9 +4529,7 @@ "id": 74, "title": "Merge k Sorted Lists", "slug": "merge-k-sorted-lists", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -4819,9 +4604,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": [ @@ -4851,9 +4634,7 @@ "id": 76, "title": "Meeting Rooms", "slug": "meeting-rooms", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Easy", "premium": true, "companies": [ @@ -4883,9 +4664,7 @@ "id": 77, "title": "Merge Intervals", "slug": "merge-intervals", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5080,9 +4859,7 @@ "id": 78, "title": "Interval List Intersections", "slug": "interval-list-intersections", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5117,9 +4894,7 @@ "id": 79, "title": "Non-overlapping Intervals", "slug": "non-overlapping-intervals", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5169,10 +4944,7 @@ "id": 80, "title": "Meeting Rooms II", "slug": "meeting-rooms-ii", - "pattern": [ - "Heap", - "Intervals" - ], + "pattern": ["Heap", "Intervals"], "difficulty": "Medium", "premium": true, "companies": [ @@ -5267,10 +5039,7 @@ "id": 81, "title": "Task Scheduler", "slug": "task-scheduler", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5335,9 +5104,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": [ @@ -5362,9 +5129,7 @@ "id": 83, "title": "Insert Interval", "slug": "insert-interval", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5429,10 +5194,7 @@ "id": 84, "title": "Employee Free Time", "slug": "employee-free-time", - "pattern": [ - "Heap", - "Greedy" - ], + "pattern": ["Heap", "Greedy"], "difficulty": "Hard", "premium": true, "companies": [ @@ -5452,9 +5214,7 @@ "id": 85, "title": "Binary Search", "slug": "binary-search", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Easy", "premium": false, "companies": [ @@ -5499,9 +5259,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": [] @@ -5510,9 +5268,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": [ @@ -5552,9 +5308,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": [ @@ -5624,9 +5378,7 @@ "id": 89, "title": "Find Peak Element", "slug": "find-peak-element", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5691,9 +5443,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": [ @@ -5818,9 +5568,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": [ @@ -5855,9 +5603,7 @@ "id": 92, "title": "Search a 2D Matrix", "slug": "search-a-2d-matrix", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5932,9 +5678,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": [ @@ -5979,9 +5723,7 @@ "id": 94, "title": "Find K Closest Elements", "slug": "find-k-closest-elements", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6046,9 +5788,7 @@ "id": 95, "title": "Count of Range Sum", "slug": "count-of-range-sum", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Hard", "premium": false, "companies": [ @@ -6063,9 +5803,7 @@ "id": 96, "title": "Minimum Size Subarray Sum", "slug": "minimum-size-subarray-sum", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6115,9 +5853,7 @@ "id": 97, "title": "Fruit Into Baskets", "slug": "fruit-into-baskets", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6157,9 +5893,7 @@ "id": 98, "title": "Permutation in String", "slug": "permutation-in-string", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6199,9 +5933,7 @@ "id": 99, "title": "Longest Repeating Character Replacement", "slug": "longest-repeating-character-replacement", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6261,9 +5993,7 @@ "id": 100, "title": "Sliding Window Maximum", "slug": "sliding-window-maximum", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Hard", "premium": false, "companies": [ @@ -6348,9 +6078,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": [ @@ -6550,9 +6278,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": [] @@ -6561,9 +6287,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": [ @@ -6583,9 +6307,7 @@ "id": 104, "title": "Minimum Window Substring", "slug": "minimum-window-substring", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Hard", "premium": false, "companies": [ @@ -6680,9 +6402,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": [ @@ -6712,9 +6432,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": [ @@ -6769,9 +6487,7 @@ "id": 107, "title": "K Closest Points to Origin", "slug": "k-closest-points-to-origin", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6801,9 +6517,7 @@ "id": 108, "title": "Top K Frequent Elements", "slug": "top-k-frequent-elements", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6918,9 +6632,7 @@ "id": 109, "title": "Sort Characters By Frequency", "slug": "sort-characters-by-frequency", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6975,10 +6687,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": [ @@ -7083,10 +6792,7 @@ "id": 111, "title": "Reorganize String", "slug": "reorganize-string", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7171,10 +6877,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": [ @@ -7189,10 +6892,7 @@ "id": 113, "title": "Course Schedule III", "slug": "course-schedule-iii", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Hard", "premium": false, "companies": [] @@ -7201,10 +6901,7 @@ "id": 114, "title": "Maximum Frequency Stack", "slug": "maximum-frequency-stack", - "pattern": [ - "Bucket Sort", - "Heap" - ], + "pattern": ["Bucket Sort", "Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -7229,12 +6926,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": [ @@ -7334,12 +7026,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": [ @@ -7439,11 +7126,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": [ @@ -7478,10 +7161,7 @@ "id": 118, "title": "Alien Dictionary", "slug": "alien-dictionary", - "pattern": [ - "Graph", - "Topological Sort" - ], + "pattern": ["Graph", "Topological Sort"], "difficulty": "Hard", "premium": true, "companies": [ @@ -7531,10 +7211,7 @@ "id": 119, "title": "Sequence Reconstruction", "slug": "sequence-reconstruction", - "pattern": [ - "Graph", - "Topological Sort" - ], + "pattern": ["Graph", "Topological Sort"], "difficulty": "Medium", "premium": true, "companies": [ @@ -7549,9 +7226,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": [] @@ -7560,9 +7235,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": [ @@ -7577,10 +7250,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": [ @@ -7610,9 +7280,7 @@ "id": 123, "title": "Binary Tree Level Order Traversal", "slug": "binary-tree-level-order-traversal", - "pattern": [ - "BFS" - ], + "pattern": ["BFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7677,9 +7345,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": [ @@ -7744,9 +7410,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": [ @@ -7806,9 +7470,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": [ @@ -7848,10 +7510,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": [ @@ -7901,10 +7560,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": [ @@ -7949,9 +7605,7 @@ "id": 129, "title": "Same Tree", "slug": "same-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -7996,9 +7650,7 @@ "id": 130, "title": "Path Sum", "slug": "path-sum", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8043,9 +7695,7 @@ "id": 131, "title": "Maximum Depth of Binary Tree", "slug": "maximum-depth-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8100,9 +7750,7 @@ "id": 132, "title": "Diameter of Binary Tree", "slug": "diameter-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8152,9 +7800,7 @@ "id": 133, "title": "Merge Two Binary Trees", "slug": "merge-two-binary-trees", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8184,9 +7830,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": [ @@ -8226,9 +7870,7 @@ "id": 135, "title": "Subtree of Another Tree", "slug": "subtree-of-another-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8253,9 +7895,7 @@ "id": 136, "title": "Invert Binary Tree", "slug": "invert-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8285,9 +7925,7 @@ "id": 137, "title": "Path Sum II", "slug": "path-sum-ii", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8312,9 +7950,7 @@ "id": 138, "title": "Path Sum III", "slug": "path-sum-iii", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8349,9 +7985,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": [ @@ -8431,9 +8065,7 @@ "id": 140, "title": "Maximum Binary Tree", "slug": "maximum-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [] @@ -8442,9 +8074,7 @@ "id": 141, "title": "Maximum Width of Binary Tree", "slug": "maximum-width-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8479,9 +8109,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": [ @@ -8526,9 +8154,7 @@ "id": 143, "title": "Validate Binary Search Tree", "slug": "validate-binary-search-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8618,10 +8244,7 @@ "id": 144, "title": "Implement Trie (Prefix Tree)", "slug": "implement-trie-prefix-tree", - "pattern": [ - "Design", - "Trie" - ], + "pattern": ["Design", "Trie"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8681,9 +8304,7 @@ "id": 145, "title": "Binary Tree Maximum Path Sum", "slug": "binary-tree-maximum-path-sum", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8778,9 +8399,7 @@ "id": 146, "title": "Serialize and Deserialize Binary Tree", "slug": "serialize-and-deserialize-binary-tree", - "pattern": [ - "Design" - ], + "pattern": ["Design"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8835,10 +8454,7 @@ "id": 147, "title": "Word Search II", "slug": "word-search-ii", - "pattern": [ - "DFS", - "Trie" - ], + "pattern": ["DFS", "Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8913,9 +8529,7 @@ "id": 148, "title": "Find Median from Data Stream", "slug": "find-median-from-data-stream", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -9000,9 +8614,7 @@ "id": 149, "title": "Sliding Window Median", "slug": "sliding-window-median", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -9037,9 +8649,7 @@ "id": 150, "title": "Two Sum", "slug": "two-sum", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9254,9 +8864,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": [ @@ -9311,9 +8919,7 @@ "id": 152, "title": "Backspace String Compare", "slug": "backspace-string-compare", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9363,9 +8969,7 @@ "id": 153, "title": "3Sum", "slug": "3sum", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9480,9 +9084,7 @@ "id": 154, "title": "3Sum Closest", "slug": "3sum-closest", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9527,9 +9129,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": [ @@ -9589,9 +9189,7 @@ "id": 156, "title": "Sort Colors", "slug": "sort-colors", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9671,9 +9269,7 @@ "id": 157, "title": "Trapping Rain Water", "slug": "trapping-rain-water", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Hard", "premium": false, "companies": [ @@ -9833,9 +9429,7 @@ "id": 158, "title": "Container With Most Water", "slug": "container-with-most-water", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9920,9 +9514,7 @@ "id": 159, "title": "Longest Word in Dictionary", "slug": "longest-word-in-dictionary", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Medium", "premium": false, "companies": [] @@ -9931,9 +9523,7 @@ "id": 160, "title": "Index Pairs of a String", "slug": "index-pairs-of-a-string", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Easy", "premium": true, "companies": [] @@ -9942,9 +9532,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": [ @@ -9959,9 +9547,7 @@ "id": 162, "title": "Concatenated Words", "slug": "concatenated-words", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -9981,9 +9567,7 @@ "id": 163, "title": "Prefix and Suffix Search", "slug": "prefix-and-suffix-search", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -9998,9 +9582,7 @@ "id": 164, "title": "Palindrome Pairs", "slug": "palindrome-pairs", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10020,9 +9602,7 @@ "id": 165, "title": "Design Search Autocomplete System", "slug": "design-search-autocomplete-system", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": true, "companies": [ @@ -10072,9 +9652,7 @@ "id": 166, "title": "Word Squares", "slug": "word-squares", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": true, "companies": [] @@ -10083,11 +9661,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": [] @@ -10096,9 +9670,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": [ @@ -10208,9 +9780,7 @@ "id": 169, "title": "Majority Element", "slug": "majority-element", - "pattern": [ - "Sorting" - ], + "pattern": ["Sorting"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10295,9 +9865,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": [] @@ -10306,10 +9874,7 @@ "id": 171, "title": "Move Zeroes", "slug": "move-zeroes", - "pattern": [ - "Arrays", - "Two Pointers" - ], + "pattern": ["Arrays", "Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10419,9 +9984,7 @@ "id": 172, "title": "Is Subsequence", "slug": "is-subsequence", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10491,10 +10054,7 @@ "id": 173, "title": "Binary Tree Paths", "slug": "binary-tree-paths", - "pattern": [ - "DFS", - "Backtracking" - ], + "pattern": ["DFS", "Backtracking"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10519,10 +10079,7 @@ "id": 174, "title": "Factor Combinations", "slug": "factor-combinations", - "pattern": [ - "Arrays", - "Backtracking" - ], + "pattern": ["Arrays", "Backtracking"], "difficulty": "Medium", "premium": true, "companies": [] @@ -10531,9 +10088,7 @@ "id": 175, "title": "Split a String Into the Max Number of Unique Substrings", "slug": "split-a-string-into-the-max-number-of-unique-substrings", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [] @@ -10542,9 +10097,7 @@ "id": 176, "title": "Maximum Average Subarray I", "slug": "maximum-average-subarray-i", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10579,9 +10132,7 @@ "id": 177, "title": "Maximum Number of Vowels in a Substring of Given Length", "slug": "maximum-number-of-vowels-in-a-substring-of-given-length", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10601,9 +10152,7 @@ "id": 178, "title": "Max Consecutive Ones III", "slug": "max-consecutive-ones-iii", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10668,10 +10217,7 @@ "id": 179, "title": "Longest Subarray of 1's After Deleting One Element", "slug": "longest-subarray-of-1s-after-deleting-one-element", - "pattern": [ - "Sliding Window", - "Dynamic Programming" - ], + "pattern": ["Sliding Window", "Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10698,4 +10244,4 @@ ] } ] -} \ No newline at end of file +}