From 73655c4c3169ee1028c7369cc96f2e7884a85d14 Mon Sep 17 00:00:00 2001 From: BilalBaheer Date: Tue, 25 Mar 2025 17:01:23 -0700 Subject: [PATCH 1/2] Add Gas Station problem to Greedy pattern --- src/data/questions.json | 776 +++++++++++----------------------------- 1 file changed, 206 insertions(+), 570 deletions(-) diff --git a/src/data/questions.json b/src/data/questions.json index b97e2799..0f12d332 100644 --- a/src/data/questions.json +++ b/src/data/questions.json @@ -1,13 +1,11 @@ { - "updated": "2025-03-23T12:03:43.728098", + "updated": "2025-03-26T00:00:15.765Z", "data": [ { "id": 0, "title": "Contains Duplicate", "slug": "contains-duplicate", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Easy", "premium": false, "companies": [ @@ -67,10 +65,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": [ @@ -147,10 +140,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": [ @@ -332,11 +320,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": [ @@ -406,9 +390,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": [ @@ -453,9 +435,7 @@ "id": 7, "title": "Set Matrix Zeroes", "slug": "set-matrix-zeroes", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -510,9 +490,7 @@ "id": 8, "title": "Spiral Matrix", "slug": "spiral-matrix", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -652,9 +630,7 @@ "id": 9, "title": "Rotate Image", "slug": "rotate-image", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -754,9 +730,7 @@ "id": 10, "title": "Word Search", "slug": "word-search", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -871,9 +845,7 @@ "id": 11, "title": "First Missing Positive", "slug": "first-missing-positive", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Hard", "premium": false, "companies": [ @@ -973,9 +945,7 @@ "id": 12, "title": "Longest Consecutive Sequence", "slug": "longest-consecutive-sequence", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1080,9 +1050,7 @@ "id": 13, "title": "Letter Case Permutation", "slug": "letter-case-permutation", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1097,9 +1065,7 @@ "id": 14, "title": "Subsets", "slug": "subsets", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1164,9 +1130,7 @@ "id": 15, "title": "Subsets II", "slug": "subsets-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1206,9 +1170,7 @@ "id": 16, "title": "Permutations", "slug": "permutations", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1273,9 +1235,7 @@ "id": 17, "title": "Permutations II", "slug": "permutations-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1305,9 +1265,7 @@ "id": 18, "title": "Combinations", "slug": "combinations", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1347,9 +1305,7 @@ "id": 19, "title": "Combination Sum", "slug": "combination-sum", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1444,9 +1400,7 @@ "id": 20, "title": "Combination Sum II", "slug": "combination-sum-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1501,9 +1455,7 @@ "id": 21, "title": "Combination Sum III", "slug": "combination-sum-iii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1528,9 +1480,7 @@ "id": 22, "title": "Generate Parentheses", "slug": "generate-parentheses", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1640,11 +1590,7 @@ "id": 23, "title": "Target Sum", "slug": "target-sum", - "pattern": [ - "Backtracking", - "DFS", - "Dynamic Programming" - ], + "pattern": ["Backtracking", "DFS", "Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1689,9 +1635,7 @@ "id": 24, "title": "Palindrome Partitioning", "slug": "palindrome-partitioning", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1726,9 +1670,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": [ @@ -1818,9 +1760,7 @@ "id": 26, "title": "Generalized Abbreviation", "slug": "generalized-abbreviation", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": true, "companies": [] @@ -1829,9 +1769,7 @@ "id": 27, "title": "Sudoku Solver", "slug": "sudoku-solver", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Hard", "premium": false, "companies": [ @@ -1886,9 +1824,7 @@ "id": 28, "title": "N-Queens", "slug": "n-queens", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Hard", "premium": false, "companies": [ @@ -1943,9 +1879,7 @@ "id": 29, "title": "Climbing Stairs", "slug": "climbing-stairs", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Easy", "premium": false, "companies": [ @@ -2030,9 +1964,7 @@ "id": 30, "title": "House Robber", "slug": "house-robber", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2167,9 +2099,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": [ @@ -2379,9 +2309,7 @@ "id": 32, "title": "Maximum Subarray", "slug": "maximum-subarray", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2506,9 +2434,7 @@ "id": 33, "title": "Range Sum Query - Immutable", "slug": "range-sum-query-immutable", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Easy", "premium": false, "companies": [ @@ -2543,9 +2469,7 @@ "id": 34, "title": "House Robber II", "slug": "house-robber-ii", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2600,9 +2524,7 @@ "id": 35, "title": "Coin Change", "slug": "coin-change", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2707,9 +2629,7 @@ "id": 36, "title": "Maximum Product Subarray", "slug": "maximum-product-subarray", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2774,9 +2694,7 @@ "id": 37, "title": "Longest Increasing Subsequence", "slug": "longest-increasing-subsequence", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2856,9 +2774,7 @@ "id": 38, "title": "Longest Palindromic Substring", "slug": "longest-palindromic-substring", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3003,9 +2919,7 @@ "id": 39, "title": "Word Break", "slug": "word-break", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3090,9 +3004,7 @@ "id": 40, "title": "Combination Sum IV", "slug": "combination-sum-iv", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3117,9 +3029,7 @@ "id": 41, "title": "Decode Ways", "slug": "decode-ways", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3179,9 +3089,7 @@ "id": 42, "title": "Unique Paths", "slug": "unique-paths", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3246,10 +3154,7 @@ "id": 43, "title": "Jump Game", "slug": "jump-game", - "pattern": [ - "Dynamic Programming", - "Greedy" - ], + "pattern": ["Dynamic Programming", "Greedy"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3334,9 +3239,7 @@ "id": 44, "title": "Palindromic Substrings", "slug": "palindromic-substrings", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3416,9 +3319,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": [ @@ -3438,9 +3339,7 @@ "id": 46, "title": "Partition Equal Subset Sum", "slug": "partition-equal-subset-sum", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3490,9 +3389,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": [ @@ -3507,9 +3404,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": [ @@ -3529,10 +3424,7 @@ "id": 49, "title": "Counting Bits", "slug": "counting-bits", - "pattern": [ - "Dynamic Programming", - "Bit Manipulation" - ], + "pattern": ["Dynamic Programming", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3557,9 +3449,7 @@ "id": 50, "title": "Linked List Cycle", "slug": "linked-list-cycle", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3609,9 +3499,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": [ @@ -3651,9 +3539,7 @@ "id": 52, "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": [ @@ -3728,9 +3614,7 @@ "id": 53, "title": "Palindrome Linked List", "slug": "palindrome-linked-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3775,9 +3659,7 @@ "id": 54, "title": "Remove Linked List Elements", "slug": "remove-linked-list-elements", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3802,9 +3684,7 @@ "id": 55, "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": [ @@ -3854,9 +3734,7 @@ "id": 56, "title": "Linked List Cycle II", "slug": "linked-list-cycle-ii", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3886,9 +3764,7 @@ "id": 57, "title": "Add Two Numbers", "slug": "add-two-numbers", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3973,9 +3849,7 @@ "id": 58, "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": [ @@ -4025,9 +3899,7 @@ "id": 59, "title": "Sort List", "slug": "sort-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4062,9 +3934,7 @@ "id": 60, "title": "Reorder List", "slug": "reorder-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4114,10 +3984,7 @@ "id": 61, "title": "Pacific Atlantic Water Flow", "slug": "pacific-atlantic-water-flow", - "pattern": [ - "BFS", - "DFS" - ], + "pattern": ["BFS", "DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4152,11 +4019,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": [ @@ -4381,12 +4244,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": [ @@ -4416,12 +4274,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": [ @@ -4456,9 +4309,7 @@ "id": 65, "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": [ @@ -4508,9 +4359,7 @@ "id": 66, "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": [ @@ -4560,9 +4409,7 @@ "id": 67, "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": [ @@ -4607,9 +4454,7 @@ "id": 68, "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": [ @@ -4649,9 +4494,7 @@ "id": 69, "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": [ @@ -4706,9 +4549,7 @@ "id": 70, "title": "Merge Two Sorted Lists", "slug": "merge-two-sorted-lists", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -4808,10 +4649,7 @@ "id": 71, "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": [ @@ -4851,9 +4689,7 @@ "id": 72, "title": "Find K Pairs with Smallest Sums", "slug": "find-k-pairs-with-smallest-sums", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4893,9 +4729,7 @@ "id": 73, "title": "Merge k Sorted Lists", "slug": "merge-k-sorted-lists", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -5010,9 +4844,7 @@ "id": 74, "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": [ @@ -5047,9 +4879,7 @@ "id": 75, "title": "Meeting Rooms", "slug": "meeting-rooms", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Easy", "premium": true, "companies": [ @@ -5084,9 +4914,7 @@ "id": 76, "title": "Merge Intervals", "slug": "merge-intervals", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5296,9 +5124,7 @@ "id": 77, "title": "Interval List Intersections", "slug": "interval-list-intersections", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5343,9 +5169,7 @@ "id": 78, "title": "Non-overlapping Intervals", "slug": "non-overlapping-intervals", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5390,10 +5214,7 @@ "id": 79, "title": "Meeting Rooms II", "slug": "meeting-rooms-ii", - "pattern": [ - "Heap", - "Intervals" - ], + "pattern": ["Heap", "Intervals"], "difficulty": "Medium", "premium": true, "companies": [ @@ -5478,10 +5299,7 @@ "id": 80, "title": "Task Scheduler", "slug": "task-scheduler", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5541,9 +5359,7 @@ "id": 81, "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": [ @@ -5568,9 +5384,7 @@ "id": 82, "title": "Insert Interval", "slug": "insert-interval", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5625,10 +5439,7 @@ "id": 83, "title": "Employee Free Time", "slug": "employee-free-time", - "pattern": [ - "Heap", - "Greedy" - ], + "pattern": ["Heap", "Greedy"], "difficulty": "Hard", "premium": true, "companies": [ @@ -5653,9 +5464,7 @@ "id": 84, "title": "Binary Search", "slug": "binary-search", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Easy", "premium": false, "companies": [ @@ -5695,9 +5504,7 @@ "id": 85, "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": [ @@ -5712,9 +5519,7 @@ "id": 86, "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": [ @@ -5749,9 +5554,7 @@ "id": 87, "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": [ @@ -5806,9 +5609,7 @@ "id": 88, "title": "Find Peak Element", "slug": "find-peak-element", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5888,9 +5689,7 @@ "id": 89, "title": "Search in Rotated Sorted Array", "slug": "search-in-rotated-sorted-array", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6010,9 +5809,7 @@ "id": 90, "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": [ @@ -6052,9 +5849,7 @@ "id": 91, "title": "Search a 2D Matrix", "slug": "search-a-2d-matrix", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6099,9 +5894,7 @@ "id": 92, "title": "Search a 2D Matrix II", "slug": "search-a-2d-matrix-ii", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6146,9 +5939,7 @@ "id": 93, "title": "Find K Closest Elements", "slug": "find-k-closest-elements", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6218,9 +6009,7 @@ "id": 94, "title": "Count of Range Sum", "slug": "count-of-range-sum", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Hard", "premium": false, "companies": [ @@ -6240,9 +6029,7 @@ "id": 95, "title": "Minimum Size Subarray Sum", "slug": "minimum-size-subarray-sum", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6297,9 +6084,7 @@ "id": 96, "title": "Fruit Into Baskets", "slug": "fruit-into-baskets", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6334,9 +6119,7 @@ "id": 97, "title": "Permutation in String", "slug": "permutation-in-string", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6391,9 +6174,7 @@ "id": 98, "title": "Longest Repeating Character Replacement", "slug": "longest-repeating-character-replacement", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6458,9 +6239,7 @@ "id": 99, "title": "Sliding Window Maximum", "slug": "sliding-window-maximum", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Hard", "premium": false, "companies": [ @@ -6565,9 +6344,7 @@ "id": 100, "title": "Longest Substring Without Repeating Characters", "slug": "longest-substring-without-repeating-characters", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6797,9 +6574,7 @@ "id": 101, "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": [ @@ -6819,9 +6594,7 @@ "id": 102, "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": [] @@ -6830,9 +6603,7 @@ "id": 103, "title": "Minimum Window Substring", "slug": "minimum-window-substring", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Hard", "premium": false, "companies": [ @@ -6937,9 +6708,7 @@ "id": 104, "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": [ @@ -6969,9 +6738,7 @@ "id": 105, "title": "Kth Smallest Element in a BST", "slug": "kth-smallest-element-in-a-bst", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7026,9 +6793,7 @@ "id": 106, "title": "K Closest Points to Origin", "slug": "k-closest-points-to-origin", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7063,9 +6828,7 @@ "id": 107, "title": "Top K Frequent Elements", "slug": "top-k-frequent-elements", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7185,9 +6948,7 @@ "id": 108, "title": "Sort Characters By Frequency", "slug": "sort-characters-by-frequency", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7237,10 +6998,7 @@ "id": 109, "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": [ @@ -7360,10 +7118,7 @@ "id": 110, "title": "Reorganize String", "slug": "reorganize-string", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7428,10 +7183,7 @@ "id": 111, "title": "Rearrange String k Distance Apart", "slug": "rearrange-string-k-distance-apart", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Hard", "premium": true, "companies": [ @@ -7451,10 +7203,7 @@ "id": 112, "title": "Course Schedule III", "slug": "course-schedule-iii", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Hard", "premium": false, "companies": [] @@ -7463,10 +7212,7 @@ "id": 113, "title": "Maximum Frequency Stack", "slug": "maximum-frequency-stack", - "pattern": [ - "Bucket Sort", - "Heap" - ], + "pattern": ["Bucket Sort", "Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -7496,12 +7242,7 @@ "id": 114, "title": "Course Schedule", "slug": "course-schedule", - "pattern": [ - "BFS", - "DFS", - "Graph", - "Topological Sort" - ], + "pattern": ["BFS", "DFS", "Graph", "Topological Sort"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7591,12 +7332,7 @@ "id": 115, "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": [ @@ -7691,11 +7427,7 @@ "id": 116, "title": "Minimum Height Trees", "slug": "minimum-height-trees", - "pattern": [ - "BFS", - "Graph", - "Topological Sort" - ], + "pattern": ["BFS", "Graph", "Topological Sort"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7725,10 +7457,7 @@ "id": 117, "title": "Alien Dictionary", "slug": "alien-dictionary", - "pattern": [ - "Graph", - "Topological Sort" - ], + "pattern": ["Graph", "Topological Sort"], "difficulty": "Hard", "premium": true, "companies": [ @@ -7773,10 +7502,7 @@ "id": 118, "title": "Sequence Reconstruction", "slug": "sequence-reconstruction", - "pattern": [ - "Graph", - "Topological Sort" - ], + "pattern": ["Graph", "Topological Sort"], "difficulty": "Medium", "premium": true, "companies": [ @@ -7791,9 +7517,7 @@ "id": 119, "title": "Binary Tree Level Order Traversal II", "slug": "binary-tree-level-order-traversal-ii", - "pattern": [ - "BFS" - ], + "pattern": ["BFS"], "difficulty": "Medium", "premium": false, "companies": [] @@ -7802,9 +7526,7 @@ "id": 120, "title": "Average of Levels in Binary Tree", "slug": "average-of-levels-in-binary-tree", - "pattern": [ - "BFS" - ], + "pattern": ["BFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -7819,10 +7541,7 @@ "id": 121, "title": "Minimum Depth of Binary Tree", "slug": "minimum-depth-of-binary-tree", - "pattern": [ - "BFS", - "DFS" - ], + "pattern": ["BFS", "DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -7847,9 +7566,7 @@ "id": 122, "title": "Binary Tree Level Order Traversal", "slug": "binary-tree-level-order-traversal", - "pattern": [ - "BFS" - ], + "pattern": ["BFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7899,9 +7616,7 @@ "id": 123, "title": "Binary Tree Zigzag Level Order Traversal", "slug": "binary-tree-zigzag-level-order-traversal", - "pattern": [ - "BFS" - ], + "pattern": ["BFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7976,10 +7691,7 @@ "id": 124, "title": "Binary Tree Right Side View", "slug": "binary-tree-right-side-view", - "pattern": [ - "BFS", - "DFS" - ], + "pattern": ["BFS", "DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8044,10 +7756,7 @@ "id": 125, "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": [ @@ -8087,9 +7796,7 @@ "id": 126, "title": "Same Tree", "slug": "same-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8129,9 +7836,7 @@ "id": 127, "title": "Path Sum", "slug": "path-sum", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8166,9 +7871,7 @@ "id": 128, "title": "Maximum Depth of Binary Tree", "slug": "maximum-depth-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8218,9 +7921,7 @@ "id": 129, "title": "Diameter of Binary Tree", "slug": "diameter-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8275,9 +7976,7 @@ "id": 130, "title": "Merge Two Binary Trees", "slug": "merge-two-binary-trees", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8297,9 +7996,7 @@ "id": 131, "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": [ @@ -8339,9 +8036,7 @@ "id": 132, "title": "Subtree of Another Tree", "slug": "subtree-of-another-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8371,9 +8066,7 @@ "id": 133, "title": "Invert Binary Tree", "slug": "invert-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -8393,9 +8086,7 @@ "id": 134, "title": "Path Sum II", "slug": "path-sum-ii", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8430,9 +8121,7 @@ "id": 135, "title": "Path Sum III", "slug": "path-sum-iii", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8462,9 +8151,7 @@ "id": 136, "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": [ @@ -8539,9 +8226,7 @@ "id": 137, "title": "Maximum Binary Tree", "slug": "maximum-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [] @@ -8550,9 +8235,7 @@ "id": 138, "title": "Maximum Width of Binary Tree", "slug": "maximum-width-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8582,9 +8265,7 @@ "id": 139, "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": [ @@ -8629,9 +8310,7 @@ "id": 140, "title": "Validate Binary Search Tree", "slug": "validate-binary-search-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8696,10 +8375,7 @@ "id": 141, "title": "Implement Trie (Prefix Tree)", "slug": "implement-trie-prefix-tree", - "pattern": [ - "Design", - "Trie" - ], + "pattern": ["Design", "Trie"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8774,9 +8450,7 @@ "id": 142, "title": "Binary Tree Maximum Path Sum", "slug": "binary-tree-maximum-path-sum", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8861,9 +8535,7 @@ "id": 143, "title": "Serialize and Deserialize Binary Tree", "slug": "serialize-and-deserialize-binary-tree", - "pattern": [ - "Design" - ], + "pattern": ["Design"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8933,10 +8605,7 @@ "id": 144, "title": "Word Search II", "slug": "word-search-ii", - "pattern": [ - "DFS", - "Trie" - ], + "pattern": ["DFS", "Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -9011,9 +8680,7 @@ "id": 145, "title": "Find Median from Data Stream", "slug": "find-median-from-data-stream", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -9128,9 +8795,7 @@ "id": 146, "title": "Sliding Window Median", "slug": "sliding-window-median", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -9155,9 +8820,7 @@ "id": 147, "title": "Two Sum", "slug": "two-sum", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9417,9 +9080,7 @@ "id": 148, "title": "Squares of a Sorted Array", "slug": "squares-of-a-sorted-array", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9474,9 +9135,7 @@ "id": 149, "title": "Backspace String Compare", "slug": "backspace-string-compare", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9521,9 +9180,7 @@ "id": 150, "title": "3Sum", "slug": "3sum", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9658,9 +9315,7 @@ "id": 151, "title": "3Sum Closest", "slug": "3sum-closest", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9705,9 +9360,7 @@ "id": 152, "title": "Subarray Product Less Than K", "slug": "subarray-product-less-than-k", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9777,9 +9430,7 @@ "id": 153, "title": "Sort Colors", "slug": "sort-colors", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9854,9 +9505,7 @@ "id": 154, "title": "Trapping Rain Water", "slug": "trapping-rain-water", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10011,9 +9660,7 @@ "id": 155, "title": "Container With Most Water", "slug": "container-with-most-water", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10103,9 +9750,7 @@ "id": 156, "title": "Longest Word in Dictionary", "slug": "longest-word-in-dictionary", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Medium", "premium": false, "companies": [] @@ -10114,9 +9759,7 @@ "id": 157, "title": "Index Pairs of a String", "slug": "index-pairs-of-a-string", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Easy", "premium": true, "companies": [] @@ -10125,9 +9768,7 @@ "id": 158, "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": [ @@ -10152,9 +9793,7 @@ "id": 159, "title": "Concatenated Words", "slug": "concatenated-words", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10184,9 +9823,7 @@ "id": 160, "title": "Prefix and Suffix Search", "slug": "prefix-and-suffix-search", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [] @@ -10195,9 +9832,7 @@ "id": 161, "title": "Palindrome Pairs", "slug": "palindrome-pairs", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10222,9 +9857,7 @@ "id": 162, "title": "Design Search Autocomplete System", "slug": "design-search-autocomplete-system", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": true, "companies": [ @@ -10279,9 +9912,7 @@ "id": 163, "title": "Word Squares", "slug": "word-squares", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": true, "companies": [] @@ -10290,11 +9921,7 @@ "id": 164, "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": [ @@ -10309,9 +9936,7 @@ "id": 165, "title": "Median of Two Sorted Arrays", "slug": "median-of-two-sorted-arrays", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10416,9 +10041,7 @@ "id": 166, "title": "Majority Element", "slug": "majority-element", - "pattern": [ - "Sorting" - ], + "pattern": ["Sorting"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10488,9 +10111,7 @@ "id": 167, "title": "Convert 1D Array Into 2D Array", "slug": "convert-1d-array-into-2d-array", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10515,10 +10136,7 @@ "id": 168, "title": "Move Zeroes", "slug": "move-zeroes", - "pattern": [ - "Arrays", - "Two Pointers" - ], + "pattern": ["Arrays", "Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10628,9 +10246,7 @@ "id": 169, "title": "Is Subsequence", "slug": "is-subsequence", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10675,10 +10291,7 @@ "id": 170, "title": "Binary Tree Paths", "slug": "binary-tree-paths", - "pattern": [ - "DFS", - "Backtracking" - ], + "pattern": ["DFS", "Backtracking"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10693,10 +10306,7 @@ "id": 171, "title": "Factor Combinations", "slug": "factor-combinations", - "pattern": [ - "Arrays", - "Backtracking" - ], + "pattern": ["Arrays", "Backtracking"], "difficulty": "Medium", "premium": true, "companies": [ @@ -10711,9 +10321,7 @@ "id": 172, "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": [ @@ -10733,9 +10341,7 @@ "id": 173, "title": "Maximum Average Subarray I", "slug": "maximum-average-subarray-i", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10760,6 +10366,36 @@ "frequency": 2 } ] + }, + { + "id": 174, + "title": "Gas Station", + "slug": "gas-station", + "pattern": ["Greedy"], + "difficulty": "Medium", + "premium": false, + "companies": [ + { + "name": "Amazon", + "slug": "amazon", + "frequency": 20 + }, + { + "name": "Microsoft", + "slug": "microsoft", + "frequency": 12 + }, + { + "name": "Google", + "slug": "google", + "frequency": 8 + }, + { + "name": "Meta", + "slug": "facebook", + "frequency": 6 + } + ] } ] -} \ No newline at end of file +} From fd43942325fa4f4a72831f8e9b9d8853e08b36bc Mon Sep 17 00:00:00 2001 From: BilalBaheer Date: Sat, 29 Mar 2025 11:25:45 -0700 Subject: [PATCH 2/2] Fix companies section for Gas Station problem to be an empty array --- src/data/questions.json | 771 +++++++++++++++++++++++++++++----------- 1 file changed, 573 insertions(+), 198 deletions(-) diff --git a/src/data/questions.json b/src/data/questions.json index 0f12d332..cd632e8c 100644 --- a/src/data/questions.json +++ b/src/data/questions.json @@ -5,7 +5,9 @@ "id": 0, "title": "Contains Duplicate", "slug": "contains-duplicate", - "pattern": ["Arrays"], + "pattern": [ + "Arrays" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -65,7 +67,10 @@ "id": 1, "title": "Missing Number", "slug": "missing-number", - "pattern": ["Arrays", "Bit Manipulation"], + "pattern": [ + "Arrays", + "Bit Manipulation" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -115,7 +120,9 @@ "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": [ @@ -140,7 +147,10 @@ "id": 3, "title": "Single Number", "slug": "single-number", - "pattern": ["Arrays", "Bit Manipulation"], + "pattern": [ + "Arrays", + "Bit Manipulation" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -190,7 +200,9 @@ "id": 4, "title": "Product of Array Except Self", "slug": "product-of-array-except-self", - "pattern": ["Arrays"], + "pattern": [ + "Arrays" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -320,7 +332,11 @@ "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": [ @@ -390,7 +406,9 @@ "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": [ @@ -435,7 +453,9 @@ "id": 7, "title": "Set Matrix Zeroes", "slug": "set-matrix-zeroes", - "pattern": ["Arrays"], + "pattern": [ + "Arrays" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -490,7 +510,9 @@ "id": 8, "title": "Spiral Matrix", "slug": "spiral-matrix", - "pattern": ["Arrays"], + "pattern": [ + "Arrays" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -630,7 +652,9 @@ "id": 9, "title": "Rotate Image", "slug": "rotate-image", - "pattern": ["Arrays"], + "pattern": [ + "Arrays" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -730,7 +754,9 @@ "id": 10, "title": "Word Search", "slug": "word-search", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -845,7 +871,9 @@ "id": 11, "title": "First Missing Positive", "slug": "first-missing-positive", - "pattern": ["Arrays"], + "pattern": [ + "Arrays" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -945,7 +973,9 @@ "id": 12, "title": "Longest Consecutive Sequence", "slug": "longest-consecutive-sequence", - "pattern": ["Arrays"], + "pattern": [ + "Arrays" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1050,7 +1080,9 @@ "id": 13, "title": "Letter Case Permutation", "slug": "letter-case-permutation", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1065,7 +1097,9 @@ "id": 14, "title": "Subsets", "slug": "subsets", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1130,7 +1164,9 @@ "id": 15, "title": "Subsets II", "slug": "subsets-ii", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1170,7 +1206,9 @@ "id": 16, "title": "Permutations", "slug": "permutations", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1235,7 +1273,9 @@ "id": 17, "title": "Permutations II", "slug": "permutations-ii", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1265,7 +1305,9 @@ "id": 18, "title": "Combinations", "slug": "combinations", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1305,7 +1347,9 @@ "id": 19, "title": "Combination Sum", "slug": "combination-sum", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1400,7 +1444,9 @@ "id": 20, "title": "Combination Sum II", "slug": "combination-sum-ii", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1455,7 +1501,9 @@ "id": 21, "title": "Combination Sum III", "slug": "combination-sum-iii", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1480,7 +1528,9 @@ "id": 22, "title": "Generate Parentheses", "slug": "generate-parentheses", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1590,7 +1640,11 @@ "id": 23, "title": "Target Sum", "slug": "target-sum", - "pattern": ["Backtracking", "DFS", "Dynamic Programming"], + "pattern": [ + "Backtracking", + "DFS", + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1635,7 +1689,9 @@ "id": 24, "title": "Palindrome Partitioning", "slug": "palindrome-partitioning", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -1670,7 +1726,9 @@ "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": [ @@ -1760,7 +1818,9 @@ "id": 26, "title": "Generalized Abbreviation", "slug": "generalized-abbreviation", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Medium", "premium": true, "companies": [] @@ -1769,7 +1829,9 @@ "id": 27, "title": "Sudoku Solver", "slug": "sudoku-solver", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -1824,7 +1886,9 @@ "id": 28, "title": "N-Queens", "slug": "n-queens", - "pattern": ["Backtracking"], + "pattern": [ + "Backtracking" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -1879,7 +1943,9 @@ "id": 29, "title": "Climbing Stairs", "slug": "climbing-stairs", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -1964,7 +2030,9 @@ "id": 30, "title": "House Robber", "slug": "house-robber", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -2099,7 +2167,9 @@ "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": [ @@ -2309,7 +2379,9 @@ "id": 32, "title": "Maximum Subarray", "slug": "maximum-subarray", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -2434,7 +2506,9 @@ "id": 33, "title": "Range Sum Query - Immutable", "slug": "range-sum-query-immutable", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -2469,7 +2543,9 @@ "id": 34, "title": "House Robber II", "slug": "house-robber-ii", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -2524,7 +2600,9 @@ "id": 35, "title": "Coin Change", "slug": "coin-change", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -2629,7 +2707,9 @@ "id": 36, "title": "Maximum Product Subarray", "slug": "maximum-product-subarray", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -2694,7 +2774,9 @@ "id": 37, "title": "Longest Increasing Subsequence", "slug": "longest-increasing-subsequence", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -2774,7 +2856,9 @@ "id": 38, "title": "Longest Palindromic Substring", "slug": "longest-palindromic-substring", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -2919,7 +3003,9 @@ "id": 39, "title": "Word Break", "slug": "word-break", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3004,7 +3090,9 @@ "id": 40, "title": "Combination Sum IV", "slug": "combination-sum-iv", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3029,7 +3117,9 @@ "id": 41, "title": "Decode Ways", "slug": "decode-ways", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3089,7 +3179,9 @@ "id": 42, "title": "Unique Paths", "slug": "unique-paths", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3154,7 +3246,10 @@ "id": 43, "title": "Jump Game", "slug": "jump-game", - "pattern": ["Dynamic Programming", "Greedy"], + "pattern": [ + "Dynamic Programming", + "Greedy" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3239,7 +3334,9 @@ "id": 44, "title": "Palindromic Substrings", "slug": "palindromic-substrings", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3319,7 +3416,9 @@ "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": [ @@ -3339,7 +3438,9 @@ "id": 46, "title": "Partition Equal Subset Sum", "slug": "partition-equal-subset-sum", - "pattern": ["Dynamic Programming"], + "pattern": [ + "Dynamic Programming" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3389,7 +3490,9 @@ "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": [ @@ -3404,7 +3507,9 @@ "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": [ @@ -3424,7 +3529,10 @@ "id": 49, "title": "Counting Bits", "slug": "counting-bits", - "pattern": ["Dynamic Programming", "Bit Manipulation"], + "pattern": [ + "Dynamic Programming", + "Bit Manipulation" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -3449,7 +3557,9 @@ "id": 50, "title": "Linked List Cycle", "slug": "linked-list-cycle", - "pattern": ["Fast & Slow Pointers"], + "pattern": [ + "Fast & Slow Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -3499,7 +3609,9 @@ "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": [ @@ -3539,7 +3651,9 @@ "id": 52, "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": [ @@ -3614,7 +3728,9 @@ "id": 53, "title": "Palindrome Linked List", "slug": "palindrome-linked-list", - "pattern": ["Fast & Slow Pointers"], + "pattern": [ + "Fast & Slow Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -3659,7 +3775,9 @@ "id": 54, "title": "Remove Linked List Elements", "slug": "remove-linked-list-elements", - "pattern": ["Fast & Slow Pointers"], + "pattern": [ + "Fast & Slow Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -3684,7 +3802,9 @@ "id": 55, "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": [ @@ -3734,7 +3854,9 @@ "id": 56, "title": "Linked List Cycle II", "slug": "linked-list-cycle-ii", - "pattern": ["Fast & Slow Pointers"], + "pattern": [ + "Fast & Slow Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3764,7 +3886,9 @@ "id": 57, "title": "Add Two Numbers", "slug": "add-two-numbers", - "pattern": ["Fast & Slow Pointers"], + "pattern": [ + "Fast & Slow Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3849,7 +3973,9 @@ "id": 58, "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": [ @@ -3899,7 +4025,9 @@ "id": 59, "title": "Sort List", "slug": "sort-list", - "pattern": ["Fast & Slow Pointers"], + "pattern": [ + "Fast & Slow Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3934,7 +4062,9 @@ "id": 60, "title": "Reorder List", "slug": "reorder-list", - "pattern": ["Fast & Slow Pointers"], + "pattern": [ + "Fast & Slow Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -3984,7 +4114,10 @@ "id": 61, "title": "Pacific Atlantic Water Flow", "slug": "pacific-atlantic-water-flow", - "pattern": ["BFS", "DFS"], + "pattern": [ + "BFS", + "DFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -4019,7 +4152,11 @@ "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": [ @@ -4244,7 +4381,12 @@ "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": [ @@ -4274,7 +4416,12 @@ "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": [ @@ -4309,7 +4456,9 @@ "id": 65, "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": [ @@ -4359,7 +4508,9 @@ "id": 66, "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": [ @@ -4409,7 +4560,9 @@ "id": 67, "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": [ @@ -4454,7 +4607,9 @@ "id": 68, "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": [ @@ -4494,7 +4649,9 @@ "id": 69, "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": [ @@ -4549,7 +4706,9 @@ "id": 70, "title": "Merge Two Sorted Lists", "slug": "merge-two-sorted-lists", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -4649,7 +4808,10 @@ "id": 71, "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": [ @@ -4689,7 +4851,9 @@ "id": 72, "title": "Find K Pairs with Smallest Sums", "slug": "find-k-pairs-with-smallest-sums", - "pattern": ["Heap"], + "pattern": [ + "Heap" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -4729,7 +4893,9 @@ "id": 73, "title": "Merge k Sorted Lists", "slug": "merge-k-sorted-lists", - "pattern": ["Heap"], + "pattern": [ + "Heap" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -4844,7 +5010,9 @@ "id": 74, "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": [ @@ -4879,7 +5047,9 @@ "id": 75, "title": "Meeting Rooms", "slug": "meeting-rooms", - "pattern": ["Intervals"], + "pattern": [ + "Intervals" + ], "difficulty": "Easy", "premium": true, "companies": [ @@ -4914,7 +5084,9 @@ "id": 76, "title": "Merge Intervals", "slug": "merge-intervals", - "pattern": ["Intervals"], + "pattern": [ + "Intervals" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5124,7 +5296,9 @@ "id": 77, "title": "Interval List Intersections", "slug": "interval-list-intersections", - "pattern": ["Intervals"], + "pattern": [ + "Intervals" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5169,7 +5343,9 @@ "id": 78, "title": "Non-overlapping Intervals", "slug": "non-overlapping-intervals", - "pattern": ["Intervals"], + "pattern": [ + "Intervals" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5214,7 +5390,10 @@ "id": 79, "title": "Meeting Rooms II", "slug": "meeting-rooms-ii", - "pattern": ["Heap", "Intervals"], + "pattern": [ + "Heap", + "Intervals" + ], "difficulty": "Medium", "premium": true, "companies": [ @@ -5299,7 +5478,10 @@ "id": 80, "title": "Task Scheduler", "slug": "task-scheduler", - "pattern": ["Greedy", "Heap"], + "pattern": [ + "Greedy", + "Heap" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5359,7 +5541,9 @@ "id": 81, "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": [ @@ -5384,7 +5568,9 @@ "id": 82, "title": "Insert Interval", "slug": "insert-interval", - "pattern": ["Intervals"], + "pattern": [ + "Intervals" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5439,7 +5625,10 @@ "id": 83, "title": "Employee Free Time", "slug": "employee-free-time", - "pattern": ["Heap", "Greedy"], + "pattern": [ + "Heap", + "Greedy" + ], "difficulty": "Hard", "premium": true, "companies": [ @@ -5464,7 +5653,9 @@ "id": 84, "title": "Binary Search", "slug": "binary-search", - "pattern": ["Binary Search"], + "pattern": [ + "Binary Search" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -5504,7 +5695,9 @@ "id": 85, "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": [ @@ -5519,7 +5712,9 @@ "id": 86, "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": [ @@ -5554,7 +5749,9 @@ "id": 87, "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": [ @@ -5609,7 +5806,9 @@ "id": 88, "title": "Find Peak Element", "slug": "find-peak-element", - "pattern": ["Binary Search"], + "pattern": [ + "Binary Search" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5689,7 +5888,9 @@ "id": 89, "title": "Search in Rotated Sorted Array", "slug": "search-in-rotated-sorted-array", - "pattern": ["Binary Search"], + "pattern": [ + "Binary Search" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5809,7 +6010,9 @@ "id": 90, "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": [ @@ -5849,7 +6052,9 @@ "id": 91, "title": "Search a 2D Matrix", "slug": "search-a-2d-matrix", - "pattern": ["Binary Search"], + "pattern": [ + "Binary Search" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5894,7 +6099,9 @@ "id": 92, "title": "Search a 2D Matrix II", "slug": "search-a-2d-matrix-ii", - "pattern": ["Binary Search"], + "pattern": [ + "Binary Search" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -5939,7 +6146,9 @@ "id": 93, "title": "Find K Closest Elements", "slug": "find-k-closest-elements", - "pattern": ["Binary Search"], + "pattern": [ + "Binary Search" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6009,7 +6218,9 @@ "id": 94, "title": "Count of Range Sum", "slug": "count-of-range-sum", - "pattern": ["Binary Search"], + "pattern": [ + "Binary Search" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -6029,7 +6240,9 @@ "id": 95, "title": "Minimum Size Subarray Sum", "slug": "minimum-size-subarray-sum", - "pattern": ["Sliding Window"], + "pattern": [ + "Sliding Window" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6084,7 +6297,9 @@ "id": 96, "title": "Fruit Into Baskets", "slug": "fruit-into-baskets", - "pattern": ["Sliding Window"], + "pattern": [ + "Sliding Window" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6119,7 +6334,9 @@ "id": 97, "title": "Permutation in String", "slug": "permutation-in-string", - "pattern": ["Sliding Window"], + "pattern": [ + "Sliding Window" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6174,7 +6391,9 @@ "id": 98, "title": "Longest Repeating Character Replacement", "slug": "longest-repeating-character-replacement", - "pattern": ["Sliding Window"], + "pattern": [ + "Sliding Window" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6239,7 +6458,9 @@ "id": 99, "title": "Sliding Window Maximum", "slug": "sliding-window-maximum", - "pattern": ["Sliding Window"], + "pattern": [ + "Sliding Window" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -6344,7 +6565,9 @@ "id": 100, "title": "Longest Substring Without Repeating Characters", "slug": "longest-substring-without-repeating-characters", - "pattern": ["Sliding Window"], + "pattern": [ + "Sliding Window" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6574,7 +6797,9 @@ "id": 101, "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": [ @@ -6594,7 +6819,9 @@ "id": 102, "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": [] @@ -6603,7 +6830,9 @@ "id": 103, "title": "Minimum Window Substring", "slug": "minimum-window-substring", - "pattern": ["Sliding Window"], + "pattern": [ + "Sliding Window" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -6708,7 +6937,9 @@ "id": 104, "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": [ @@ -6738,7 +6969,9 @@ "id": 105, "title": "Kth Smallest Element in a BST", "slug": "kth-smallest-element-in-a-bst", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6793,7 +7026,9 @@ "id": 106, "title": "K Closest Points to Origin", "slug": "k-closest-points-to-origin", - "pattern": ["Heap"], + "pattern": [ + "Heap" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6828,7 +7063,9 @@ "id": 107, "title": "Top K Frequent Elements", "slug": "top-k-frequent-elements", - "pattern": ["Heap"], + "pattern": [ + "Heap" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6948,7 +7185,9 @@ "id": 108, "title": "Sort Characters By Frequency", "slug": "sort-characters-by-frequency", - "pattern": ["Heap"], + "pattern": [ + "Heap" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -6998,7 +7237,10 @@ "id": 109, "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": [ @@ -7118,7 +7360,10 @@ "id": 110, "title": "Reorganize String", "slug": "reorganize-string", - "pattern": ["Greedy", "Heap"], + "pattern": [ + "Greedy", + "Heap" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -7183,7 +7428,10 @@ "id": 111, "title": "Rearrange String k Distance Apart", "slug": "rearrange-string-k-distance-apart", - "pattern": ["Greedy", "Heap"], + "pattern": [ + "Greedy", + "Heap" + ], "difficulty": "Hard", "premium": true, "companies": [ @@ -7203,7 +7451,10 @@ "id": 112, "title": "Course Schedule III", "slug": "course-schedule-iii", - "pattern": ["Greedy", "Heap"], + "pattern": [ + "Greedy", + "Heap" + ], "difficulty": "Hard", "premium": false, "companies": [] @@ -7212,7 +7463,10 @@ "id": 113, "title": "Maximum Frequency Stack", "slug": "maximum-frequency-stack", - "pattern": ["Bucket Sort", "Heap"], + "pattern": [ + "Bucket Sort", + "Heap" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -7242,7 +7496,12 @@ "id": 114, "title": "Course Schedule", "slug": "course-schedule", - "pattern": ["BFS", "DFS", "Graph", "Topological Sort"], + "pattern": [ + "BFS", + "DFS", + "Graph", + "Topological Sort" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -7332,7 +7591,12 @@ "id": 115, "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": [ @@ -7427,7 +7691,11 @@ "id": 116, "title": "Minimum Height Trees", "slug": "minimum-height-trees", - "pattern": ["BFS", "Graph", "Topological Sort"], + "pattern": [ + "BFS", + "Graph", + "Topological Sort" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -7457,7 +7725,10 @@ "id": 117, "title": "Alien Dictionary", "slug": "alien-dictionary", - "pattern": ["Graph", "Topological Sort"], + "pattern": [ + "Graph", + "Topological Sort" + ], "difficulty": "Hard", "premium": true, "companies": [ @@ -7502,7 +7773,10 @@ "id": 118, "title": "Sequence Reconstruction", "slug": "sequence-reconstruction", - "pattern": ["Graph", "Topological Sort"], + "pattern": [ + "Graph", + "Topological Sort" + ], "difficulty": "Medium", "premium": true, "companies": [ @@ -7517,7 +7791,9 @@ "id": 119, "title": "Binary Tree Level Order Traversal II", "slug": "binary-tree-level-order-traversal-ii", - "pattern": ["BFS"], + "pattern": [ + "BFS" + ], "difficulty": "Medium", "premium": false, "companies": [] @@ -7526,7 +7802,9 @@ "id": 120, "title": "Average of Levels in Binary Tree", "slug": "average-of-levels-in-binary-tree", - "pattern": ["BFS"], + "pattern": [ + "BFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -7541,7 +7819,10 @@ "id": 121, "title": "Minimum Depth of Binary Tree", "slug": "minimum-depth-of-binary-tree", - "pattern": ["BFS", "DFS"], + "pattern": [ + "BFS", + "DFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -7566,7 +7847,9 @@ "id": 122, "title": "Binary Tree Level Order Traversal", "slug": "binary-tree-level-order-traversal", - "pattern": ["BFS"], + "pattern": [ + "BFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -7616,7 +7899,9 @@ "id": 123, "title": "Binary Tree Zigzag Level Order Traversal", "slug": "binary-tree-zigzag-level-order-traversal", - "pattern": ["BFS"], + "pattern": [ + "BFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -7691,7 +7976,10 @@ "id": 124, "title": "Binary Tree Right Side View", "slug": "binary-tree-right-side-view", - "pattern": ["BFS", "DFS"], + "pattern": [ + "BFS", + "DFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -7756,7 +8044,10 @@ "id": 125, "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": [ @@ -7796,7 +8087,9 @@ "id": 126, "title": "Same Tree", "slug": "same-tree", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -7836,7 +8129,9 @@ "id": 127, "title": "Path Sum", "slug": "path-sum", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -7871,7 +8166,9 @@ "id": 128, "title": "Maximum Depth of Binary Tree", "slug": "maximum-depth-of-binary-tree", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -7921,7 +8218,9 @@ "id": 129, "title": "Diameter of Binary Tree", "slug": "diameter-of-binary-tree", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -7976,7 +8275,9 @@ "id": 130, "title": "Merge Two Binary Trees", "slug": "merge-two-binary-trees", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -7996,7 +8297,9 @@ "id": 131, "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": [ @@ -8036,7 +8339,9 @@ "id": 132, "title": "Subtree of Another Tree", "slug": "subtree-of-another-tree", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -8066,7 +8371,9 @@ "id": 133, "title": "Invert Binary Tree", "slug": "invert-binary-tree", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -8086,7 +8393,9 @@ "id": 134, "title": "Path Sum II", "slug": "path-sum-ii", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -8121,7 +8430,9 @@ "id": 135, "title": "Path Sum III", "slug": "path-sum-iii", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -8151,7 +8462,9 @@ "id": 136, "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": [ @@ -8226,7 +8539,9 @@ "id": 137, "title": "Maximum Binary Tree", "slug": "maximum-binary-tree", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Medium", "premium": false, "companies": [] @@ -8235,7 +8550,9 @@ "id": 138, "title": "Maximum Width of Binary Tree", "slug": "maximum-width-of-binary-tree", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -8265,7 +8582,9 @@ "id": 139, "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": [ @@ -8310,7 +8629,9 @@ "id": 140, "title": "Validate Binary Search Tree", "slug": "validate-binary-search-tree", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -8375,7 +8696,10 @@ "id": 141, "title": "Implement Trie (Prefix Tree)", "slug": "implement-trie-prefix-tree", - "pattern": ["Design", "Trie"], + "pattern": [ + "Design", + "Trie" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -8450,7 +8774,9 @@ "id": 142, "title": "Binary Tree Maximum Path Sum", "slug": "binary-tree-maximum-path-sum", - "pattern": ["DFS"], + "pattern": [ + "DFS" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -8535,7 +8861,9 @@ "id": 143, "title": "Serialize and Deserialize Binary Tree", "slug": "serialize-and-deserialize-binary-tree", - "pattern": ["Design"], + "pattern": [ + "Design" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -8605,7 +8933,10 @@ "id": 144, "title": "Word Search II", "slug": "word-search-ii", - "pattern": ["DFS", "Trie"], + "pattern": [ + "DFS", + "Trie" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -8680,7 +9011,9 @@ "id": 145, "title": "Find Median from Data Stream", "slug": "find-median-from-data-stream", - "pattern": ["Heap"], + "pattern": [ + "Heap" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -8795,7 +9128,9 @@ "id": 146, "title": "Sliding Window Median", "slug": "sliding-window-median", - "pattern": ["Heap"], + "pattern": [ + "Heap" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -8820,7 +9155,9 @@ "id": 147, "title": "Two Sum", "slug": "two-sum", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -9080,7 +9417,9 @@ "id": 148, "title": "Squares of a Sorted Array", "slug": "squares-of-a-sorted-array", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -9135,7 +9474,9 @@ "id": 149, "title": "Backspace String Compare", "slug": "backspace-string-compare", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -9180,7 +9521,9 @@ "id": 150, "title": "3Sum", "slug": "3sum", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -9315,7 +9658,9 @@ "id": 151, "title": "3Sum Closest", "slug": "3sum-closest", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -9360,7 +9705,9 @@ "id": 152, "title": "Subarray Product Less Than K", "slug": "subarray-product-less-than-k", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -9430,7 +9777,9 @@ "id": 153, "title": "Sort Colors", "slug": "sort-colors", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -9505,7 +9854,9 @@ "id": 154, "title": "Trapping Rain Water", "slug": "trapping-rain-water", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -9660,7 +10011,9 @@ "id": 155, "title": "Container With Most Water", "slug": "container-with-most-water", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Medium", "premium": false, "companies": [ @@ -9750,7 +10103,9 @@ "id": 156, "title": "Longest Word in Dictionary", "slug": "longest-word-in-dictionary", - "pattern": ["Trie"], + "pattern": [ + "Trie" + ], "difficulty": "Medium", "premium": false, "companies": [] @@ -9759,7 +10114,9 @@ "id": 157, "title": "Index Pairs of a String", "slug": "index-pairs-of-a-string", - "pattern": ["Trie"], + "pattern": [ + "Trie" + ], "difficulty": "Easy", "premium": true, "companies": [] @@ -9768,7 +10125,9 @@ "id": 158, "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": [ @@ -9793,7 +10152,9 @@ "id": 159, "title": "Concatenated Words", "slug": "concatenated-words", - "pattern": ["Trie"], + "pattern": [ + "Trie" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -9823,7 +10184,9 @@ "id": 160, "title": "Prefix and Suffix Search", "slug": "prefix-and-suffix-search", - "pattern": ["Trie"], + "pattern": [ + "Trie" + ], "difficulty": "Hard", "premium": false, "companies": [] @@ -9832,7 +10195,9 @@ "id": 161, "title": "Palindrome Pairs", "slug": "palindrome-pairs", - "pattern": ["Trie"], + "pattern": [ + "Trie" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -9857,7 +10222,9 @@ "id": 162, "title": "Design Search Autocomplete System", "slug": "design-search-autocomplete-system", - "pattern": ["Trie"], + "pattern": [ + "Trie" + ], "difficulty": "Hard", "premium": true, "companies": [ @@ -9912,7 +10279,9 @@ "id": 163, "title": "Word Squares", "slug": "word-squares", - "pattern": ["Trie"], + "pattern": [ + "Trie" + ], "difficulty": "Hard", "premium": true, "companies": [] @@ -9921,7 +10290,11 @@ "id": 164, "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": [ @@ -9936,7 +10309,9 @@ "id": 165, "title": "Median of Two Sorted Arrays", "slug": "median-of-two-sorted-arrays", - "pattern": ["Binary Search"], + "pattern": [ + "Binary Search" + ], "difficulty": "Hard", "premium": false, "companies": [ @@ -10041,7 +10416,9 @@ "id": 166, "title": "Majority Element", "slug": "majority-element", - "pattern": ["Sorting"], + "pattern": [ + "Sorting" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -10111,7 +10488,9 @@ "id": 167, "title": "Convert 1D Array Into 2D Array", "slug": "convert-1d-array-into-2d-array", - "pattern": ["Arrays"], + "pattern": [ + "Arrays" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -10136,7 +10515,10 @@ "id": 168, "title": "Move Zeroes", "slug": "move-zeroes", - "pattern": ["Arrays", "Two Pointers"], + "pattern": [ + "Arrays", + "Two Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -10246,7 +10628,9 @@ "id": 169, "title": "Is Subsequence", "slug": "is-subsequence", - "pattern": ["Two Pointers"], + "pattern": [ + "Two Pointers" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -10291,7 +10675,10 @@ "id": 170, "title": "Binary Tree Paths", "slug": "binary-tree-paths", - "pattern": ["DFS", "Backtracking"], + "pattern": [ + "DFS", + "Backtracking" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -10306,7 +10693,10 @@ "id": 171, "title": "Factor Combinations", "slug": "factor-combinations", - "pattern": ["Arrays", "Backtracking"], + "pattern": [ + "Arrays", + "Backtracking" + ], "difficulty": "Medium", "premium": true, "companies": [ @@ -10321,7 +10711,9 @@ "id": 172, "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": [ @@ -10341,7 +10733,9 @@ "id": 173, "title": "Maximum Average Subarray I", "slug": "maximum-average-subarray-i", - "pattern": ["Sliding Window"], + "pattern": [ + "Sliding Window" + ], "difficulty": "Easy", "premium": false, "companies": [ @@ -10371,31 +10765,12 @@ "id": 174, "title": "Gas Station", "slug": "gas-station", - "pattern": ["Greedy"], + "pattern": [ + "Greedy" + ], "difficulty": "Medium", "premium": false, - "companies": [ - { - "name": "Amazon", - "slug": "amazon", - "frequency": 20 - }, - { - "name": "Microsoft", - "slug": "microsoft", - "frequency": 12 - }, - { - "name": "Google", - "slug": "google", - "frequency": 8 - }, - { - "name": "Meta", - "slug": "facebook", - "frequency": 6 - } - ] + "companies": [] } ] -} +} \ No newline at end of file