From bca082151e1a7fe3df23f2f6eb26c99560ba893c Mon Sep 17 00:00:00 2001 From: Sean Prashad <13009507+SeanPrashad@users.noreply.github.com> Date: Thu, 11 Aug 2022 00:05:39 -0400 Subject: [PATCH 1/2] Revert "Introduce multithreading for requests (#231)" This reverts commit d9f286a1622b6ec012c3ca176830af3d78fc4448. --- cron/update_questions.py | 63 ++-- src/data/questions.json | 730 +++++++++------------------------------ 2 files changed, 198 insertions(+), 595 deletions(-) diff --git a/cron/update_questions.py b/cron/update_questions.py index 02135316..8c05222b 100644 --- a/cron/update_questions.py +++ b/cron/update_questions.py @@ -1,11 +1,9 @@ import os import json -import uuid import leetcode import leetcode.auth from datetime import datetime from leetcode.rest import ApiException -from concurrent.futures import ThreadPoolExecutor, as_completed def create_leetcode_api(): @@ -28,7 +26,6 @@ def get_question_metadata(api, title_slug): query='''query questionData($titleSlug: String!) { question(titleSlug: $titleSlug) { title - titleSlug difficulty companyTagStats isPaidOnly @@ -41,12 +38,13 @@ def get_question_metadata(api, title_slug): try: response = api.graphql_post(body=graphql_request) - return response except ApiException as e: print( f'Exception occurred when contacting the Leetcode GraphQL API: ${e}') exit() + return response + def construct_company_tag_list(company_tags_json, sections): companies = [] @@ -62,24 +60,13 @@ def construct_company_tag_list(company_tags_json, sections): return sorted(companies, key=lambda d: d['frequency'], reverse=True) -def update_question_metadata(question, response): - question_title = response.data.question.title - question_difficulty = response.data.question.difficulty - question_company_tags = json.loads( - response.data.question.company_tag_stats) - question_is_premium = response.data.question.is_paid_only - - # Retrieve companies who have asked this question within the following two - # company_tag_stat sections: - # 1. 0-6 months - # 2. 6 months to 1 year - companies = construct_company_tag_list( - question_company_tags, ["1", "2"]) +def update_question_metadata(question, title, difficulty, companies, is_premium): + print(f"🔄 Updating question metadata for {title}") - question["title"] = question_title - question["difficulty"] = question_difficulty + question["title"] = title + question["difficulty"] = difficulty question["companies"] = companies - question["premium"] = question_is_premium + question["premium"] = is_premium def read_questions(file_name): @@ -110,28 +97,30 @@ def write_questions(file_name, questions): exit() -def runners(api, question_list): - print(f"📡 Retrieving question metadata from Leetcode") - - threads = [] - - with ThreadPoolExecutor(max_workers=3) as executor: - for question in question_list: - title_slug = question["slug"] - threads.append(executor.submit( - get_question_metadata, api, title_slug)) +def main(file_name): + api = create_leetcode_api() + questions = read_questions(file_name) - for task in as_completed(threads): - update_question_metadata(question, task.result()) + for question in questions["data"]: + title_slug = question["slug"] - print(f"✅ Finished retrieving question metadata from Leetcode") + response = get_question_metadata(api, title_slug) + question_title = response.data.question.title + question_difficulty = response.data.question.difficulty + question_company_tags = json.loads( + response.data.question.company_tag_stats) + question_is_premium = response.data.question.is_paid_only -def main(file_name): - api = create_leetcode_api() - questions = read_questions(file_name) + # Retrieve companies who have asked this question within the following two + # company_tag_stat sections: + # 1. 0-6 months + # 2. 6 months to 1 year + companies = construct_company_tag_list( + question_company_tags, ["1", "2"]) - runners(api, questions["data"]) + update_question_metadata(question, question_title, question_difficulty, + companies, question_is_premium) write_questions(file_name, questions) diff --git a/src/data/questions.json b/src/data/questions.json index 45f2931a..bb7b6451 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": [ @@ -92,10 +90,7 @@ "id": 1, "title": "Missing Number", "slug": "missing-number", - "pattern": [ - "Arrays", - "Bit Manipulation" - ], + "pattern": ["Arrays", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -165,9 +160,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": [ @@ -202,10 +195,7 @@ "id": 3, "title": "Single Number", "slug": "single-number", - "pattern": [ - "Arrays", - "Bit Manipulation" - ], + "pattern": ["Arrays", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -275,9 +265,7 @@ "id": 4, "title": "Product of Array Except Self", "slug": "product-of-array-except-self", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -392,11 +380,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": [ @@ -466,9 +450,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": [ @@ -518,9 +500,7 @@ "id": 7, "title": "Set Matrix Zeroes", "slug": "set-matrix-zeroes", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -575,9 +555,7 @@ "id": 8, "title": "Spiral Matrix", "slug": "spiral-matrix", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -687,9 +665,7 @@ "id": 9, "title": "Rotate Image", "slug": "rotate-image", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -799,9 +775,7 @@ "id": 10, "title": "Word Search", "slug": "word-search", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -941,9 +915,7 @@ "id": 11, "title": "First Missing Positive", "slug": "first-missing-positive", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Hard", "premium": false, "companies": [ @@ -1043,9 +1015,7 @@ "id": 12, "title": "Longest Consecutive Sequence", "slug": "longest-consecutive-sequence", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1130,9 +1100,7 @@ "id": 13, "title": "Letter Case Permutation", "slug": "letter-case-permutation", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1157,9 +1125,7 @@ "id": 14, "title": "Subsets", "slug": "subsets", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1254,9 +1220,7 @@ "id": 15, "title": "Subsets II", "slug": "subsets-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1301,9 +1265,7 @@ "id": 16, "title": "Permutations", "slug": "permutations", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1393,9 +1355,7 @@ "id": 17, "title": "Permutations II", "slug": "permutations-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1435,9 +1395,7 @@ "id": 18, "title": "Combinations", "slug": "combinations", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1482,9 +1440,7 @@ "id": 19, "title": "Combination Sum", "slug": "combination-sum", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1579,9 +1535,7 @@ "id": 20, "title": "Combination Sum II", "slug": "combination-sum-ii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1626,9 +1580,7 @@ "id": 21, "title": "Combination Sum III", "slug": "combination-sum-iii", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1653,9 +1605,7 @@ "id": 22, "title": "Generate Parentheses", "slug": "generate-parentheses", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1795,10 +1745,7 @@ "id": 23, "title": "Target Sum", "slug": "target-sum", - "pattern": [ - "DFS", - "Dynamic Programming" - ], + "pattern": ["DFS", "Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1848,9 +1795,7 @@ "id": 24, "title": "Palindrome Partitioning", "slug": "palindrome-partitioning", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": false, "companies": [ @@ -1890,9 +1835,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": [ @@ -2007,9 +1950,7 @@ "id": 26, "title": "Generalized Abbreviation", "slug": "generalized-abbreviation", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Medium", "premium": true, "companies": [] @@ -2018,9 +1959,7 @@ "id": 27, "title": "Sudoku Solver", "slug": "sudoku-solver", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Hard", "premium": false, "companies": [ @@ -2100,9 +2039,7 @@ "id": 28, "title": "N-Queens", "slug": "n-queens", - "pattern": [ - "Backtracking" - ], + "pattern": ["Backtracking"], "difficulty": "Hard", "premium": false, "companies": [ @@ -2162,9 +2099,7 @@ "id": 29, "title": "Climbing Stairs", "slug": "climbing-stairs", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Easy", "premium": false, "companies": [ @@ -2239,9 +2174,7 @@ "id": 30, "title": "House Robber", "slug": "house-robber", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2351,9 +2284,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": [ @@ -2603,9 +2534,7 @@ "id": 32, "title": "Maximum Subarray", "slug": "maximum-subarray", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2765,9 +2694,7 @@ "id": 33, "title": "Range Sum Query - Immutable", "slug": "range-sum-query-immutable", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Easy", "premium": false, "companies": [ @@ -2787,9 +2714,7 @@ "id": 34, "title": "House Robber II", "slug": "house-robber-ii", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2829,9 +2754,7 @@ "id": 35, "title": "Coin Change", "slug": "coin-change", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2926,9 +2849,7 @@ "id": 36, "title": "Maximum Product Subarray", "slug": "maximum-product-subarray", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -2993,9 +2914,7 @@ "id": 37, "title": "Longest Increasing Subsequence", "slug": "longest-increasing-subsequence", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3090,9 +3009,7 @@ "id": 38, "title": "Longest Palindromic Substring", "slug": "longest-palindromic-substring", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3247,9 +3164,7 @@ "id": 39, "title": "Word Break", "slug": "word-break", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3344,9 +3259,7 @@ "id": 40, "title": "Combination Sum IV", "slug": "combination-sum-iv", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3386,9 +3299,7 @@ "id": 41, "title": "Decode Ways", "slug": "decode-ways", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3498,9 +3409,7 @@ "id": 42, "title": "Unique Paths", "slug": "unique-paths", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3570,10 +3479,7 @@ "id": 43, "title": "Jump Game", "slug": "jump-game", - "pattern": [ - "Dynamic Programming", - "Greedy" - ], + "pattern": ["Dynamic Programming", "Greedy"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3668,9 +3574,7 @@ "id": 44, "title": "Palindromic Substrings", "slug": "palindromic-substrings", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3725,9 +3629,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": [ @@ -3747,9 +3649,7 @@ "id": 46, "title": "Partition Equal Subset Sum", "slug": "partition-equal-subset-sum", - "pattern": [ - "Dynamic Programming" - ], + "pattern": ["Dynamic Programming"], "difficulty": "Medium", "premium": false, "companies": [ @@ -3809,9 +3709,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": [ @@ -3866,9 +3764,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": [ @@ -3903,10 +3799,7 @@ "id": 49, "title": "Counting Bits", "slug": "counting-bits", - "pattern": [ - "Dynamic Programming", - "Bit Manipulation" - ], + "pattern": ["Dynamic Programming", "Bit Manipulation"], "difficulty": "Easy", "premium": false, "companies": [ @@ -3951,9 +3844,7 @@ "id": 50, "title": "Linked List Cycle", "slug": "linked-list-cycle", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -4033,9 +3924,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": [ @@ -4085,9 +3974,7 @@ "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 +4039,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 +4084,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": [ @@ -4256,9 +4139,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": [ @@ -4283,9 +4164,7 @@ "id": 56, "title": "Add Two Numbers", "slug": "add-two-numbers", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4395,9 +4274,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": [ @@ -4487,9 +4364,7 @@ "id": 58, "title": "Sort List", "slug": "sort-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4534,9 +4409,7 @@ "id": 59, "title": "Reorder List", "slug": "reorder-list", - "pattern": [ - "Fast & Slow Pointers" - ], + "pattern": ["Fast & Slow Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4611,11 +4484,7 @@ "id": 60, "title": "Clone Graph", "slug": "clone-graph", - "pattern": [ - "BFS", - "DFS", - "Graph" - ], + "pattern": ["BFS", "DFS", "Graph"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4680,10 +4549,7 @@ "id": 61, "title": "Pacific Atlantic Water Flow", "slug": "pacific-atlantic-water-flow", - "pattern": [ - "BFS", - "DFS" - ], + "pattern": ["BFS", "DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -4733,11 +4599,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": [ @@ -4982,12 +4844,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": [ @@ -5027,12 +4884,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": [ @@ -5077,9 +4929,7 @@ "id": 65, "title": "Reverse Linked List", "slug": "reverse-linked-list", - "pattern": [ - "In-place reversal of a linked list" - ], + "pattern": ["In-place reversal of a linked list"], "difficulty": "Easy", "premium": false, "companies": [ @@ -5184,9 +5034,7 @@ "id": 66, "title": "Reverse Linked List II", "slug": "reverse-linked-list-ii", - "pattern": [ - "In-place reversal of a linked list" - ], + "pattern": ["In-place reversal of a linked list"], "difficulty": "Medium", "premium": false, "companies": [ @@ -5246,9 +5094,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": [ @@ -5308,9 +5154,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": [ @@ -5365,9 +5209,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": [ @@ -5417,9 +5259,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": [ @@ -5509,9 +5349,7 @@ "id": 71, "title": "Merge Two Sorted Lists", "slug": "merge-two-sorted-lists", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -5621,10 +5459,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": [ @@ -5674,9 +5509,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": [ @@ -5721,9 +5554,7 @@ "id": 74, "title": "Merge k Sorted Lists", "slug": "merge-k-sorted-lists", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -5868,9 +5699,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": [ @@ -5920,9 +5749,7 @@ "id": 76, "title": "Meeting Rooms", "slug": "meeting-rooms", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Easy", "premium": true, "companies": [ @@ -5957,9 +5784,7 @@ "id": 77, "title": "Merge Intervals", "slug": "merge-intervals", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6169,9 +5994,7 @@ "id": 78, "title": "Interval List Intersections", "slug": "interval-list-intersections", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6216,9 +6039,7 @@ "id": 79, "title": "Non-overlapping Intervals", "slug": "non-overlapping-intervals", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6248,10 +6069,7 @@ "id": 80, "title": "Meeting Rooms II", "slug": "meeting-rooms-ii", - "pattern": [ - "Heap", - "Intervals" - ], + "pattern": ["Heap", "Intervals"], "difficulty": "Medium", "premium": true, "companies": [ @@ -6391,10 +6209,7 @@ "id": 81, "title": "Task Scheduler", "slug": "task-scheduler", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6479,9 +6294,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": [ @@ -6526,9 +6339,7 @@ "id": 83, "title": "Insert Interval", "slug": "insert-interval", - "pattern": [ - "Intervals" - ], + "pattern": ["Intervals"], "difficulty": "Medium", "premium": false, "companies": [ @@ -6598,10 +6409,7 @@ "id": 84, "title": "Employee Free Time", "slug": "employee-free-time", - "pattern": [ - "Heap", - "Greedy" - ], + "pattern": ["Heap", "Greedy"], "difficulty": "Hard", "premium": true, "companies": [ @@ -6681,9 +6489,7 @@ "id": 85, "title": "Binary Search", "slug": "binary-search", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Easy", "premium": false, "companies": [ @@ -6758,9 +6564,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": [ @@ -6785,9 +6589,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": [ @@ -6827,9 +6629,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": [ @@ -6909,9 +6709,7 @@ "id": 89, "title": "Find Peak Element", "slug": "find-peak-element", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7006,9 +6804,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": [ @@ -7158,9 +6954,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": [ @@ -7200,9 +6994,7 @@ "id": 92, "title": "Search a 2D Matrix", "slug": "search-a-2d-matrix", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7277,9 +7069,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": [ @@ -7344,9 +7134,7 @@ "id": 94, "title": "Find K Closest Elements", "slug": "find-k-closest-elements", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7401,9 +7189,7 @@ "id": 95, "title": "Count of Range Sum", "slug": "count-of-range-sum", - "pattern": [ - "Binary Search" - ], + "pattern": ["Binary Search"], "difficulty": "Hard", "premium": false, "companies": [ @@ -7418,9 +7204,7 @@ "id": 96, "title": "Minimum Size Subarray Sum", "slug": "minimum-size-subarray-sum", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7475,9 +7259,7 @@ "id": 97, "title": "Fruit Into Baskets", "slug": "fruit-into-baskets", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7502,9 +7284,7 @@ "id": 98, "title": "Permutation in String", "slug": "permutation-in-string", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7559,9 +7339,7 @@ "id": 99, "title": "Longest Repeating Character Replacement", "slug": "longest-repeating-character-replacement", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Medium", "premium": false, "companies": [ @@ -7606,9 +7384,7 @@ "id": 100, "title": "Sliding Window Maximum", "slug": "sliding-window-maximum", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Hard", "premium": false, "companies": [ @@ -7758,9 +7534,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": [ @@ -7975,9 +7749,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": [ @@ -7992,9 +7764,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": [ @@ -8014,9 +7784,7 @@ "id": 104, "title": "Minimum Window Substring", "slug": "minimum-window-substring", - "pattern": [ - "Sliding Window" - ], + "pattern": ["Sliding Window"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8111,9 +7879,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": [ @@ -8158,9 +7924,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": [ @@ -8205,9 +7969,7 @@ "id": 107, "title": "K Closest Points to Origin", "slug": "k-closest-points-to-origin", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8282,9 +8044,7 @@ "id": 108, "title": "Top K Frequent Elements", "slug": "top-k-frequent-elements", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8414,9 +8174,7 @@ "id": 109, "title": "Sort Characters By Frequency", "slug": "sort-characters-by-frequency", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8451,10 +8209,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": [ @@ -8554,10 +8309,7 @@ "id": 111, "title": "Reorganize String", "slug": "reorganize-string", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Medium", "premium": false, "companies": [ @@ -8627,10 +8379,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": [ @@ -8660,10 +8409,7 @@ "id": 113, "title": "Course Schedule III", "slug": "course-schedule-iii", - "pattern": [ - "Greedy", - "Heap" - ], + "pattern": ["Greedy", "Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8683,10 +8429,7 @@ "id": 114, "title": "Maximum Frequency Stack", "slug": "maximum-frequency-stack", - "pattern": [ - "Bucket Sort", - "Heap" - ], + "pattern": ["Bucket Sort", "Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -8741,12 +8484,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": [ @@ -8871,12 +8609,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": [ @@ -9006,11 +8739,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": [ @@ -9050,10 +8779,7 @@ "id": 118, "title": "Alien Dictionary", "slug": "alien-dictionary", - "pattern": [ - "Graph", - "Topological Sort" - ], + "pattern": ["Graph", "Topological Sort"], "difficulty": "Hard", "premium": true, "companies": [ @@ -9128,10 +8854,7 @@ "id": 119, "title": "Sequence Reconstruction", "slug": "sequence-reconstruction", - "pattern": [ - "Graph", - "Topological Sort" - ], + "pattern": ["Graph", "Topological Sort"], "difficulty": "Medium", "premium": true, "companies": [ @@ -9146,9 +8869,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": [ @@ -9163,9 +8884,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": [ @@ -9190,10 +8909,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": [ @@ -9223,9 +8939,7 @@ "id": 123, "title": "Binary Tree Level Order Traversal", "slug": "binary-tree-level-order-traversal", - "pattern": [ - "BFS" - ], + "pattern": ["BFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -9280,9 +8994,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": [ @@ -9382,9 +9094,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": [ @@ -9429,9 +9139,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": [ @@ -9476,10 +9184,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": [ @@ -9554,10 +9259,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": [ @@ -9642,9 +9344,7 @@ "id": 129, "title": "Same Tree", "slug": "same-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9699,9 +9399,7 @@ "id": 130, "title": "Path Sum", "slug": "path-sum", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9741,9 +9439,7 @@ "id": 131, "title": "Maximum Depth of Binary Tree", "slug": "maximum-depth-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9803,9 +9499,7 @@ "id": 132, "title": "Diameter of Binary Tree", "slug": "diameter-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9850,9 +9544,7 @@ "id": 133, "title": "Merge Two Binary Trees", "slug": "merge-two-binary-trees", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9897,9 +9589,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": "Easy", "premium": false, "companies": [ @@ -9949,9 +9639,7 @@ "id": 135, "title": "Subtree of Another Tree", "slug": "subtree-of-another-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -9991,9 +9679,7 @@ "id": 136, "title": "Invert Binary Tree", "slug": "invert-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Easy", "premium": false, "companies": [ @@ -10048,9 +9734,7 @@ "id": 137, "title": "Path Sum II", "slug": "path-sum-ii", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10100,9 +9784,7 @@ "id": 138, "title": "Path Sum III", "slug": "path-sum-iii", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10162,9 +9844,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": [ @@ -10304,9 +9984,7 @@ "id": 140, "title": "Maximum Binary Tree", "slug": "maximum-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10321,9 +9999,7 @@ "id": 141, "title": "Maximum Width of Binary Tree", "slug": "maximum-width-of-binary-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10373,9 +10049,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": [ @@ -10425,9 +10099,7 @@ "id": 143, "title": "Validate Binary Search Tree", "slug": "validate-binary-search-tree", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10527,10 +10199,7 @@ "id": 144, "title": "Implement Trie (Prefix Tree)", "slug": "implement-trie-prefix-tree", - "pattern": [ - "Design", - "Trie" - ], + "pattern": ["Design", "Trie"], "difficulty": "Medium", "premium": false, "companies": [ @@ -10610,9 +10279,7 @@ "id": 145, "title": "Binary Tree Maximum Path Sum", "slug": "binary-tree-maximum-path-sum", - "pattern": [ - "DFS" - ], + "pattern": ["DFS"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10712,9 +10379,7 @@ "id": 146, "title": "Serialize and Deserialize Binary Tree", "slug": "serialize-and-deserialize-binary-tree", - "pattern": [ - "Design" - ], + "pattern": ["Design"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10829,10 +10494,7 @@ "id": 147, "title": "Word Search II", "slug": "word-search-ii", - "pattern": [ - "DFS", - "Trie" - ], + "pattern": ["DFS", "Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -10932,9 +10594,7 @@ "id": 148, "title": "Find Median from Data Stream", "slug": "find-median-from-data-stream", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -11039,9 +10699,7 @@ "id": 149, "title": "Sliding Window Median", "slug": "sliding-window-median", - "pattern": [ - "Heap" - ], + "pattern": ["Heap"], "difficulty": "Hard", "premium": false, "companies": [ @@ -11081,9 +10739,7 @@ "id": 150, "title": "Two Sum", "slug": "two-sum", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -11348,9 +11004,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": [ @@ -11420,9 +11074,7 @@ "id": 152, "title": "Backspace String Compare", "slug": "backspace-string-compare", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Easy", "premium": false, "companies": [ @@ -11497,9 +11149,7 @@ "id": 153, "title": "3Sum", "slug": "3sum", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -11639,9 +11289,7 @@ "id": 154, "title": "3Sum Closest", "slug": "3sum-closest", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -11706,9 +11354,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": [ @@ -11743,9 +11389,7 @@ "id": 156, "title": "Sort Colors", "slug": "sort-colors", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -11845,9 +11489,7 @@ "id": 157, "title": "Trapping Rain Water", "slug": "trapping-rain-water", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Hard", "premium": false, "companies": [ @@ -12027,9 +11669,7 @@ "id": 158, "title": "Container With Most Water", "slug": "container-with-most-water", - "pattern": [ - "Two Pointers" - ], + "pattern": ["Two Pointers"], "difficulty": "Medium", "premium": false, "companies": [ @@ -12169,9 +11809,7 @@ "id": 159, "title": "Longest Word in Dictionary", "slug": "longest-word-in-dictionary", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Medium", "premium": false, "companies": [ @@ -12196,9 +11834,7 @@ "id": 160, "title": "Index Pairs of a String", "slug": "index-pairs-of-a-string", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Easy", "premium": true, "companies": [] @@ -12207,9 +11843,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": [ @@ -12244,9 +11878,7 @@ "id": 162, "title": "Concatenated Words", "slug": "concatenated-words", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -12271,9 +11903,7 @@ "id": 163, "title": "Prefix and Suffix Search", "slug": "prefix-and-suffix-search", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -12293,9 +11923,7 @@ "id": 164, "title": "Palindrome Pairs", "slug": "palindrome-pairs", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": false, "companies": [ @@ -12340,9 +11968,7 @@ "id": 165, "title": "Design Search Autocomplete System", "slug": "design-search-autocomplete-system", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": true, "companies": [ @@ -12397,9 +12023,7 @@ "id": 166, "title": "Word Squares", "slug": "word-squares", - "pattern": [ - "Trie" - ], + "pattern": ["Trie"], "difficulty": "Hard", "premium": true, "companies": [ @@ -12419,11 +12043,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": [] @@ -12432,9 +12052,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": [ @@ -12564,9 +12182,7 @@ "id": 169, "title": "Majority Element", "slug": "majority-element", - "pattern": [ - "Sorting" - ], + "pattern": ["Sorting"], "difficulty": "Easy", "premium": false, "companies": [ @@ -12621,9 +12237,7 @@ "id": 170, "title": "Majority Element", "slug": "convert-1d-array-into-2d-array", - "pattern": [ - "Arrays" - ], + "pattern": ["Arrays"], "difficulty": "Easy", "premium": false, "companies": [ @@ -12675,4 +12289,4 @@ ] } ] -} \ No newline at end of file +} From 25587ca3071d37d9eee91b2a0b0d02864771c2b8 Mon Sep 17 00:00:00 2001 From: Sean Prashad <13009507+SeanPrashad@users.noreply.github.com> Date: Thu, 11 Aug 2022 00:07:35 -0400 Subject: [PATCH 2/2] Revert questions.json content --- src/data/questions.json | 52 +++-------------------------------------- 1 file changed, 3 insertions(+), 49 deletions(-) diff --git a/src/data/questions.json b/src/data/questions.json index bb7b6451..28ef8919 100644 --- a/src/data/questions.json +++ b/src/data/questions.json @@ -1,5 +1,5 @@ { - "updated": "2022-08-11T04:03:48.259078", + "updated": "2022-08-11T00:10:11.080417", "data": [ { "id": 0, @@ -12235,58 +12235,12 @@ }, { "id": 170, - "title": "Majority Element", + "title": "Convert 1D Array Into 2D Array", "slug": "convert-1d-array-into-2d-array", "pattern": ["Arrays"], "difficulty": "Easy", "premium": false, - "companies": [ - { - "name": "Amazon", - "slug": "amazon", - "frequency": 13 - }, - { - "name": "Facebook", - "slug": "facebook", - "frequency": 7 - }, - { - "name": "Adobe", - "slug": "adobe", - "frequency": 6 - }, - { - "name": "Google", - "slug": "google", - "frequency": 5 - }, - { - "name": "Microsoft", - "slug": "microsoft", - "frequency": 5 - }, - { - "name": "Rubrik", - "slug": "rubrik", - "frequency": 5 - }, - { - "name": "Apple", - "slug": "apple", - "frequency": 4 - }, - { - "name": "Bloomberg", - "slug": "bloomberg", - "frequency": 4 - }, - { - "name": "Uber", - "slug": "uber", - "frequency": 2 - } - ] + "companies": [] } ] }