data.json

[
  {
    "id": 0,
    "name": "Contains Duplicate",
    "url": "https://leetcode.com/problems/contains-duplicate/",
    "pattern": ["Arrays"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Apple"]
  },
  {
    "id": 1,
    "name": "Missing Number",
    "url": "https://leetcode.com/problems/missing-number/",
    "pattern": ["Arrays", "Bit Manipulation"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Apple"]
  },
  {
    "id": 2,
    "name": "Find All Numbers Disappeared in an Array",
    "url": "https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/",
    "pattern": ["Arrays"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Microsoft", "Apple"]
  },
  {
    "id": 3,
    "name": "Single Number",
    "url": "https://leetcode.com/problems/single-number/",
    "pattern": ["Arrays", "Bit Manipulation"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Bloomberg",
      "Apple",
      "Microsoft",
      "Google",
      "Oracle"
    ]
  },
  {
    "id": 4,
    "name": "Product of Array Except Self",
    "url": "https://leetcode.com/problems/product-of-array-except-self/",
    "pattern": ["Arrays"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Lyft",
      "Microsoft",
      "Goldman Sachs",
      "Apple",
      "Oracle",
      "Google",
      "Uber",
      "Adobe",
      "Asana",
      "Bloomberg"
    ]
  },
  {
    "id": 5,
    "name": "Find the Duplicate Number",
    "url": "https://leetcode.com/problems/find-the-duplicate-number/",
    "pattern": ["Arrays", "Binary Search", "Two Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Google", "Microsoft", "Facebook", "Apple"]
  },
  {
    "id": 6,
    "name": "Find All Duplicates in an Array",
    "url": "https://leetcode.com/problems/find-all-duplicates-in-an-array/",
    "pattern": ["Arrays"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Facebook", "Apple"]
  },
  {
    "id": 7,
    "name": "Set Matrix Zeroes",
    "url": "https://leetcode.com/problems/set-matrix-zeroes/",
    "pattern": ["Arrays"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Microsoft", "Oracle"]
  },
  {
    "id": 8,
    "name": "Spiral Matrix",
    "url": "https://leetcode.com/problems/spiral-matrix/",
    "pattern": ["Arrays"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Oracle",
      "Apple",
      "Facebook",
      "Google",
      "Adobe"
    ]
  },
  {
    "id": 9,
    "name": "Rotate Image",
    "url": "https://leetcode.com/problems/rotate-image/",
    "pattern": ["Arrays"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Apple", "Facebook"]
  },
  {
    "id": 10,
    "name": "Word Search",
    "url": "https://leetcode.com/problems/word-search/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Bloomberg",
      "Intuit",
      "Facebook",
      "Google",
      "Snapchat",
      "Apple",
      "Pinterest"
    ]
  },
  {
    "id": 11,
    "name": "First Missing Positive",
    "url": "https://leetcode.com/problems/first-missing-positive/",
    "pattern": ["Arrays"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Google",
      "Bloomberg",
      "Oracle",
      "Adobe",
      "Facebook",
      "Apple"
    ]
  },
  {
    "id": 12,
    "name": "Longest Consecutive Sequence",
    "url": "https://leetcode.com/problems/longest-consecutive-sequence/",
    "pattern": ["Arrays"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Google",
      "Microsoft",
      "Amazon",
      "Apple",
      "Bloomberg",
      "Facebook",
      "Uber"
    ]
  },
  {
    "id": 13,
    "name": "Letter Case Permutation",
    "url": "https://leetcode.com/problems/letter-case-permutation/",
    "pattern": ["Backtracking"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon"]
  },
  {
    "id": 14,
    "name": "Subsets",
    "url": "https://leetcode.com/problems/subsets/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Bloomberg",
      "Google",
      "Microsoft",
      "Atlassian"
    ]
  },
  {
    "id": 15,
    "name": "Subsets II",
    "url": "https://leetcode.com/problems/subsets-ii/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Bloomberg"]
  },
  {
    "id": 16,
    "name": "Permutations",
    "url": "https://leetcode.com/problems/permutations/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Microsoft",
      "Amazon",
      "Facebook",
      "Apple",
      "Google",
      "LinkedIn",
      "Oracle",
      "Uber",
      "Goldman Sachs",
      "Atlassian"
    ]
  },
  {
    "id": 17,
    "name": "Permutations II",
    "url": "https://leetcode.com/problems/permutations-ii/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Bloomberg"]
  },
  {
    "id": 18,
    "name": "Combinations",
    "url": "https://leetcode.com/problems/combinations/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Microsoft", "Google", "Amazon"]
  },
  {
    "id": 19,
    "name": "Combination Sum",
    "url": "https://leetcode.com/problems/combination-sum/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Microsoft", "Airbnb", "Uber"]
  },
  {
    "id": 20,
    "name": "Combination Sum II",
    "url": "https://leetcode.com/problems/combination-sum-ii/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google", "Microsoft", "Amazon"]
  },
  {
    "id": 21,
    "name": "Combination Sum III",
    "url": "https://leetcode.com/problems/combination-sum-iii/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Microsoft", "Amazon"]
  },
  {
    "id": 22,
    "name": "Generate Parentheses",
    "url": "https://leetcode.com/problems/generate-parentheses/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Microsoft",
      "Adobe",
      "Bloomberg",
      "Google",
      "Apple"
    ]
  },
  {
    "id": 23,
    "name": "Target Sum",
    "url": "https://leetcode.com/problems/target-sum/",
    "pattern": ["DFS", "Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook"]
  },
  {
    "id": 24,
    "name": "Palindrome Partitioning",
    "url": "https://leetcode.com/problems/palindrome-partitioning/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon"]
  },
  {
    "id": 25,
    "name": "Letter Combinations of a Phone Number",
    "url": "https://leetcode.com/problems/letter-combinations-of-a-phone-number/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Google",
      "Atlassian",
      "Facebook",
      "Oracle",
      "Salesforce",
      "Lyft",
      "Uber",
      "Apple"
    ]
  },
  {
    "id": 26,
    "name": "Generalized Abbreviation",
    "url": "https://leetcode.com/problems/generalized-abbreviation/",
    "pattern": ["Backtracking"],
    "difficulty": "Medium",
    "premium": true,
    "companies": ["Google"]
  },
  {
    "id": 27,
    "name": "Sudoku Solver",
    "url": "https://leetcode.com/problems/sudoku-solver/",
    "pattern": ["Backtracking"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Microsoft", "Amazon", "Apple", "Oracle"]
  },
  {
    "id": 28,
    "name": "N-Queens",
    "url": "https://leetcode.com/problems/n-queens/",
    "pattern": ["Backtracking"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Apple", "Oracle", "Amazon"]
  },
  {
    "id": 29,
    "name": "Climbing Stairs",
    "url": "https://leetcode.com/problems/climbing-stairs/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Amazon",
      "Google",
      "Adobe",
      "Microsoft",
      "Uber",
      "Facebook",
      "Bloomberg",
      "Oracle"
    ]
  },
  {
    "id": 30,
    "name": "House Robber",
    "url": "https://leetcode.com/problems/house-robber/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Google", "Apple", "Adobe", "Microsoft", "Amazon"]
  },
  {
    "id": 31,
    "name": "Best Time to Buy and Sell Stock",
    "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Amazon",
      "Facebook",
      "Microsoft",
      "Goldman Sachs",
      "Bloomberg",
      "Apple",
      "Oracle",
      "Uber",
      "Google",
      "JPMorgan",
      "Atlassian"
    ]
  },
  {
    "id": 32,
    "name": "Maximum Subarray",
    "url": "https://leetcode.com/problems/maximum-subarray/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Amazon",
      "Apple",
      "Microsoft",
      "Google",
      "Facebook",
      "LinkedIn",
      "Oracle",
      "Bloomberg",
      "Adobe",
      "Uber",
      "JPMorgan"
    ]
  },
  {
    "id": 33,
    "name": "Range Sum Query - Immutable",
    "url": "https://leetcode.com/problems/range-sum-query-immutable/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Google", "Facebook"]
  },
  {
    "id": 34,
    "name": "House Robber II",
    "url": "https://leetcode.com/problems/house-robber-ii/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google"]
  },
  {
    "id": 35,
    "name": "Coin Change",
    "url": "https://leetcode.com/problems/coin-change/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Blackrock",
      "Goldman Sachs",
      "Google",
      "Apple",
      "Airbnb",
      "Capital One",
      "Uber"
    ]
  },
  {
    "id": 36,
    "name": "Maximum Product Subarray",
    "url": "https://leetcode.com/problems/maximum-product-subarray/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "LinkedIn",
      "Google",
      "Microsoft",
      "Facebook",
      "Bloomberg"
    ]
  },
  {
    "id": 37,
    "name": "Longest Increasing Subsequence",
    "url": "https://leetcode.com/problems/longest-increasing-subsequence/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Atlassian",
      "Amazon",
      "Apple",
      "Facebook",
      "Google",
      "Microsoft",
      "Oracle"
    ]
  },
  {
    "id": 38,
    "name": "Longest Palindromic Substring",
    "url": "https://leetcode.com/problems/longest-palindromic-substring/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Adobe",
      "Facebook",
      "Apple",
      "Bloomberg",
      "Oracle",
      "Google",
      "Uber"
    ]
  },
  {
    "id": 39,
    "name": "Word Break",
    "url": "https://leetcode.com/problems/word-break/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Google",
      "Bloomberg",
      "Oracle",
      "Microsoft",
      "Qualtrics",
      "Apple",
      "Adobe",
      "Snapchat"
    ]
  },
  {
    "id": 40,
    "name": "Combination Sum IV",
    "url": "https://leetcode.com/problems/combination-sum-iv/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google"]
  },
  {
    "id": 41,
    "name": "Decode Ways",
    "url": "https://leetcode.com/problems/decode-ways/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Facebook",
      "Lyft",
      "Google",
      "Microsoft",
      "Bloomberg",
      "Apple",
      "Goldman Sachs"
    ]
  },
  {
    "id": 42,
    "name": "Unique Paths",
    "url": "https://leetcode.com/problems/unique-paths/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Microsoft",
      "Amazon",
      "Google",
      "Apple",
      "Oracle",
      "Goldman Sachs",
      "Uber"
    ]
  },
  {
    "id": 43,
    "name": "Jump Game",
    "url": "https://leetcode.com/problems/jump-game/",
    "pattern": ["Dynamic Programming", "Greedy"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Facebook",
      "Adobe",
      "Google",
      "Bloomberg",
      "Oracle"
    ]
  },
  {
    "id": 44,
    "name": "Palindromic Substrings",
    "url": "https://leetcode.com/problems/palindromic-substrings/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Apple", "Twitter", "Google", "Citadel"]
  },
  {
    "id": 45,
    "name": "Number of Longest Increasing Subsequence",
    "url": "https://leetcode.com/problems/number-of-longest-increasing-subsequence/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon"]
  },
  {
    "id": 46,
    "name": "Partition Equal Subset Sum",
    "url": "https://leetcode.com/problems/partition-equal-subset-sum/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook"]
  },
  {
    "id": 47,
    "name": "Partition to K Equal Sum Subsets",
    "url": "https://leetcode.com/problems/partition-to-k-equal-sum-subsets/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["LinkedIn", "Amazon", "Facebook"]
  },
  {
    "id": 48,
    "name": "Best Time to Buy and Sell Stock with Cooldown",
    "url": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google", "Amazon", "Apple"]
  },
  {
    "id": 49,
    "name": "Counting Bits",
    "url": "https://leetcode.com/problems/counting-bits/",
    "pattern": ["Dynamic Programming"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook"]
  },
  {
    "id": 50,
    "name": "Linked List Cycle",
    "url": "https://leetcode.com/problems/linked-list-cycle/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Apple", "Microsoft", "Goldman Sachs"]
  },
  {
    "id": 51,
    "name": "Middle of the Linked List",
    "url": "https://leetcode.com/problems/middle-of-the-linked-list/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Apple", "Oracle"]
  },
  {
    "id": 52,
    "name": "Palindrome Linked List",
    "url": "https://leetcode.com/problems/palindrome-linked-list/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Apple", "Snapchat", "Bloomberg"]
  },
  {
    "id": 53,
    "name": "Remove Linked List Elements",
    "url": "https://leetcode.com/problems/remove-linked-list-elements/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Bloomberg", "Google", "Capital One"]
  },
  {
    "id": 54,
    "name": "Remove Duplicates from Sorted List",
    "url": "https://leetcode.com/problems/remove-duplicates-from-sorted-list/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Apple", "Microsoft"]
  },
  {
    "id": 55,
    "name": "Linked List Cycle II",
    "url": "https://leetcode.com/problems/linked-list-cycle-ii/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Microsoft", "Apple", "Adobe"]
  },
  {
    "id": 56,
    "name": "Add Two Numbers",
    "url": "https://leetcode.com/problems/add-two-numbers/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Google",
      "Bloomberg",
      "Facebook",
      "Adobe",
      "Apple",
      "Microsoft",
      "Uber",
      "Oracle"
    ]
  },
  {
    "id": 57,
    "name": "Remove Nth Node From End Of List",
    "url": "https://leetcode.com/problems/remove-nth-node-from-end-of-list/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Microsoft"]
  },
  {
    "id": 58,
    "name": "Sort List",
    "url": "https://leetcode.com/problems/sort-list/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Microsoft", "Amazon", "Facebook"]
  },
  {
    "id": 59,
    "name": "Reorder List",
    "url": "https://leetcode.com/problems/reorder-list/",
    "pattern": ["Fast & Slow Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Microsoft"]
  },
  {
    "id": 60,
    "name": "Clone Graph",
    "url": "https://leetcode.com/problems/clone-graph/",
    "pattern": ["BFS", "DFS", "Graph"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Microsoft"]
  },
  {
    "id": 62,
    "name": "Pacific Atlantic Water Flow",
    "url": "https://leetcode.com/problems/pacific-atlantic-water-flow/",
    "pattern": ["BFS", "DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Microsoft", "Google", "Amazon"]
  },
  {
    "id": 63,
    "name": "Number of Islands",
    "url": "https://leetcode.com/problems/number-of-islands/",
    "pattern": ["BFS", "DFS", "Union Find"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Bloomberg",
      "Facebook",
      "Microsoft",
      "Google",
      "Oracle",
      "Apple",
      "Uber",
      "Goldman Sachs"
    ]
  },
  {
    "id": 64,
    "name": "Graph Valid Tree",
    "url": "https://leetcode.com/problems/graph-valid-tree/",
    "pattern": ["BFS", "DFS", "Graph", "Union Find"],
    "difficulty": "Medium",
    "premium": true,
    "companies": ["Amazon", "LinkedIn"]
  },
  {
    "id": 65,
    "name": "Number of Connected Components in an Undirected Graph",
    "url": "https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/",
    "pattern": ["BFS", "DFS", "Graph", "Union Find"],
    "difficulty": "Medium",
    "premium": true,
    "companies": ["Facebook", "Amazon"]
  },
  {
    "id": 66,
    "name": "Reverse Linked List",
    "url": "https://leetcode.com/problems/reverse-linked-list/",
    "pattern": ["In-place reversal of a linked list"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Apple",
      "Facebook",
      "Adobe",
      "Oracle",
      "Goldman Sachs",
      "Google"
    ]
  },
  {
    "id": 67,
    "name": "Reverse Linked List II",
    "url": "https://leetcode.com/problems/reverse-linked-list-ii/",
    "pattern": ["In-place reversal of a linked list"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Microsoft", "Oracle"]
  },
  {
    "id": 68,
    "name": "Rotate List",
    "url": "https://leetcode.com/problems/rotate-list/",
    "pattern": ["In-place reversal of a linked list"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["LinkedIn", "Amazon", "Microsoft"]
  },
  {
    "id": 69,
    "name": "Swap Nodes in Pairs",
    "url": "https://leetcode.com/problems/swap-nodes-in-pairs/",
    "pattern": ["In-place reversal of a linked list"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Microsoft", "Facebook", "Apple", "Amazon"]
  },
  {
    "id": 70,
    "name": "Odd Even Linked List",
    "url": "https://leetcode.com/problems/odd-even-linked-list/",
    "pattern": ["In-place reversal of a linked list"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Capital One", "Facebook", "Google", "Microsoft", "Bloomberg"]
  },
  {
    "id": 71,
    "name": "Reverse Nodes in k-Group",
    "url": "https://leetcode.com/problems/reverse-nodes-in-k-group/",
    "pattern": ["In-place reversal of a linked list"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Microsoft", "Amazon", "Facebook", "Apple", "Adobe"]
  },
  {
    "id": 72,
    "name": "Merge Two Sorted Lists",
    "url": "https://leetcode.com/problems/merge-two-sorted-lists/",
    "pattern": ["Two Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Adobe",
      "Bloomberg",
      "Google",
      "Apple",
      "Oracle",
      "LinkedIn",
      "Facebook",
      "Uber"
    ]
  },
  {
    "id": 73,
    "name": "Kth Smallest Element in a Sorted Matrix",
    "url": "https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix/",
    "pattern": ["Binary Search", "Heap"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Microsoft", "Google"]
  },
  {
    "id": 74,
    "name": "Find K Pairs with Smallest Sums",
    "url": "https://leetcode.com/problems/find-k-pairs-with-smallest-sums/",
    "pattern": ["Heap"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["LinkedIn", "Amazon", "Facebook"]
  },
  {
    "id": 75,
    "name": "Merge k Sorted Lists",
    "url": "https://leetcode.com/problems/merge-k-sorted-lists/",
    "pattern": ["Heap"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Microsoft",
      "Bloomberg",
      "Google",
      "Oracle",
      "Uber",
      "Lyft",
      "Atlassian"
    ]
  },
  {
    "id": 76,
    "name": "Smallest Range Covering Elements from K Lists",
    "url": "https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/",
    "pattern": ["Heap"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Google", "Amazon", "Snapchat"]
  },
  {
    "id": 77,
    "name": "Meeting Rooms",
    "url": "https://leetcode.com/problems/meeting-rooms",
    "pattern": ["Intervals"],
    "difficulty": "Easy",
    "premium": true,
    "companies": ["Microsoft"]
  },
  {
    "id": 78,
    "name": "Merge Intervals",
    "url": "https://leetcode.com/problems/merge-intervals/",
    "pattern": ["Intervals"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Google",
      "Microsoft",
      "Uber",
      "Oracle",
      "Apple",
      "LinkedIn",
      "Bloomberg",
      "Salesforce",
      "Palantir",
      "Goldman Sachs",
      "Twitch"
    ]
  },
  {
    "id": 79,
    "name": "Interval List Intersections",
    "url": "https://leetcode.com/problems/interval-list-intersections/",
    "pattern": ["Intervals"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Uber",
      "Google",
      "Apple",
      "Snapchat",
      "Amazon",
      "Oracle"
    ]
  },
  {
    "id": 80,
    "name": "Non-overlapping Intervals",
    "url": "https://leetcode.com/problems/non-overlapping-intervals/",
    "pattern": ["Intervals"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook"]
  },
  {
    "id": 81,
    "name": "Meeting Rooms II",
    "url": "https://leetcode.com/problems/meeting-rooms-ii/",
    "pattern": ["Heap", "Intervals"],
    "difficulty": "Medium",
    "premium": true,
    "companies": [
      "Amazon",
      "Bloomberg",
      "Facebook",
      "Google",
      "Microsoft",
      "Apple",
      "Uber",
      "Oracle",
      "Goldman Sachs"
    ]
  },
  {
    "id": 82,
    "name": "Task Scheduler",
    "url": "https://leetcode.com/problems/task-scheduler/",
    "pattern": ["Greedy", "Heap"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Microsoft", "Amazon", "Uber", "Oracle"]
  },
  {
    "id": 83,
    "name": "Minimum Number of Arrows to Burst Balloons",
    "url": "https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/",
    "pattern": ["Greedy"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook"]
  },
  {
    "id": 84,
    "name": "Insert Interval",
    "url": "https://leetcode.com/problems/insert-interval/",
    "pattern": ["Intervals"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Google", "Facebook", "Twitter", "Uber", "LinkedIn", "Amazon"]
  },
  {
    "id": 85,
    "name": "Employee Free Time",
    "url": "https://leetcode.com/problems/employee-free-time/",
    "pattern": ["Heap", "Greedy"],
    "difficulty": "Hard",
    "premium": true,
    "companies": [
      "Pinterest",
      "Amazon",
      "Google",
      "Facebook",
      "Airbnb",
      "Bloomberg"
    ]
  },
  {
    "id": 86,
    "name": "Binary Search",
    "url": "https://leetcode.com/problems/binary-search/",
    "pattern": ["Binary Search"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Microsoft"]
  },
  {
    "id": 87,
    "name": "Find Smallest Letter Greater Than Target",
    "url": "https://leetcode.com/problems/find-smallest-letter-greater-than-target/",
    "pattern": ["Binary Search"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["LinkedIn"]
  },
  {
    "id": 88,
    "name": "Peak Index in a Mountain Array",
    "url": "https://leetcode.com/problems/peak-index-in-a-mountain-array/",
    "pattern": ["Binary Search"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Google", "Uber"]
  },
  {
    "id": 89,
    "name": "Find Minimum in Rotated Sorted Array",
    "url": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/",
    "pattern": ["Binary Search"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Google", "Goldman Sachs", "Apple"]
  },
  {
    "id": 90,
    "name": "Find Peak Element",
    "url": "https://leetcode.com/problems/find-peak-element/",
    "pattern": ["Binary Search"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Google", "Apple"]
  },
  {
    "id": 91,
    "name": "Search in Rotated Sorted Array",
    "url": "https://leetcode.com/problems/search-in-rotated-sorted-array/",
    "pattern": ["Binary Search"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Microsoft",
      "Google",
      "Oracle",
      "Goldman Sachs",
      "Bloomberg",
      "LinkedIn",
      "Apple"
    ]
  },
  {
    "id": 92,
    "name": "Search in Rotated Sorted Array II",
    "url": "https://leetcode.com/problems/search-in-rotated-sorted-array-ii/",
    "pattern": ["Binary Search"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon"]
  },
  {
    "id": 93,
    "name": "Search a 2D Matrix",
    "url": "https://leetcode.com/problems/search-a-2d-matrix/",
    "pattern": ["Binary Search"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Facebook", "Uber", "Apple"]
  },
  {
    "id": 94,
    "name": "Search a 2D Matrix II",
    "url": "https://leetcode.com/problems/search-a-2d-matrix-ii/",
    "pattern": ["Binary Search"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Microsoft"]
  },
  {
    "id": 95,
    "name": "Find K Closest Elements",
    "url": "https://leetcode.com/problems/find-k-closest-elements/",
    "pattern": ["Binary Search"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Bloomberg", "Apple"]
  },
  {
    "id": 96,
    "name": "Count of Range Sum",
    "url": "https://leetcode.com/problems/count-of-range-sum/",
    "pattern": ["Binary Search"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Google"]
  },
  {
    "id": 97,
    "name": "Minimum Size Subarray Sum",
    "url": "https://leetcode.com/problems/minimum-size-subarray-sum/",
    "pattern": ["Sliding Window"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Goldman Sachs", "Google", "Amazon", "Facebook", "Oracle"]
  },
  {
    "id": 98,
    "name": "Fruit Into Baskets",
    "url": "https://leetcode.com/problems/fruit-into-baskets/",
    "pattern": ["Sliding Window"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google"]
  },
  {
    "id": 99,
    "name": "Permutation in String",
    "url": "https://leetcode.com/problems/permutation-in-string/",
    "pattern": ["Sliding Window"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Microsoft", "Google"]
  },
  {
    "id": 100,
    "name": "Longest Repeating Character Replacement",
    "url": "https://leetcode.com/problems/longest-repeating-character-replacement/",
    "pattern": ["Sliding Window"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google"]
  },
  {
    "id": 101,
    "name": "Sliding Window Maximum",
    "url": "https://leetcode.com/problems/sliding-window-maximum/",
    "pattern": ["Sliding Window"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Google",
      "Uber",
      "Facebook",
      "Apple",
      "Adobe",
      "Citadel"
    ]
  },
  {
    "id": 102,
    "name": "Longest Substring Without Repeating Characters",
    "url": "https://leetcode.com/problems/longest-substring-without-repeating-characters/",
    "pattern": ["Sliding Window"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Amazon",
      "Facebook",
      "Google",
      "Apple",
      "Adobe",
      "Bloomberg",
      "Microsoft",
      "Uber",
      "Goldman Sachs"
    ]
  },
  {
    "id": 103,
    "name": "Minimum Number of K Consecutive Bit Flips",
    "url": "https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips/",
    "pattern": ["Sliding Window"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Amazon"]
  },
  {
    "id": 104,
    "name": "Count Unique Characters of All Substrings of a Given String",
    "url": "https://leetcode.com/problems/count-unique-characters-of-all-substrings-of-a-given-string/",
    "pattern": ["Sliding Window"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Twitch"]
  },
  {
    "id": 105,
    "name": "Minimum Window Substring",
    "url": "https://leetcode.com/problems/minimum-window-substring/",
    "pattern": ["Sliding Window"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Google",
      "Microsoft",
      "LinkedIn",
      "Bloomberg",
      "Apple",
      "Adobe",
      "Lyft",
      "Oracle",
      "Salesforce"
    ]
  },
  {
    "id": 106,
    "name": "Substring with Concatenation of All Words",
    "url": "https://leetcode.com/problems/substring-with-concatenation-of-all-words/",
    "pattern": ["Sliding Window"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Google", "Facebook"]
  },
  {
    "id": 107,
    "name": "Kth Smallest Element in a BST",
    "url": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Oracle", "Facebook", "Apple", "Bloomberg"]
  },
  {
    "id": 108,
    "name": "K Closest Points to Origin",
    "url": "https://leetcode.com/problems/k-closest-points-to-origin/",
    "pattern": ["Heap"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Asana", "Oracle", "Apple"]
  },
  {
    "id": 109,
    "name": "Top K Frequent Elements",
    "url": "https://leetcode.com/problems/top-k-frequent-elements/",
    "pattern": ["Heap"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Oracle", "Google", "Yelp", "Apple"]
  },
  {
    "id": 110,
    "name": "Sort Characters By Frequency",
    "url": "https://leetcode.com/problems/sort-characters-by-frequency/",
    "pattern": ["Heap"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Bloomberg", "Uber"]
  },
  {
    "id": 111,
    "name": "Kth Largest Element in an Array",
    "url": "https://leetcode.com/problems/kth-largest-element-in-an-array/",
    "pattern": ["Heap"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "LinkedIn",
      "Google",
      "Microsoft",
      "Goldman Sachs",
      "Bloomberg",
      "Uber",
      "Adobe",
      "Oracle",
      "JPMorgan"
    ]
  },
  {
    "id": 112,
    "name": "Reorganize String",
    "url": "https://leetcode.com/problems/reorganize-string/",
    "pattern": ["Greedy", "Heap"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Google",
      "Microsoft",
      "Oracle",
      "Twitter"
    ]
  },
  {
    "id": 113,
    "name": "Rearrange String k Distance Apart",
    "url": "https://leetcode.com/problems/rearrange-string-k-distance-apart",
    "pattern": ["Greedy", "Heap"],
    "difficulty": "Hard",
    "premium": true,
    "companies": ["Google"]
  },
  {
    "id": 114,
    "name": "Course Schedule III",
    "url": "https://leetcode.com/problems/course-schedule-iii/",
    "pattern": ["Greedy", "Heap"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Microsoft"]
  },
  {
    "id": 115,
    "name": "Maximum Frequency Stack",
    "url": "https://leetcode.com/problems/maximum-frequency-stack/",
    "pattern": ["Bucket Sort", "Heap"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Amazon", "Apple"]
  },
  {
    "id": 116,
    "name": "Course Schedule",
    "url": "https://leetcode.com/problems/course-schedule/",
    "pattern": ["BFS", "DFS", "Graph", "Topological Sort"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Microsoft",
      "Amazon",
      "Facebook",
      "Oracle",
      "Google",
      "Apple"
    ]
  },
  {
    "id": 117,
    "name": "Course Schedule II",
    "url": "https://leetcode.com/problems/course-schedule-ii/",
    "pattern": ["BFS", "DFS", "Graph", "Topological Sort"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Google",
      "Facebook",
      "Apple",
      "Intuit",
      "Microsoft",
      "Uber",
      "Twitter",
      "Oracle"
    ]
  },
  {
    "id": 118,
    "name": "Minimum Height Trees",
    "url": "https://leetcode.com/problems/minimum-height-trees/",
    "pattern": ["BFS", "Graph", "Topological Sort"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google", "Amazon"]
  },
  {
    "id": 119,
    "name": "Alien Dictionary",
    "url": "https://leetcode.com/problems/alien-dictionary",
    "pattern": ["Graph", "Topological Sort"],
    "difficulty": "Hard",
    "premium": true,
    "companies": [
      "Facebook",
      "Amazon",
      "Airbnb",
      "Apple",
      "Bloomberg",
      "Google",
      "Uber",
      "Twitter",
      "Microsoft"
    ]
  },
  {
    "id": 120,
    "name": "Sequence Reconstruction",
    "url": "https://leetcode.com/problems/sequence-reconstruction",
    "pattern": ["Graph", "Topological Sort"],
    "difficulty": "Hard",
    "premium": true,
    "companies": ["Google"]
  },
  {
    "id": 121,
    "name": "Binary Tree Level Order Traversal II",
    "url": "https://leetcode.com/problems/binary-tree-level-order-traversal-ii/",
    "pattern": ["BFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Apple"]
  },
  {
    "id": 122,
    "name": "Average of Levels in Binary Tree",
    "url": "https://leetcode.com/problems/average-of-levels-in-binary-tree/",
    "pattern": ["BFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Facebook"]
  },
  {
    "id": 123,
    "name": "Minimum Depth of Binary Tree",
    "url": "https://leetcode.com/problems/minimum-depth-of-binary-tree/",
    "pattern": ["BFS", "DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Facebook"]
  },
  {
    "id": 124,
    "name": "Binary Tree Level Order Traversal",
    "url": "https://leetcode.com/problems/binary-tree-level-order-traversal/",
    "pattern": ["BFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "LinkedIn",
      "Apple",
      "Bloomberg",
      "Facebook"
    ]
  },
  {
    "id": 125,
    "name": "Binary Tree Zigzag Level Order Traversal",
    "url": "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/",
    "pattern": ["BFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Qualtrics",
      "Facebook",
      "Apple",
      "Bloomberg",
      "LinkedIn"
    ]
  },
  {
    "id": 126,
    "name": "Populating Next Right Pointers in Each Node",
    "url": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node/",
    "pattern": ["BFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Microsoft",
      "Amazon",
      "Facebook",
      "Bloomberg",
      "Apple",
      "Oracle"
    ]
  },
  {
    "id": 127,
    "name": "Populating Next Right Pointers in Each Node II",
    "url": "https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii/",
    "pattern": ["BFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Bloomberg", "Facebook", "Google"]
  },
  {
    "id": 128,
    "name": "Binary Tree Right Side View",
    "url": "https://leetcode.com/problems/binary-tree-right-side-view/",
    "pattern": ["BFS", "DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Microsoft", "Bloomberg"]
  },
  {
    "id": 129,
    "name": "All Nodes Distance K in Binary Tree",
    "url": "https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree/",
    "pattern": ["BFS", "DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Microsoft", "Uber"]
  },
  {
    "id": 131,
    "name": "Same Tree",
    "url": "https://leetcode.com/problems/same-tree/",
    "pattern": ["DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon"]
  },
  {
    "id": 132,
    "name": "Path Sum",
    "url": "https://leetcode.com/problems/path-sum/",
    "pattern": ["DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Bloomberg"]
  },
  {
    "id": 133,
    "name": "Diameter of Binary Tree",
    "url": "https://leetcode.com/problems/diameter-of-binary-tree/",
    "pattern": ["DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Microsoft",
      "Oracle",
      "Google",
      "Adobe"
    ]
  },
  {
    "id": 134,
    "name": "Merge Two Binary Trees",
    "url": "https://leetcode.com/problems/merge-two-binary-trees/",
    "pattern": ["DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Adobe", "Amazon"]
  },
  {
    "id": 135,
    "name": "Maximum Depth of Binary Tree",
    "url": "https://leetcode.com/problems/maximum-depth-of-binary-tree/",
    "pattern": ["DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Google", "Goldman Sachs"]
  },
  {
    "id": 136,
    "name": "Lowest Common Ancestor of a Binary Search Tree",
    "url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/",
    "pattern": ["DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Microsoft", "LinkedIn"]
  },
  {
    "id": 137,
    "name": "Subtree of Another Tree",
    "url": "https://leetcode.com/problems/subtree-of-another-tree/",
    "pattern": ["DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon"]
  },
  {
    "id": 138,
    "name": "Invert Binary Tree",
    "url": "https://leetcode.com/problems/invert-binary-tree/",
    "pattern": ["DFS"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Google", "Microsoft", "Amazon"]
  },
  {
    "id": 139,
    "name": "Path Sum II",
    "url": "https://leetcode.com/problems/path-sum-ii/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Quora"]
  },
  {
    "id": 140,
    "name": "Path Sum III",
    "url": "https://leetcode.com/problems/path-sum-iii/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft"]
  },
  {
    "id": 141,
    "name": "Lowest Common Ancestor of a Binary Tree",
    "url": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Microsoft",
      "Google",
      "Oracle",
      "LinkedIn",
      "Atlassian"
    ]
  },
  {
    "id": 142,
    "name": "Maximum Binary Tree",
    "url": "https://leetcode.com/problems/maximum-binary-tree/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google"]
  },
  {
    "id": 143,
    "name": "Maximum Width of Binary Tree",
    "url": "https://leetcode.com/problems/maximum-width-of-binary-tree/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Facebook", "Amazon", "Google", "Microsoft"]
  },
  {
    "id": 144,
    "name": "Construct Binary Tree from Preorder and Inorder Traversal",
    "url": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Google", "Facebook", "Bloomberg"]
  },
  {
    "id": 145,
    "name": "Validate Binary Search Tree",
    "url": "https://leetcode.com/problems/validate-binary-search-tree/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Microsoft",
      "Bloomberg",
      "Asana",
      "Atlassian",
      "Oracle",
      "Google",
      "Salesforce",
      "Apple"
    ]
  },
  {
    "id": 146,
    "name": "Kth Smallest Element in a BST",
    "url": "https://leetcode.com/problems/kth-smallest-element-in-a-bst/",
    "pattern": ["DFS"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Oracle", "Facebook", "Apple", "Bloomberg"]
  },
  {
    "id": 147,
    "name": "Implement Trie (Prefix Tree)",
    "url": "https://leetcode.com/problems/implement-trie-prefix-tree/",
    "pattern": ["Design", "Trie"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Amazon", "Microsoft", "Google", "Facebook"]
  },
  {
    "id": 148,
    "name": "Binary Tree Maximum Path Sum",
    "url": "https://leetcode.com/problems/binary-tree-maximum-path-sum/",
    "pattern": ["DFS"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Facebook", "Microsoft", "Amazon", "Google", "Uber", "Apple"]
  },
  {
    "id": 149,
    "name": "Serialize and Deserialize Binary Tree",
    "url": "https://leetcode.com/problems/serialize-and-deserialize-binary-tree/",
    "pattern": ["Design"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Microsoft",
      "LinkedIn",
      "Oracle",
      "Uber",
      "Google",
      "Apple",
      "Snapchat"
    ]
  },
  {
    "id": 150,
    "name": "Word Search II",
    "url": "https://leetcode.com/problems/word-search-ii/",
    "pattern": ["DFS", "Trie"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Google",
      "Snapchat",
      "Apple",
      "Facebook",
      "Citadel"
    ]
  },
  {
    "id": 151,
    "name": "Find Median from Data Stream",
    "url": "https://leetcode.com/problems/find-median-from-data-stream/",
    "pattern": ["Heap"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Amazon",
      "Google",
      "Apple",
      "Microsoft",
      "Facebook",
      "Uber",
      "Salesforce"
    ]
  },
  {
    "id": 152,
    "name": "Sliding Window Median",
    "url": "https://leetcode.com/problems/sliding-window-median/",
    "pattern": ["Heap"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Amazon", "Facebook", "Google"]
  },
  {
    "id": 153,
    "name": "Two Sum",
    "url": "https://leetcode.com/problems/two-sum/",
    "pattern": ["Two Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Amazon",
      "Google",
      "Apple",
      "Adobe",
      "Microsoft",
      "Facebook",
      "Bloomberg",
      "Uber",
      "Oracle"
    ]
  },
  {
    "id": 154,
    "name": "Remove Duplicates from Sorted List",
    "url": "https://leetcode.com/problems/remove-duplicates-from-sorted-list/",
    "pattern": ["Two Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Amazon", "Apple", "Microsoft"]
  },
  {
    "id": 155,
    "name": "Squares of a Sorted Array",
    "url": "https://leetcode.com/problems/squares-of-a-sorted-array/",
    "pattern": ["Two Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Apple",
      "Google",
      "Adobe",
      "Microsoft",
      "Twitch",
      "Bloomberg",
      "Oracle"
    ]
  },
  {
    "id": 156,
    "name": "Backspace String Compare",
    "url": "https://leetcode.com/problems/backspace-string-compare",
    "pattern": ["Two Pointers"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Google", "Facebook", "Amazon", "Microsoft", "Oracle"]
  },
  {
    "id": 157,
    "name": "3 Sum",
    "url": "https://leetcode.com/problems/3sum/",
    "pattern": ["Two Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Facebook",
      "Google",
      "Microsoft",
      "Apple",
      "Bloomberg",
      "Adobe",
      "Oracle",
      "Citadel"
    ]
  },
  {
    "id": 158,
    "name": "3 Sum Closest",
    "url": "https://leetcode.com/problems/3sum-closest/",
    "pattern": ["Two Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google", "Facebook", "Amazon", "Apple", "Microsoft"]
  },
  {
    "id": 159,
    "name": "Subarrays with Product Less than K",
    "url": "https://leetcode.com/problems/subarray-product-less-than-k/",
    "pattern": ["Two Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Akuna Capital", "Google"]
  },
  {
    "id": 160,
    "name": "Sort Colours",
    "url": "https://leetcode.com/problems/sort-colors/",
    "pattern": ["Two Pointers"],
    "difficulty": "Medium",
    "premium": false,
    "companies": [
      "Amazon",
      "Microsoft",
      "Oracle",
      "LinkedIn",
      "Apple",
      "Facebook",
      "Uber"
    ]
  },
  {
    "id": 161,
    "name": "Minimum Window Substring",
    "url": "https://leetcode.com/problems/minimum-window-substring/",
    "pattern": ["Two Pointers"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Facebook",
      "Amazon",
      "Google",
      "Microsoft",
      "LinkedIn",
      "Bloomberg",
      "Adobe",
      "Lyft",
      "Oracle",
      "Salesforce"
    ]
  },
  {
    "id": 162,
    "name": "Trapping Rain Water",
    "url": "https://leetcode.com/problems/trapping-rain-water/",
    "pattern": ["Two Pointers"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Amazon",
      "Goldman Sachs",
      "Facebook",
      "Microsoft",
      "Google",
      "Apple",
      "Bloomberg",
      "Adobe",
      "Oracle",
      "Airbnb",
      "Qualtrics"
    ]
  },
  {
    "id": 163,
    "name": "Container With Most Water",
    "url": "https://leetcode.com/problems/container-with-most-water/",
    "pattern": ["Two Pointers"],
    "difficulty": "Hard",
    "premium": false,
    "companies": [
      "Amazon",
      "Goldman Sachs",
      "Adobe",
      "Apple",
      "Google",
      "Facebook",
      "Microsoft",
      "Bloomberg"
    ]
  },
  {
    "id": 164,
    "name": "Longest Word in Dictionary",
    "url": "https://leetcode.com/problems/longest-word-in-dictionary/",
    "pattern": ["Trie"],
    "difficulty": "Easy",
    "premium": false,
    "companies": ["Goldman Sachs", "Google"]
  },
  {
    "id": 165,
    "name": "Index Pairs of a String",
    "url": "https://leetcode.com/problems/index-pairs-of-a-string/",
    "pattern": ["Trie"],
    "difficulty": "Easy",
    "premium": true,
    "companies": ["Amazon"]
  },
  {
    "id": 166,
    "name": "Maximum XOR of Two Numbers in an Array",
    "url": "https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array",
    "pattern": ["Trie"],
    "difficulty": "Medium",
    "premium": false,
    "companies": ["Google"]
  },
  {
    "id": 167,
    "name": "Concatenated Words",
    "url": "https://leetcode.com/problems/concatenated-words/",
    "pattern": ["Trie"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Amazon", "Apple", "Facebook"]
  },
  {
    "id": 168,
    "name": "Prefix and Suffix Search",
    "url": "https://leetcode.com/problems/prefix-and-suffix-search/",
    "pattern": ["Trie"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Facebook", "Google", "Uber"]
  },
  {
    "id": 169,
    "name": "Palindrome Pairs",
    "url": "https://leetcode.com/problems/palindrome-pairs/",
    "pattern": ["Trie"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Airbnb", "Amazon", "Facebook", "Google", "Square"]
  },
  {
    "id": 170,
    "name": "Design Search Autocomplete System",
    "url": "https://leetcode.com/problems/design-search-autocomplete-system/",
    "pattern": ["Trie"],
    "difficulty": "Hard",
    "premium": true,
    "companies": ["Amazon", "Google", "Lyft", "Microsoft", "Uber"]
  },
  {
    "id": 171,
    "name": "Word Squares",
    "url": "https://leetcode.com/problems/word-squares/",
    "pattern": ["Trie"],
    "difficulty": "Hard",
    "premium": true,
    "companies": ["Oracle"]
  },
  {
    "id": 172,
    "name": "Sort Items by Groups Respecting Dependencies",
    "url": "https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies/",
    "pattern": ["DFS", "Graph", "Topological Sort"],
    "difficulty": "Hard",
    "premium": false,
    "companies": ["Google"]
  }
]