From a1b83b268450dc2a15bb50a79495c001a440cda4 Mon Sep 17 00:00:00 2001 From: Sean Prashad <13009507+SeanPrashad@users.noreply.github.com> Date: Sat, 19 Nov 2022 13:25:02 -0500 Subject: [PATCH] Move reverse linked list infront of palindrome linked list Solving these questions in order will develop a better intuition! Fixes #243 --- src/data/questions.json | 958 ++++++++++++---------------------------- 1 file changed, 286 insertions(+), 672 deletions(-) diff --git a/src/data/questions.json b/src/data/questions.json index daa4ed61..04f8a7cf 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": [ @@ -102,10 +100,7 @@ "id": 1, "title": "Missing Number", "slug": "missing-number", - "pattern": [ - "Arrays", - "Bit Manipulation" - ], + "pattern": ["Arrays", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -185,9 +180,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": [ @@ -222,10 +215,7 @@ "id": 3, "title": "Single Number", "slug": "single-number", - "pattern": [ - "Arrays", - "Bit Manipulation" - ], + "pattern": ["Arrays", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -295,9 +285,7 @@ "id": 4, "title": "Product of Array Except Self", "slug": "product-of-array-except-self", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -417,11 +405,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": [ @@ -486,9 +470,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": [ @@ -543,9 +525,7 @@ "id": 7, "title": "Set Matrix Zeroes", "slug": "set-matrix-zeroes", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -600,9 +580,7 @@ "id": 8, "title": "Spiral Matrix", "slug": "spiral-matrix", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -717,9 +695,7 @@ "id": 9, "title": "Rotate Image", "slug": "rotate-image", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -834,9 +810,7 @@ "id": 10, "title": "Word Search", "slug": "word-search", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -956,9 +930,7 @@ "id": 11, "title": "First Missing Positive", "slug": "first-missing-positive", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Hard", "premium": false, "companies": [ @@ -1068,9 +1040,7 @@ "id": 12, "title": "Longest Consecutive Sequence", "slug": "longest-consecutive-sequence", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1145,9 +1115,7 @@ "id": 13, "title": "Letter Case Permutation", "slug": "letter-case-permutation", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1172,9 +1140,7 @@ "id": 14, "title": "Subsets", "slug": "subsets", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1264,9 +1230,7 @@ "id": 15, "title": "Subsets II", "slug": "subsets-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1321,9 +1285,7 @@ "id": 16, "title": "Permutations", "slug": "permutations", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1428,9 +1390,7 @@ "id": 17, "title": "Permutations II", "slug": "permutations-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1465,9 +1425,7 @@ "id": 18, "title": "Combinations", "slug": "combinations", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1512,9 +1470,7 @@ "id": 19, "title": "Combination Sum", "slug": "combination-sum", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1614,9 +1570,7 @@ "id": 20, "title": "Combination Sum II", "slug": "combination-sum-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1671,9 +1625,7 @@ "id": 21, "title": "Combination Sum III", "slug": "combination-sum-iii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1703,9 +1655,7 @@ "id": 22, "title": "Generate Parentheses", "slug": "generate-parentheses", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1845,10 +1795,7 @@ "id": 23, "title": "Target Sum", "slug": "target-sum", - "pattern": [ - "DFS", - "Dynamic Programming" - ], + "pattern": ["DFS", "Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1898,9 +1845,7 @@ "id": 24, "title": "Palindrome Partitioning", "slug": "palindrome-partitioning", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1950,9 +1895,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": [ @@ -2062,9 +2005,7 @@ "id": 26, "title": "Generalized Abbreviation", "slug": "generalized-abbreviation", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": true, "companies": [] @@ -2073,9 +2014,7 @@ "id": 27, "title": "Sudoku Solver", "slug": "sudoku-solver", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Hard", "premium": false, "companies": [ @@ -2155,9 +2094,7 @@ "id": 28, "title": "N-Queens", "slug": "n-queens", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Hard", "premium": false, "companies": [ @@ -2217,9 +2154,7 @@ "id": 29, "title": "Climbing Stairs", "slug": "climbing-stairs", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Easy", "premium": false, "companies": [ @@ -2299,9 +2234,7 @@ "id": 30, "title": "House Robber", "slug": "house-robber", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2391,9 +2324,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": [ @@ -2613,9 +2544,7 @@ "id": 32, "title": "Maximum Subarray", "slug": "maximum-subarray", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2770,9 +2699,7 @@ "id": 33, "title": "Range Sum Query - Immutable", "slug": "range-sum-query-immutable", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Easy", "premium": false, "companies": [ @@ -2792,9 +2719,7 @@ "id": 34, "title": "House Robber II", "slug": "house-robber-ii", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2839,9 +2764,7 @@ "id": 35, "title": "Coin Change", "slug": "coin-change", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2946,9 +2869,7 @@ "id": 36, "title": "Maximum Product Subarray", "slug": "maximum-product-subarray", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3018,9 +2939,7 @@ "id": 37, "title": "Longest Increasing Subsequence", "slug": "longest-increasing-subsequence", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3105,9 +3024,7 @@ "id": 38, "title": "Longest Palindromic Substring", "slug": "longest-palindromic-substring", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3257,9 +3174,7 @@ "id": 39, "title": "Word Break", "slug": "word-break", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3364,9 +3279,7 @@ "id": 40, "title": "Combination Sum IV", "slug": "combination-sum-iv", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3401,9 +3314,7 @@ "id": 41, "title": "Decode Ways", "slug": "decode-ways", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3508,9 +3419,7 @@ "id": 42, "title": "Unique Paths", "slug": "unique-paths", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3600,10 +3509,7 @@ "id": 43, "title": "Jump Game", "slug": "jump-game", - "pattern": [ - "Dynamic Programming", - "Greedy" - ], + "pattern": ["Dynamic Programming", "Greedy"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3693,9 +3599,7 @@ "id": 44, "title": "Palindromic Substrings", "slug": "palindromic-substrings", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3755,9 +3659,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": [ @@ -3777,9 +3679,7 @@ "id": 46, "title": "Partition Equal Subset Sum", "slug": "partition-equal-subset-sum", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3834,9 +3734,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": [ @@ -3886,9 +3784,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": [ @@ -3908,10 +3804,7 @@ "id": 49, "title": "Counting Bits", "slug": "counting-bits", - "pattern": [ - "Dynamic Programming", - "Bit Manipulation" - ], + "pattern": ["Dynamic Programming", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3956,9 +3849,7 @@ "id": 50, "title": "Linked List Cycle", "slug": "linked-list-cycle", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -4023,9 +3914,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": [ @@ -4076,13 +3965,126 @@ } ] }, + { + "id": 65, + "title": "Reverse Linked List", + "slug": "reverse-linked-list", + "pattern": ["In-place reversal of a linked list"], + "difficulty": "Easy", + "premium": false, + "companies": [ + { + "name": "Amazon", + "slug": "amazon", + "frequency": 12 + }, + { + "name": "Apple", + "slug": "apple", + "frequency": 8 + }, + { + "name": "Bloomberg", + "slug": "bloomberg", + "frequency": 4 + }, + { + "name": "Adobe", + "slug": "adobe", + "frequency": 4 + }, + { + "name": "Yandex", + "slug": "yandex", + "frequency": 4 + }, + { + "name": "VMware", + "slug": "vmware", + "frequency": 4 + }, + { + "name": "Microsoft", + "slug": "microsoft", + "frequency": 3 + }, + { + "name": "Oracle", + "slug": "oracle", + "frequency": 3 + }, + { + "name": "Intuit", + "slug": "intuit", + "frequency": 3 + }, + { + "name": "Facebook", + "slug": "facebook", + "frequency": 2 + }, + { + "name": "Google", + "slug": "google", + "frequency": 2 + }, + { + "name": "Uber", + "slug": "uber", + "frequency": 2 + }, + { + "name": "ServiceNow", + "slug": "servicenow", + "frequency": 2 + }, + { + "name": "Nagarro", + "slug": "nagarro", + "frequency": 2 + }, + { + "name": "Paypal", + "slug": "paypal", + "frequency": 2 + }, + { + "name": "Nvidia", + "slug": "nvidia", + "frequency": 2 + }, + { + "name": "Yahoo", + "slug": "yahoo", + "frequency": 2 + }, + { + "name": "Samsung", + "slug": "samsung", + "frequency": 2 + }, + { + "name": "Dell", + "slug": "dell", + "frequency": 2 + }, + { + "name": "JPMorgan", + "slug": "jpmorgan", + "frequency": 2 + }, + { + "name": "Canonical", + "slug": "canonical", + "frequency": 2 + } + ] + }, { "id": 52, "title": "Palindrome Linked List", "slug": "palindrome-linked-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -4152,9 +4154,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": [ @@ -4199,9 +4199,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": [ @@ -4251,9 +4249,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": [ @@ -4288,9 +4284,7 @@ "id": 56, "title": "Add Two Numbers", "slug": "add-two-numbers", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4390,9 +4384,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": [ @@ -4482,9 +4474,7 @@ "id": 58, "title": "Sort List", "slug": "sort-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4529,9 +4519,7 @@ "id": 59, "title": "Reorder List", "slug": "reorder-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4596,11 +4584,7 @@ "id": 60, "title": "Clone Graph", "slug": "clone-graph", - "pattern": [ - "BFS", - "DFS", - "Graph" - ], + "pattern": ["BFS", "DFS", "Graph"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4655,10 +4639,7 @@ "id": 61, "title": "Pacific Atlantic Water Flow", "slug": "pacific-atlantic-water-flow", - "pattern": [ - "BFS", - "DFS" - ], + "pattern": ["BFS", "DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4713,11 +4694,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": [ @@ -4942,12 +4919,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": [ @@ -4987,12 +4959,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": [ @@ -5033,130 +5000,11 @@ } ] }, - { - "id": 65, - "title": "Reverse Linked List", - "slug": "reverse-linked-list", - "pattern": [ - "In-place reversal of a linked list" - ], - "difficulty": "Easy", - "premium": false, - "companies": [ - { - "name": "Amazon", - "slug": "amazon", - "frequency": 12 - }, - { - "name": "Apple", - "slug": "apple", - "frequency": 8 - }, - { - "name": "Bloomberg", - "slug": "bloomberg", - "frequency": 4 - }, - { - "name": "Adobe", - "slug": "adobe", - "frequency": 4 - }, - { - "name": "Yandex", - "slug": "yandex", - "frequency": 4 - }, - { - "name": "VMware", - "slug": "vmware", - "frequency": 4 - }, - { - "name": "Microsoft", - "slug": "microsoft", - "frequency": 3 - }, - { - "name": "Oracle", - "slug": "oracle", - "frequency": 3 - }, - { - "name": "Intuit", - "slug": "intuit", - "frequency": 3 - }, - { - "name": "Facebook", - "slug": "facebook", - "frequency": 2 - }, - { - "name": "Google", - "slug": "google", - "frequency": 2 - }, - { - "name": "Uber", - "slug": "uber", - "frequency": 2 - }, - { - "name": "ServiceNow", - "slug": "servicenow", - "frequency": 2 - }, - { - "name": "Nagarro", - "slug": "nagarro", - "frequency": 2 - }, - { - "name": "Paypal", - "slug": "paypal", - "frequency": 2 - }, - { - "name": "Nvidia", - "slug": "nvidia", - "frequency": 2 - }, - { - "name": "Yahoo", - "slug": "yahoo", - "frequency": 2 - }, - { - "name": "Samsung", - "slug": "samsung", - "frequency": 2 - }, - { - "name": "Dell", - "slug": "dell", - "frequency": 2 - }, - { - "name": "JPMorgan", - "slug": "jpmorgan", - "frequency": 2 - }, - { - "name": "Canonical", - "slug": "canonical", - "frequency": 2 - } - ] - }, { "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": [ @@ -5211,9 +5059,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": [ @@ -5263,9 +5109,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": [ @@ -5310,9 +5154,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": [ @@ -5367,9 +5209,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": [ @@ -5449,9 +5289,7 @@ "id": 71, "title": "Merge Two Sorted Lists", "slug": "merge-two-sorted-lists", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -5551,10 +5389,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": [ @@ -5604,9 +5439,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": [ @@ -5656,9 +5489,7 @@ "id": 74, "title": "Merge k Sorted Lists", "slug": "merge-k-sorted-lists", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -5783,9 +5614,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": [ @@ -5835,9 +5664,7 @@ "id": 76, "title": "Meeting Rooms", "slug": "meeting-rooms", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Easy", "premium": true, "companies": [ @@ -5867,9 +5694,7 @@ "id": 77, "title": "Merge Intervals", "slug": "merge-intervals", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6059,9 +5884,7 @@ "id": 78, "title": "Interval List Intersections", "slug": "interval-list-intersections", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6101,9 +5924,7 @@ "id": 79, "title": "Non-overlapping Intervals", "slug": "non-overlapping-intervals", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6138,10 +5959,7 @@ "id": 80, "title": "Meeting Rooms II", "slug": "meeting-rooms-ii", - "pattern": [ - "Heap", - "Intervals" - ], + "pattern": ["Heap", "Intervals"], "difficulty": "Medium", "premium": true, "companies": [ @@ -6231,10 +6049,7 @@ "id": 81, "title": "Task Scheduler", "slug": "task-scheduler", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6304,9 +6119,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": [ @@ -6351,9 +6164,7 @@ "id": 83, "title": "Insert Interval", "slug": "insert-interval", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6423,10 +6234,7 @@ "id": 84, "title": "Employee Free Time", "slug": "employee-free-time", - "pattern": [ - "Heap", - "Greedy" - ], + "pattern": ["Heap", "Greedy"], "difficulty": "Hard", "premium": true, "companies": [ @@ -6486,9 +6294,7 @@ "id": 85, "title": "Binary Search", "slug": "binary-search", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Easy", "premium": false, "companies": [ @@ -6548,9 +6354,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": [ @@ -6575,9 +6379,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": [ @@ -6622,9 +6424,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": [ @@ -6714,9 +6514,7 @@ "id": 89, "title": "Find Peak Element", "slug": "find-peak-element", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6786,9 +6584,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": [ @@ -6918,9 +6714,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": [ @@ -6960,9 +6754,7 @@ "id": 92, "title": "Search a 2D Matrix", "slug": "search-a-2d-matrix", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7037,9 +6829,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": [ @@ -7094,9 +6884,7 @@ "id": 94, "title": "Find K Closest Elements", "slug": "find-k-closest-elements", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7161,9 +6949,7 @@ "id": 95, "title": "Count of Range Sum", "slug": "count-of-range-sum", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Hard", "premium": false, "companies": [] @@ -7172,9 +6958,7 @@ "id": 96, "title": "Minimum Size Subarray Sum", "slug": "minimum-size-subarray-sum", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7239,9 +7023,7 @@ "id": 97, "title": "Fruit Into Baskets", "slug": "fruit-into-baskets", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7271,9 +7053,7 @@ "id": 98, "title": "Permutation in String", "slug": "permutation-in-string", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7333,9 +7113,7 @@ "id": 99, "title": "Longest Repeating Character Replacement", "slug": "longest-repeating-character-replacement", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7380,9 +7158,7 @@ "id": 100, "title": "Sliding Window Maximum", "slug": "sliding-window-maximum", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Hard", "premium": false, "companies": [ @@ -7507,9 +7283,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": [ @@ -7739,9 +7513,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": [ @@ -7756,9 +7528,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": [ @@ -7778,9 +7548,7 @@ "id": 104, "title": "Minimum Window Substring", "slug": "minimum-window-substring", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Hard", "premium": false, "companies": [ @@ -7865,9 +7633,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": [ @@ -7907,9 +7673,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": [ @@ -7959,9 +7723,7 @@ "id": 107, "title": "K Closest Points to Origin", "slug": "k-closest-points-to-origin", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8021,9 +7783,7 @@ "id": 108, "title": "Top K Frequent Elements", "slug": "top-k-frequent-elements", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8153,9 +7913,7 @@ "id": 109, "title": "Sort Characters By Frequency", "slug": "sort-characters-by-frequency", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8195,10 +7953,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": [ @@ -8298,10 +8053,7 @@ "id": 111, "title": "Reorganize String", "slug": "reorganize-string", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8356,10 +8108,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": [ @@ -8394,10 +8143,7 @@ "id": 113, "title": "Course Schedule III", "slug": "course-schedule-iii", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8417,10 +8163,7 @@ "id": 114, "title": "Maximum Frequency Stack", "slug": "maximum-frequency-stack", - "pattern": [ - "Bucket Sort", - "Heap" - ], + "pattern": ["Bucket Sort", "Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8475,12 +8218,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": [ @@ -8605,12 +8343,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": [ @@ -8720,11 +8453,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": [ @@ -8754,10 +8483,7 @@ "id": 118, "title": "Alien Dictionary", "slug": "alien-dictionary", - "pattern": [ - "Graph", - "Topological Sort" - ], + "pattern": ["Graph", "Topological Sort"], "difficulty": "Hard", "premium": true, "companies": [ @@ -8812,10 +8538,7 @@ "id": 119, "title": "Sequence Reconstruction", "slug": "sequence-reconstruction", - "pattern": [ - "Graph", - "Topological Sort" - ], + "pattern": ["Graph", "Topological Sort"], "difficulty": "Medium", "premium": true, "companies": [ @@ -8830,9 +8553,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": [ @@ -8847,9 +8568,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": [ @@ -8874,10 +8593,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": [ @@ -8902,9 +8618,7 @@ "id": 123, "title": "Binary Tree Level Order Traversal", "slug": "binary-tree-level-order-traversal", - "pattern": [ - "BFS" - ], + "pattern": ["BFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8969,9 +8683,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": [ @@ -9081,9 +8793,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": [ @@ -9128,9 +8838,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": [ @@ -9175,10 +8883,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": [ @@ -9248,10 +8953,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": [ @@ -9316,9 +9018,7 @@ "id": 129, "title": "Same Tree", "slug": "same-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9363,9 +9063,7 @@ "id": 130, "title": "Path Sum", "slug": "path-sum", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9405,9 +9103,7 @@ "id": 131, "title": "Maximum Depth of Binary Tree", "slug": "maximum-depth-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9462,9 +9158,7 @@ "id": 132, "title": "Diameter of Binary Tree", "slug": "diameter-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9514,9 +9208,7 @@ "id": 133, "title": "Merge Two Binary Trees", "slug": "merge-two-binary-trees", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9551,9 +9243,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": [ @@ -9608,9 +9298,7 @@ "id": 135, "title": "Subtree of Another Tree", "slug": "subtree-of-another-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9650,9 +9338,7 @@ "id": 136, "title": "Invert Binary Tree", "slug": "invert-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9707,9 +9393,7 @@ "id": 137, "title": "Path Sum II", "slug": "path-sum-ii", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9769,9 +9453,7 @@ "id": 138, "title": "Path Sum III", "slug": "path-sum-iii", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9831,9 +9513,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": [ @@ -9948,9 +9628,7 @@ "id": 140, "title": "Maximum Binary Tree", "slug": "maximum-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [] @@ -9959,9 +9637,7 @@ "id": 141, "title": "Maximum Width of Binary Tree", "slug": "maximum-width-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10006,9 +9682,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": [ @@ -10058,9 +9732,7 @@ "id": 143, "title": "Validate Binary Search Tree", "slug": "validate-binary-search-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10155,10 +9827,7 @@ "id": 144, "title": "Implement Trie (Prefix Tree)", "slug": "implement-trie-prefix-tree", - "pattern": [ - "Design", - "Trie" - ], + "pattern": ["Design", "Trie"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10223,9 +9892,7 @@ "id": 145, "title": "Binary Tree Maximum Path Sum", "slug": "binary-tree-maximum-path-sum", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10335,9 +10002,7 @@ "id": 146, "title": "Serialize and Deserialize Binary Tree", "slug": "serialize-and-deserialize-binary-tree", - "pattern": [ - "Design" - ], + "pattern": ["Design"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10432,10 +10097,7 @@ "id": 147, "title": "Word Search II", "slug": "word-search-ii", - "pattern": [ - "DFS", - "Trie" - ], + "pattern": ["DFS", "Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10520,9 +10182,7 @@ "id": 148, "title": "Find Median from Data Stream", "slug": "find-median-from-data-stream", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10637,9 +10297,7 @@ "id": 149, "title": "Sliding Window Median", "slug": "sliding-window-median", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10669,9 +10327,7 @@ "id": 150, "title": "Two Sum", "slug": "two-sum", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10941,9 +10597,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": [ @@ -11008,9 +10662,7 @@ "id": 152, "title": "Backspace String Compare", "slug": "backspace-string-compare", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -11075,9 +10727,7 @@ "id": 153, "title": "3Sum", "slug": "3sum", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -11212,9 +10862,7 @@ "id": 154, "title": "3Sum Closest", "slug": "3sum-closest", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -11274,9 +10922,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": [ @@ -11301,9 +10947,7 @@ "id": 156, "title": "Sort Colors", "slug": "sort-colors", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -11398,9 +11042,7 @@ "id": 157, "title": "Trapping Rain Water", "slug": "trapping-rain-water", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Hard", "premium": false, "companies": [ @@ -11550,9 +11192,7 @@ "id": 158, "title": "Container With Most Water", "slug": "container-with-most-water", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -11682,9 +11322,7 @@ "id": 159, "title": "Longest Word in Dictionary", "slug": "longest-word-in-dictionary", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Medium", "premium": false, "companies": [ @@ -11704,9 +11342,7 @@ "id": 160, "title": "Index Pairs of a String", "slug": "index-pairs-of-a-string", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Easy", "premium": true, "companies": [] @@ -11715,9 +11351,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": [ @@ -11747,9 +11381,7 @@ "id": 162, "title": "Concatenated Words", "slug": "concatenated-words", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -11769,9 +11401,7 @@ "id": 163, "title": "Prefix and Suffix Search", "slug": "prefix-and-suffix-search", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -11786,9 +11416,7 @@ "id": 164, "title": "Palindrome Pairs", "slug": "palindrome-pairs", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -11838,9 +11466,7 @@ "id": 165, "title": "Design Search Autocomplete System", "slug": "design-search-autocomplete-system", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": true, "companies": [ @@ -11890,9 +11516,7 @@ "id": 166, "title": "Word Squares", "slug": "word-squares", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": true, "companies": [ @@ -11912,11 +11536,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": [ @@ -11931,9 +11551,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": [ @@ -12063,9 +11681,7 @@ "id": 169, "title": "Majority Element", "slug": "majority-element", - "pattern": [ - "Sorting" - ], + "pattern": ["Sorting"], "difficulty": "Easy", "premium": false, "companies": [ @@ -12120,12 +11736,10 @@ "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": [] } ] -} \ No newline at end of file +}