problem_data.json

{
  "sections": [
    {
      "sectionName": "Amazon",
      "problems": [
        {
          "slug": "lru-cache",
          "name": "LRU Cache",
          "link": "https://leetcode.com/problems/lru-cache",
          "otherCompanies": [
            ["Facebook", 60],
            ["Microsoft", 52],
            ["Apple", 20],
            ["Bloomberg", 19],
            ["Oracle", 13],
            ["Salesforce", 10],
            ["Google", 9],
            ["Intuit", 8],
            ["Twilio", 7],
            ["Goldman Sachs", 6],
            ["ByteDance", 6],
            ["LinkedIn", 5],
            ["ByteDance", 5],
            ["Adobe", 4],
            ["Walmart Global Tech", 4],
            ["Yahoo", 3],
            ["Snapchat", 3],
            ["Nvidia", 3],
            ["Morgan Stanley", 2],
            ["GoDaddy", 2],
            ["Docusign", 2],
            ["Paypal", 2],
            ["Uber", 2],
            ["VMware", 2],
            ["Shopee", 2]
          ],
          "occurence": 117,
          "tags": ["Hash Table", "Linked List", "Design", "Doubly-Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "two-sum",
          "name": "Two Sum",
          "link": "https://leetcode.com/problems/two-sum",
          "otherCompanies": [
            ["Adobe", 52],
            ["Google", 44],
            ["Apple", 40],
            ["Microsoft", 39],
            ["Facebook", 21],
            ["Bloomberg", 16],
            ["Uber", 11],
            ["Spotify", 8],
            ["Goldman Sachs", 7],
            ["Expedia", 7],
            ["Oracle", 6],
            ["Yahoo", 4],
            ["Visa", 4],
            ["Zoho", 4],
            ["Morgan Stanley", 3],
            ["Paypal", 3],
            ["Intel", 3],
            ["IBM", 3],
            ["Dell", 3],
            ["Salesforce", 3],
            ["Accenture", 3],
            ["American Express", 3],
            ["JPMorgan", 3],
            ["Walmart Global Tech", 3],
            ["Intuit", 2],
            ["Zomato", 2],
            ["Samsung", 2],
            ["Zillow", 2],
            ["Zoom", 2]
          ],
          "occurence": 117,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-islands",
          "name": "Number of Islands",
          "link": "https://leetcode.com/problems/number-of-islands",
          "otherCompanies": [
            ["Microsoft", 42],
            ["Facebook", 34],
            ["Bloomberg", 33],
            ["Google", 21],
            ["LinkedIn", 16],
            ["Apple", 11],
            ["Oracle", 9],
            ["Uber", 7],
            ["Salesforce", 6],
            ["ByteDance", 6],
            ["Docusign", 5],
            ["DoorDash", 5],
            ["SAP", 4],
            ["Karat", 4],
            ["Paypal", 3],
            ["ServiceNow", 3],
            ["Goldman Sachs", 3],
            ["Qualtrics", 3],
            ["Adobe", 3],
            ["VMware", 3],
            ["Nvidia", 3],
            ["Shopee", 3],
            ["Twitch", 2],
            ["Snapchat", 2],
            ["Square", 2],
            ["eBay", 2],
            ["Dropbox", 2],
            ["Cruise Automation", 2]
          ],
          "occurence": 103,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Matrix"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "search-suggestions-system",
          "name": "Search Suggestions System",
          "link": "https://leetcode.com/problems/search-suggestions-system",
          "otherCompanies": [
            ["Google", 3],
            ["Facebook", 3],
            ["Oracle", 3],
            ["Apple", 2],
            ["Adobe", 2]
          ],
          "occurence": 68,
          "tags": ["Array", "String", "Trie"],
          "difficulty": "Medium"
        },
        {
          "slug": "best-time-to-buy-and-sell-stock",
          "name": "Best Time to Buy and Sell Stock",
          "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock",
          "otherCompanies": [
            ["Facebook", 16],
            ["Microsoft", 14],
            ["Google", 12],
            ["Bloomberg", 12],
            ["Goldman Sachs", 11],
            ["Apple", 8],
            ["Adobe", 8],
            ["Uber", 7],
            ["Expedia", 5],
            ["Oracle", 4],
            ["Capital One", 4],
            ["JPMorgan", 3],
            ["ByteDance", 3],
            ["Walmart Global Tech", 3],
            ["Atlassian", 2],
            ["Alation", 2],
            ["Docusign", 2],
            ["Paypal", 2],
            ["eBay", 2],
            ["Netflix", 2],
            ["tcs", 2],
            ["ServiceNow", 2],
            ["Visa", 2],
            ["Zoho", 2],
            ["VMware", 2],
            ["Salesforce", 2],
            ["Cisco", 2],
            ["Zoom", 2],
            ["ByteDance", 2]
          ],
          "occurence": 56,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Easy"
        },
        {
          "slug": "group-anagrams",
          "name": "Group Anagrams",
          "link": "https://leetcode.com/problems/group-anagrams",
          "otherCompanies": [
            ["Microsoft", 29],
            ["Facebook", 17],
            ["Apple", 11],
            ["JPMorgan", 8],
            ["BlackRock", 6],
            ["Google", 5],
            ["Walmart Global Tech", 5],
            ["eBay", 4],
            ["Oracle", 4],
            ["Adobe", 4],
            ["Affirm", 4],
            ["Twilio", 3],
            ["Uber", 3],
            ["ServiceNow", 3],
            ["Visa", 3],
            ["Salesforce", 3],
            ["Alation", 2],
            ["Yahoo", 2],
            ["Goldman Sachs", 2],
            ["IBM", 2],
            ["VMware", 2],
            ["Cisco", 2],
            ["ByteDance", 2]
          ],
          "occurence": 51,
          "tags": ["Array", "Hash Table", "String", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "analyze-user-website-visit-pattern",
          "name": "Analyze User Website Visit Pattern",
          "link": "https://leetcode.com/problems/analyze-user-website-visit-pattern",
          "otherCompanies": [["Spotify", 6]],
          "occurence": 50,
          "tags": ["Array", "Hash Table", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-substring-without-repeating-characters",
          "name": "Longest Substring Without Repeating Characters",
          "link": "https://leetcode.com/problems/longest-substring-without-repeating-characters",
          "otherCompanies": [
            ["Microsoft", 29],
            ["Facebook", 23],
            ["Bloomberg", 23],
            ["Apple", 16],
            ["Google", 13],
            ["Spotify", 10],
            ["Adobe", 6],
            ["Uber", 5],
            ["VMware", 5],
            ["Yahoo", 4],
            ["Goldman Sachs", 4],
            ["Oracle", 4],
            ["Salesforce", 3],
            ["Walmart Global Tech", 3],
            ["Yandex", 2],
            ["Paypal", 2],
            ["Intuit", 2],
            ["Zoho", 2],
            ["Samsung", 2],
            ["JPMorgan", 2]
          ],
          "occurence": 49,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "meeting-rooms-ii",
          "name": "Meeting Rooms II",
          "link": "https://leetcode.com/problems/meeting-rooms-ii",
          "otherCompanies": [
            ["Facebook", 33],
            ["Google", 22],
            ["Bloomberg", 20],
            ["Microsoft", 14],
            ["Oracle", 13],
            ["Visa", 3],
            ["Snapchat", 2],
            ["Uber", 2]
          ],
          "occurence": 48,
          "tags": [
            "Array",
            "Two Pointers",
            "Greedy",
            "Sorting",
            "Heap (Priority Queue)",
            "Prefix Sum"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "trapping-rain-water",
          "name": "Trapping Rain Water",
          "link": "https://leetcode.com/problems/trapping-rain-water",
          "otherCompanies": [
            ["Goldman Sachs", 38],
            ["Facebook", 34],
            ["Bloomberg", 15],
            ["Microsoft", 9],
            ["Google", 8],
            ["Apple", 8],
            ["Adobe", 7],
            ["Uber", 5],
            ["Qualtrics", 4],
            ["Rubrik", 4],
            ["Snapchat", 3],
            ["Paypal", 3],
            ["Intel", 3],
            ["Oracle", 3],
            ["Tesla", 3],
            ["Sapient", 2],
            ["Citadel", 2],
            ["National Instruments", 2],
            ["Intuit", 2],
            ["ServiceNow", 2],
            ["Visa", 2]
          ],
          "occurence": 45,
          "tags": [
            "Array",
            "Two Pointers",
            "Dynamic Programming",
            "Stack",
            "Monotonic Stack"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "3sum",
          "name": "3Sum",
          "link": "https://leetcode.com/problems/3sum",
          "otherCompanies": [
            ["Facebook", 28],
            ["Microsoft", 20],
            ["Apple", 10],
            ["Adobe", 9],
            ["Google", 8],
            ["Walmart Global Tech", 7],
            ["Bloomberg", 6],
            ["Uber", 6],
            ["Yahoo", 5],
            ["Qualtrics", 5],
            ["Goldman Sachs", 4],
            ["ByteDance", 4],
            ["Morgan Stanley", 3],
            ["VMware", 3],
            ["Salesforce", 3],
            ["ByteDance", 3],
            ["Infosys", 2],
            ["Oracle", 2],
            ["Tesla", 2],
            ["American Express", 2],
            ["Cisco", 2]
          ],
          "occurence": 44,
          "tags": ["Array", "Two Pointers", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-parentheses",
          "name": "Valid Parentheses",
          "link": "https://leetcode.com/problems/valid-parentheses",
          "otherCompanies": [
            ["LinkedIn", 33],
            ["Facebook", 24],
            ["Microsoft", 22],
            ["Bloomberg", 14],
            ["Spotify", 13],
            ["Apple", 8],
            ["Adobe", 8],
            ["Google", 6],
            ["Oracle", 6],
            ["Expedia", 6],
            ["VMware", 5],
            ["Cisco", 5],
            ["Intel", 4],
            ["Yandex", 3],
            ["Arista Networks", 3],
            ["ByteDance", 3],
            ["Barclays", 2],
            ["Netflix", 2],
            ["tcs", 2],
            ["Uber", 2],
            ["ServiceNow", 2],
            ["Dataminr", 2],
            ["Goldman Sachs", 2],
            ["Salesforce", 2],
            ["Booking", 2]
          ],
          "occurence": 43,
          "tags": ["String", "Stack"],
          "difficulty": "Easy"
        },
        {
          "slug": "word-ladder",
          "name": "Word Ladder",
          "link": "https://leetcode.com/problems/word-ladder",
          "otherCompanies": [
            ["Facebook", 13],
            ["LinkedIn", 7],
            ["Qualtrics", 6],
            ["Microsoft", 6],
            ["Apple", 5],
            ["Lyft", 4],
            ["Snapchat", 4],
            ["Adobe", 4]
          ],
          "occurence": 41,
          "tags": ["Hash Table", "String", "Breadth-First Search"],
          "difficulty": "Hard"
        },
        {
          "slug": "median-of-two-sorted-arrays",
          "name": "Median of Two Sorted Arrays",
          "link": "https://leetcode.com/problems/median-of-two-sorted-arrays",
          "otherCompanies": [
            ["Adobe", 19],
            ["Goldman Sachs", 18],
            ["Apple", 15],
            ["Microsoft", 15],
            ["Google", 14],
            ["Facebook", 7],
            ["ServiceNow", 4],
            ["Paypal", 3],
            ["Yandex", 2],
            ["Bloomberg", 2],
            ["LinkedIn", 2],
            ["VMware", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 40,
          "tags": ["Array", "Binary Search", "Divide and Conquer"],
          "difficulty": "Hard"
        },
        {
          "slug": "add-two-numbers",
          "name": "Add Two Numbers",
          "link": "https://leetcode.com/problems/add-two-numbers",
          "otherCompanies": [
            ["Facebook", 19],
            ["Apple", 19],
            ["Microsoft", 17],
            ["Bloomberg", 16],
            ["Google", 10],
            ["Adobe", 10],
            ["Yahoo", 6],
            ["Uber", 4],
            ["Oracle", 4],
            ["JPMorgan", 3],
            ["Huawei", 2],
            ["Visa", 2],
            ["Capital One", 2],
            ["SAP", 2]
          ],
          "occurence": 36,
          "tags": ["Linked List", "Math", "Recursion"],
          "difficulty": "Medium"
        },
        {
          "slug": "word-search",
          "name": "Word Search",
          "link": "https://leetcode.com/problems/word-search",
          "otherCompanies": [
            ["Twitter", 23],
            ["Uber", 17],
            ["Karat", 17],
            ["Microsoft", 16],
            ["Bloomberg", 14],
            ["Facebook", 12],
            ["Indeed", 9],
            ["Snapchat", 7]
          ],
          "occurence": 36,
          "tags": ["Array", "Backtracking", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-palindromic-substring",
          "name": "Longest Palindromic Substring",
          "link": "https://leetcode.com/problems/longest-palindromic-substring",
          "otherCompanies": [
            ["Microsoft", 18],
            ["Google", 12],
            ["Adobe", 12],
            ["Facebook", 7],
            ["Apple", 7],
            ["Oracle", 7],
            ["Bloomberg", 6],
            ["Goldman Sachs", 5]
          ],
          "occurence": 35,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "rotting-oranges",
          "name": "Rotting Oranges",
          "link": "https://leetcode.com/problems/rotting-oranges",
          "otherCompanies": [
            ["Microsoft", 12],
            ["VMware", 4],
            ["LinkedIn", 2]
          ],
          "occurence": 35,
          "tags": ["Array", "Breadth-First Search", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "course-schedule-ii",
          "name": "Course Schedule II",
          "link": "https://leetcode.com/problems/course-schedule-ii",
          "otherCompanies": [
            ["Google", 11],
            ["Microsoft", 10],
            ["Robinhood", 7],
            ["Roblox", 5],
            ["Twilio", 5],
            ["Facebook", 5],
            ["Apple", 5],
            ["Wayfair", 4],
            ["VMware", 4],
            ["Karat", 4],
            ["Salesforce", 3],
            ["ByteDance", 3],
            ["Uber", 2],
            ["ByteDance", 2]
          ],
          "occurence": 34,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Graph",
            "Topological Sort"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "word-break",
          "name": "Word Break",
          "link": "https://leetcode.com/problems/word-break",
          "otherCompanies": [
            ["Facebook", 33],
            ["Apple", 10],
            ["Qualtrics", 7],
            ["Bloomberg", 5],
            ["Microsoft", 5],
            ["Oracle", 3],
            ["Adobe", 3],
            ["Google", 2]
          ],
          "occurence": 34,
          "tags": [
            "Hash Table",
            "String",
            "Dynamic Programming",
            "Trie",
            "Memoization"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "sliding-window-maximum",
          "name": "Sliding Window Maximum",
          "link": "https://leetcode.com/problems/sliding-window-maximum",
          "otherCompanies": [
            ["Google", 8],
            ["Microsoft", 6],
            ["Salesforce", 6],
            ["Facebook", 5],
            ["Uber", 5],
            ["Citadel", 4],
            ["Adobe", 4],
            ["ByteDance", 4],
            ["Twilio", 3],
            ["Apple", 3],
            ["ByteDance", 3],
            ["DE Shaw", 2],
            ["Quora", 2],
            ["Bloomberg", 2],
            ["DoorDash", 2],
            ["VMware", 2],
            ["Booking", 2]
          ],
          "occurence": 32,
          "tags": [
            "Array",
            "Queue",
            "Sliding Window",
            "Heap (Priority Queue)",
            "Monotonic Queue"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "product-of-array-except-self",
          "name": "Product of Array Except Self",
          "link": "https://leetcode.com/problems/product-of-array-except-self",
          "otherCompanies": [
            ["Facebook", 18],
            ["Microsoft", 15],
            ["Asana", 13],
            ["Apple", 10],
            ["Uber", 8],
            ["Adobe", 7],
            ["Bloomberg", 4],
            ["Oracle", 4]
          ],
          "occurence": 32,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "search-in-rotated-sorted-array",
          "name": "Search in Rotated Sorted Array",
          "link": "https://leetcode.com/problems/search-in-rotated-sorted-array",
          "otherCompanies": [
            ["Facebook", 30],
            ["Microsoft", 24],
            ["LinkedIn", 17],
            ["Bloomberg", 7],
            ["Apple", 7],
            ["Adobe", 7],
            ["ByteDance", 6],
            ["Oracle", 5],
            ["Walmart Global Tech", 5],
            ["ByteDance", 4],
            ["Google", 3],
            ["ServiceNow", 3],
            ["Visa", 3],
            ["VMware", 3],
            ["Morgan Stanley", 2],
            ["Splunk", 2],
            ["Goldman Sachs", 2],
            ["Expedia", 2],
            ["Nvidia", 2],
            ["Salesforce", 2]
          ],
          "occurence": 31,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "first-unique-character-in-a-string",
          "name": "First Unique Character in a String",
          "link": "https://leetcode.com/problems/first-unique-character-in-a-string",
          "otherCompanies": [
            ["Bloomberg", 13],
            ["Apple", 6],
            ["Microsoft", 6],
            ["Oracle", 5],
            ["Facebook", 4],
            ["Goldman Sachs", 4],
            ["Yahoo", 3],
            ["Qualtrics", 3]
          ],
          "occurence": 30,
          "tags": ["Hash Table", "String", "Queue", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "concatenated-words",
          "name": "Concatenated Words",
          "link": "https://leetcode.com/problems/concatenated-words",
          "otherCompanies": [["Microsoft", 3]],
          "occurence": 30,
          "tags": [
            "Array",
            "String",
            "Dynamic Programming",
            "Depth-First Search",
            "Trie"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "maximum-units-on-a-truck",
          "name": "Maximum Units on a Truck",
          "link": "https://leetcode.com/problems/maximum-units-on-a-truck",
          "otherCompanies": [
            ["LinkedIn", 2],
            ["JPMorgan", 2]
          ],
          "occurence": 29,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-length-of-subarray-with-positive-product",
          "name": "Maximum Length of Subarray With Positive Product",
          "link": "https://leetcode.com/problems/maximum-length-of-subarray-with-positive-product",
          "otherCompanies": [
            ["Arcesium", 4],
            ["Adobe", 2]
          ],
          "occurence": 29,
          "tags": ["Array", "Dynamic Programming", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "course-schedule",
          "name": "Course Schedule",
          "link": "https://leetcode.com/problems/course-schedule",
          "otherCompanies": [
            ["Microsoft", 10],
            ["Facebook", 9],
            ["ByteDance", 7],
            ["Google", 5],
            ["Apple", 3],
            ["Bloomberg", 2],
            ["Uber", 2],
            ["Oracle", 2]
          ],
          "occurence": 28,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Graph",
            "Topological Sort"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-tree-zigzag-level-order-traversal",
          "name": "Binary Tree Zigzag Level Order Traversal",
          "link": "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal",
          "otherCompanies": [
            ["Facebook", 18],
            ["Microsoft", 13],
            ["Bloomberg", 5],
            ["Google", 3],
            ["Apple", 2],
            ["LinkedIn", 2],
            ["Oracle", 2],
            ["Adobe", 2]
          ],
          "occurence": 28,
          "tags": ["Tree", "Breadth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "letter-combinations-of-a-phone-number",
          "name": "Letter Combinations of a Phone Number",
          "link": "https://leetcode.com/problems/letter-combinations-of-a-phone-number",
          "otherCompanies": [
            ["Microsoft", 20],
            ["Facebook", 14],
            ["Uber", 9],
            ["Apple", 7],
            ["Google", 5],
            ["Bloomberg", 5],
            ["Swiggy", 3],
            ["Epic Systems", 3]
          ],
          "occurence": 28,
          "tags": ["Hash Table", "String", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "roman-to-integer",
          "name": "Roman to Integer",
          "link": "https://leetcode.com/problems/roman-to-integer",
          "otherCompanies": [
            ["Adobe", 16],
            ["Apple", 13],
            ["Google", 10],
            ["Bloomberg", 10],
            ["Facebook", 8],
            ["Microsoft", 6],
            ["ByteDance", 5],
            ["Yahoo", 4]
          ],
          "occurence": 27,
          "tags": ["Hash Table", "Math", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "integer-to-roman",
          "name": "Integer to Roman",
          "link": "https://leetcode.com/problems/integer-to-roman",
          "otherCompanies": [
            ["Bloomberg", 5],
            ["Microsoft", 5],
            ["Apple", 3],
            ["Capital One", 3],
            ["Google", 2],
            ["Adobe", 2],
            ["ByteDance", 2]
          ],
          "occurence": 27,
          "tags": ["Hash Table", "Math", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "validate-binary-search-tree",
          "name": "Validate Binary Search Tree",
          "link": "https://leetcode.com/problems/validate-binary-search-tree",
          "otherCompanies": [
            ["Bloomberg", 14],
            ["Facebook", 8],
            ["Microsoft", 6],
            ["Adobe", 4],
            ["Oracle", 2],
            ["Qualtrics", 2],
            ["VMware", 2],
            ["ByteDance", 2]
          ],
          "occurence": 25,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "the-kth-factor-of-n",
          "name": "The kth Factor of n",
          "link": "https://leetcode.com/problems/the-kth-factor-of-n",
          "otherCompanies": [["Expedia", 6]],
          "occurence": 25,
          "tags": ["Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-twin-sum-of-a-linked-list",
          "name": "Maximum Twin Sum of a Linked List",
          "link": "https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list",
          "otherCompanies": [],
          "occurence": 23,
          "tags": ["Linked List", "Two Pointers", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "serialize-and-deserialize-binary-tree",
          "name": "Serialize and Deserialize Binary Tree",
          "link": "https://leetcode.com/problems/serialize-and-deserialize-binary-tree",
          "otherCompanies": [
            ["Microsoft", 20],
            ["LinkedIn", 18],
            ["DoorDash", 7],
            ["Uber", 4],
            ["Nvidia", 4],
            ["ByteDance", 4],
            ["Google", 3],
            ["Oracle", 3]
          ],
          "occurence": 21,
          "tags": [
            "String",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Design",
            "Binary Tree"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "house-robber",
          "name": "House Robber",
          "link": "https://leetcode.com/problems/house-robber",
          "otherCompanies": [
            ["Apple", 8],
            ["Google", 7],
            ["Cisco", 6],
            ["Microsoft", 5],
            ["Adobe", 4],
            ["Facebook", 2],
            ["Bloomberg", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 21,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "container-with-most-water",
          "name": "Container With Most Water",
          "link": "https://leetcode.com/problems/container-with-most-water",
          "otherCompanies": [
            ["Microsoft", 9],
            ["Adobe", 9],
            ["Facebook", 8],
            ["Google", 5],
            ["Bloomberg", 5],
            ["Apple", 5],
            ["Swiggy", 4],
            ["Goldman Sachs", 3]
          ],
          "occurence": 21,
          "tags": ["Array", "Two Pointers", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-swaps-to-group-all-1s-together",
          "name": "Minimum Swaps to Group All 1's Together",
          "link": "https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together",
          "otherCompanies": [],
          "occurence": 21,
          "tags": ["Array", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "jump-game",
          "name": "Jump Game",
          "link": "https://leetcode.com/problems/jump-game",
          "otherCompanies": [
            ["Facebook", 8],
            ["Apple", 3],
            ["Flipkart", 3],
            ["DoorDash", 3],
            ["Google", 2],
            ["Bloomberg", 2],
            ["Qualtrics", 2],
            ["Salesforce", 2]
          ],
          "occurence": 20,
          "tags": ["Array", "Dynamic Programming", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "first-missing-positive",
          "name": "First Missing Positive",
          "link": "https://leetcode.com/problems/first-missing-positive",
          "otherCompanies": [
            ["Microsoft", 16],
            ["Adobe", 8],
            ["Google", 5],
            ["Facebook", 4],
            ["Grab", 2],
            ["Databricks", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 20,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Hard"
        },
        {
          "slug": "merge-two-sorted-lists",
          "name": "Merge Two Sorted Lists",
          "link": "https://leetcode.com/problems/merge-two-sorted-lists",
          "otherCompanies": [
            ["Facebook", 13],
            ["Microsoft", 13],
            ["Adobe", 11],
            ["Oracle", 4],
            ["Google", 3],
            ["Bloomberg", 3],
            ["Uber", 3],
            ["Shopee", 3],
            ["Accenture", 2]
          ],
          "occurence": 20,
          "tags": ["Linked List", "Recursion"],
          "difficulty": "Easy"
        },
        {
          "slug": "max-area-of-island",
          "name": "Max Area of Island",
          "link": "https://leetcode.com/problems/max-area-of-island",
          "otherCompanies": [
            ["Facebook", 18],
            ["Microsoft", 10],
            ["Google", 9],
            ["Qualtrics", 4],
            ["Apple", 3],
            ["LinkedIn", 3],
            ["Oracle", 2],
            ["Dropbox", 2]
          ],
          "occurence": 19,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Matrix"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "contains-duplicate",
          "name": "Contains Duplicate",
          "link": "https://leetcode.com/problems/contains-duplicate",
          "otherCompanies": [
            ["Adobe", 12],
            ["Google", 6],
            ["Apple", 6],
            ["Microsoft", 3],
            ["Yahoo", 2],
            ["Bloomberg", 2],
            ["tcs", 2],
            ["Uber", 2]
          ],
          "occurence": 19,
          "tags": ["Array", "Hash Table", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "valid-sudoku",
          "name": "Valid Sudoku",
          "link": "https://leetcode.com/problems/valid-sudoku",
          "otherCompanies": [
            ["Microsoft", 8],
            ["Uber", 5],
            ["Cruise Automation", 5],
            ["Facebook", 4],
            ["Apple", 4],
            ["Wayfair", 3],
            ["Nvidia", 3],
            ["Karat", 3]
          ],
          "occurence": 19,
          "tags": ["Array", "Hash Table", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "gas-station",
          "name": "Gas Station",
          "link": "https://leetcode.com/problems/gas-station",
          "otherCompanies": [
            ["IBM", 8],
            ["Microsoft", 7],
            ["Apple", 5],
            ["ByteDance", 5],
            ["Bloomberg", 3],
            ["Adobe", 3],
            ["Walmart Global Tech", 3],
            ["Uber", 2]
          ],
          "occurence": 19,
          "tags": ["Array", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "coin-change",
          "name": "Coin Change",
          "link": "https://leetcode.com/problems/coin-change",
          "otherCompanies": [
            ["Microsoft", 14],
            ["Google", 5],
            ["Mathworks", 5],
            ["Bloomberg", 4],
            ["Yahoo", 2],
            ["Facebook", 2],
            ["Goldman Sachs", 2]
          ],
          "occurence": 18,
          "tags": ["Array", "Dynamic Programming", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "min-stack",
          "name": "Min Stack",
          "link": "https://leetcode.com/problems/min-stack",
          "otherCompanies": [
            ["Microsoft", 10],
            ["Bloomberg", 7],
            ["Facebook", 4],
            ["Google", 3],
            ["Salesforce", 3],
            ["Oracle", 2],
            ["Adobe", 2]
          ],
          "occurence": 18,
          "tags": ["Stack", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "range-addition",
          "name": "Range Addition",
          "link": "https://leetcode.com/problems/range-addition",
          "otherCompanies": [["Citadel", 5]],
          "occurence": 18,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "combination-sum",
          "name": "Combination Sum",
          "link": "https://leetcode.com/problems/combination-sum",
          "otherCompanies": [
            ["Facebook", 12],
            ["Microsoft", 6],
            ["Airbnb", 5],
            ["Apple", 4],
            ["Bloomberg", 3],
            ["LinkedIn", 3],
            ["Adobe", 3],
            ["ByteDance", 3]
          ],
          "occurence": 18,
          "tags": ["Array", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "reorganize-string",
          "name": "Reorganize String",
          "link": "https://leetcode.com/problems/reorganize-string",
          "otherCompanies": [
            ["Facebook", 9],
            ["Google", 4],
            ["eBay", 3],
            ["Uber", 2],
            ["Oracle", 2]
          ],
          "occurence": 17,
          "tags": [
            "Hash Table",
            "String",
            "Greedy",
            "Sorting",
            "Heap (Priority Queue)",
            "Counting"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "slowest-key",
          "name": "Slowest Key",
          "link": "https://leetcode.com/problems/slowest-key",
          "otherCompanies": [["Walmart Global Tech", 2]],
          "occurence": 17,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "design-in-memory-file-system",
          "name": "Design In-Memory File System",
          "link": "https://leetcode.com/problems/design-in-memory-file-system",
          "otherCompanies": [
            ["Microsoft", 10],
            ["DoorDash", 4],
            ["Google", 3],
            ["Salesforce", 3],
            ["Goldman Sachs", 2]
          ],
          "occurence": 16,
          "tags": ["Hash Table", "String", "Design", "Trie"],
          "difficulty": "Hard"
        },
        {
          "slug": "find-the-duplicate-number",
          "name": "Find the Duplicate Number",
          "link": "https://leetcode.com/problems/find-the-duplicate-number",
          "otherCompanies": [
            ["Microsoft", 11],
            ["Facebook", 4],
            ["Apple", 3],
            ["Uber", 3],
            ["Google", 2],
            ["Qualcomm", 2]
          ],
          "occurence": 16,
          "tags": [
            "Array",
            "Two Pointers",
            "Binary Search",
            "Bit Manipulation"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-all-anagrams-in-a-string",
          "name": "Find All Anagrams in a String",
          "link": "https://leetcode.com/problems/find-all-anagrams-in-a-string",
          "otherCompanies": [
            ["Microsoft", 11],
            ["Facebook", 5],
            ["Apple", 4],
            ["Adobe", 4],
            ["Yahoo", 3],
            ["Bloomberg", 3],
            ["Uber", 3],
            ["Oracle", 3],
            ["Google", 2]
          ],
          "occurence": 15,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "implement-trie-prefix-tree",
          "name": "Implement Trie",
          "link": "https://leetcode.com/problems/implement-trie-prefix-tree",
          "otherCompanies": [
            ["Google", 9],
            ["Twitter", 6],
            ["Microsoft", 5],
            ["Snapchat", 4],
            ["Apple", 3],
            ["Facebook", 2],
            ["Oracle", 2],
            ["ByteDance", 2]
          ],
          "occurence": 15,
          "tags": ["Hash Table", "String", "Design", "Trie"],
          "difficulty": "Medium"
        },
        {
          "slug": "recover-binary-search-tree",
          "name": "Recover Binary Search Tree",
          "link": "https://leetcode.com/problems/recover-binary-search-tree",
          "otherCompanies": [
            ["Microsoft", 4],
            ["Apple", 3],
            ["Google", 2],
            ["Bloomberg", 2],
            ["Adobe", 2]
          ],
          "occurence": 15,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-winner-on-a-tic-tac-toe-game",
          "name": "Find Winner on a Tic Tac Toe Game",
          "link": "https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game",
          "otherCompanies": [
            ["Google", 11],
            ["Microsoft", 10],
            ["Facebook", 4],
            ["Tesla", 2]
          ],
          "occurence": 14,
          "tags": ["Array", "Hash Table", "Matrix", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "climbing-stairs",
          "name": "Climbing Stairs",
          "link": "https://leetcode.com/problems/climbing-stairs",
          "otherCompanies": [
            ["Expedia", 7],
            ["Microsoft", 7],
            ["Google", 4],
            ["Uber", 4],
            ["Yahoo", 3],
            ["Adobe", 3],
            ["Bloomberg", 2],
            ["Goldman Sachs", 2]
          ],
          "occurence": 14,
          "tags": ["Math", "Dynamic Programming", "Memoization"],
          "difficulty": "Easy"
        },
        {
          "slug": "reverse-nodes-in-k-group",
          "name": "Reverse Nodes in k-Group",
          "link": "https://leetcode.com/problems/reverse-nodes-in-k-group",
          "otherCompanies": [
            ["Capital One", 13],
            ["Microsoft", 13],
            ["Facebook", 5],
            ["Google", 2],
            ["Yahoo", 2],
            ["Bloomberg", 2],
            ["Zoom", 2],
            ["ByteDance", 2]
          ],
          "occurence": 14,
          "tags": ["Linked List", "Recursion"],
          "difficulty": "Hard"
        },
        {
          "slug": "asteroid-collision",
          "name": "Asteroid Collision",
          "link": "https://leetcode.com/problems/asteroid-collision",
          "otherCompanies": [
            ["Facebook", 10],
            ["DoorDash", 7],
            ["ByteDance", 5],
            ["Lyft", 4],
            ["Microsoft", 4],
            ["Goldman Sachs", 3],
            ["Oracle", 3],
            ["Hotstar", 3]
          ],
          "occurence": 14,
          "tags": ["Array", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "pairs-of-songs-with-total-durations-divisible-by-60",
          "name": "Pairs of Songs With Total Durations Divisible by 60",
          "link": "https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60",
          "otherCompanies": [
            ["Citadel", 8],
            ["Bloomberg", 3],
            ["C3 IoT", 3],
            ["Apple", 2],
            ["ServiceNow", 2],
            ["Oracle", 2],
            ["Cisco", 2]
          ],
          "occurence": 14,
          "tags": ["Array", "Hash Table", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-search",
          "name": "Binary Search",
          "link": "https://leetcode.com/problems/binary-search",
          "otherCompanies": [
            ["Apple", 5],
            ["Google", 4],
            ["Microsoft", 4],
            ["Bloomberg", 3],
            ["Adobe", 3],
            ["Yahoo", 2],
            ["Facebook", 2],
            ["Uber", 2]
          ],
          "occurence": 13,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "best-time-to-buy-and-sell-stock-ii",
          "name": "Best Time to Buy and Sell Stock II",
          "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii",
          "otherCompanies": [
            ["Facebook", 5],
            ["Walmart Global Tech", 4],
            ["Google", 3],
            ["Bloomberg", 3],
            ["Microsoft", 3],
            ["ByteDance", 3],
            ["Oracle", 2]
          ],
          "occurence": 13,
          "tags": ["Array", "Dynamic Programming", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "jump-game-ii",
          "name": "Jump Game II",
          "link": "https://leetcode.com/problems/jump-game-ii",
          "otherCompanies": [
            ["Apple", 4],
            ["Google", 3],
            ["Bloomberg", 3],
            ["DoorDash", 3],
            ["ByteDance", 3],
            ["payu", 2],
            ["Tesla", 2],
            ["Microsoft", 2],
            ["Adobe", 2]
          ],
          "occurence": 13,
          "tags": ["Array", "Dynamic Programming", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "reverse-linked-list",
          "name": "Reverse Linked List",
          "link": "https://leetcode.com/problems/reverse-linked-list",
          "otherCompanies": [
            ["Microsoft", 10],
            ["Apple", 6],
            ["Facebook", 4],
            ["Bloomberg", 4],
            ["Google", 3],
            ["Yandex", 3],
            ["Intuit", 2],
            ["Nvidia", 2]
          ],
          "occurence": 12,
          "tags": ["Linked List", "Recursion"],
          "difficulty": "Easy"
        },
        {
          "slug": "boundary-of-binary-tree",
          "name": "Boundary of Binary Tree",
          "link": "https://leetcode.com/problems/boundary-of-binary-tree",
          "otherCompanies": [
            ["Microsoft", 9],
            ["Facebook", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 12,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "largest-rectangle-in-histogram",
          "name": "Largest Rectangle in Histogram",
          "link": "https://leetcode.com/problems/largest-rectangle-in-histogram",
          "otherCompanies": [
            ["Microsoft", 6],
            ["Facebook", 4],
            ["Uber", 4],
            ["Adobe", 4],
            ["Bloomberg", 2],
            ["DoorDash", 2],
            ["ByteDance", 2]
          ],
          "occurence": 12,
          "tags": ["Array", "Stack", "Monotonic Stack"],
          "difficulty": "Hard"
        },
        {
          "slug": "design-parking-system",
          "name": "Design Parking System",
          "link": "https://leetcode.com/problems/design-parking-system",
          "otherCompanies": [],
          "occurence": 12,
          "tags": ["Design", "Simulation", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "two-sum-ii-input-array-is-sorted",
          "name": "Two Sum II - Input array is sorted",
          "link": "https://leetcode.com/problems/two-sum-ii-input-array-is-sorted",
          "otherCompanies": [
            ["Adobe", 5],
            ["Google", 4],
            ["Apple", 3],
            ["Yahoo", 2],
            ["Microsoft", 2]
          ],
          "occurence": 11,
          "tags": ["Array", "Two Pointers", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "peak-index-in-a-mountain-array",
          "name": "Peak Index in a Mountain Array",
          "link": "https://leetcode.com/problems/peak-index-in-a-mountain-array",
          "otherCompanies": [
            ["Bloomberg", 3],
            ["Apple", 3],
            ["Google", 2]
          ],
          "occurence": 10,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "fibonacci-number",
          "name": "Fibonacci Number",
          "link": "https://leetcode.com/problems/fibonacci-number",
          "otherCompanies": [
            ["Apple", 4],
            ["Microsoft", 4],
            ["Adobe", 4],
            ["Facebook", 3],
            ["Goldman Sachs", 3],
            ["Oracle", 3],
            ["Zoom", 3],
            ["Google", 2]
          ],
          "occurence": 10,
          "tags": ["Math", "Dynamic Programming", "Recursion", "Memoization"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-k-digits",
          "name": "Remove K Digits",
          "link": "https://leetcode.com/problems/remove-k-digits",
          "otherCompanies": [
            ["Bloomberg", 3],
            ["Microsoft", 3],
            ["Google", 2],
            ["MakeMyTrip", 2],
            ["Facebook", 2],
            ["Adobe", 2]
          ],
          "occurence": 10,
          "tags": ["String", "Stack", "Greedy", "Monotonic Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "search-a-2d-matrix-ii",
          "name": "Search a 2D Matrix II",
          "link": "https://leetcode.com/problems/search-a-2d-matrix-ii",
          "otherCompanies": [
            ["Microsoft", 5],
            ["Bloomberg", 3],
            ["Facebook", 2],
            ["Apple", 2],
            ["Oracle", 2]
          ],
          "occurence": 10,
          "tags": ["Array", "Binary Search", "Divide and Conquer", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "reorder-list",
          "name": "Reorder List",
          "link": "https://leetcode.com/problems/reorder-list",
          "otherCompanies": [
            ["Microsoft", 4],
            ["Adobe", 3],
            ["Facebook", 2],
            ["Bloomberg", 2],
            ["Uber", 2],
            ["Samsung", 2]
          ],
          "occurence": 10,
          "tags": ["Linked List", "Two Pointers", "Stack", "Recursion"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-hashmap",
          "name": "Design HashMap",
          "link": "https://leetcode.com/problems/design-hashmap",
          "otherCompanies": [
            ["Microsoft", 6],
            ["LinkedIn", 5],
            ["Oracle", 4],
            ["Apple", 3],
            ["Goldman Sachs", 3],
            ["Salesforce", 3],
            ["Walmart Global Tech", 3]
          ],
          "occurence": 10,
          "tags": [
            "Array",
            "Hash Table",
            "Linked List",
            "Design",
            "Hash Function"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "car-pooling",
          "name": "Car Pooling",
          "link": "https://leetcode.com/problems/car-pooling",
          "otherCompanies": [
            ["Flipkart", 4],
            ["DoorDash", 4],
            ["Google", 3],
            ["Bloomberg", 3],
            ["Microsoft", 3],
            ["Facebook", 2],
            ["Cruise Automation", 2]
          ],
          "occurence": 9,
          "tags": [
            "Array",
            "Sorting",
            "Heap (Priority Queue)",
            "Simulation",
            "Prefix Sum"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "time-based-key-value-store",
          "name": "Time Based Key-Value Store",
          "link": "https://leetcode.com/problems/time-based-key-value-store",
          "otherCompanies": [
            ["Lyft", 7],
            ["Microsoft", 5],
            ["Google", 4],
            ["Oracle", 3],
            ["ByteDance", 3]
          ],
          "occurence": 9,
          "tags": ["Hash Table", "String", "Binary Search", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "single-element-in-a-sorted-array",
          "name": "Single Element in a Sorted Array",
          "link": "https://leetcode.com/problems/single-element-in-a-sorted-array",
          "otherCompanies": [
            ["Facebook", 5],
            ["Microsoft", 5],
            ["Google", 3],
            ["Apple", 2],
            ["Nvidia", 2]
          ],
          "occurence": 9,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "intersection-of-two-arrays",
          "name": "Intersection of Two Arrays",
          "link": "https://leetcode.com/problems/intersection-of-two-arrays",
          "otherCompanies": [
            ["Facebook", 6],
            ["Apple", 6],
            ["Adobe", 5],
            ["Google", 3],
            ["Bloomberg", 2],
            ["Microsoft", 2],
            ["JPMorgan", 2]
          ],
          "occurence": 9,
          "tags": [
            "Array",
            "Hash Table",
            "Two Pointers",
            "Binary Search",
            "Sorting"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "rotate-array",
          "name": "Rotate Array",
          "link": "https://leetcode.com/problems/rotate-array",
          "otherCompanies": [
            ["Microsoft", 7],
            ["Google", 4],
            ["Yahoo", 2],
            ["Facebook", 2],
            ["tcs", 2],
            ["Salesforce", 2]
          ],
          "occurence": 9,
          "tags": ["Array", "Math", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "majority-element",
          "name": "Majority Element",
          "link": "https://leetcode.com/problems/majority-element",
          "otherCompanies": [
            ["Microsoft", 6],
            ["Adobe", 5],
            ["Apple", 4],
            ["Google", 3],
            ["Bloomberg", 3],
            ["Facebook", 2],
            ["Uber", 2],
            ["Rubrik", 2]
          ],
          "occurence": 9,
          "tags": [
            "Array",
            "Hash Table",
            "Divide and Conquer",
            "Sorting",
            "Counting"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "linked-list-cycle",
          "name": "Linked List Cycle",
          "link": "https://leetcode.com/problems/linked-list-cycle",
          "otherCompanies": [
            ["Spotify", 4],
            ["Visa", 3],
            ["Oracle", 3],
            ["Microsoft", 3],
            ["Google", 2],
            ["Goldman Sachs", 2]
          ],
          "occurence": 9,
          "tags": ["Hash Table", "Linked List", "Two Pointers"],
          "difficulty": "Easy"
        },
        {
          "slug": "longest-consecutive-sequence",
          "name": "Longest Consecutive Sequence",
          "link": "https://leetcode.com/problems/longest-consecutive-sequence",
          "otherCompanies": [
            ["Microsoft", 8],
            ["Google", 7],
            ["Adobe", 3],
            ["Spotify", 3],
            ["eBay", 2],
            ["Bloomberg", 2],
            ["Apple", 2],
            ["Visa", 2],
            ["Qualtrics", 2]
          ],
          "occurence": 9,
          "tags": ["Array", "Hash Table", "Union Find"],
          "difficulty": "Medium"
        },
        {
          "slug": "permutations",
          "name": "Permutations",
          "link": "https://leetcode.com/problems/permutations",
          "otherCompanies": [
            ["Facebook", 7],
            ["LinkedIn", 6],
            ["Google", 5],
            ["Microsoft", 5],
            ["Apple", 4],
            ["Adobe", 3],
            ["Bloomberg", 2],
            ["Goldman Sachs", 2]
          ],
          "occurence": 9,
          "tags": ["Array", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "search-insert-position",
          "name": "Search Insert Position",
          "link": "https://leetcode.com/problems/search-insert-position",
          "otherCompanies": [
            ["Apple", 7],
            ["Adobe", 7],
            ["Google", 4],
            ["Bloomberg", 3],
            ["Facebook", 2],
            ["Uber", 2],
            ["VMware", 2],
            ["ByteDance", 2]
          ],
          "occurence": 9,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "longest-valid-parentheses",
          "name": "Longest Valid Parentheses",
          "link": "https://leetcode.com/problems/longest-valid-parentheses",
          "otherCompanies": [
            ["Morgan Stanley", 4],
            ["Facebook", 4],
            ["ByteDance", 3],
            ["Oracle", 2],
            ["Microsoft", 2],
            ["VMware", 2]
          ],
          "occurence": 9,
          "tags": ["String", "Dynamic Programming", "Stack"],
          "difficulty": "Hard"
        },
        {
          "slug": "word-ladder-ii",
          "name": "Word Ladder II",
          "link": "https://leetcode.com/problems/word-ladder-ii",
          "otherCompanies": [
            ["Box", 4],
            ["Facebook", 4],
            ["Snapchat", 3],
            ["Microsoft", 2]
          ],
          "occurence": 9,
          "tags": [
            "Hash Table",
            "String",
            "Backtracking",
            "Breadth-First Search"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "single-number",
          "name": "Single Number",
          "link": "https://leetcode.com/problems/single-number",
          "otherCompanies": [
            ["Bloomberg", 5],
            ["Microsoft", 5],
            ["Google", 4],
            ["Facebook", 4],
            ["Apple", 4],
            ["Adobe", 4],
            ["Atlassian", 2],
            ["Uber", 2]
          ],
          "occurence": 8,
          "tags": ["Array", "Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "delete-node-in-a-bst",
          "name": "Delete Node in a BST",
          "link": "https://leetcode.com/problems/delete-node-in-a-bst",
          "otherCompanies": [
            ["Microsoft", 6],
            ["Oracle", 4],
            ["Google", 3],
            ["LinkedIn", 3]
          ],
          "occurence": 8,
          "tags": ["Tree", "Binary Search Tree", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "implement-queue-using-stacks",
          "name": "Implement Queue using Stacks",
          "link": "https://leetcode.com/problems/implement-queue-using-stacks",
          "otherCompanies": [
            ["Goldman Sachs", 3],
            ["Microsoft", 3],
            ["Google", 2],
            ["eBay", 2]
          ],
          "occurence": 8,
          "tags": ["Stack", "Design", "Queue"],
          "difficulty": "Easy"
        },
        {
          "slug": "edit-distance",
          "name": "Edit Distance",
          "link": "https://leetcode.com/problems/edit-distance",
          "otherCompanies": [
            ["LinkedIn", 7],
            ["Microsoft", 6],
            ["Google", 4],
            ["Apple", 3],
            ["Facebook", 2],
            ["Bloomberg", 2],
            ["Rubrik", 2]
          ],
          "occurence": 8,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "number-of-distinct-islands",
          "name": "Number of Distinct Islands",
          "link": "https://leetcode.com/problems/number-of-distinct-islands",
          "otherCompanies": [
            ["Microsoft", 4],
            ["Bloomberg", 2],
            ["DoorDash", 2]
          ],
          "occurence": 8,
          "tags": [
            "Hash Table",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Hash Function"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "kill-process",
          "name": "Kill Process",
          "link": "https://leetcode.com/problems/kill-process",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 8,
          "tags": [
            "Array",
            "Hash Table",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "candy",
          "name": "Candy",
          "link": "https://leetcode.com/problems/candy",
          "otherCompanies": [],
          "occurence": 8,
          "tags": ["Array", "Greedy"],
          "difficulty": "Hard"
        },
        {
          "slug": "isomorphic-strings",
          "name": "Isomorphic Strings",
          "link": "https://leetcode.com/problems/isomorphic-strings",
          "otherCompanies": [
            ["LinkedIn", 6],
            ["Google", 3]
          ],
          "occurence": 7,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-path-sum",
          "name": "Minimum Path Sum",
          "link": "https://leetcode.com/problems/minimum-path-sum",
          "otherCompanies": [
            ["Microsoft", 5],
            ["Google", 4],
            ["Apple", 3],
            ["Goldman Sachs", 3],
            ["Oracle", 3],
            ["Square", 2],
            ["Uber", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "n-queens",
          "name": "N-Queens",
          "link": "https://leetcode.com/problems/n-queens",
          "otherCompanies": [
            ["Facebook", 4],
            ["Microsoft", 4],
            ["Google", 3],
            ["Bloomberg", 3],
            ["Adobe", 3],
            ["ByteDance", 3],
            ["ByteDance", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Backtracking"],
          "difficulty": "Hard"
        },
        {
          "slug": "sudoku-solver",
          "name": "Sudoku Solver",
          "link": "https://leetcode.com/problems/sudoku-solver",
          "otherCompanies": [
            ["Apple", 6],
            ["Google", 5],
            ["Microsoft", 5],
            ["Intuit", 4],
            ["DoorDash", 4],
            ["Uber", 3],
            ["Adobe", 3],
            ["ByteDance", 3],
            ["Facebook", 2],
            ["Nutanix", 2],
            ["Salesforce", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Backtracking", "Matrix"],
          "difficulty": "Hard"
        },
        {
          "slug": "implement-strstr",
          "name": "Implement strStr()",
          "link": "https://leetcode.com/problems/implement-strstr",
          "otherCompanies": [
            ["Google", 4],
            ["Microsoft", 4],
            ["Facebook", 3],
            ["Apple", 2],
            ["Uber", 2]
          ],
          "occurence": 7,
          "tags": ["Two Pointers", "String", "String Matching"],
          "difficulty": "Medium"
        },
        {
          "slug": "contiguous-array",
          "name": "Contiguous Array",
          "link": "https://leetcode.com/problems/contiguous-array",
          "otherCompanies": [
            ["Facebook", 3],
            ["Apple", 2],
            ["Microsoft", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Hash Table", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-an-expression-tree-with-evaluate-function",
          "name": "Design an Expression Tree With Evaluate Function",
          "link": "https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function",
          "otherCompanies": [],
          "occurence": 7,
          "tags": ["Math", "Stack", "Tree", "Design", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "compare-version-numbers",
          "name": "Compare Version Numbers",
          "link": "https://leetcode.com/problems/compare-version-numbers",
          "otherCompanies": [
            ["Microsoft", 4],
            ["Nutanix", 2],
            ["Arista Networks", 2]
          ],
          "occurence": 7,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "linked-list-cycle-ii",
          "name": "Linked List Cycle II",
          "link": "https://leetcode.com/problems/linked-list-cycle-ii",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 7,
          "tags": ["Hash Table", "Linked List", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "best-time-to-buy-and-sell-stock-iii",
          "name": "Best Time to Buy and Sell Stock III",
          "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii",
          "otherCompanies": [
            ["Uber", 3],
            ["Apple", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "number-of-connected-components-in-an-undirected-graph",
          "name": "Number of Connected Components in an Undirected Graph",
          "link": "https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph",
          "otherCompanies": [
            ["Facebook", 3],
            ["LinkedIn", 3],
            ["Pinterest", 2],
            ["Google", 2],
            ["Microsoft", 2]
          ],
          "occurence": 6,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-sum-circular-subarray",
          "name": "Maximum Sum Circular Subarray",
          "link": "https://leetcode.com/problems/maximum-sum-circular-subarray",
          "otherCompanies": [["Google", 3]],
          "occurence": 6,
          "tags": [
            "Array",
            "Divide and Conquer",
            "Dynamic Programming",
            "Queue",
            "Monotonic Queue"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-width-of-binary-tree",
          "name": "Maximum Width of Binary Tree",
          "link": "https://leetcode.com/problems/maximum-width-of-binary-tree",
          "otherCompanies": [
            ["Google", 4],
            ["Facebook", 3],
            ["Microsoft", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 6,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "subtree-of-another-tree",
          "name": "Subtree of Another Tree",
          "link": "https://leetcode.com/problems/subtree-of-another-tree",
          "otherCompanies": [
            ["Facebook", 5],
            ["Microsoft", 3],
            ["Google", 2]
          ],
          "occurence": 6,
          "tags": [
            "Tree",
            "Depth-First Search",
            "String Matching",
            "Binary Tree",
            "Hash Function"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "strong-password-checker",
          "name": "Strong Password Checker",
          "link": "https://leetcode.com/problems/strong-password-checker",
          "otherCompanies": [["Google", 3]],
          "occurence": 6,
          "tags": ["String", "Greedy", "Heap (Priority Queue)"],
          "difficulty": "Hard"
        },
        {
          "slug": "frog-jump",
          "name": "Frog Jump",
          "link": "https://leetcode.com/problems/frog-jump",
          "otherCompanies": [
            ["Microsoft", 3],
            ["Google", 2],
            ["ByteDance", 2]
          ],
          "occurence": 6,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "house-robber-iii",
          "name": "House Robber III",
          "link": "https://leetcode.com/problems/house-robber-iii",
          "otherCompanies": [
            ["Google", 5],
            ["Adobe", 3]
          ],
          "occurence": 6,
          "tags": [
            "Dynamic Programming",
            "Tree",
            "Depth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "4sum",
          "name": "4 Sum",
          "link": "https://leetcode.com/problems/4sum",
          "otherCompanies": [
            ["Facebook", 5],
            ["Apple", 5],
            ["Microsoft", 4],
            ["Adobe", 3],
            ["Google", 2],
            ["Infosys", 2],
            ["Yahoo", 2],
            ["LinkedIn", 2]
          ],
          "occurence": 6,
          "tags": ["Array", "Two Pointers", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "4sum-ii",
          "name": "4Sum II",
          "link": "https://leetcode.com/problems/4sum-ii",
          "otherCompanies": [
            ["Facebook", 3],
            ["Bloomberg", 2],
            ["Adobe", 2]
          ],
          "occurence": 6,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Medium"
        },
        {
          "slug": "reverse-string",
          "name": "Reverse String",
          "link": "https://leetcode.com/problems/reverse-string",
          "otherCompanies": [
            ["Microsoft", 5],
            ["Adobe", 5],
            ["Facebook", 3],
            ["tcs", 3],
            ["Apple", 2],
            ["Intel", 2]
          ],
          "occurence": 6,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-duplicates-from-sorted-list",
          "name": "Remove Duplicates from Sorted List",
          "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-list",
          "otherCompanies": [
            ["Facebook", 4],
            ["Bloomberg", 2],
            ["Microsoft", 2],
            ["Adobe", 2]
          ],
          "occurence": 6,
          "tags": ["Linked List"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-duplicates-from-sorted-list-ii",
          "name": "Remove Duplicates from Sorted List II",
          "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii",
          "otherCompanies": [
            ["Facebook", 2],
            ["Microsoft", 2]
          ],
          "occurence": 6,
          "tags": ["Linked List", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-laser-beams-in-a-bank",
          "name": "Number of Laser Beams in a Bank",
          "link": "https://leetcode.com/problems/number-of-laser-beams-in-a-bank",
          "otherCompanies": [],
          "occurence": 6,
          "tags": ["Array", "Math", "String", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-zigzag-path-in-a-binary-tree",
          "name": "Longest ZigZag Path in a Binary Tree",
          "link": "https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree",
          "otherCompanies": [],
          "occurence": 6,
          "tags": [
            "Dynamic Programming",
            "Tree",
            "Depth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-common-subsequence",
          "name": "Longest Common Subsequence",
          "link": "https://leetcode.com/problems/longest-common-subsequence",
          "otherCompanies": [
            ["DoorDash", 5],
            ["Bloomberg", 3],
            ["Karat", 2]
          ],
          "occurence": 6,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "online-stock-span",
          "name": "Online Stock Span",
          "link": "https://leetcode.com/problems/online-stock-span",
          "otherCompanies": [
            ["Bloomberg", 2],
            ["Adobe", 2]
          ],
          "occurence": 6,
          "tags": ["Stack", "Design", "Monotonic Stack", "Data Stream"],
          "difficulty": "Medium"
        },
        {
          "slug": "keys-and-rooms",
          "name": "Keys and Rooms",
          "link": "https://leetcode.com/problems/keys-and-rooms",
          "otherCompanies": [["Hotstar", 2]],
          "occurence": 6,
          "tags": ["Depth-First Search", "Breadth-First Search", "Graph"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-palindromic-subsequence",
          "name": "Longest Palindromic Subsequence",
          "link": "https://leetcode.com/problems/longest-palindromic-subsequence",
          "otherCompanies": [
            ["LinkedIn", 5],
            ["Microsoft", 3],
            ["Bloomberg", 2],
            ["Apple", 2],
            ["Oracle", 2]
          ],
          "occurence": 6,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-snake-game",
          "name": "Design Snake Game",
          "link": "https://leetcode.com/problems/design-snake-game",
          "otherCompanies": [
            ["Atlassian", 3],
            ["Square", 3],
            ["ByteDance", 3],
            ["Google", 2],
            ["IXL", 2],
            ["Microsoft", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Design", "Queue", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "furthest-building-you-can-reach",
          "name": "Furthest Building You Can Reach",
          "link": "https://leetcode.com/problems/furthest-building-you-can-reach",
          "otherCompanies": [
            ["Google", 3],
            ["Microsoft", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Greedy", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        },
        {
          "slug": "sort-array-by-increasing-frequency",
          "name": "Sort Array by Increasing Frequency",
          "link": "https://leetcode.com/problems/sort-array-by-increasing-frequency",
          "otherCompanies": [
            ["Oracle", 3],
            ["Google", 2],
            ["Twilio", 2],
            ["C3 IoT", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Hash Table", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "middle-of-the-linked-list",
          "name": "Middle of the Linked List",
          "link": "https://leetcode.com/problems/middle-of-the-linked-list",
          "otherCompanies": [
            ["Adobe", 4],
            ["Google", 3],
            ["Facebook", 3],
            ["Qualcomm", 2],
            ["Apple", 2],
            ["Microsoft", 2]
          ],
          "occurence": 5,
          "tags": ["Linked List", "Two Pointers"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-all-duplicates-in-an-array",
          "name": "Find All Duplicates in an Array",
          "link": "https://leetcode.com/problems/find-all-duplicates-in-an-array",
          "otherCompanies": [
            ["Microsoft", 4],
            ["Google", 2],
            ["Apple", 2],
            ["Adobe", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Medium"
        },
        {
          "slug": "power-of-two",
          "name": "Power of Two",
          "link": "https://leetcode.com/problems/power-of-two",
          "otherCompanies": [
            ["Apple", 4],
            ["Google", 3],
            ["Snapchat", 2]
          ],
          "occurence": 5,
          "tags": ["Math", "Bit Manipulation", "Recursion"],
          "difficulty": "Easy"
        },
        {
          "slug": "path-sum-ii",
          "name": "Path Sum II",
          "link": "https://leetcode.com/problems/path-sum-ii",
          "otherCompanies": [
            ["Facebook", 4],
            ["Google", 3],
            ["Oracle", 2],
            ["Microsoft", 2]
          ],
          "occurence": 5,
          "tags": ["Backtracking", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "balanced-binary-tree",
          "name": "Balanced Binary Tree",
          "link": "https://leetcode.com/problems/balanced-binary-tree",
          "otherCompanies": [
            ["Spotify", 4],
            ["Google", 2],
            ["Facebook", 2],
            ["Adobe", 2]
          ],
          "occurence": 5,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-element",
          "name": "Remove Element",
          "link": "https://leetcode.com/problems/remove-element",
          "otherCompanies": [
            ["Apple", 4],
            ["Google", 2],
            ["Microsoft", 2],
            ["Adobe", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Two Pointers"],
          "difficulty": "Easy"
        },
        {
          "slug": "pascals-triangle",
          "name": "Pascal's Triangle",
          "link": "https://leetcode.com/problems/pascals-triangle",
          "otherCompanies": [
            ["Apple", 4],
            ["Microsoft", 4],
            ["Goldman Sachs", 3],
            ["Yahoo", 2],
            ["Snapchat", 2],
            ["Uber", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-frequency-stack",
          "name": "Maximum Frequency Stack",
          "link": "https://leetcode.com/problems/maximum-frequency-stack",
          "otherCompanies": [
            ["Apple", 4],
            ["Facebook", 2],
            ["Twitter", 2],
            ["LinkedIn", 2],
            ["MindTickle", 2],
            ["Microsoft", 2],
            ["Adobe", 2]
          ],
          "occurence": 5,
          "tags": ["Hash Table", "Stack", "Design", "Ordered Set"],
          "difficulty": "Hard"
        },
        {
          "slug": "search-in-rotated-sorted-array-ii",
          "name": "Search in Rotated Sorted Array II",
          "link": "https://leetcode.com/problems/search-in-rotated-sorted-array-ii",
          "otherCompanies": [
            ["LinkedIn", 4],
            ["Adobe", 3],
            ["Facebook", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "least-number-of-unique-integers-after-k-removals",
          "name": "Least Number of Unique Integers after K Removals",
          "link": "https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals",
          "otherCompanies": [
            ["Expedia", 4],
            ["Booking", 3],
            ["Salesforce", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Hash Table", "Greedy", "Sorting", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-days-between-two-dates",
          "name": "Number of Days Between Two Dates",
          "link": "https://leetcode.com/problems/number-of-days-between-two-dates",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Math", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "next-greater-node-in-linked-list",
          "name": "Next Greater Node In Linked List",
          "link": "https://leetcode.com/problems/next-greater-node-in-linked-list",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 5,
          "tags": ["Array", "Linked List", "Stack", "Monotonic Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "reach-a-number",
          "name": "Reach a Number",
          "link": "https://leetcode.com/problems/reach-a-number",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Math", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "min-cost-climbing-stairs",
          "name": "Min Cost Climbing Stairs",
          "link": "https://leetcode.com/problems/min-cost-climbing-stairs",
          "otherCompanies": [
            ["Adobe", 4],
            ["Bloomberg", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Easy"
        },
        {
          "slug": "shortest-unsorted-continuous-subarray",
          "name": "Shortest Unsorted Continuous Subarray",
          "link": "https://leetcode.com/problems/shortest-unsorted-continuous-subarray",
          "otherCompanies": [["Microsoft", 3]],
          "occurence": 5,
          "tags": [
            "Array",
            "Two Pointers",
            "Stack",
            "Greedy",
            "Sorting",
            "Monotonic Stack"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "single-number-ii",
          "name": "Single Number II",
          "link": "https://leetcode.com/problems/single-number-ii",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Array", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "zigzag-conversion",
          "name": "ZigZag Conversion",
          "link": "https://leetcode.com/problems/zigzag-conversion",
          "otherCompanies": [
            ["Adobe", 4],
            ["Paypal", 2]
          ],
          "occurence": 5,
          "tags": ["String"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-if-path-exists-in-graph",
          "name": "Find if Path Exists in Graph",
          "link": "https://leetcode.com/problems/find-if-path-exists-in-graph",
          "otherCompanies": [["Google", 3]],
          "occurence": 4,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-difference-between-node-and-ancestor",
          "name": "Maximum Difference Between Node and Ancestor",
          "link": "https://leetcode.com/problems/maximum-difference-between-node-and-ancestor",
          "otherCompanies": [
            ["Google", 2],
            ["Facebook", 2]
          ],
          "occurence": 4,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "partition-labels",
          "name": "Partition Labels",
          "link": "https://leetcode.com/problems/partition-labels",
          "otherCompanies": [["Google", 2]],
          "occurence": 4,
          "tags": ["Hash Table", "Two Pointers", "String", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "solve-the-equation",
          "name": "Solve the Equation",
          "link": "https://leetcode.com/problems/solve-the-equation",
          "otherCompanies": [["Google", 3]],
          "occurence": 4,
          "tags": ["Math", "String", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "is-subsequence",
          "name": "Is Subsequence",
          "link": "https://leetcode.com/problems/is-subsequence",
          "otherCompanies": [
            ["Google", 3],
            ["Yandex", 3],
            ["Adobe", 2]
          ],
          "occurence": 4,
          "tags": ["Two Pointers", "String", "Dynamic Programming"],
          "difficulty": "Easy"
        },
        {
          "slug": "combination-sum-iv",
          "name": "Combination Sum IV",
          "link": "https://leetcode.com/problems/combination-sum-iv",
          "otherCompanies": [
            ["Google", 3],
            ["Facebook", 2],
            ["Microsoft", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "meeting-rooms",
          "name": "Meeting Rooms",
          "link": "https://leetcode.com/problems/meeting-rooms",
          "otherCompanies": [["Google", 2]],
          "occurence": 4,
          "tags": ["Array", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "best-time-to-buy-and-sell-stock-iv",
          "name": "Best Time to Buy and Sell Stock IV",
          "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv",
          "otherCompanies": [
            ["Apple", 3],
            ["Nvidia", 3],
            ["Google", 2],
            ["Citadel", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "distinct-subsequences",
          "name": "Distinct Subsequences",
          "link": "https://leetcode.com/problems/distinct-subsequences",
          "otherCompanies": [
            ["Mathworks", 3],
            ["Google", 2]
          ],
          "occurence": 4,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "first-unique-number",
          "name": "First Unique Number",
          "link": "https://leetcode.com/problems/first-unique-number",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 4,
          "tags": ["Array", "Hash Table", "Design", "Queue", "Data Stream"],
          "difficulty": "Medium"
        },
        {
          "slug": "construct-binary-search-tree-from-preorder-traversal",
          "name": "Construct Binary Search Tree from Preorder Traversal",
          "link": "https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal",
          "otherCompanies": [
            ["Microsoft", 3],
            ["Facebook", 2],
            ["Bloomberg", 2]
          ],
          "occurence": 4,
          "tags": [
            "Array",
            "Stack",
            "Tree",
            "Binary Search Tree",
            "Monotonic Stack",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-linked-list-elements",
          "name": "Remove Linked List Elements",
          "link": "https://leetcode.com/problems/remove-linked-list-elements",
          "otherCompanies": [
            ["Microsoft", 3],
            ["Facebook", 2],
            ["Adobe", 2]
          ],
          "occurence": 4,
          "tags": ["Linked List", "Recursion"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-smooth-descent-periods-of-a-stock",
          "name": "Number of Smooth Descent Periods of a Stock",
          "link": "https://leetcode.com/problems/number-of-smooth-descent-periods-of-a-stock",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "shortest-subarray-to-be-removed-to-make-array-sorted",
          "name": "Shortest Subarray to be Removed to Make Array Sorted",
          "link": "https://leetcode.com/problems/shortest-subarray-to-be-removed-to-make-array-sorted",
          "otherCompanies": [["Flipkart", 2]],
          "occurence": 4,
          "tags": [
            "Array",
            "Two Pointers",
            "Binary Search",
            "Stack",
            "Monotonic Stack"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-k-length-substrings-with-no-repeated-characters",
          "name": "Find K-Length Substrings With No Repeated Characters",
          "link": "https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "partition-array-for-maximum-sum",
          "name": "Partition Array for Maximum Sum",
          "link": "https://leetcode.com/problems/partition-array-for-maximum-sum",
          "otherCompanies": [["Adobe", 3]],
          "occurence": 4,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-common-characters",
          "name": "Find Common Characters",
          "link": "https://leetcode.com/problems/find-common-characters",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "validate-stack-sequences",
          "name": "Validate Stack Sequences",
          "link": "https://leetcode.com/problems/validate-stack-sequences",
          "otherCompanies": [
            ["Microsoft", 2],
            ["ByteDance", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "Stack", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "fruit-into-baskets",
          "name": "Fruit Into Baskets",
          "link": "https://leetcode.com/problems/fruit-into-baskets",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "Hash Table", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "2-keys-keyboard",
          "name": "2 Keys Keyboard",
          "link": "https://leetcode.com/problems/2-keys-keyboard",
          "otherCompanies": [["Microsoft", 3]],
          "occurence": 4,
          "tags": ["Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "132-pattern",
          "name": "132 Pattern",
          "link": "https://leetcode.com/problems/132-pattern",
          "otherCompanies": [],
          "occurence": 4,
          "tags": [
            "Array",
            "Binary Search",
            "Stack",
            "Monotonic Stack",
            "Ordered Set"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "word-pattern",
          "name": "Word Pattern",
          "link": "https://leetcode.com/problems/word-pattern",
          "otherCompanies": [
            ["Bolt", 3],
            ["Uber", 2],
            ["Adobe", 2]
          ],
          "occurence": 4,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "majority-element-ii",
          "name": "Majority Element II",
          "link": "https://leetcode.com/problems/majority-element-ii",
          "otherCompanies": [
            ["Microsoft", 3],
            ["Adobe", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "Hash Table", "Sorting", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "factorial-trailing-zeroes",
          "name": "Factorial Trailing Zeroes",
          "link": "https://leetcode.com/problems/factorial-trailing-zeroes",
          "otherCompanies": [["Oracle", 2]],
          "occurence": 4,
          "tags": ["Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-substring-with-at-most-two-distinct-characters",
          "name": "Longest Substring with At Most Two Distinct Characters",
          "link": "https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 4,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "triangle",
          "name": "Triangle",
          "link": "https://leetcode.com/problems/triangle",
          "otherCompanies": [["Microsoft", 3]],
          "occurence": 4,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "unique-binary-search-trees",
          "name": "Unique Binary Search Trees",
          "link": "https://leetcode.com/problems/unique-binary-search-trees",
          "otherCompanies": [],
          "occurence": 4,
          "tags": [
            "Math",
            "Dynamic Programming",
            "Tree",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "permutations-ii",
          "name": "Permutations II",
          "link": "https://leetcode.com/problems/permutations-ii",
          "otherCompanies": [["Microsoft", 3]],
          "occurence": 4,
          "tags": ["Array", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "jewels-and-stones",
          "name": "Jewels and Stones",
          "link": "https://leetcode.com/problems/jewels-and-stones",
          "otherCompanies": [
            ["Google", 2],
            ["Adobe", 2]
          ],
          "occurence": 3,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "counting-bits",
          "name": "Counting Bits",
          "link": "https://leetcode.com/problems/counting-bits",
          "otherCompanies": [
            ["Google", 2],
            ["Bloomberg", 2],
            ["JPMorgan", 2]
          ],
          "occurence": 3,
          "tags": ["Dynamic Programming", "Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "self-crossing",
          "name": "Self Crossing",
          "link": "https://leetcode.com/problems/self-crossing",
          "otherCompanies": [["Google", 2]],
          "occurence": 3,
          "tags": ["Array", "Math", "Geometry"],
          "difficulty": "Hard"
        },
        {
          "slug": "cousins-in-binary-tree",
          "name": "Cousins in Binary Tree",
          "link": "https://leetcode.com/problems/cousins-in-binary-tree",
          "otherCompanies": [
            ["Facebook", 2],
            ["Microsoft", 2]
          ],
          "occurence": 3,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "unique-paths-iii",
          "name": "Unique Paths III",
          "link": "https://leetcode.com/problems/unique-paths-iii",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 3,
          "tags": ["Array", "Backtracking", "Bit Manipulation", "Matrix"],
          "difficulty": "Hard"
        },
        {
          "slug": "best-time-to-buy-and-sell-stock-with-transaction-fee",
          "name": "Best Time to Buy and Sell Stock with Transaction Fee",
          "link": "https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 3,
          "tags": ["Array", "Dynamic Programming", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "convert-sorted-array-to-binary-search-tree",
          "name": "Convert Sorted Array to Binary Search Tree",
          "link": "https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree",
          "otherCompanies": [
            ["Facebook", 2],
            ["Apple", 2],
            ["Oracle", 2],
            ["Microsoft", 2]
          ],
          "occurence": 3,
          "tags": [
            "Array",
            "Divide and Conquer",
            "Tree",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "design-front-middle-back-queue",
          "name": "Design Front Middle Back Queue",
          "link": "https://leetcode.com/problems/design-front-middle-back-queue",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Linked List", "Design", "Queue", "Data Stream"],
          "difficulty": "Medium"
        },
        {
          "slug": "kids-with-the-greatest-number-of-candies",
          "name": "Kids With the Greatest Number of Candies",
          "link": "https://leetcode.com/problems/kids-with-the-greatest-number-of-candies",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "string-matching-in-an-array",
          "name": "String Matching in an Array",
          "link": "https://leetcode.com/problems/string-matching-in-an-array",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 3,
          "tags": ["Array", "String", "String Matching"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-sum-bst-in-binary-tree",
          "name": "Maximum Sum BST in Binary Tree",
          "link": "https://leetcode.com/problems/maximum-sum-bst-in-binary-tree",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Dynamic Programming",
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "maximum-number-of-events-that-can-be-attended",
          "name": "Maximum Number of Events That Can Be Attended",
          "link": "https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended",
          "otherCompanies": [
            ["Salesforce", 2],
            ["JPMorgan", 2]
          ],
          "occurence": 3,
          "tags": ["Array", "Greedy", "Sorting", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        },
        {
          "slug": "sequential-digits",
          "name": "Sequential Digits",
          "link": "https://leetcode.com/problems/sequential-digits",
          "otherCompanies": [["Apple", 2]],
          "occurence": 3,
          "tags": ["Enumeration"],
          "difficulty": "Medium"
        },
        {
          "slug": "two-sum-bsts",
          "name": "Two Sum BSTs",
          "link": "https://leetcode.com/problems/two-sum-bsts",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Two Pointers",
            "Binary Search",
            "Stack",
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "n-th-tribonacci-number",
          "name": "N-th Tribonacci Number",
          "link": "https://leetcode.com/problems/n-th-tribonacci-number",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Math", "Dynamic Programming", "Memoization"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-vowels-from-a-string",
          "name": "Remove Vowels from a String",
          "link": "https://leetcode.com/problems/remove-vowels-from-a-string",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "sort-an-array",
          "name": "Sort an Array",
          "link": "https://leetcode.com/problems/sort-an-array",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 3,
          "tags": [
            "Array",
            "Divide and Conquer",
            "Sorting",
            "Heap (Priority Queue)",
            "Merge Sort",
            "Bucket Sort",
            "Radix Sort",
            "Counting Sort"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "design-hashset",
          "name": "Design HashSet",
          "link": "https://leetcode.com/problems/design-hashset",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 3,
          "tags": [
            "Array",
            "Hash Table",
            "Linked List",
            "Design",
            "Hash Function"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "knight-probability-in-chessboard",
          "name": "Knight Probability in Chessboard",
          "link": "https://leetcode.com/problems/knight-probability-in-chessboard",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "cut-off-trees-for-golf-event",
          "name": "Cut Off Trees for Golf Event",
          "link": "https://leetcode.com/problems/cut-off-trees-for-golf-event",
          "otherCompanies": [["Apple", 2]],
          "occurence": 3,
          "tags": [
            "Array",
            "Breadth-First Search",
            "Heap (Priority Queue)",
            "Matrix"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "out-of-boundary-paths",
          "name": "Out of Boundary Paths",
          "link": "https://leetcode.com/problems/out-of-boundary-paths",
          "otherCompanies": [["Baidu", 1]],
          "occurence": 3,
          "tags": ["Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "reverse-pairs",
          "name": "Reverse Pairs",
          "link": "https://leetcode.com/problems/reverse-pairs",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Array",
            "Binary Search",
            "Divide and Conquer",
            "Binary Indexed Tree",
            "Segment Tree",
            "Merge Sort",
            "Ordered Set"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "count-the-repetitions",
          "name": "Count The Repetitions",
          "link": "https://leetcode.com/problems/count-the-repetitions",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "serialize-and-deserialize-bst",
          "name": "Serialize and Deserialize BST",
          "link": "https://leetcode.com/problems/serialize-and-deserialize-bst",
          "otherCompanies": [
            ["LinkedIn", 2],
            ["Microsoft", 2]
          ],
          "occurence": 3,
          "tags": [
            "String",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Design",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-substring-with-at-least-k-repeating-characters",
          "name": "Longest Substring with At Least K Repeating Characters",
          "link": "https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 3,
          "tags": [
            "Hash Table",
            "String",
            "Divide and Conquer",
            "Sliding Window"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "implement-stack-using-queues",
          "name": "Implement Stack using Queues",
          "link": "https://leetcode.com/problems/implement-stack-using-queues",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Stack", "Design", "Queue"],
          "difficulty": "Easy"
        },
        {
          "slug": "length-of-last-word",
          "name": "Length of Last Word",
          "link": "https://leetcode.com/problems/length-of-last-word",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 3,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximize-sum-of-array-after-k-negations",
          "name": "Maximize Sum Of Array After K Negations",
          "link": "https://leetcode.com/problems/maximize-sum-of-array-after-k-negations",
          "otherCompanies": [["Druva", 1]],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-swaps-to-group-all-1s-together-ii",
          "name": "Minimum Swaps to Group All 1's Together II",
          "link": "https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "check-if-a-parentheses-string-can-be-valid",
          "name": "Check if a Parentheses String Can Be Valid",
          "link": "https://leetcode.com/problems/check-if-a-parentheses-string-can-be-valid",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Stack", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "two-furthest-houses-with-different-colors",
          "name": "Two Furthest Houses With Different Colors",
          "link": "https://leetcode.com/problems/two-furthest-houses-with-different-colors",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-valid-words-in-a-sentence",
          "name": "Number of Valid Words in a Sentence",
          "link": "https://leetcode.com/problems/number-of-valid-words-in-a-sentence",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximize-the-confusion-of-an-exam",
          "name": "Maximize the Confusion of an Exam",
          "link": "https://leetcode.com/problems/maximize-the-confusion-of-an-exam",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Binary Search", "Sliding Window", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-unique-binary-string",
          "name": "Find Unique Binary String",
          "link": "https://leetcode.com/problems/find-unique-binary-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "String", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "array-with-elements-not-equal-to-average-of-neighbors",
          "name": "Array With Elements Not Equal to Average of Neighbors",
          "link": "https://leetcode.com/problems/array-with-elements-not-equal-to-average-of-neighbors",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "nearest-exit-from-entrance-in-maze",
          "name": "Nearest Exit from Entrance in Maze",
          "link": "https://leetcode.com/problems/nearest-exit-from-entrance-in-maze",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Breadth-First Search", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-square-sum-triples",
          "name": "Count Square Sum Triples",
          "link": "https://leetcode.com/problems/count-square-sum-triples",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Enumeration"],
          "difficulty": "Easy"
        },
        {
          "slug": "longer-contiguous-segments-of-ones-than-zeros",
          "name": "Longer Contiguous Segments of Ones than Zeros",
          "link": "https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-average-pass-ratio",
          "name": "Maximum Average Pass Ratio",
          "link": "https://leetcode.com/problems/maximum-average-pass-ratio",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        },
        {
          "slug": "sort-features-by-popularity",
          "name": "Sort Features by Popularity",
          "link": "https://leetcode.com/problems/sort-features-by-popularity",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-number-of-operations-to-move-all-balls-to-each-box",
          "name": "Minimum Number of Operations to Move All Balls to Each Box",
          "link": "https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "check-if-array-is-sorted-and-rotated",
          "name": "Check if Array Is Sorted and Rotated",
          "link": "https://leetcode.com/problems/check-if-array-is-sorted-and-rotated",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "max-number-of-k-sum-pairs",
          "name": "Max Number of K-Sum Pairs",
          "link": "https://leetcode.com/problems/max-number-of-k-sum-pairs",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Two Pointers", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimize-deviation-in-array",
          "name": "Minimize Deviation in Array",
          "link": "https://leetcode.com/problems/minimize-deviation-in-array",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Heap (Priority Queue)", "Ordered Set"],
          "difficulty": "Hard"
        },
        {
          "slug": "number-of-good-ways-to-split-a-string",
          "name": "Number of Good Ways to Split a String",
          "link": "https://leetcode.com/problems/number-of-good-ways-to-split-a-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Dynamic Programming", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "average-salary-excluding-the-minimum-and-maximum-salary",
          "name": "Average Salary Excluding the Minimum and Maximum Salary",
          "link": "https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary",
          "otherCompanies": [["Netsuite", 1]],
          "occurence": 2,
          "tags": ["Array", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "final-prices-with-a-special-discount-in-a-shop",
          "name": "Final Prices With a Special Discount in a Shop",
          "link": "https://leetcode.com/problems/final-prices-with-a-special-discount-in-a-shop",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Stack", "Monotonic Stack"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence",
          "name": "Check If a Word Occurs As a Prefix of Any Word in a Sentence",
          "link": "https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "String Matching"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-subsequence-in-non-increasing-order",
          "name": "Minimum Subsequence in Non-Increasing Order",
          "link": "https://leetcode.com/problems/minimum-subsequence-in-non-increasing-order",
          "otherCompanies": [["Mercari", 1]],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "longest-happy-prefix",
          "name": "Longest Happy Prefix",
          "link": "https://leetcode.com/problems/longest-happy-prefix",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "String",
            "Rolling Hash",
            "String Matching",
            "Hash Function"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree",
          "name": "Find a Corresponding Node of a Binary Tree in a Clone of That Tree",
          "link": "https://leetcode.com/problems/find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "reduce-array-size-to-the-half",
          "name": "Reduce Array Size to The Half",
          "link": "https://leetcode.com/problems/reduce-array-size-to-the-half",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Hash Table",
            "Greedy",
            "Sorting",
            "Heap (Priority Queue)"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "delete-leaves-with-a-given-value",
          "name": "Delete Leaves With a Given Value",
          "link": "https://leetcode.com/problems/delete-leaves-with-a-given-value",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "sum-of-nodes-with-even-valued-grandparent",
          "name": "Sum of Nodes with Even-Valued Grandparent",
          "link": "https://leetcode.com/problems/sum-of-nodes-with-even-valued-grandparent",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "matrix-block-sum",
          "name": "Matrix Block Sum",
          "link": "https://leetcode.com/problems/matrix-block-sum",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-number-of-occurrences-of-a-substring",
          "name": "Maximum Number of Occurrences of a Substring",
          "link": "https://leetcode.com/problems/maximum-number-of-occurrences-of-a-substring",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-numbers-with-even-number-of-digits",
          "name": "Find Numbers with Even Number of Digits",
          "link": "https://leetcode.com/problems/find-numbers-with-even-number-of-digits",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "prime-arrangements",
          "name": "Prime Arrangements",
          "link": "https://leetcode.com/problems/prime-arrangements",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-zero-sum-consecutive-nodes-from-linked-list",
          "name": "Remove Zero Sum Consecutive Nodes from Linked List",
          "link": "https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "alphabet-board-path",
          "name": "Alphabet Board Path",
          "link": "https://leetcode.com/problems/alphabet-board-path",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "parallel-courses",
          "name": "Parallel Courses",
          "link": "https://leetcode.com/problems/parallel-courses",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Graph", "Topological Sort"],
          "difficulty": "Medium"
        },
        {
          "slug": "campus-bikes",
          "name": "Campus Bikes",
          "link": "https://leetcode.com/problems/campus-bikes",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "powerful-integers",
          "name": "Powerful Integers",
          "link": "https://leetcode.com/problems/powerful-integers",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-mountain-array",
          "name": "Valid Mountain Array",
          "link": "https://leetcode.com/problems/valid-mountain-array",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "reverse-only-letters",
          "name": "Reverse Only Letters",
          "link": "https://leetcode.com/problems/reverse-only-letters",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "surface-area-of-3d-shapes",
          "name": "Surface Area of 3D Shapes",
          "link": "https://leetcode.com/problems/surface-area-of-3d-shapes",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math", "Geometry", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "decoded-string-at-index",
          "name": "Decoded String at Index",
          "link": "https://leetcode.com/problems/decoded-string-at-index",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "stone-game",
          "name": "Stone Game",
          "link": "https://leetcode.com/problems/stone-game",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math", "Dynamic Programming", "Game Theory"],
          "difficulty": "Medium"
        },
        {
          "slug": "score-after-flipping-matrix",
          "name": "Score After Flipping Matrix",
          "link": "https://leetcode.com/problems/score-after-flipping-matrix",
          "otherCompanies": [["IIT Bombay", 1]],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Bit Manipulation", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-trees-with-factors",
          "name": "Binary Trees With Factors",
          "link": "https://leetcode.com/problems/binary-trees-with-factors",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "most-common-word",
          "name": "Most Common Word",
          "link": "https://leetcode.com/problems/most-common-word",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "sentence-similarity-ii",
          "name": "Sentence Similarity II",
          "link": "https://leetcode.com/problems/sentence-similarity-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Hash Table",
            "String",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "to-lower-case",
          "name": "To Lower Case",
          "link": "https://leetcode.com/problems/to-lower-case",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "search-in-a-binary-search-tree",
          "name": "Search in a Binary Search Tree",
          "link": "https://leetcode.com/problems/search-in-a-binary-search-tree",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Tree", "Binary Search Tree", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "redundant-connection-ii",
          "name": "Redundant Connection II",
          "link": "https://leetcode.com/problems/redundant-connection-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "equal-tree-partition",
          "name": "Equal Tree Partition",
          "link": "https://leetcode.com/problems/equal-tree-partition",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-binary-tree",
          "name": "Maximum Binary Tree",
          "link": "https://leetcode.com/problems/maximum-binary-tree",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Divide and Conquer",
            "Stack",
            "Tree",
            "Monotonic Stack",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-derangement-of-an-array",
          "name": "Find the Derangement of An Array",
          "link": "https://leetcode.com/problems/find-the-derangement-of-an-array",
          "otherCompanies": [["IXL", 1]],
          "occurence": 2,
          "tags": ["Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "range-addition-ii",
          "name": "Range Addition II",
          "link": "https://leetcode.com/problems/range-addition-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "n-ary-tree-postorder-traversal",
          "name": "N-ary Tree Postorder Traversal",
          "link": "https://leetcode.com/problems/n-ary-tree-postorder-traversal",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Stack", "Tree", "Depth-First Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "delete-operation-for-two-strings",
          "name": "Delete Operation for Two Strings",
          "link": "https://leetcode.com/problems/delete-operation-for-two-strings",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-palindrome",
          "name": "Longest Palindrome",
          "link": "https://leetcode.com/problems/longest-palindrome",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "patching-array",
          "name": "Patching Array",
          "link": "https://leetcode.com/problems/patching-array",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy"],
          "difficulty": "Hard"
        },
        {
          "slug": "power-of-three",
          "name": "Power of Three",
          "link": "https://leetcode.com/problems/power-of-three",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Recursion"],
          "difficulty": "Easy"
        },
        {
          "slug": "wiggle-sort",
          "name": "Wiggle Sort",
          "link": "https://leetcode.com/problems/wiggle-sort",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "rectangle-area",
          "name": "Rectangle Area",
          "link": "https://leetcode.com/problems/rectangle-area",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Geometry"],
          "difficulty": "Medium"
        },
        {
          "slug": "palindrome-partitioning-ii",
          "name": "Palindrome Partitioning II",
          "link": "https://leetcode.com/problems/palindrome-partitioning-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "binary-tree-level-order-traversal-ii",
          "name": "Binary Tree Level Order Traversal II",
          "link": "https://leetcode.com/problems/binary-tree-level-order-traversal-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Tree", "Breadth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "gray-code",
          "name": "Gray Code",
          "link": "https://leetcode.com/problems/gray-code",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Backtracking", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-average-difference",
          "name": "Minimum Average Difference",
          "link": "https://leetcode.com/problems/minimum-average-difference",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-rounds-to-complete-all-tasks",
          "name": "Minimum Rounds to Complete All Tasks",
          "link": "https://leetcode.com/problems/minimum-rounds-to-complete-all-tasks",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Greedy", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "partition-array-according-to-given-pivot",
          "name": "Partition Array According to Given Pivot",
          "link": "https://leetcode.com/problems/partition-array-according-to-given-pivot",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Two Pointers", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-sum-of-four-digit-number-after-splitting-digits",
          "name": "Minimum Sum of Four Digit Number After Splitting Digits",
          "link": "https://leetcode.com/problems/minimum-sum-of-four-digit-number-after-splitting-digits",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Greedy", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "rearrange-array-elements-by-sign",
          "name": "Rearrange Array Elements by Sign",
          "link": "https://leetcode.com/problems/rearrange-array-elements-by-sign",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Two Pointers", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "adding-spaces-to-a-string",
          "name": "Adding Spaces to a String",
          "link": "https://leetcode.com/problems/adding-spaces-to-a-string",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "decode-the-slanted-ciphertext",
          "name": "Decode the Slanted Ciphertext",
          "link": "https://leetcode.com/problems/decode-the-slanted-ciphertext",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "kth-distinct-string-in-an-array",
          "name": "Kth Distinct String in an Array",
          "link": "https://leetcode.com/problems/kth-distinct-string-in-an-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "String", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-beauty-in-the-array",
          "name": "Sum of Beauty in the Array",
          "link": "https://leetcode.com/problems/sum-of-beauty-in-the-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-number-of-pairs-with-absolute-difference-k",
          "name": "Count Number of Pairs With Absolute Difference K",
          "link": "https://leetcode.com/problems/count-number-of-pairs-with-absolute-difference-k",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimize-the-difference-between-target-and-chosen-elements",
          "name": "Minimize the Difference Between Target and Chosen Elements",
          "link": "https://leetcode.com/problems/minimize-the-difference-between-target-and-chosen-elements",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "form-array-by-concatenating-subarrays-of-another-array",
          "name": "Form Array by Concatenating Subarrays of Another Array",
          "link": "https://leetcode.com/problems/form-array-by-concatenating-subarrays-of-another-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy", "String Matching"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-numbers-of-function-calls-to-make-target-array",
          "name": "Minimum Numbers of Function Calls to Make Target Array",
          "link": "https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "can-make-arithmetic-progression-from-sequence",
          "name": "Can Make Arithmetic Progression From Sequence",
          "link": "https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-number-of-vowels-in-a-substring-of-given-length",
          "name": "Maximum Number of Vowels in a Substring of Given Length",
          "link": "https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "queries-on-a-permutation-with-key",
          "name": "Queries on a Permutation With Key",
          "link": "https://leetcode.com/problems/queries-on-a-permutation-with-key",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Binary Indexed Tree", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "closest-divisors",
          "name": "Closest Divisors",
          "link": "https://leetcode.com/problems/closest-divisors",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "the-k-weakest-rows-in-a-matrix",
          "name": "The K Weakest Rows in a Matrix",
          "link": "https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Array",
            "Binary Search",
            "Sorting",
            "Heap (Priority Queue)",
            "Matrix"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "diet-plan-performance",
          "name": "Diet Plan Performance",
          "link": "https://leetcode.com/problems/diet-plan-performance",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Sliding Window"],
          "difficulty": "Easy"
        },
        {
          "slug": "armstrong-number",
          "name": "Armstrong Number",
          "link": "https://leetcode.com/problems/armstrong-number",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "largest-unique-number",
          "name": "Largest Unique Number",
          "link": "https://leetcode.com/problems/largest-unique-number",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-days-in-a-month",
          "name": "Number of Days in a Month",
          "link": "https://leetcode.com/problems/number-of-days-in-a-month",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-digits-in-the-minimum-number",
          "name": "Sum of Digits in the Minimum Number",
          "link": "https://leetcode.com/problems/sum-of-digits-in-the-minimum-number",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "index-pairs-of-a-string",
          "name": "Index Pairs of a String",
          "link": "https://leetcode.com/problems/index-pairs-of-a-string",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String", "Trie", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "prime-number-of-set-bits-in-binary-representation",
          "name": "Prime Number of Set Bits in Binary Representation",
          "link": "https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "optimal-division",
          "name": "Optimal Division",
          "link": "https://leetcode.com/problems/optimal-division",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "complex-number-multiplication",
          "name": "Complex Number Multiplication",
          "link": "https://leetcode.com/problems/complex-number-multiplication",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "String", "Simulation"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Google",
      "problems": [
        {
          "slug": "find-leaves-of-binary-tree",
          "name": "Find Leaves of Binary Tree",
          "link": "https://leetcode.com/problems/find-leaves-of-binary-tree",
          "otherCompanies": [
            ["LinkedIn", 13],
            ["Microsoft", 4],
            ["Facebook", 2],
            ["Amazon", 2]
          ],
          "occurence": 75,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "evaluate-reverse-polish-notation",
          "name": "Evaluate Reverse Polish Notation",
          "link": "https://leetcode.com/problems/evaluate-reverse-polish-notation",
          "otherCompanies": [
            ["LinkedIn", 8],
            ["Amazon", 6],
            ["Yandex", 2],
            ["Facebook", 2],
            ["Oracle", 2],
            ["Microsoft", 2]
          ],
          "occurence": 73,
          "tags": ["Array", "Math", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "snapshot-array",
          "name": "Snapshot Array",
          "link": "https://leetcode.com/problems/snapshot-array",
          "otherCompanies": [
            ["Rubrik", 5],
            ["Microsoft", 2]
          ],
          "occurence": 36,
          "tags": ["Array", "Hash Table", "Binary Search", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "stock-price-fluctuation",
          "name": "Stock Price Fluctuation",
          "link": "https://leetcode.com/problems/stock-price-fluctuation",
          "otherCompanies": [],
          "occurence": 30,
          "tags": [
            "Hash Table",
            "Design",
            "Heap (Priority Queue)",
            "Data Stream",
            "Ordered Set"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-time-difference",
          "name": "Minimum Time Difference",
          "link": "https://leetcode.com/problems/minimum-time-difference",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 30,
          "tags": ["Array", "Math", "String", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "text-justification",
          "name": "Text Justification",
          "link": "https://leetcode.com/problems/text-justification",
          "otherCompanies": [
            ["LinkedIn", 18],
            ["Karat", 10],
            ["Uber", 6],
            ["Facebook", 4],
            ["Square", 3],
            ["Twilio", 3],
            ["Apple", 3],
            ["Reddit", 3],
            ["Indeed", 3]
          ],
          "occurence": 24,
          "tags": ["Array", "String", "Simulation"],
          "difficulty": "Hard"
        },
        {
          "slug": "logger-rate-limiter",
          "name": "Logger Rate Limiter",
          "link": "https://leetcode.com/problems/logger-rate-limiter",
          "otherCompanies": [
            ["Atlassian", 10],
            ["Microsoft", 5],
            ["Amazon", 3],
            ["Netflix", 3],
            ["Apple", 2]
          ],
          "occurence": 22,
          "tags": ["Hash Table", "Design"],
          "difficulty": "Easy"
        },
        {
          "slug": "happy-number",
          "name": "Happy Number",
          "link": "https://leetcode.com/problems/happy-number",
          "otherCompanies": [
            ["Apple", 7],
            ["Amazon", 6],
            ["Paypal", 4],
            ["Adobe", 4],
            ["Uber", 3]
          ],
          "occurence": 22,
          "tags": ["Hash Table", "Math", "Two Pointers"],
          "difficulty": "Easy"
        },
        {
          "slug": "first-bad-version",
          "name": "First Bad Version",
          "link": "https://leetcode.com/problems/first-bad-version",
          "otherCompanies": [
            ["Amazon", 12],
            ["Facebook", 7],
            ["Microsoft", 6],
            ["Apple", 5],
            ["Adobe", 4],
            ["Cisco", 2]
          ],
          "occurence": 19,
          "tags": ["Binary Search", "Interactive"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-points-you-can-obtain-from-cards",
          "name": "Maximum Points You Can Obtain from Cards",
          "link": "https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards",
          "otherCompanies": [
            ["Amazon", 3],
            ["Adobe", 2]
          ],
          "occurence": 17,
          "tags": ["Array", "Sliding Window", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-matching-subsequences",
          "name": "Number of Matching Subsequences",
          "link": "https://leetcode.com/problems/number-of-matching-subsequences",
          "otherCompanies": [["Roblox", 2]],
          "occurence": 15,
          "tags": ["Hash Table", "String", "Trie", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "unique-paths",
          "name": "Unique Paths",
          "link": "https://leetcode.com/problems/unique-paths",
          "otherCompanies": [
            ["Facebook", 11],
            ["Microsoft", 9],
            ["Amazon", 8],
            ["Apple", 7],
            ["Bloomberg", 4],
            ["Adobe", 4]
          ],
          "occurence": 15,
          "tags": ["Math", "Dynamic Programming", "Combinatorics"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-original-array-from-doubled-array",
          "name": "Find Original Array From Doubled Array",
          "link": "https://leetcode.com/problems/find-original-array-from-doubled-array",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 14,
          "tags": ["Array", "Hash Table", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "student-attendance-record-ii",
          "name": "Student Attendance Record II",
          "link": "https://leetcode.com/problems/student-attendance-record-ii",
          "otherCompanies": [],
          "occurence": 14,
          "tags": ["Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "find-duplicate-subtrees",
          "name": "Find Duplicate Subtrees",
          "link": "https://leetcode.com/problems/find-duplicate-subtrees",
          "otherCompanies": [
            ["Amazon", 7],
            ["Bloomberg", 2]
          ],
          "occurence": 13,
          "tags": ["Hash Table", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "bulls-and-cows",
          "name": "Bulls and Cows",
          "link": "https://leetcode.com/problems/bulls-and-cows",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 12,
          "tags": ["Hash Table", "String", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "basic-calculator",
          "name": "Basic Calculator",
          "link": "https://leetcode.com/problems/basic-calculator",
          "otherCompanies": [
            ["Facebook", 10],
            ["Amazon", 7],
            ["DoorDash", 6],
            ["Uber", 5],
            ["Microsoft", 5],
            ["ByteDance", 3],
            ["Snapchat", 2],
            ["Adobe", 2]
          ],
          "occurence": 12,
          "tags": ["Math", "String", "Stack", "Recursion"],
          "difficulty": "Hard"
        },
        {
          "slug": "time-needed-to-inform-all-employees",
          "name": "Time Needed to Inform All Employees",
          "link": "https://leetcode.com/problems/time-needed-to-inform-all-employees",
          "otherCompanies": [["Amazon", 6]],
          "occurence": 11,
          "tags": ["Tree", "Depth-First Search", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "insert-interval",
          "name": "Insert Intervals",
          "link": "https://leetcode.com/problems/insert-interval",
          "otherCompanies": [
            ["LinkedIn", 9],
            ["Facebook", 5],
            ["Amazon", 5],
            ["Robinhood", 3]
          ],
          "occurence": 11,
          "tags": ["Array"],
          "difficulty": "Medium"
        },
        {
          "slug": "palindrome-number",
          "name": "Palindrome Number",
          "link": "https://leetcode.com/problems/palindrome-number",
          "otherCompanies": [
            ["Facebook", 8],
            ["Amazon", 7],
            ["Bloomberg", 6],
            ["Adobe", 5],
            ["Apple", 3],
            ["Yahoo", 2],
            ["Uber", 2],
            ["Accenture", 2]
          ],
          "occurence": 11,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "battleships-in-a-board",
          "name": "Battleships in a Board",
          "link": "https://leetcode.com/problems/battleships-in-a-board",
          "otherCompanies": [
            ["Twitch", 7],
            ["Facebook", 4],
            ["Microsoft", 4],
            ["GoDaddy", 2],
            ["Amazon", 2],
            ["Apple", 2]
          ],
          "occurence": 10,
          "tags": ["Array", "Depth-First Search", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "pacific-atlantic-water-flow",
          "name": "Pacific Atlantic Water Flow",
          "link": "https://leetcode.com/problems/pacific-atlantic-water-flow",
          "otherCompanies": [
            ["Uber", 3],
            ["Amazon", 2],
            ["Salesforce", 2]
          ],
          "occurence": 10,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Matrix"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "design-search-autocomplete-system",
          "name": "Design Search Autocomplete System",
          "link": "https://leetcode.com/problems/design-search-autocomplete-system",
          "otherCompanies": [
            ["Amazon", 9],
            ["Microsoft", 4],
            ["Snapchat", 2],
            ["Twitter", 2],
            ["LinkedIn", 2]
          ],
          "occurence": 9,
          "tags": ["String", "Design", "Trie", "Data Stream"],
          "difficulty": "Hard"
        },
        {
          "slug": "h-index",
          "name": "H-Index",
          "link": "https://leetcode.com/problems/h-index",
          "otherCompanies": [
            ["Alation", 3],
            ["Facebook", 2],
            ["Amazon", 2],
            ["Apple", 2]
          ],
          "occurence": 9,
          "tags": ["Array", "Sorting", "Counting Sort"],
          "difficulty": "Medium"
        },
        {
          "slug": "house-robber-ii",
          "name": "House Robber II",
          "link": "https://leetcode.com/problems/house-robber-ii",
          "otherCompanies": [["Amazon", 4]],
          "occurence": 9,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-square-submatrices-with-all-ones",
          "name": "Count Square Submatrices with All Ones",
          "link": "https://leetcode.com/problems/count-square-submatrices-with-all-ones",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 8,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "network-delay-time",
          "name": "Network Delay Time",
          "link": "https://leetcode.com/problems/network-delay-time",
          "otherCompanies": [["Amazon", 3]],
          "occurence": 8,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Graph",
            "Heap (Priority Queue)",
            "Shortest Path"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "sentence-screen-fitting",
          "name": "Sentence Screen Fitting",
          "link": "https://leetcode.com/problems/sentence-screen-fitting",
          "otherCompanies": [],
          "occurence": 8,
          "tags": ["String", "Dynamic Programming", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "split-array-largest-sum",
          "name": "Split Array Largest Sum",
          "link": "https://leetcode.com/problems/split-array-largest-sum",
          "otherCompanies": [
            ["Amazon", 6],
            ["ByteDance", 6],
            ["Facebook", 5],
            ["Apple", 2],
            ["ByteDance", 2]
          ],
          "occurence": 8,
          "tags": ["Array", "Binary Search", "Dynamic Programming", "Greedy"],
          "difficulty": "Hard"
        },
        {
          "slug": "peeking-iterator",
          "name": "Peeking Iterator",
          "link": "https://leetcode.com/problems/peeking-iterator",
          "otherCompanies": [
            ["Amazon", 3],
            ["Apple", 3],
            ["Microsoft", 2]
          ],
          "occurence": 8,
          "tags": ["Array", "Design", "Iterator"],
          "difficulty": "Medium"
        },
        {
          "slug": "product-of-the-last-k-numbers",
          "name": "Product of the Last K Numbers",
          "link": "https://leetcode.com/problems/product-of-the-last-k-numbers",
          "otherCompanies": [
            ["Amazon", 3],
            ["Apple", 2],
            ["Cruise Automation", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Math", "Design", "Queue", "Data Stream"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-repeating-character-replacement",
          "name": "Longest Repeating Character Replacement",
          "link": "https://leetcode.com/problems/longest-repeating-character-replacement",
          "otherCompanies": [
            ["Amazon", 6],
            ["Uber", 4],
            ["Adobe", 3]
          ],
          "occurence": 7,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-absolute-file-path",
          "name": "Longest Absolute File Path",
          "link": "https://leetcode.com/problems/longest-absolute-file-path",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 7,
          "tags": ["String", "Stack", "Depth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "russian-doll-envelopes",
          "name": "Russian Doll Envelopes",
          "link": "https://leetcode.com/problems/russian-doll-envelopes",
          "otherCompanies": [["ByteDance", 2]],
          "occurence": 7,
          "tags": ["Array", "Binary Search", "Dynamic Programming", "Sorting"],
          "difficulty": "Hard"
        },
        {
          "slug": "burst-balloons",
          "name": "Burst Balloons",
          "link": "https://leetcode.com/problems/burst-balloons",
          "otherCompanies": [
            ["Microsoft", 6],
            ["Bloomberg", 4],
            ["Apple", 4],
            ["Uber", 3],
            ["Amazon", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "smallest-rectangle-enclosing-black-pixels",
          "name": "Smallest Rectangle Enclosing Black Pixels",
          "link": "https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels",
          "otherCompanies": [],
          "occurence": 7,
          "tags": [
            "Array",
            "Binary Search",
            "Depth-First Search",
            "Breadth-First Search",
            "Matrix"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "count-complete-tree-nodes",
          "name": "Count Complete Tree Nodes",
          "link": "https://leetcode.com/problems/count-complete-tree-nodes",
          "otherCompanies": [
            ["Amazon", 5],
            ["ByteDance", 4]
          ],
          "occurence": 7,
          "tags": [
            "Binary Search",
            "Tree",
            "Depth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "rings-and-rods",
          "name": "Rings and Rods",
          "link": "https://leetcode.com/problems/rings-and-rods",
          "otherCompanies": [],
          "occurence": 6,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "longest-word-in-dictionary",
          "name": "Longest Word in Dictionary",
          "link": "https://leetcode.com/problems/longest-word-in-dictionary",
          "otherCompanies": [],
          "occurence": 6,
          "tags": ["Array", "Hash Table", "String", "Trie", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "employee-importance",
          "name": "Employee Importance",
          "link": "https://leetcode.com/problems/employee-importance",
          "otherCompanies": [["Apple", 2]],
          "occurence": 6,
          "tags": ["Hash Table", "Depth-First Search", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "01-matrix",
          "name": "01 Matrix",
          "link": "https://leetcode.com/problems/01-matrix",
          "otherCompanies": [
            ["Amazon", 6],
            ["Facebook", 2],
            ["Adobe", 2]
          ],
          "occurence": 6,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Breadth-First Search",
            "Matrix"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-difference",
          "name": "Find the Difference",
          "link": "https://leetcode.com/problems/find-the-difference",
          "otherCompanies": [
            ["Amazon", 3],
            ["Apple", 2]
          ],
          "occurence": 6,
          "tags": ["Hash Table", "String", "Bit Manipulation", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "count-of-smaller-numbers-after-self",
          "name": "Count of Smaller Numbers After Self",
          "link": "https://leetcode.com/problems/count-of-smaller-numbers-after-self",
          "otherCompanies": [
            ["Microsoft", 5],
            ["Amazon", 3],
            ["Adobe", 2]
          ],
          "occurence": 6,
          "tags": [
            "Array",
            "Binary Search",
            "Divide and Conquer",
            "Binary Indexed Tree",
            "Segment Tree",
            "Merge Sort",
            "Ordered Set"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "range-sum-query-mutable",
          "name": "Range Sum Query - Mutable",
          "link": "https://leetcode.com/problems/range-sum-query-mutable",
          "otherCompanies": [["Amazon", 3]],
          "occurence": 6,
          "tags": ["Array", "Design", "Binary Indexed Tree", "Segment Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "path-with-maximum-probability",
          "name": "Path with Maximum Probability",
          "link": "https://leetcode.com/problems/path-with-maximum-probability",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Array", "Graph", "Heap (Priority Queue)", "Shortest Path"],
          "difficulty": "Medium"
        },
        {
          "slug": "jump-game-iv",
          "name": "Jump Game IV",
          "link": "https://leetcode.com/problems/jump-game-iv",
          "otherCompanies": [
            ["Amazon", 4],
            ["ByteDance", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Hash Table", "Breadth-First Search"],
          "difficulty": "Hard"
        },
        {
          "slug": "longest-line-of-consecutive-one-in-matrix",
          "name": "Longest Line of Consecutive One in Matrix",
          "link": "https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "student-attendance-record-i",
          "name": "Student Attendance Record I",
          "link": "https://leetcode.com/problems/student-attendance-record-i",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-boomerangs",
          "name": "Number of Boomerangs",
          "link": "https://leetcode.com/problems/number-of-boomerangs",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Array", "Hash Table", "Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "surrounded-regions",
          "name": "Surrounded Regions",
          "link": "https://leetcode.com/problems/surrounded-regions",
          "otherCompanies": [
            ["Bloomberg", 4],
            ["Uber", 2],
            ["ByteDance", 2]
          ],
          "occurence": 5,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Matrix"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-target-indices-after-sorting-array",
          "name": "Find Target Indices After Sorting Array",
          "link": "https://leetcode.com/problems/find-target-indices-after-sorting-array",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 4,
          "tags": ["Array", "Binary Search", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-word-can-be-placed-in-crossword",
          "name": "Check if Word Can Be Placed In Crossword",
          "link": "https://leetcode.com/problems/check-if-word-can-be-placed-in-crossword",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "Matrix", "Enumeration"],
          "difficulty": "Medium"
        },
        {
          "slug": "concatenation-of-array",
          "name": "Concatenation of Array",
          "link": "https://leetcode.com/problems/concatenation-of-array",
          "otherCompanies": [["Adobe", 2]],
          "occurence": 4,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "rearrange-spaces-between-words",
          "name": "Rearrange Spaces Between Words",
          "link": "https://leetcode.com/problems/rearrange-spaces-between-words",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-number-of-increments-on-subarrays-to-form-a-target-array",
          "name": "Minimum Number of Increments on Subarrays to Form a Target Array",
          "link": "https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array",
          "otherCompanies": [],
          "occurence": 4,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Stack",
            "Greedy",
            "Monotonic Stack"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "reformat-the-string",
          "name": "Reformat The String",
          "link": "https://leetcode.com/problems/reformat-the-string",
          "otherCompanies": [["Microsoft", 1]],
          "occurence": 4,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "divide-array-in-sets-of-k-consecutive-numbers",
          "name": "Divide Array in Sets of K Consecutive Numbers",
          "link": "https://leetcode.com/problems/divide-array-in-sets-of-k-consecutive-numbers",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "Hash Table", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "brace-expansion",
          "name": "Brace Expansion",
          "link": "https://leetcode.com/problems/brace-expansion",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 4,
          "tags": ["String", "Backtracking", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-square",
          "name": "Valid Square",
          "link": "https://leetcode.com/problems/valid-square",
          "otherCompanies": [
            ["Pure Storage", 2],
            ["Microsoft", 2]
          ],
          "occurence": 4,
          "tags": ["Math", "Geometry"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-tree-longest-consecutive-sequence-ii",
          "name": "Binary Tree Longest Consecutive Sequence II",
          "link": "https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-word-in-dictionary-through-deleting",
          "name": "Longest Word in Dictionary through Deleting",
          "link": "https://leetcode.com/problems/longest-word-in-dictionary-through-deleting",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "Two Pointers", "String", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "trapping-rain-water-ii",
          "name": "Trapping Rain Water II",
          "link": "https://leetcode.com/problems/trapping-rain-water-ii",
          "otherCompanies": [],
          "occurence": 4,
          "tags": [
            "Array",
            "Breadth-First Search",
            "Heap (Priority Queue)",
            "Matrix"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "strobogrammatic-number-iii",
          "name": "Strobogrammatic Number III",
          "link": "https://leetcode.com/problems/strobogrammatic-number-iii",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "String", "Recursion"],
          "difficulty": "Hard"
        },
        {
          "slug": "contains-duplicate-iii",
          "name": "Contains Duplicate III",
          "link": "https://leetcode.com/problems/contains-duplicate-iii",
          "otherCompanies": [
            ["Amazon", 2],
            ["Apple", 2],
            ["Adobe", 2]
          ],
          "occurence": 4,
          "tags": [
            "Array",
            "Sliding Window",
            "Sorting",
            "Bucket Sort",
            "Ordered Set"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "maximal-rectangle",
          "name": "Maximal Rectangle",
          "link": "https://leetcode.com/problems/maximal-rectangle",
          "otherCompanies": [
            ["Amazon", 3],
            ["Apple", 2]
          ],
          "occurence": 4,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Stack",
            "Matrix",
            "Monotonic Stack"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "minimize-maximum-pair-sum-in-array",
          "name": "Minimize Maximum Pair Sum in Array",
          "link": "https://leetcode.com/problems/minimize-maximum-pair-sum-in-array",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Two Pointers", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "concatenation-of-consecutive-binary-numbers",
          "name": "Concatenation of Consecutive Binary Numbers",
          "link": "https://leetcode.com/problems/concatenation-of-consecutive-binary-numbers",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Math", "Bit Manipulation", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-operations-to-reduce-x-to-zero",
          "name": "Minimum Operations to Reduce X to Zero",
          "link": "https://leetcode.com/problems/minimum-operations-to-reduce-x-to-zero",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 3,
          "tags": [
            "Array",
            "Hash Table",
            "Binary Search",
            "Sliding Window",
            "Prefix Sum"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "count-sorted-vowel-strings",
          "name": "Count Sorted Vowel Strings",
          "link": "https://leetcode.com/problems/count-sorted-vowel-strings",
          "otherCompanies": [["Salesforce", 2]],
          "occurence": 3,
          "tags": ["Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "univalued-binary-tree",
          "name": "Univalued Binary Tree",
          "link": "https://leetcode.com/problems/univalued-binary-tree",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "array-of-doubled-pairs",
          "name": "Array of Doubled Pairs",
          "link": "https://leetcode.com/problems/array-of-doubled-pairs",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Hash Table", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "rle-iterator",
          "name": "RLE Iterator",
          "link": "https://leetcode.com/problems/rle-iterator",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Design", "Counting", "Iterator"],
          "difficulty": "Medium"
        },
        {
          "slug": "magic-squares-in-grid",
          "name": "Magic Squares In Grid",
          "link": "https://leetcode.com/problems/magic-squares-in-grid",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Math", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "flipping-an-image",
          "name": "Flipping an Image",
          "link": "https://leetcode.com/problems/flipping-an-image",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Two Pointers", "Matrix", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "positions-of-large-groups",
          "name": "Positions of Large Groups",
          "link": "https://leetcode.com/problems/positions-of-large-groups",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "max-increase-to-keep-city-skyline",
          "name": "Max Increase to Keep City Skyline",
          "link": "https://leetcode.com/problems/max-increase-to-keep-city-skyline",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 3,
          "tags": ["Array", "Greedy", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "split-bst",
          "name": "Split BST",
          "link": "https://leetcode.com/problems/split-bst",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Tree", "Binary Search Tree", "Recursion", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "shopping-offers",
          "name": "Shopping Offers",
          "link": "https://leetcode.com/problems/shopping-offers",
          "otherCompanies": [
            ["Facebook", 2],
            ["Amazon", 2],
            ["Apple", 2]
          ],
          "occurence": 3,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Backtracking",
            "Bit Manipulation",
            "Memoization",
            "Bitmask"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "n-ary-tree-preorder-traversal",
          "name": "N-ary Tree Preorder Traversal",
          "link": "https://leetcode.com/problems/n-ary-tree-preorder-traversal",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Stack", "Tree", "Depth-First Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-absolute-difference-in-bst",
          "name": "Minimum Absolute Difference in BST",
          "link": "https://leetcode.com/problems/minimum-absolute-difference-in-bst",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "word-abbreviation",
          "name": "Word Abbreviation",
          "link": "https://leetcode.com/problems/word-abbreviation",
          "otherCompanies": [["Snapchat", 1]],
          "occurence": 3,
          "tags": ["Array", "String", "Greedy", "Trie", "Sorting"],
          "difficulty": "Hard"
        },
        {
          "slug": "base-7",
          "name": "Base 7",
          "link": "https://leetcode.com/problems/base-7",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "word-squares",
          "name": "Word Squares",
          "link": "https://leetcode.com/problems/word-squares",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "String", "Backtracking", "Trie"],
          "difficulty": "Hard"
        },
        {
          "slug": "rotate-function",
          "name": "Rotate Function",
          "link": "https://leetcode.com/problems/rotate-function",
          "otherCompanies": [
            ["Apple", 2],
            ["Amazon", 1]
          ],
          "occurence": 3,
          "tags": ["Array", "Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-twitter",
          "name": "Design Twitter",
          "link": "https://leetcode.com/problems/design-twitter",
          "otherCompanies": [
            ["Amazon", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 3,
          "tags": [
            "Hash Table",
            "Linked List",
            "Design",
            "Heap (Priority Queue)"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "increasing-triplet-subsequence",
          "name": "Increasing Triplet Subsequence",
          "link": "https://leetcode.com/problems/increasing-triplet-subsequence",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 3,
          "tags": ["Array", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "range-sum-query-2d-mutable",
          "name": "Range Sum Query 2D - Mutable",
          "link": "https://leetcode.com/problems/range-sum-query-2d-mutable",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Array",
            "Design",
            "Binary Indexed Tree",
            "Segment Tree",
            "Matrix"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "palindrome-permutation-ii",
          "name": "Palindrome Permutation II",
          "link": "https://leetcode.com/problems/palindrome-permutation-ii",
          "otherCompanies": [["Cruise Automation", 2]],
          "occurence": 3,
          "tags": ["Hash Table", "String", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "combination-sum-iii",
          "name": "Combination Sum III",
          "link": "https://leetcode.com/problems/combination-sum-iii",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "evaluate-the-bracket-pairs-of-a-string",
          "name": "Evaluate the Bracket Pairs of a String",
          "link": "https://leetcode.com/problems/evaluate-the-bracket-pairs-of-a-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-most-competitive-subsequence",
          "name": "Find the Most Competitive Subsequence",
          "link": "https://leetcode.com/problems/find-the-most-competitive-subsequence",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Stack", "Greedy", "Monotonic Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "largest-substring-between-two-equal-characters",
          "name": "Largest Substring Between Two Equal Characters",
          "link": "https://leetcode.com/problems/largest-substring-between-two-equal-characters",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-number-of-vertices-to-reach-all-nodes",
          "name": "Minimum Number of Vertices to Reach All Nodes",
          "link": "https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Graph"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-good-triplets",
          "name": "Count Good Triplets",
          "link": "https://leetcode.com/problems/count-good-triplets",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Enumeration"],
          "difficulty": "Easy"
        },
        {
          "slug": "shuffle-string",
          "name": "Shuffle String",
          "link": "https://leetcode.com/problems/shuffle-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "path-crossing",
          "name": "Path Crossing",
          "link": "https://leetcode.com/problems/path-crossing",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "clone-n-ary-tree",
          "name": "Clone N-ary Tree",
          "link": "https://leetcode.com/problems/clone-n-ary-tree",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Hash Table",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-number-of-days-to-make-m-bouquets",
          "name": "Minimum Number of Days to Make m Bouquets",
          "link": "https://leetcode.com/problems/minimum-number-of-days-to-make-m-bouquets",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "simplified-fractions",
          "name": "Simplified Fractions",
          "link": "https://leetcode.com/problems/simplified-fractions",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "String", "Number Theory"],
          "difficulty": "Medium"
        },
        {
          "slug": "build-an-array-with-stack-operations",
          "name": "Build an Array With Stack Operations",
          "link": "https://leetcode.com/problems/build-an-array-with-stack-operations",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Stack", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "pizza-with-3n-slices",
          "name": "Pizza With 3n Slices",
          "link": "https://leetcode.com/problems/pizza-with-3n-slices",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Greedy",
            "Heap (Priority Queue)"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "frog-position-after-t-seconds",
          "name": "Frog Position After T Seconds",
          "link": "https://leetcode.com/problems/frog-position-after-t-seconds",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Graph"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "check-if-n-and-its-double-exist",
          "name": "Check If N and Its Double Exist",
          "link": "https://leetcode.com/problems/check-if-n-and-its-double-exist",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Hash Table",
            "Two Pointers",
            "Binary Search",
            "Sorting"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "cells-with-odd-values-in-a-matrix",
          "name": "Cells with Odd Values in a Matrix",
          "link": "https://leetcode.com/problems/cells-with-odd-values-in-a-matrix",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-positive-integer-solution-for-a-given-equation",
          "name": "Find Positive Integer Solution for a Given Equation",
          "link": "https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Two Pointers", "Binary Search", "Interactive"],
          "difficulty": "Medium"
        },
        {
          "slug": "relative-sort-array",
          "name": "Relative Sort Array",
          "link": "https://leetcode.com/problems/relative-sort-array",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Sorting", "Counting Sort"],
          "difficulty": "Easy"
        },
        {
          "slug": "compare-strings-by-frequency-of-the-smallest-character",
          "name": "Compare Strings by Frequency of the Smallest Character",
          "link": "https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String", "Binary Search", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "print-in-order",
          "name": "Print in Order",
          "link": "https://leetcode.com/problems/print-in-order",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Concurrency"],
          "difficulty": "Easy"
        },
        {
          "slug": "defanging-an-ip-address",
          "name": "Defanging an IP Address",
          "link": "https://leetcode.com/problems/defanging-an-ip-address",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "campus-bikes-ii",
          "name": "Campus Bikes II",
          "link": "https://leetcode.com/problems/campus-bikes-ii",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Backtracking",
            "Bit Manipulation",
            "Bitmask"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "confusing-number",
          "name": "Confusing Number",
          "link": "https://leetcode.com/problems/confusing-number",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "video-stitching",
          "name": "Video Stitching",
          "link": "https://leetcode.com/problems/video-stitching",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "best-sightseeing-pair",
          "name": "Best Sightseeing Pair",
          "link": "https://leetcode.com/problems/best-sightseeing-pair",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "flip-equivalent-binary-trees",
          "name": "Flip Equivalent Binary Trees",
          "link": "https://leetcode.com/problems/flip-equivalent-binary-trees",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-falling-path-sum",
          "name": "Minimum Falling Path Sum",
          "link": "https://leetcode.com/problems/minimum-falling-path-sum",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "long-pressed-name",
          "name": "Long Pressed Name",
          "link": "https://leetcode.com/problems/long-pressed-name",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "x-of-a-kind-in-a-deck-of-cards",
          "name": "X of a Kind in a Deck of Cards",
          "link": "https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Math", "Counting", "Number Theory"],
          "difficulty": "Easy"
        },
        {
          "slug": "leaf-similar-trees",
          "name": "Leaf-Similar Trees",
          "link": "https://leetcode.com/problems/leaf-similar-trees",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "global-and-local-inversions",
          "name": "Global and Local Inversions",
          "link": "https://leetcode.com/problems/global-and-local-inversions",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "bold-words-in-string",
          "name": "Bold Words in String",
          "link": "https://leetcode.com/problems/bold-words-in-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String", "Trie", "String Matching"],
          "difficulty": "Medium"
        },
        {
          "slug": "pyramid-transition-matrix",
          "name": "Pyramid Transition Matrix",
          "link": "https://leetcode.com/problems/pyramid-transition-matrix",
          "otherCompanies": [
            ["Amazon", 2],
            ["Airbnb", 1]
          ],
          "occurence": 2,
          "tags": [
            "Bit Manipulation",
            "Depth-First Search",
            "Breadth-First Search"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "shortest-completing-word",
          "name": "Shortest Completing Word",
          "link": "https://leetcode.com/problems/shortest-completing-word",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-window-subsequence",
          "name": "Minimum Window Subsequence",
          "link": "https://leetcode.com/problems/minimum-window-subsequence",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Dynamic Programming", "Sliding Window"],
          "difficulty": "Hard"
        },
        {
          "slug": "repeated-string-match",
          "name": "Repeated String Match",
          "link": "https://leetcode.com/problems/repeated-string-match",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "String Matching"],
          "difficulty": "Medium"
        },
        {
          "slug": "map-sum-pairs",
          "name": "Map Sum Pairs",
          "link": "https://leetcode.com/problems/map-sum-pairs",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String", "Design", "Trie"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-longest-increasing-subsequence",
          "name": "Number of Longest Increasing Subsequence",
          "link": "https://leetcode.com/problems/number-of-longest-increasing-subsequence",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Binary Indexed Tree",
            "Segment Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-9",
          "name": "Remove 9",
          "link": "https://leetcode.com/problems/remove-9",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Hard"
        },
        {
          "slug": "design-compressed-string-iterator",
          "name": "Design Compressed String Iterator",
          "link": "https://leetcode.com/problems/design-compressed-string-iterator",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String", "Design", "Iterator"],
          "difficulty": "Easy"
        },
        {
          "slug": "detect-capital",
          "name": "Detect Capital",
          "link": "https://leetcode.com/problems/detect-capital",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "the-maze-iii",
          "name": "The Maze III",
          "link": "https://leetcode.com/problems/the-maze-iii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Graph",
            "Heap (Priority Queue)",
            "Shortest Path"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "encode-string-with-shortest-length",
          "name": "Encode String with Shortest Length",
          "link": "https://leetcode.com/problems/encode-string-with-shortest-length",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "hamming-distance",
          "name": "Hamming Distance",
          "link": "https://leetcode.com/problems/hamming-distance",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "sequence-reconstruction",
          "name": "Sequence Reconstruction",
          "link": "https://leetcode.com/problems/sequence-reconstruction",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Graph", "Topological Sort"],
          "difficulty": "Medium"
        },
        {
          "slug": "convert-a-number-to-hexadecimal",
          "name": "Convert a Number to Hexadecimal",
          "link": "https://leetcode.com/problems/convert-a-number-to-hexadecimal",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Math", "Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "guess-number-higher-or-lower-ii",
          "name": "Guess Number Higher or Lower II",
          "link": "https://leetcode.com/problems/guess-number-higher-or-lower-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Dynamic Programming", "Game Theory"],
          "difficulty": "Medium"
        },
        {
          "slug": "largest-divisible-subset",
          "name": "Largest Divisible Subset",
          "link": "https://leetcode.com/problems/largest-divisible-subset",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math", "Dynamic Programming", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-substring-with-at-most-k-distinct-characters",
          "name": "Longest Substring with At Most K Distinct Characters",
          "link": "https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "single-number-iii",
          "name": "Single Number III",
          "link": "https://leetcode.com/problems/single-number-iii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-minimum-in-rotated-sorted-array-ii",
          "name": "Find Minimum in Rotated Sorted Array II",
          "link": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Hard"
        },
        {
          "slug": "insertion-sort-list",
          "name": "Insertion Sort List",
          "link": "https://leetcode.com/problems/insertion-sort-list",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Linked List", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-consecutive-cards-to-pick-up",
          "name": "Minimum Consecutive Cards to Pick Up",
          "link": "https://leetcode.com/problems/minimum-consecutive-cards-to-pick-up",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-prefixes-of-a-given-string",
          "name": "Count Prefixes of a Given String",
          "link": "https://leetcode.com/problems/count-prefixes-of-a-given-string",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-the-difference-of-two-arrays",
          "name": "Find the Difference of Two Arrays",
          "link": "https://leetcode.com/problems/find-the-difference-of-two-arrays",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-all-k-distant-indices-in-an-array",
          "name": "Find All K-Distant Indices in an Array",
          "link": "https://leetcode.com/problems/find-all-k-distant-indices-in-an-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "most-frequent-number-following-key-in-an-array",
          "name": "Most Frequent Number Following Key In an Array",
          "link": "https://leetcode.com/problems/most-frequent-number-following-key-in-an-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "counting-words-with-a-given-prefix",
          "name": "Counting Words With a Given Prefix",
          "link": "https://leetcode.com/problems/counting-words-with-a-given-prefix",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "all-divisions-with-the-highest-score-of-a-binary-array",
          "name": "All Divisions With the Highest Score of a Binary Array",
          "link": "https://leetcode.com/problems/all-divisions-with-the-highest-score-of-a-binary-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-all-lonely-numbers-in-the-array",
          "name": "Find All Lonely Numbers in the Array",
          "link": "https://leetcode.com/problems/find-all-lonely-numbers-in-the-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "destroying-asteroids",
          "name": "Destroying Asteroids",
          "link": "https://leetcode.com/problems/destroying-asteroids",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-number-of-words-found-in-sentences",
          "name": "Maximum Number of Words Found in Sentences",
          "link": "https://leetcode.com/problems/maximum-number-of-words-found-in-sentences",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "watering-plants",
          "name": "Watering Plants",
          "link": "https://leetcode.com/problems/watering-plants",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array"],
          "difficulty": "Medium"
        },
        {
          "slug": "smallest-index-with-equal-value",
          "name": "Smallest Index With Equal Value",
          "link": "https://leetcode.com/problems/smallest-index-with-equal-value",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "convert-1d-array-into-2d-array",
          "name": "Convert 1D Array Into 2D Array",
          "link": "https://leetcode.com/problems/convert-1d-array-into-2d-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "binary-searchable-numbers-in-an-unsorted-array",
          "name": "Binary Searchable Numbers in an Unsorted Array",
          "link": "https://leetcode.com/problems/binary-searchable-numbers-in-an-unsorted-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimize-product-sum-of-two-arrays",
          "name": "Minimize Product Sum of Two Arrays",
          "link": "https://leetcode.com/problems/minimize-product-sum-of-two-arrays",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "queries-on-number-of-points-inside-a-circle",
          "name": "Queries on Number of Points Inside a Circle",
          "link": "https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Geometry"],
          "difficulty": "Medium"
        },
        {
          "slug": "sentence-similarity-iii",
          "name": "Sentence Similarity III",
          "link": "https://leetcode.com/problems/sentence-similarity-iii",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-number-of-operations-to-reinitialize-a-permutation",
          "name": "Minimum Number of Operations to Reinitialize a Permutation",
          "link": "https://leetcode.com/problems/minimum-number-of-operations-to-reinitialize-a-permutation",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "sum-of-beauty-of-all-substrings",
          "name": "Sum of Beauty of All Substrings",
          "link": "https://leetcode.com/problems/sum-of-beauty-of-all-substrings",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "String", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-most-recently-used-queue",
          "name": "Design Most Recently Used Queue",
          "link": "https://leetcode.com/problems/design-most-recently-used-queue",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Array",
            "Hash Table",
            "Stack",
            "Design",
            "Binary Indexed Tree",
            "Ordered Set"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "latest-time-by-replacing-hidden-digits",
          "name": "Latest Time by Replacing Hidden Digits",
          "link": "https://leetcode.com/problems/latest-time-by-replacing-hidden-digits",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "largest-submatrix-with-rearrangements",
          "name": "Largest Submatrix With Rearrangements",
          "link": "https://leetcode.com/problems/largest-submatrix-with-rearrangements",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy", "Sorting", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "tuple-with-same-product",
          "name": "Tuple with Same Product",
          "link": "https://leetcode.com/problems/tuple-with-same-product",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-score-from-removing-substrings",
          "name": "Maximum Score From Removing Substrings",
          "link": "https://leetcode.com/problems/maximum-score-from-removing-substrings",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Stack", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "largest-subarray-length-k",
          "name": "Largest Subarray Length K",
          "link": "https://leetcode.com/problems/largest-subarray-length-k",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "mean-of-array-after-removing-some-elements",
          "name": "Mean of Array After Removing Some Elements",
          "link": "https://leetcode.com/problems/mean-of-array-after-removing-some-elements",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "special-array-with-x-elements-greater-than-or-equal-x",
          "name": "Special Array With X Elements Greater Than or Equal X",
          "link": "https://leetcode.com/problems/special-array-with-x-elements-greater-than-or-equal-x",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Binary Search", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "range-sum-of-sorted-subarray-sums",
          "name": "Range Sum of Sorted Subarray Sums",
          "link": "https://leetcode.com/problems/range-sum-of-sorted-subarray-sums",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Two Pointers", "Binary Search", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "the-k-strongest-values-in-an-array",
          "name": "The k Strongest Values in an Array",
          "link": "https://leetcode.com/problems/the-k-strongest-values-in-an-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Two Pointers", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "check-if-a-string-contains-all-binary-codes-of-size-k",
          "name": "Check If a String Contains All Binary Codes of Size K",
          "link": "https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Hash Table",
            "String",
            "Bit Manipulation",
            "Rolling Hash",
            "Hash Function"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list",
          "name": "People Whose List of Favorite Companies Is Not a Subset of Another List",
          "link": "https://leetcode.com/problems/people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-score-after-splitting-a-string",
          "name": "Maximum Score After Splitting a String",
          "link": "https://leetcode.com/problems/maximum-score-after-splitting-a-string",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-elements-in-a-contaminated-binary-tree",
          "name": "Find Elements in a Contaminated Binary Tree",
          "link": "https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Hash Table",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Design",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "distance-between-bus-stops",
          "name": "Distance Between Bus Stops",
          "link": "https://leetcode.com/problems/distance-between-bus-stops",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "single-row-keyboard",
          "name": "Single-Row Keyboard",
          "link": "https://leetcode.com/problems/single-row-keyboard",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "largest-values-from-labels",
          "name": "Largest Values From Labels",
          "link": "https://leetcode.com/problems/largest-values-from-labels",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Greedy", "Sorting", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "occurrences-after-bigram",
          "name": "Occurrences After Bigram",
          "link": "https://leetcode.com/problems/occurrences-after-bigram",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "valid-boomerang",
          "name": "Valid Boomerang",
          "link": "https://leetcode.com/problems/valid-boomerang",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Geometry"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-enclaves",
          "name": "Number of Enclaves",
          "link": "https://leetcode.com/problems/number-of-enclaves",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Matrix"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "delete-columns-to-make-sorted",
          "name": "Delete Columns to Make Sorted",
          "link": "https://leetcode.com/problems/delete-columns-to-make-sorted",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "ambiguous-coordinates",
          "name": "Ambiguous Coordinates",
          "link": "https://leetcode.com/problems/ambiguous-coordinates",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "largest-triangle-area",
          "name": "Largest Triangle Area",
          "link": "https://leetcode.com/problems/largest-triangle-area",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Geometry"],
          "difficulty": "Easy"
        },
        {
          "slug": "similar-rgb-color",
          "name": "Similar RGB Color",
          "link": "https://leetcode.com/problems/similar-rgb-color",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "String", "Enumeration"],
          "difficulty": "Easy"
        },
        {
          "slug": "escape-the-ghosts",
          "name": "Escape The Ghosts",
          "link": "https://leetcode.com/problems/escape-the-ghosts",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-anagram-mappings",
          "name": "Find Anagram Mappings",
          "link": "https://leetcode.com/problems/find-anagram-mappings",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Easy"
        },
        {
          "slug": "beautiful-arrangement-ii",
          "name": "Beautiful Arrangement II",
          "link": "https://leetcode.com/problems/beautiful-arrangement-ii",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "coin-path",
          "name": "Coin Path",
          "link": "https://leetcode.com/problems/coin-path",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "maximum-average-subarray-ii",
          "name": "Maximum Average Subarray II",
          "link": "https://leetcode.com/problems/maximum-average-subarray-ii",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Binary Search", "Prefix Sum"],
          "difficulty": "Hard"
        },
        {
          "slug": "erect-the-fence",
          "name": "Erect the Fence",
          "link": "https://leetcode.com/problems/erect-the-fence",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Geometry"],
          "difficulty": "Hard"
        },
        {
          "slug": "lonely-pixel-ii",
          "name": "Lonely Pixel II",
          "link": "https://leetcode.com/problems/lonely-pixel-ii",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-uncommon-subsequence-i",
          "name": "Longest Uncommon Subsequence I",
          "link": "https://leetcode.com/problems/longest-uncommon-subsequence-i",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "relative-ranks",
          "name": "Relative Ranks",
          "link": "https://leetcode.com/problems/relative-ranks",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Sorting", "Heap (Priority Queue)"],
          "difficulty": "Easy"
        },
        {
          "slug": "magical-string",
          "name": "Magical String",
          "link": "https://leetcode.com/problems/magical-string",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "convex-polygon",
          "name": "Convex Polygon",
          "link": "https://leetcode.com/problems/convex-polygon",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Geometry"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-unique-word-abbreviation",
          "name": "Minimum Unique Word Abbreviation",
          "link": "https://leetcode.com/problems/minimum-unique-word-abbreviation",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Backtracking", "Bit Manipulation"],
          "difficulty": "Hard"
        },
        {
          "slug": "binary-watch",
          "name": "Binary Watch",
          "link": "https://leetcode.com/problems/binary-watch",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Backtracking", "Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "plus-one-linked-list",
          "name": "Plus One Linked List",
          "link": "https://leetcode.com/problems/plus-one-linked-list",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Linked List", "Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "verify-preorder-serialization-of-a-binary-tree",
          "name": "Verify Preorder Serialization of a Binary Tree",
          "link": "https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Stack", "Tree", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "generalized-abbreviation",
          "name": "Generalized Abbreviation",
          "link": "https://leetcode.com/problems/generalized-abbreviation",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Backtracking", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "flip-game-ii",
          "name": "Flip Game II",
          "link": "https://leetcode.com/problems/flip-game-ii",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Math",
            "Dynamic Programming",
            "Backtracking",
            "Memoization",
            "Game Theory"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "flip-game",
          "name": "Flip Game",
          "link": "https://leetcode.com/problems/flip-game",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Facebook",
      "problems": [
        {
          "slug": "minimum-remove-to-make-valid-parentheses",
          "name": "Minimum Remove to Make Valid Parentheses",
          "link": "https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses",
          "otherCompanies": [
            ["Bloomberg", 8],
            ["Amazon", 6],
            ["Microsoft", 4],
            ["Google", 2],
            ["Snapchat", 2],
            ["Adobe", 2]
          ],
          "occurence": 282,
          "tags": ["String", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-palindrome-ii",
          "name": "Valid Palindrome II",
          "link": "https://leetcode.com/problems/valid-palindrome-ii",
          "otherCompanies": [
            ["Amazon", 5],
            ["Apple", 3],
            ["Microsoft", 3],
            ["Bloomberg", 2],
            ["Oracle", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 252,
          "tags": ["Two Pointers", "String", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "binary-tree-vertical-order-traversal",
          "name": "Binary Tree Vertical Order Traversal",
          "link": "https://leetcode.com/problems/binary-tree-vertical-order-traversal",
          "otherCompanies": [
            ["Bloomberg", 8],
            ["Amazon", 4],
            ["Microsoft", 3]
          ],
          "occurence": 188,
          "tags": [
            "Hash Table",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "lowest-common-ancestor-of-a-binary-tree",
          "name": "Lowest Common Ancestor of a Binary Tree",
          "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree",
          "otherCompanies": [
            ["Amazon", 25],
            ["LinkedIn", 11],
            ["Microsoft", 10],
            ["Google", 8],
            ["Sumologic", 3],
            ["Oracle", 3],
            ["Karat", 3],
            ["Apple", 2]
          ],
          "occurence": 180,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "powx-n",
          "name": "Pow(x, n)",
          "link": "https://leetcode.com/problems/powx-n",
          "otherCompanies": [
            ["Amazon", 9],
            ["Bloomberg", 8],
            ["LinkedIn", 7],
            ["Google", 5],
            ["Apple", 5],
            ["Microsoft", 5],
            ["Yahoo", 3],
            ["Adobe", 3]
          ],
          "occurence": 162,
          "tags": ["Math", "Recursion"],
          "difficulty": "Medium"
        },
        {
          "slug": "lowest-common-ancestor-of-a-binary-tree-iii",
          "name": "Lowest Common Ancestor of a Binary Tree III",
          "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-iii",
          "otherCompanies": [
            ["LinkedIn", 5],
            ["Microsoft", 5],
            ["Google", 3],
            ["Amazon", 3],
            ["Sumologic", 2],
            ["Spotify", 2]
          ],
          "occurence": 156,
          "tags": ["Hash Table", "Tree", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "range-sum-of-bst",
          "name": "Range Sum of BST",
          "link": "https://leetcode.com/problems/range-sum-of-bst",
          "otherCompanies": [
            ["Amazon", 4],
            ["Apple", 3]
          ],
          "occurence": 149,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "subarray-sum-equals-k",
          "name": "Subarray Sum Equals K",
          "link": "https://leetcode.com/problems/subarray-sum-equals-k",
          "otherCompanies": [
            ["Amazon", 19],
            ["Google", 15],
            ["Microsoft", 10],
            ["Oracle", 7],
            ["ByteDance", 5],
            ["Bloomberg", 4],
            ["Visa", 4],
            ["Quora", 3],
            ["Apple", 3],
            ["ServiceNow", 2],
            ["Expedia", 2],
            ["DoorDash", 2],
            ["Adobe", 2],
            ["Nvidia", 2],
            ["Bolt", 2]
          ],
          "occurence": 141,
          "tags": ["Array", "Hash Table", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "random-pick-with-weight",
          "name": "Random Pick with Weight",
          "link": "https://leetcode.com/problems/random-pick-with-weight",
          "otherCompanies": [
            ["Google", 27],
            ["Uber", 13],
            ["Amazon", 11],
            ["LinkedIn", 8],
            ["Apple", 2],
            ["Twitter", 2],
            ["Microsoft", 2]
          ],
          "occurence": 140,
          "tags": ["Math", "Binary Search", "Prefix Sum", "Randomized"],
          "difficulty": "Medium"
        },
        {
          "slug": "kth-largest-element-in-an-array",
          "name": "Kth Largest Element in an Array",
          "link": "https://leetcode.com/problems/kth-largest-element-in-an-array",
          "otherCompanies": [
            ["Amazon", 16],
            ["LinkedIn", 14],
            ["Microsoft", 12],
            ["Google", 8],
            ["Bloomberg", 5],
            ["Adobe", 5],
            ["ByteDance", 3],
            ["Goldman Sachs", 2]
          ],
          "occurence": 140,
          "tags": [
            "Array",
            "Divide and Conquer",
            "Sorting",
            "Heap (Priority Queue)",
            "Quickselect"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "k-closest-points-to-origin",
          "name": "K Closest Points to Origin",
          "link": "https://leetcode.com/problems/k-closest-points-to-origin",
          "otherCompanies": [
            ["Amazon", 49],
            ["Microsoft", 6],
            ["Asana", 5],
            ["Google", 3],
            ["Sumologic", 2],
            ["LinkedIn", 2]
          ],
          "occurence": 127,
          "tags": [
            "Array",
            "Math",
            "Divide and Conquer",
            "Geometry",
            "Sorting",
            "Heap (Priority Queue)",
            "Quickselect"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "dot-product-of-two-sparse-vectors",
          "name": "Dot Product of Two Sparse Vectors",
          "link": "https://leetcode.com/problems/dot-product-of-two-sparse-vectors",
          "otherCompanies": [
            ["Google", 4],
            ["Amazon", 2],
            ["Bloomberg", 2],
            ["Microsoft", 2]
          ],
          "occurence": 121,
          "tags": ["Array", "Hash Table", "Two Pointers", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "basic-calculator-ii",
          "name": "Basic Calculator II",
          "link": "https://leetcode.com/problems/basic-calculator-ii",
          "otherCompanies": [
            ["Amazon", 13],
            ["Microsoft", 11],
            ["ByteDance", 4],
            ["Snapchat", 3],
            ["Oracle", 3],
            ["Yahoo", 2],
            ["Apple", 2],
            ["Uber", 2],
            ["Tesla", 2]
          ],
          "occurence": 118,
          "tags": ["Math", "String", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-word-abbreviation",
          "name": "Valid Word Abbreviation",
          "link": "https://leetcode.com/problems/valid-word-abbreviation",
          "otherCompanies": [["Google", 3]],
          "occurence": 114,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "simplify-path",
          "name": "Simplify Path",
          "link": "https://leetcode.com/problems/simplify-path",
          "otherCompanies": [
            ["Amazon", 8],
            ["Google", 5],
            ["Apple", 3]
          ],
          "occurence": 112,
          "tags": ["String", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "merge-intervals",
          "name": "Merge Intervals",
          "link": "https://leetcode.com/problems/merge-intervals",
          "otherCompanies": [
            ["Amazon", 87],
            ["Google", 28],
            ["Bloomberg", 20],
            ["Salesforce", 19],
            ["Apple", 18],
            ["Microsoft", 15],
            ["Uber", 14],
            ["IBM", 8],
            ["Adobe", 8],
            ["LinkedIn", 7],
            ["Snapchat", 5],
            ["VMware", 5],
            ["Walmart Global Tech", 5],
            ["Yandex", 4],
            ["Oracle", 4],
            ["Shopee", 4],
            ["Twitter", 3],
            ["Morgan Stanley", 2],
            ["Intuit", 2],
            ["Nvidia", 2],
            ["Cisco", 2],
            ["ByteDance", 2]
          ],
          "occurence": 110,
          "tags": ["Array", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-tree-right-side-view",
          "name": "Binary Tree Right Side View",
          "link": "https://leetcode.com/problems/binary-tree-right-side-view",
          "otherCompanies": [
            ["Amazon", 10],
            ["Bloomberg", 4],
            ["Qualtrics", 4],
            ["Oracle", 3],
            ["Apple", 2],
            ["Uber", 2],
            ["DoorDash", 2],
            ["Microsoft", 2]
          ],
          "occurence": 108,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-add-to-make-parentheses-valid",
          "name": "Minimum Add to Make Parentheses Valid",
          "link": "https://leetcode.com/problems/minimum-add-to-make-parentheses-valid",
          "otherCompanies": [
            ["Amazon", 3],
            ["Microsoft", 3],
            ["Twitter", 2]
          ],
          "occurence": 100,
          "tags": ["String", "Stack", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "nested-list-weight-sum",
          "name": "Nested List Weight Sum",
          "link": "https://leetcode.com/problems/nested-list-weight-sum",
          "otherCompanies": [
            ["LinkedIn", 34],
            ["Amazon", 4]
          ],
          "occurence": 100,
          "tags": ["Depth-First Search", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "top-k-frequent-elements",
          "name": "Top K Frequent Elements",
          "link": "https://leetcode.com/problems/top-k-frequent-elements",
          "otherCompanies": [
            ["Amazon", 29],
            ["Microsoft", 12],
            ["Google", 8],
            ["Oracle", 7],
            ["Uber", 6],
            ["Apple", 5],
            ["Bloomberg", 4],
            ["Adobe", 3],
            ["Cisco", 3]
          ],
          "occurence": 97,
          "tags": [
            "Array",
            "Hash Table",
            "Divide and Conquer",
            "Sorting",
            "Heap (Priority Queue)",
            "Bucket Sort",
            "Counting",
            "Quickselect"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-palindrome",
          "name": "Valid Palindrome",
          "link": "https://leetcode.com/problems/valid-palindrome",
          "otherCompanies": [
            ["Amazon", 8],
            ["Microsoft", 8],
            ["Apple", 5],
            ["Bloomberg", 3],
            ["Adobe", 3],
            ["American Express", 3],
            ["Yandex", 2],
            ["Wayfair", 2]
          ],
          "occurence": 94,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "diameter-of-binary-tree",
          "name": "Diameter of Binary Tree",
          "link": "https://leetcode.com/problems/diameter-of-binary-tree",
          "otherCompanies": [
            ["Amazon", 12],
            ["Bloomberg", 4],
            ["Google", 3],
            ["Microsoft", 3],
            ["Apple", 2]
          ],
          "occurence": 89,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "merge-sorted-array",
          "name": "Merge Sorted Array",
          "link": "https://leetcode.com/problems/merge-sorted-array",
          "otherCompanies": [
            ["Microsoft", 10],
            ["Apple", 8],
            ["Amazon", 5],
            ["LinkedIn", 5],
            ["Bloomberg", 4],
            ["Shopee", 4],
            ["Uber", 2],
            ["Oracle", 2],
            ["Indeed", 2]
          ],
          "occurence": 89,
          "tags": ["Array", "Two Pointers", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-peak-element",
          "name": "Find Peak Element",
          "link": "https://leetcode.com/problems/find-peak-element",
          "otherCompanies": [
            ["Amazon", 8],
            ["Google", 7],
            ["Uber", 5],
            ["Snapchat", 4],
            ["Hudson River Trading", 3],
            ["Roblox", 2],
            ["Apple", 2],
            ["Microsoft", 2]
          ],
          "occurence": 82,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "vertical-order-traversal-of-a-binary-tree",
          "name": "Vertical Order Traversal of a Binary Tree",
          "link": "https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree",
          "otherCompanies": [
            ["Amazon", 10],
            ["Bloomberg", 7],
            ["Microsoft", 6],
            ["Uber", 2]
          ],
          "occurence": 82,
          "tags": [
            "Hash Table",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "shortest-path-in-binary-matrix",
          "name": "Shortest Path in Binary Matrix",
          "link": "https://leetcode.com/problems/shortest-path-in-binary-matrix",
          "otherCompanies": [
            ["Amazon", 9],
            ["Microsoft", 8],
            ["Google", 5],
            ["Snapchat", 3],
            ["Adobe", 2]
          ],
          "occurence": 76,
          "tags": ["Array", "Breadth-First Search", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "custom-sort-string",
          "name": "Custom Sort String",
          "link": "https://leetcode.com/problems/custom-sort-string",
          "otherCompanies": [["ByteDance", 2]],
          "occurence": 67,
          "tags": ["Hash Table", "String", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "copy-list-with-random-pointer",
          "name": "Copy List with Random Pointer",
          "link": "https://leetcode.com/problems/copy-list-with-random-pointer",
          "otherCompanies": [
            ["Amazon", 19],
            ["Microsoft", 12],
            ["Google", 3],
            ["Bloomberg", 3],
            ["Apple", 2]
          ],
          "occurence": 64,
          "tags": ["Hash Table", "Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "merge-k-sorted-lists",
          "name": "Merge k Sorted Lists",
          "link": "https://leetcode.com/problems/merge-k-sorted-lists",
          "otherCompanies": [
            ["Amazon", 47],
            ["Microsoft", 17],
            ["Google", 8],
            ["Apple", 8],
            ["ByteDance", 8],
            ["Adobe", 4],
            ["VMware", 4],
            ["Yandex", 3],
            ["LinkedIn", 3],
            ["Oracle", 3],
            ["Indeed", 3],
            ["Bloomberg", 2],
            ["TuSimple", 2],
            ["Sprinklr", 2],
            ["ByteDance", 2],
            ["Shopee", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 59,
          "tags": [
            "Linked List",
            "Divide and Conquer",
            "Heap (Priority Queue)",
            "Merge Sort"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "continuous-subarray-sum",
          "name": "Continuous Subarray Sum",
          "link": "https://leetcode.com/problems/continuous-subarray-sum",
          "otherCompanies": [
            ["Amazon", 5],
            ["ByteDance", 3],
            ["Google", 2],
            ["Apple", 2],
            ["ByteDance", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 56,
          "tags": ["Array", "Hash Table", "Math", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "add-strings",
          "name": "Add Strings",
          "link": "https://leetcode.com/problems/add-strings",
          "otherCompanies": [
            ["Wayfair", 20],
            ["Microsoft", 9],
            ["Google", 5],
            ["Oracle", 4],
            ["Amazon", 3],
            ["Bloomberg", 3],
            ["Apple", 2]
          ],
          "occurence": 54,
          "tags": ["Math", "String", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "valid-number",
          "name": "Valid Number",
          "link": "https://leetcode.com/problems/valid-number",
          "otherCompanies": [["LinkedIn", 10]],
          "occurence": 53,
          "tags": ["String"],
          "difficulty": "Hard"
        },
        {
          "slug": "binary-search-tree-iterator",
          "name": "Binary Search Tree Iterator",
          "link": "https://leetcode.com/problems/binary-search-tree-iterator",
          "otherCompanies": [
            ["Microsoft", 9],
            ["Amazon", 4],
            ["Bloomberg", 4],
            ["Salesforce", 3],
            ["Google", 2]
          ],
          "occurence": 50,
          "tags": [
            "Stack",
            "Tree",
            "Design",
            "Binary Search Tree",
            "Binary Tree",
            "Iterator"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "diagonal-traverse",
          "name": "Diagonal Traverse",
          "link": "https://leetcode.com/problems/diagonal-traverse",
          "otherCompanies": [
            ["Microsoft", 6],
            ["Google", 2]
          ],
          "occurence": 48,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "group-shifted-strings",
          "name": "Group Shifted Strings",
          "link": "https://leetcode.com/problems/group-shifted-strings",
          "otherCompanies": [["Google", 2]],
          "occurence": 47,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "moving-average-from-data-stream",
          "name": "Moving Average from Data Stream",
          "link": "https://leetcode.com/problems/moving-average-from-data-stream",
          "otherCompanies": [
            ["Spotify", 16],
            ["Google", 4],
            ["Amazon", 4]
          ],
          "occurence": 43,
          "tags": ["Array", "Design", "Queue", "Data Stream"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-all-adjacent-duplicates-in-string",
          "name": "Remove All Adjacent Duplicates In String",
          "link": "https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string",
          "otherCompanies": [["Amazon", 4]],
          "occurence": 40,
          "tags": ["String", "Stack"],
          "difficulty": "Easy"
        },
        {
          "slug": "clone-graph",
          "name": "Clone Graph",
          "link": "https://leetcode.com/problems/clone-graph",
          "otherCompanies": [
            ["Amazon", 8],
            ["Bloomberg", 6],
            ["Google", 5],
            ["Microsoft", 4],
            ["Pinterest", 2]
          ],
          "occurence": 38,
          "tags": [
            "Hash Table",
            "Depth-First Search",
            "Breadth-First Search",
            "Graph"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "subsets",
          "name": "Subsets",
          "link": "https://leetcode.com/problems/subsets",
          "otherCompanies": [
            ["Amazon", 13],
            ["Google", 7],
            ["Bloomberg", 4],
            ["Apple", 3],
            ["Reddit", 3],
            ["Twitter", 3],
            ["Microsoft", 3],
            ["Uber", 2],
            ["Adobe", 2]
          ],
          "occurence": 38,
          "tags": ["Array", "Backtracking", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-swap",
          "name": "Maximum Swap",
          "link": "https://leetcode.com/problems/maximum-swap",
          "otherCompanies": [
            ["ByteDance", 8],
            ["Amazon", 4],
            ["ByteDance", 2]
          ],
          "occurence": 36,
          "tags": ["Math", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-invalid-parentheses",
          "name": "Remove Invalid Parentheses",
          "link": "https://leetcode.com/problems/remove-invalid-parentheses",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 36,
          "tags": ["String", "Backtracking", "Breadth-First Search"],
          "difficulty": "Hard"
        },
        {
          "slug": "accounts-merge",
          "name": "Accounts Merge",
          "link": "https://leetcode.com/problems/accounts-merge",
          "otherCompanies": [
            ["Apple", 4],
            ["Google", 3],
            ["Twitter", 3],
            ["Pinterest", 2],
            ["Amazon", 2],
            ["LinkedIn", 2]
          ],
          "occurence": 34,
          "tags": [
            "Array",
            "String",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "exclusive-time-of-functions",
          "name": "Exclusive Time of Functions",
          "link": "https://leetcode.com/problems/exclusive-time-of-functions",
          "otherCompanies": [
            ["LinkedIn", 8],
            ["Google", 3],
            ["Microsoft", 3],
            ["DoorDash", 2]
          ],
          "occurence": 33,
          "tags": ["Array", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "string-to-integer-atoi",
          "name": "String to Integer (atoi)",
          "link": "https://leetcode.com/problems/string-to-integer-atoi",
          "otherCompanies": [
            ["Microsoft", 16],
            ["Amazon", 9],
            ["Google", 6],
            ["Bloomberg", 5],
            ["Adobe", 4],
            ["Goldman Sachs", 3],
            ["Redfin", 3],
            ["Apple", 2]
          ],
          "occurence": 32,
          "tags": ["String"],
          "difficulty": "Medium"
        },
        {
          "slug": "cutting-ribbons",
          "name": "Cutting Ribbons",
          "link": "https://leetcode.com/problems/cutting-ribbons",
          "otherCompanies": [],
          "occurence": 31,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "sum-root-to-leaf-numbers",
          "name": "Sum Root to Leaf Numbers",
          "link": "https://leetcode.com/problems/sum-root-to-leaf-numbers",
          "otherCompanies": [
            ["Microsoft", 4],
            ["Amazon", 3]
          ],
          "occurence": 31,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "toeplitz-matrix",
          "name": "Toeplitz Matrix",
          "link": "https://leetcode.com/problems/toeplitz-matrix",
          "otherCompanies": [["Bloomberg", 3]],
          "occurence": 30,
          "tags": ["Array", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "squares-of-a-sorted-array",
          "name": "Squares of a Sorted Array",
          "link": "https://leetcode.com/problems/squares-of-a-sorted-array",
          "otherCompanies": [
            ["Amazon", 13],
            ["Google", 5],
            ["Microsoft", 5],
            ["Paypal", 2]
          ],
          "occurence": 29,
          "tags": ["Array", "Two Pointers", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "kth-missing-positive-number",
          "name": "Kth Missing Positive Number",
          "link": "https://leetcode.com/problems/kth-missing-positive-number",
          "otherCompanies": [
            ["ByteDance", 3],
            ["Google", 2],
            ["Amazon", 2],
            ["Microsoft", 2]
          ],
          "occurence": 28,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "max-consecutive-ones-iii",
          "name": "Max Consecutive Ones III",
          "link": "https://leetcode.com/problems/max-consecutive-ones-iii",
          "otherCompanies": [
            ["Google", 3],
            ["Microsoft", 3],
            ["Amazon", 2],
            ["Bloomberg", 2],
            ["Apple", 2],
            ["ByteDance", 2]
          ],
          "occurence": 26,
          "tags": ["Array", "Binary Search", "Sliding Window", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-common-prefix",
          "name": "Longest Common Prefix",
          "link": "https://leetcode.com/problems/longest-common-prefix",
          "otherCompanies": [
            ["Apple", 14],
            ["Google", 12],
            ["Adobe", 11],
            ["Amazon", 9],
            ["Bloomberg", 5],
            ["Microsoft", 5],
            ["Uber", 4],
            ["Quora", 3],
            ["SAP", 3]
          ],
          "occurence": 26,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "3sum-closest",
          "name": "3Sum Closest",
          "link": "https://leetcode.com/problems/3sum-closest",
          "otherCompanies": [
            ["Amazon", 15],
            ["Adobe", 4],
            ["Google", 3],
            ["Apple", 3],
            ["Microsoft", 3],
            ["Goldman Sachs", 2]
          ],
          "occurence": 25,
          "tags": ["Array", "Two Pointers", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "palindromic-substrings",
          "name": "Palindromic Substrings",
          "link": "https://leetcode.com/problems/palindromic-substrings",
          "otherCompanies": [
            ["Twitter", 2],
            ["Expedia", 2]
          ],
          "occurence": 24,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-nth-node-from-end-of-list",
          "name": "Remove Nth Node From End of List",
          "link": "https://leetcode.com/problems/remove-nth-node-from-end-of-list",
          "otherCompanies": [
            ["Amazon", 10],
            ["Microsoft", 6],
            ["Google", 5],
            ["Bloomberg", 3],
            ["Walmart Global Tech", 3],
            ["Apple", 2],
            ["Uber", 2]
          ],
          "occurence": 23,
          "tags": ["Linked List", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "expression-add-operators",
          "name": "Expression Add Operators",
          "link": "https://leetcode.com/problems/expression-add-operators",
          "otherCompanies": [],
          "occurence": 23,
          "tags": ["Math", "String", "Backtracking"],
          "difficulty": "Hard"
        },
        {
          "slug": "shortest-distance-from-all-buildings",
          "name": "Shortest Distance from All Buildings",
          "link": "https://leetcode.com/problems/shortest-distance-from-all-buildings",
          "otherCompanies": [
            ["Microsoft", 7],
            ["Google", 6],
            ["DoorDash", 5]
          ],
          "occurence": 22,
          "tags": ["Array", "Breadth-First Search", "Matrix"],
          "difficulty": "Hard"
        },
        {
          "slug": "word-break-ii",
          "name": "Word Break II",
          "link": "https://leetcode.com/problems/word-break-ii",
          "otherCompanies": [
            ["Amazon", 11],
            ["Bloomberg", 7],
            ["Apple", 4],
            ["Adobe", 4],
            ["Google", 3],
            ["Snapchat", 3],
            ["Microsoft", 3]
          ],
          "occurence": 22,
          "tags": [
            "Hash Table",
            "String",
            "Dynamic Programming",
            "Backtracking",
            "Trie",
            "Memoization"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "find-k-closest-elements",
          "name": "Find K Closest Elements",
          "link": "https://leetcode.com/problems/find-k-closest-elements",
          "otherCompanies": [
            ["Google", 4],
            ["ByteDance", 4],
            ["Amazon", 3],
            ["Bloomberg", 2],
            ["Uber", 2],
            ["Oracle", 2]
          ],
          "occurence": 21,
          "tags": [
            "Array",
            "Two Pointers",
            "Binary Search",
            "Sliding Window",
            "Sorting",
            "Heap (Priority Queue)"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "random-pick-index",
          "name": "Random Pick Index",
          "link": "https://leetcode.com/problems/random-pick-index",
          "otherCompanies": [
            ["Google", 3],
            ["Amazon", 2]
          ],
          "occurence": 21,
          "tags": ["Hash Table", "Math", "Reservoir Sampling", "Randomized"],
          "difficulty": "Medium"
        },
        {
          "slug": "verifying-an-alien-dictionary",
          "name": "Verifying an Alien Dictionary",
          "link": "https://leetcode.com/problems/verifying-an-alien-dictionary",
          "otherCompanies": [
            ["Uber", 3],
            ["Amazon", 2],
            ["LinkedIn", 2]
          ],
          "occurence": 21,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "closest-binary-search-tree-value",
          "name": "Closest Binary Search Tree Value",
          "link": "https://leetcode.com/problems/closest-binary-search-tree-value",
          "otherCompanies": [],
          "occurence": 21,
          "tags": [
            "Binary Search",
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-window-substring",
          "name": "Minimum Window Substring",
          "link": "https://leetcode.com/problems/minimum-window-substring",
          "otherCompanies": [
            ["Amazon", 11],
            ["LinkedIn", 10],
            ["Lyft", 9],
            ["Microsoft", 7],
            ["Airbnb", 6],
            ["Apple", 4],
            ["Adobe", 3],
            ["Snapchat", 2],
            ["Oracle", 2]
          ],
          "occurence": 20,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Hard"
        },
        {
          "slug": "integer-to-english-words",
          "name": "Integer to English Words",
          "link": "https://leetcode.com/problems/integer-to-english-words",
          "otherCompanies": [
            ["Amazon", 19],
            ["Microsoft", 7],
            ["DoorDash", 4],
            ["Expedia", 3],
            ["Salesforce", 3],
            ["Apple", 2],
            ["Booking", 2]
          ],
          "occurence": 20,
          "tags": ["Math", "String", "Recursion"],
          "difficulty": "Hard"
        },
        {
          "slug": "regular-expression-matching",
          "name": "Regular Expression Matching",
          "link": "https://leetcode.com/problems/regular-expression-matching",
          "otherCompanies": [
            ["Microsoft", 11],
            ["Google", 9],
            ["Amazon", 8],
            ["Nvidia", 4],
            ["Bloomberg", 3],
            ["Apple", 2],
            ["Uber", 2],
            ["Adobe", 2]
          ],
          "occurence": 19,
          "tags": ["String", "Dynamic Programming", "Recursion"],
          "difficulty": "Hard"
        },
        {
          "slug": "move-zeroes",
          "name": "Move Zeroes",
          "link": "https://leetcode.com/problems/move-zeroes",
          "otherCompanies": [
            ["Microsoft", 10],
            ["Amazon", 8],
            ["Apple", 8],
            ["Yandex", 6],
            ["Bloomberg", 4],
            ["tcs", 4],
            ["Uber", 2],
            ["IBM", 2],
            ["Expedia", 2],
            ["Adobe", 2],
            ["ByteDance", 2]
          ],
          "occurence": 19,
          "tags": ["Array", "Two Pointers"],
          "difficulty": "Easy"
        },
        {
          "slug": "strobogrammatic-number",
          "name": "Strobogrammatic Number",
          "link": "https://leetcode.com/problems/strobogrammatic-number",
          "otherCompanies": [["Uber", 2]],
          "occurence": 19,
          "tags": ["Hash Table", "Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "kth-smallest-element-in-a-sorted-matrix",
          "name": "Kth Smallest Element in a Sorted Matrix",
          "link": "https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix",
          "otherCompanies": [
            ["Amazon", 6],
            ["Google", 4],
            ["Microsoft", 4],
            ["Bloomberg", 2],
            ["Uber", 2],
            ["Adobe", 2],
            ["ByteDance", 2]
          ],
          "occurence": 18,
          "tags": [
            "Array",
            "Binary Search",
            "Sorting",
            "Heap (Priority Queue)",
            "Matrix"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-largest-value-in-each-tree-row",
          "name": "Find Largest Value in Each Tree Row",
          "link": "https://leetcode.com/problems/find-largest-value-in-each-tree-row",
          "otherCompanies": [],
          "occurence": 18,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "daily-temperatures",
          "name": "Daily Temperatures",
          "link": "https://leetcode.com/problems/daily-temperatures",
          "otherCompanies": [
            ["Amazon", 10],
            ["Microsoft", 5],
            ["C3 IoT", 3],
            ["Uber", 2],
            ["Salesforce", 2]
          ],
          "occurence": 17,
          "tags": ["Array", "Stack", "Monotonic Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "alien-dictionary",
          "name": "Alien Dictionary",
          "link": "https://leetcode.com/problems/alien-dictionary",
          "otherCompanies": [
            ["Airbnb", 14],
            ["Amazon", 10],
            ["Google", 7],
            ["Bloomberg", 4],
            ["Uber", 3],
            ["Microsoft", 3],
            ["Pinterest", 2],
            ["Snapchat", 2]
          ],
          "occurence": 16,
          "tags": [
            "Array",
            "String",
            "Depth-First Search",
            "Breadth-First Search",
            "Graph",
            "Topological Sort"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "palindrome-linked-list",
          "name": "Palindrome Linked List",
          "link": "https://leetcode.com/problems/palindrome-linked-list",
          "otherCompanies": [
            ["Amazon", 16],
            ["Microsoft", 10],
            ["Apple", 6],
            ["Google", 3],
            ["Bloomberg", 3],
            ["Yahoo", 2],
            ["Intuit", 2],
            ["ServiceNow", 2],
            ["Adobe", 2],
            ["VMware", 2]
          ],
          "occurence": 16,
          "tags": ["Linked List", "Two Pointers", "Stack", "Recursion"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-duplicates-from-sorted-array",
          "name": "Remove Duplicates from Sorted Array",
          "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-array",
          "otherCompanies": [
            ["Amazon", 9],
            ["Adobe", 7],
            ["Microsoft", 6],
            ["LinkedIn", 5],
            ["Google", 4],
            ["Bloomberg", 4],
            ["Apple", 4],
            ["VMware", 2]
          ],
          "occurence": 16,
          "tags": ["Array", "Two Pointers"],
          "difficulty": "Easy"
        },
        {
          "slug": "generate-parentheses",
          "name": "Generate Parentheses",
          "link": "https://leetcode.com/problems/generate-parentheses",
          "otherCompanies": [
            ["Amazon", 15],
            ["Microsoft", 13],
            ["Apple", 9],
            ["Google", 4],
            ["Adobe", 4],
            ["Bloomberg", 3],
            ["Uber", 3],
            ["Oracle", 3],
            ["C3 IoT", 3],
            ["Walmart Global Tech", 3],
            ["Tesla", 2],
            ["ByteDance", 2]
          ],
          "occurence": 16,
          "tags": ["String", "Dynamic Programming", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-tic-tac-toe",
          "name": "Design Tic-Tac-Toe",
          "link": "https://leetcode.com/problems/design-tic-tac-toe",
          "otherCompanies": [
            ["Amazon", 15],
            ["Microsoft", 7],
            ["Google", 4],
            ["Adobe", 2]
          ],
          "occurence": 15,
          "tags": ["Array", "Hash Table", "Design", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "walls-and-gates",
          "name": "Walls and Gates",
          "link": "https://leetcode.com/problems/walls-and-gates",
          "otherCompanies": [
            ["DoorDash", 11],
            ["Google", 5],
            ["ByteDance", 5],
            ["Amazon", 4],
            ["Microsoft", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 15,
          "tags": ["Array", "Breadth-First Search", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "contains-duplicate-ii",
          "name": "Contains Duplicate II",
          "link": "https://leetcode.com/problems/contains-duplicate-ii",
          "otherCompanies": [
            ["Google", 3],
            ["Adobe", 3],
            ["Amazon", 2],
            ["Bloomberg", 2],
            ["Uber", 2],
            ["Microsoft", 2]
          ],
          "occurence": 15,
          "tags": ["Array", "Hash Table", "Sliding Window"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-pivot-index",
          "name": "Find Pivot Index",
          "link": "https://leetcode.com/problems/find-pivot-index",
          "otherCompanies": [
            ["Goldman Sachs", 9],
            ["Amazon", 3],
            ["Apple", 3],
            ["Google", 2],
            ["Expedia", 2],
            ["Microsoft", 2],
            ["Adobe", 2],
            ["Cisco", 2]
          ],
          "occurence": 14,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Easy"
        },
        {
          "slug": "multiply-strings",
          "name": "Multiply Strings",
          "link": "https://leetcode.com/problems/multiply-strings",
          "otherCompanies": [
            ["Microsoft", 12],
            ["Google", 5],
            ["Amazon", 5],
            ["Two Sigma", 4],
            ["Adobe", 2]
          ],
          "occurence": 14,
          "tags": ["Math", "String", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "search-a-2d-matrix",
          "name": "Search a 2D Matrix",
          "link": "https://leetcode.com/problems/search-a-2d-matrix",
          "otherCompanies": [
            ["Amazon", 12],
            ["Microsoft", 7],
            ["Bloomberg", 5],
            ["Apple", 4],
            ["Adobe", 3],
            ["Goldman Sachs", 2],
            ["Oracle", 2],
            ["Nvidia", 2],
            ["Salesforce", 2]
          ],
          "occurence": 14,
          "tags": ["Array", "Binary Search", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "add-bold-tag-in-string",
          "name": "Add Bold Tag in String",
          "link": "https://leetcode.com/problems/add-bold-tag-in-string",
          "otherCompanies": [],
          "occurence": 13,
          "tags": ["Array", "Hash Table", "String", "Trie", "String Matching"],
          "difficulty": "Medium"
        },
        {
          "slug": "symmetric-tree",
          "name": "Symmetric Tree",
          "link": "https://leetcode.com/problems/symmetric-tree",
          "otherCompanies": [
            ["Amazon", 8],
            ["Google", 5],
            ["LinkedIn", 5],
            ["Microsoft", 5],
            ["Bloomberg", 3],
            ["Uber", 2],
            ["Adobe", 2]
          ],
          "occurence": 12,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "monotonic-array",
          "name": "Monotonic Array",
          "link": "https://leetcode.com/problems/monotonic-array",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 12,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "palindrome-permutation",
          "name": "Palindrome Permutation",
          "link": "https://leetcode.com/problems/palindrome-permutation",
          "otherCompanies": [],
          "occurence": 12,
          "tags": ["Hash Table", "String", "Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "partition-equal-subset-sum",
          "name": "Partition Equal Subset Sum",
          "link": "https://leetcode.com/problems/partition-equal-subset-sum",
          "otherCompanies": [
            ["Microsoft", 5],
            ["Amazon", 4],
            ["Google", 2],
            ["Apple", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 11,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "convert-sorted-list-to-binary-search-tree",
          "name": "Convert Sorted List to Binary Search Tree",
          "link": "https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree",
          "otherCompanies": [
            ["Amazon", 7],
            ["Microsoft", 3],
            ["Google", 2]
          ],
          "occurence": 11,
          "tags": [
            "Linked List",
            "Divide and Conquer",
            "Tree",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "plus-one",
          "name": "Plus One",
          "link": "https://leetcode.com/problems/plus-one",
          "otherCompanies": [
            ["Google", 5],
            ["Amazon", 5],
            ["Apple", 2],
            ["Adobe", 2],
            ["ByteDance", 2]
          ],
          "occurence": 11,
          "tags": ["Array", "Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "divide-two-integers",
          "name": "Divide Two Integers",
          "link": "https://leetcode.com/problems/divide-two-integers",
          "otherCompanies": [
            ["Amazon", 9],
            ["Google", 5],
            ["Microsoft", 3],
            ["Yahoo", 2],
            ["Bloomberg", 2],
            ["Adobe", 2]
          ],
          "occurence": 11,
          "tags": ["Math", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "balance-a-binary-search-tree",
          "name": "Balance a Binary Search Tree",
          "link": "https://leetcode.com/problems/balance-a-binary-search-tree",
          "otherCompanies": [],
          "occurence": 11,
          "tags": [
            "Divide and Conquer",
            "Greedy",
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "angle-between-hands-of-a-clock",
          "name": "Angle Between Hands of a Clock",
          "link": "https://leetcode.com/problems/angle-between-hands-of-a-clock",
          "otherCompanies": [
            ["Microsoft", 5],
            ["Amazon", 3],
            ["Oracle", 2]
          ],
          "occurence": 11,
          "tags": ["Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "check-completeness-of-a-binary-tree",
          "name": "Check Completeness of a Binary Tree",
          "link": "https://leetcode.com/problems/check-completeness-of-a-binary-tree",
          "otherCompanies": [],
          "occurence": 11,
          "tags": ["Tree", "Breadth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-size-subarray-sum-equals-k",
          "name": "Maximum Size Subarray Sum Equals k",
          "link": "https://leetcode.com/problems/maximum-size-subarray-sum-equals-k",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 11,
          "tags": ["Array", "Hash Table", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "target-sum",
          "name": "Target Sum",
          "link": "https://leetcode.com/problems/target-sum",
          "otherCompanies": [
            ["Amazon", 7],
            ["Google", 2],
            ["Bloomberg", 2],
            ["Adobe", 2]
          ],
          "occurence": 10,
          "tags": ["Array", "Dynamic Programming", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "island-perimeter",
          "name": "Island Perimeter",
          "link": "https://leetcode.com/problems/island-perimeter",
          "otherCompanies": [
            ["Google", 3],
            ["Amazon", 2]
          ],
          "occurence": 10,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Matrix"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "range-sum-query-2d-immutable",
          "name": "Range Sum Query 2D - Immutable",
          "link": "https://leetcode.com/problems/range-sum-query-2d-immutable",
          "otherCompanies": [
            ["Lyft", 4],
            ["Amazon", 3],
            ["Google", 2],
            ["Samsung", 2]
          ],
          "occurence": 10,
          "tags": ["Array", "Design", "Matrix", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "add-binary",
          "name": "Add Binary",
          "link": "https://leetcode.com/problems/add-binary",
          "otherCompanies": [
            ["Amazon", 6],
            ["Snapchat", 3],
            ["Google", 2],
            ["Uber", 2],
            ["Adobe", 2]
          ],
          "occurence": 10,
          "tags": ["Math", "String", "Bit Manipulation", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "sparse-matrix-multiplication",
          "name": "Sparse Matrix Multiplication",
          "link": "https://leetcode.com/problems/sparse-matrix-multiplication",
          "otherCompanies": [
            ["Snapchat", 5],
            ["Amazon", 2],
            ["Databricks", 2]
          ],
          "occurence": 10,
          "tags": ["Array", "Hash Table", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "flatten-binary-tree-to-linked-list",
          "name": "Flatten Binary Tree to Linked List",
          "link": "https://leetcode.com/problems/flatten-binary-tree-to-linked-list",
          "otherCompanies": [
            ["Amazon", 6],
            ["Microsoft", 6],
            ["Salesforce", 2]
          ],
          "occurence": 10,
          "tags": [
            "Linked List",
            "Stack",
            "Tree",
            "Depth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "sliding-window-median",
          "name": "Sliding Window Median",
          "link": "https://leetcode.com/problems/sliding-window-median",
          "otherCompanies": [
            ["Spotify", 4],
            ["Microsoft", 3],
            ["HBO", 2]
          ],
          "occurence": 9,
          "tags": [
            "Array",
            "Hash Table",
            "Sliding Window",
            "Heap (Priority Queue)"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "swap-nodes-in-pairs",
          "name": "Swap Nodes in Pairs",
          "link": "https://leetcode.com/problems/swap-nodes-in-pairs",
          "otherCompanies": [
            ["Amazon", 8],
            ["Microsoft", 7],
            ["Bloomberg", 2],
            ["Apple", 2],
            ["Adobe", 2]
          ],
          "occurence": 9,
          "tags": ["Linked List", "Recursion"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-size-subarray-sum",
          "name": "Minimum Size Subarray Sum",
          "link": "https://leetcode.com/problems/minimum-size-subarray-sum",
          "otherCompanies": [
            ["Amazon", 6],
            ["Microsoft", 4],
            ["Google", 2],
            ["Bloomberg", 2],
            ["Apple", 2],
            ["Arcesium", 2],
            ["Goldman Sachs", 2]
          ],
          "occurence": 8,
          "tags": ["Array", "Binary Search", "Sliding Window", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "lowest-common-ancestor-of-a-binary-tree-ii",
          "name": "Lowest Common Ancestor of a Binary Tree II",
          "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree-ii",
          "otherCompanies": [],
          "occurence": 8,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "missing-ranges",
          "name": "Missing Ranges",
          "link": "https://leetcode.com/problems/missing-ranges",
          "otherCompanies": [],
          "occurence": 8,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-minimum-in-rotated-sorted-array",
          "name": "Find Minimum in Rotated Sorted Array",
          "link": "https://leetcode.com/problems/find-minimum-in-rotated-sorted-array",
          "otherCompanies": [
            ["Amazon", 8],
            ["Microsoft", 7],
            ["Adobe", 3],
            ["Uber", 2],
            ["Goldman Sachs", 2],
            ["Oracle", 2]
          ],
          "occurence": 8,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "path-sum",
          "name": "Path Sum",
          "link": "https://leetcode.com/problems/path-sum",
          "otherCompanies": [
            ["Microsoft", 7],
            ["Amazon", 2],
            ["Oracle", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 8,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "delete-nodes-and-return-forest",
          "name": "Delete Nodes And Return Forest",
          "link": "https://leetcode.com/problems/delete-nodes-and-return-forest",
          "otherCompanies": [
            ["Google", 6],
            ["Intuit", 2],
            ["Microsoft", 2]
          ],
          "occurence": 7,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "add-and-search-word-data-structure-design",
          "name": "Add and Search Word - Data structure design",
          "link": "https://leetcode.com/problems/add-and-search-word-data-structure-design",
          "otherCompanies": [
            ["Amazon", 7],
            ["Microsoft", 4],
            ["Google", 2],
            ["Apple", 2],
            ["Nvidia", 2],
            ["ByteDance", 2]
          ],
          "occurence": 7,
          "tags": ["String", "Depth-First Search", "Design", "Trie"],
          "difficulty": "Medium"
        },
        {
          "slug": "one-edit-distance",
          "name": "One Edit Distance",
          "link": "https://leetcode.com/problems/one-edit-distance",
          "otherCompanies": [
            ["Google", 5],
            ["Yahoo", 2]
          ],
          "occurence": 7,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "reverse-linked-list-ii",
          "name": "Reverse Linked List II",
          "link": "https://leetcode.com/problems/reverse-linked-list-ii",
          "otherCompanies": [
            ["Amazon", 5],
            ["Microsoft", 5],
            ["Google", 3],
            ["Apple", 2],
            ["Adobe", 2]
          ],
          "occurence": 7,
          "tags": ["Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-average-subarray-i",
          "name": "Maximum Average Subarray I",
          "link": "https://leetcode.com/problems/maximum-average-subarray-i",
          "otherCompanies": [],
          "occurence": 7,
          "tags": ["Array", "Sliding Window"],
          "difficulty": "Easy"
        },
        {
          "slug": "construct-binary-tree-from-string",
          "name": "Construct Binary Tree from String",
          "link": "https://leetcode.com/problems/construct-binary-tree-from-string",
          "otherCompanies": [],
          "occurence": 7,
          "tags": ["String", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-all-numbers-disappeared-in-an-array",
          "name": "Find All Numbers Disappeared in an Array",
          "link": "https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array",
          "otherCompanies": [
            ["Amazon", 5],
            ["Apple", 2],
            ["Microsoft", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Easy"
        },
        {
          "slug": "non-overlapping-intervals",
          "name": "Non-overlapping Intervals",
          "link": "https://leetcode.com/problems/non-overlapping-intervals",
          "otherCompanies": [
            ["Amazon", 4],
            ["Microsoft", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Dynamic Programming", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "largest-bst-subtree",
          "name": "Largest BST Subtree",
          "link": "https://leetcode.com/problems/largest-bst-subtree",
          "otherCompanies": [
            ["Oracle", 2],
            ["Cohesity", 2]
          ],
          "occurence": 7,
          "tags": [
            "Dynamic Programming",
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "merge-two-binary-trees",
          "name": "Merge Two Binary Trees",
          "link": "https://leetcode.com/problems/merge-two-binary-trees",
          "otherCompanies": [
            ["Yahoo", 3],
            ["Amazon", 3],
            ["Uber", 2]
          ],
          "occurence": 6,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "odd-even-linked-list",
          "name": "Odd Even Linked List",
          "link": "https://leetcode.com/problems/odd-even-linked-list",
          "otherCompanies": [
            ["Amazon", 4],
            ["Adobe", 4],
            ["eBay", 2],
            ["ByteDance", 2]
          ],
          "occurence": 6,
          "tags": ["Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "sort-list",
          "name": "Sort List",
          "link": "https://leetcode.com/problems/sort-list",
          "otherCompanies": [
            ["Amazon", 3],
            ["Microsoft", 3],
            ["ByteDance", 3],
            ["Apple", 2]
          ],
          "occurence": 6,
          "tags": [
            "Linked List",
            "Two Pointers",
            "Divide and Conquer",
            "Sorting",
            "Merge Sort"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "all-elements-in-two-binary-search-trees",
          "name": "All Elements in Two Binary Search Trees",
          "link": "https://leetcode.com/problems/all-elements-in-two-binary-search-trees",
          "otherCompanies": [
            ["Google", 2],
            ["Amazon", 2],
            ["Bloomberg", 2]
          ],
          "occurence": 5,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Sorting",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "element-appearing-more-than-25-in-sorted-array",
          "name": "Element Appearing More Than 25% In Sorted Array",
          "link": "https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array",
          "otherCompanies": [["Google", 2]],
          "occurence": 5,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "invert-binary-tree",
          "name": "Invert Binary Tree",
          "link": "https://leetcode.com/problems/invert-binary-tree",
          "otherCompanies": [
            ["Amazon", 5],
            ["Google", 3],
            ["Apple", 3],
            ["Uber", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 5,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "combinations",
          "name": "Combinations",
          "link": "https://leetcode.com/problems/combinations",
          "otherCompanies": [
            ["Google", 5],
            ["Amazon", 2],
            ["Microsoft", 2]
          ],
          "occurence": 5,
          "tags": ["Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-and-say",
          "name": "Count and Say",
          "link": "https://leetcode.com/problems/count-and-say",
          "otherCompanies": [
            ["Google", 3],
            ["Amazon", 2],
            ["Apple", 2],
            ["Adobe", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 5,
          "tags": ["String"],
          "difficulty": "Medium"
        },
        {
          "slug": "process-restricted-friend-requests",
          "name": "Process Restricted Friend Requests",
          "link": "https://leetcode.com/problems/process-restricted-friend-requests",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Union Find", "Graph"],
          "difficulty": "Hard"
        },
        {
          "slug": "goat-latin",
          "name": "Goat Latin",
          "link": "https://leetcode.com/problems/goat-latin",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "average-of-levels-in-binary-tree",
          "name": "Average of Levels in Binary Tree",
          "link": "https://leetcode.com/problems/average-of-levels-in-binary-tree",
          "otherCompanies": [
            ["Amazon", 4],
            ["Microsoft", 2]
          ],
          "occurence": 5,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "insert-delete-getrandom-o1-duplicates-allowed",
          "name": "Insert Delete GetRandom O(1) - Duplicates allowed",
          "link": "https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed",
          "otherCompanies": [
            ["LinkedIn", 4],
            ["Affirm", 3]
          ],
          "occurence": 5,
          "tags": ["Array", "Hash Table", "Math", "Design", "Randomized"],
          "difficulty": "Hard"
        },
        {
          "slug": "rotated-digits",
          "name": "Rotated Digits",
          "link": "https://leetcode.com/problems/rotated-digits",
          "otherCompanies": [["Google", 2]],
          "occurence": 4,
          "tags": ["Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "strobogrammatic-number-ii",
          "name": "Strobogrammatic Number II",
          "link": "https://leetcode.com/problems/strobogrammatic-number-ii",
          "otherCompanies": [
            ["Uber", 3],
            ["Google", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "String", "Recursion"],
          "difficulty": "Medium"
        },
        {
          "slug": "score-of-parentheses",
          "name": "Score of Parentheses",
          "link": "https://leetcode.com/problems/score-of-parentheses",
          "otherCompanies": [
            ["Amazon", 4],
            ["Bloomberg", 3],
            ["Infosys", 2],
            ["ByteDance", 2]
          ],
          "occurence": 4,
          "tags": ["String", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-kth-largest-integer-in-the-array",
          "name": "Find the Kth Largest Integer in the Array",
          "link": "https://leetcode.com/problems/find-the-kth-largest-integer-in-the-array",
          "otherCompanies": [],
          "occurence": 4,
          "tags": [
            "Array",
            "String",
            "Divide and Conquer",
            "Sorting",
            "Heap (Priority Queue)",
            "Quickselect"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-tree-pruning",
          "name": "Binary Tree Pruning",
          "link": "https://leetcode.com/problems/binary-tree-pruning",
          "otherCompanies": [["Apple", 2]],
          "occurence": 4,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-continuous-increasing-subsequence",
          "name": "Longest Continuous Increasing Subsequence",
          "link": "https://leetcode.com/problems/longest-continuous-increasing-subsequence",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-depth-of-binary-tree",
          "name": "Minimum Depth of Binary Tree",
          "link": "https://leetcode.com/problems/minimum-depth-of-binary-tree",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 4,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "combination-sum-ii",
          "name": "Combination Sum II",
          "link": "https://leetcode.com/problems/combination-sum-ii",
          "otherCompanies": [
            ["Amazon", 4],
            ["Reddit", 3],
            ["Bloomberg", 2],
            ["Oracle", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "rank-transform-of-an-array",
          "name": "Rank Transform of an Array",
          "link": "https://leetcode.com/problems/rank-transform-of-an-array",
          "otherCompanies": [["Google", 2]],
          "occurence": 3,
          "tags": ["Array", "Hash Table", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "uncommon-words-from-two-sentences",
          "name": "Uncommon Words from Two Sentences",
          "link": "https://leetcode.com/problems/uncommon-words-from-two-sentences",
          "otherCompanies": [["Google", 2]],
          "occurence": 3,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "implement-magic-dictionary",
          "name": "Implement Magic Dictionary",
          "link": "https://leetcode.com/problems/implement-magic-dictionary",
          "otherCompanies": [["Google", 2]],
          "occurence": 3,
          "tags": ["Hash Table", "String", "Design", "Trie"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-tree-longest-consecutive-sequence",
          "name": "Binary Tree Longest Consecutive Sequence",
          "link": "https://leetcode.com/problems/binary-tree-longest-consecutive-sequence",
          "otherCompanies": [
            ["Google", 2],
            ["Amazon", 2]
          ],
          "occurence": 3,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "unique-word-abbreviation",
          "name": "Unique Word Abbreviation",
          "link": "https://leetcode.com/problems/unique-word-abbreviation",
          "otherCompanies": [["Google", 1]],
          "occurence": 3,
          "tags": ["Array", "Hash Table", "String", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "trim-a-binary-search-tree",
          "name": "Trim a Binary Search Tree",
          "link": "https://leetcode.com/problems/trim-a-binary-search-tree",
          "otherCompanies": [
            ["Amazon", 3],
            ["Yahoo", 2],
            ["Microsoft", 2]
          ],
          "occurence": 3,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "k-radius-subarray-averages",
          "name": "K Radius Subarray Averages",
          "link": "https://leetcode.com/problems/k-radius-subarray-averages",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-operations-to-make-a-uni-value-grid",
          "name": "Minimum Operations to Make a Uni-Value Grid",
          "link": "https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Math", "Sorting", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-middle-index-in-array",
          "name": "Find the Middle Index in Array",
          "link": "https://leetcode.com/problems/find-the-middle-index-in-array",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Easy"
        },
        {
          "slug": "swapping-nodes-in-a-linked-list",
          "name": "Swapping Nodes in a Linked List",
          "link": "https://leetcode.com/problems/swapping-nodes-in-a-linked-list",
          "otherCompanies": [
            ["Amazon", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 3,
          "tags": ["Linked List", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "intersection-of-three-sorted-arrays",
          "name": "Intersection of Three Sorted Arrays",
          "link": "https://leetcode.com/problems/intersection-of-three-sorted-arrays",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Hash Table", "Binary Search", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-level-sum-of-a-binary-tree",
          "name": "Maximum Level Sum of a Binary Tree",
          "link": "https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "two-sum-less-than-k",
          "name": "Two Sum Less Than K",
          "link": "https://leetcode.com/problems/two-sum-less-than-k",
          "otherCompanies": [["Amazon", 3]],
          "occurence": 3,
          "tags": ["Array", "Two Pointers", "Binary Search", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "closest-leaf-in-a-binary-tree",
          "name": "Closest Leaf in a Binary Tree",
          "link": "https://leetcode.com/problems/closest-leaf-in-a-binary-tree",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-k-th-smallest-pair-distance",
          "name": "Find K-th Smallest Pair Distance",
          "link": "https://leetcode.com/problems/find-k-th-smallest-pair-distance",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Two Pointers", "Binary Search", "Sorting"],
          "difficulty": "Hard"
        },
        {
          "slug": "subarray-product-less-than-k",
          "name": "Subarray Product Less Than K",
          "link": "https://leetcode.com/problems/subarray-product-less-than-k",
          "otherCompanies": [
            ["Amazon", 3],
            ["Goldman Sachs", 2]
          ],
          "occurence": 3,
          "tags": ["Array", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "stickers-to-spell-word",
          "name": "Stickers to Spell Word",
          "link": "https://leetcode.com/problems/stickers-to-spell-word",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Array",
            "String",
            "Dynamic Programming",
            "Backtracking",
            "Bit Manipulation",
            "Bitmask"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "maximum-sum-of-3-non-overlapping-subarrays",
          "name": "Maximum Sum of 3 Non-Overlapping Subarrays",
          "link": "https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "task-scheduler",
          "name": "Task Scheduler",
          "link": "https://leetcode.com/problems/task-scheduler",
          "otherCompanies": [
            ["Amazon", 3],
            ["Uber", 2],
            ["Rubrik", 2],
            ["Microsoft", 2]
          ],
          "occurence": 3,
          "tags": [
            "Array",
            "Hash Table",
            "Greedy",
            "Sorting",
            "Heap (Priority Queue)",
            "Counting"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "split-array-with-equal-sum",
          "name": "Split Array with Equal Sum",
          "link": "https://leetcode.com/problems/split-array-with-equal-sum",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Hard"
        },
        {
          "slug": "convert-bst-to-greater-tree",
          "name": "Convert BST to Greater Tree",
          "link": "https://leetcode.com/problems/convert-bst-to-greater-tree",
          "otherCompanies": [
            ["Amazon", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 3,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "queue-reconstruction-by-height",
          "name": "Queue Reconstruction by Height",
          "link": "https://leetcode.com/problems/queue-reconstruction-by-height",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Array",
            "Greedy",
            "Binary Indexed Tree",
            "Segment Tree",
            "Sorting"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "integer-break",
          "name": "Integer Break",
          "link": "https://leetcode.com/problems/integer-break",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "encode-and-decode-strings",
          "name": "Encode and Decode Strings",
          "link": "https://leetcode.com/problems/encode-and-decode-strings",
          "otherCompanies": [["LinkedIn", 2]],
          "occurence": 3,
          "tags": ["Array", "String", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "ugly-number",
          "name": "Ugly Number",
          "link": "https://leetcode.com/problems/ugly-number",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "subsets-ii",
          "name": "Subsets II",
          "link": "https://leetcode.com/problems/subsets-ii",
          "otherCompanies": [
            ["Amazon", 2],
            ["Bloomberg", 2],
            ["Adobe", 2]
          ],
          "occurence": 3,
          "tags": ["Array", "Backtracking", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "sentence-similarity",
          "name": "Sentence Similarity",
          "link": "https://leetcode.com/problems/sentence-similarity",
          "otherCompanies": [["Google", 1]],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "repeated-substring-pattern",
          "name": "Repeated Substring Pattern",
          "link": "https://leetcode.com/problems/repeated-substring-pattern",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["String", "String Matching"],
          "difficulty": "Easy"
        },
        {
          "slug": "path-sum-iv",
          "name": "Path Sum IV",
          "link": "https://leetcode.com/problems/path-sum-iv",
          "otherCompanies": [["Alibaba", 1]],
          "occurence": 2,
          "tags": ["Array", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-pairs-of-strings-with-concatenation-equal-to-target",
          "name": "Number of Pairs of Strings With Concatenation Equal to Target",
          "link": "https://leetcode.com/problems/number-of-pairs-of-strings-with-concatenation-equal-to-target",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-one-element-to-make-the-array-strictly-increasing",
          "name": "Remove One Element to Make the Array Strictly Increasing",
          "link": "https://leetcode.com/problems/remove-one-element-to-make-the-array-strictly-increasing",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-one-string-swap-can-make-strings-equal",
          "name": "Check if One String Swap Can Make Strings Equal",
          "link": "https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-unique-elements",
          "name": "Sum of Unique Elements",
          "link": "https://leetcode.com/problems/sum-of-unique-elements",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-array-formation-through-concatenation",
          "name": "Check Array Formation Through Concatenation",
          "link": "https://leetcode.com/problems/check-array-formation-through-concatenation",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Easy"
        },
        {
          "slug": "clone-binary-tree-with-random-pointer",
          "name": "Clone Binary Tree With Random Pointer",
          "link": "https://leetcode.com/problems/clone-binary-tree-with-random-pointer",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Hash Table",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "validate-binary-tree-nodes",
          "name": "Validate Binary Tree Nodes",
          "link": "https://leetcode.com/problems/validate-binary-tree-nodes",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "count-negative-numbers-in-a-sorted-matrix",
          "name": "Count Negative Numbers in a Sorted Matrix",
          "link": "https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Binary Search", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "replace-elements-with-greatest-element-on-right-side",
          "name": "Replace Elements with Greatest Element on Right Side",
          "link": "https://leetcode.com/problems/replace-elements-with-greatest-element-on-right-side",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-a-number-is-majority-element-in-a-sorted-array",
          "name": "Check If a Number Is Majority Element in a Sorted Array",
          "link": "https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array",
          "otherCompanies": [["Salesforce", 1]],
          "occurence": 2,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "binary-search-tree-to-greater-sum-tree",
          "name": "Binary Search Tree to Greater Sum Tree",
          "link": "https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "add-to-array-form-of-integer",
          "name": "Add to Array-Form of Integer",
          "link": "https://leetcode.com/problems/add-to-array-form-of-integer",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "increasing-order-search-tree",
          "name": "Increasing Order Search Tree",
          "link": "https://leetcode.com/problems/increasing-order-search-tree",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Stack",
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "advantage-shuffle",
          "name": "Advantage Shuffle",
          "link": "https://leetcode.com/problems/advantage-shuffle",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Two Pointers", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "replace-words",
          "name": "Replace Words",
          "link": "https://leetcode.com/problems/replace-words",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String", "Trie"],
          "difficulty": "Medium"
        },
        {
          "slug": "construct-string-from-binary-tree",
          "name": "Construct String from Binary Tree",
          "link": "https://leetcode.com/problems/construct-string-from-binary-tree",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-two-integers",
          "name": "Sum of Two Integers",
          "link": "https://leetcode.com/problems/sum-of-two-integers",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "range-sum-query-immutable",
          "name": "Range Sum Query - Immutable",
          "link": "https://leetcode.com/problems/range-sum-query-immutable",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Design", "Prefix Sum"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-gap",
          "name": "Maximum Gap",
          "link": "https://leetcode.com/problems/maximum-gap",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Sorting", "Bucket Sort", "Radix Sort"],
          "difficulty": "Hard"
        },
        {
          "slug": "count-hills-and-valleys-in-an-array",
          "name": "Count Hills and Valleys in an Array",
          "link": "https://leetcode.com/problems/count-hills-and-valleys-in-an-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "faulty-sensor",
          "name": "Faulty Sensor",
          "link": "https://leetcode.com/problems/faulty-sensor",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Two Pointers"],
          "difficulty": "Easy"
        },
        {
          "slug": "apply-discount-every-n-orders",
          "name": "Apply Discount Every n Orders",
          "link": "https://leetcode.com/problems/apply-discount-every-n-orders",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "moving-stones-until-consecutive",
          "name": "Moving Stones Until Consecutive",
          "link": "https://leetcode.com/problems/moving-stones-until-consecutive",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Brainteaser"],
          "difficulty": "Medium"
        },
        {
          "slug": "groups-of-special-equivalent-strings",
          "name": "Groups of Special-Equivalent Strings",
          "link": "https://leetcode.com/problems/groups-of-special-equivalent-strings",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-corner-rectangles",
          "name": "Number Of Corner Rectangles",
          "link": "https://leetcode.com/problems/number-of-corner-rectangles",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Microsoft",
      "problems": [
        {
          "slug": "sign-of-the-product-of-an-array",
          "name": "Sign of the Product of an Array",
          "link": "https://leetcode.com/problems/sign-of-the-product-of-an-array",
          "otherCompanies": [],
          "occurence": 45,
          "tags": ["Array", "Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "reverse-words-in-a-string",
          "name": "Reverse Words in a String",
          "link": "https://leetcode.com/problems/reverse-words-in-a-string",
          "otherCompanies": [
            ["Apple", 3],
            ["Google", 2],
            ["Amazon", 2],
            ["LinkedIn", 2],
            ["Visa", 2]
          ],
          "occurence": 34,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "spiral-matrix",
          "name": "Spiral Matrix",
          "link": "https://leetcode.com/problems/spiral-matrix",
          "otherCompanies": [
            ["Amazon", 13],
            ["Apple", 11],
            ["Facebook", 10],
            ["Google", 8],
            ["LiveRamp", 3],
            ["Adobe", 3],
            ["Uber", 2],
            ["Zillow", 2]
          ],
          "occurence": 26,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-n-unique-integers-sum-up-to-zero",
          "name": "Find N Unique Integers Sum up to Zero",
          "link": "https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero",
          "otherCompanies": [],
          "occurence": 22,
          "tags": ["Array", "Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "cinema-seat-allocation",
          "name": "Cinema Seat Allocation",
          "link": "https://leetcode.com/problems/cinema-seat-allocation",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 17,
          "tags": ["Array", "Hash Table", "Greedy", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "wildcard-matching",
          "name": "Wildcard Matching",
          "link": "https://leetcode.com/problems/wildcard-matching",
          "otherCompanies": [
            ["Amazon", 5],
            ["Google", 4],
            ["Facebook", 2],
            ["Coursera", 2],
            ["Uber", 2]
          ],
          "occurence": 14,
          "tags": ["String", "Dynamic Programming", "Greedy", "Recursion"],
          "difficulty": "Hard"
        },
        {
          "slug": "missing-number",
          "name": "Missing Number",
          "link": "https://leetcode.com/problems/missing-number",
          "otherCompanies": [
            ["Amazon", 8],
            ["Facebook", 6],
            ["Apple", 3],
            ["Adobe", 3],
            ["VMware", 2],
            ["Nvidia", 2],
            ["Salesforce", 2]
          ],
          "occurence": 13,
          "tags": [
            "Array",
            "Hash Table",
            "Math",
            "Binary Search",
            "Bit Manipulation",
            "Sorting"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "lfu-cache",
          "name": "LFU Cache",
          "link": "https://leetcode.com/problems/lfu-cache",
          "otherCompanies": [
            ["Amazon", 8],
            ["Google", 4],
            ["Snapchat", 3],
            ["Apple", 2],
            ["LinkedIn", 2],
            ["Oracle", 2],
            ["VMware", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 11,
          "tags": ["Hash Table", "Linked List", "Design", "Doubly-Linked List"],
          "difficulty": "Hard"
        },
        {
          "slug": "inorder-successor-in-bst",
          "name": "Inorder Successor In BST",
          "link": "https://leetcode.com/problems/inorder-successor-in-bst",
          "otherCompanies": [
            ["Facebook", 6],
            ["Google", 3],
            ["Adobe", 2]
          ],
          "occurence": 11,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "count-good-nodes-in-binary-tree",
          "name": "Count Good Nodes in Binary Tree",
          "link": "https://leetcode.com/problems/count-good-nodes-in-binary-tree",
          "otherCompanies": [["Salesforce", 2]],
          "occurence": 11,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "sort-colors",
          "name": "Sort Colors",
          "link": "https://leetcode.com/problems/sort-colors",
          "otherCompanies": [
            ["Amazon", 8],
            ["Grab", 3],
            ["Adobe", 3],
            ["VMware", 3],
            ["Nvidia", 3],
            ["Salesforce", 3],
            ["Facebook", 2],
            ["Uber", 2],
            ["Intel", 2]
          ],
          "occurence": 8,
          "tags": ["Array", "Two Pointers", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "intersection-of-two-linked-lists",
          "name": "Intersection of Two Linked Lists",
          "link": "https://leetcode.com/problems/intersection-of-two-linked-lists",
          "otherCompanies": [
            ["Amazon", 8],
            ["LinkedIn", 6],
            ["Facebook", 4],
            ["Adobe", 3],
            ["Nvidia", 3],
            ["ByteDance", 3],
            ["Airbnb", 2]
          ],
          "occurence": 8,
          "tags": ["Hash Table", "Linked List", "Two Pointers"],
          "difficulty": "Easy"
        },
        {
          "slug": "set-matrix-zeroes",
          "name": "Set Matrix Zeroes",
          "link": "https://leetcode.com/problems/set-matrix-zeroes",
          "otherCompanies": [
            ["Amazon", 6],
            ["Facebook", 5],
            ["Apple", 4],
            ["Bloomberg", 3]
          ],
          "occurence": 8,
          "tags": ["Array", "Hash Table", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximal-square",
          "name": "Maximal Square",
          "link": "https://leetcode.com/problems/maximal-square",
          "otherCompanies": [
            ["Visa", 6],
            ["Google", 3],
            ["Amazon", 3],
            ["IBM", 3],
            ["Salesforce", 3],
            ["FactSet", 2],
            ["ByteDance", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "excel-sheet-column-number",
          "name": "Excel Sheet Column Number",
          "link": "https://leetcode.com/problems/excel-sheet-column-number",
          "otherCompanies": [
            ["Google", 2],
            ["Apple", 2]
          ],
          "occurence": 6,
          "tags": ["Math", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "count-servers-that-communicate",
          "name": "Count Servers that Communicate",
          "link": "https://leetcode.com/problems/count-servers-that-communicate",
          "otherCompanies": [],
          "occurence": 6,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Matrix",
            "Counting"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "permutation-in-string",
          "name": "Permutation in String",
          "link": "https://leetcode.com/problems/permutation-in-string",
          "otherCompanies": [
            ["Yandex", 4],
            ["Apple", 4],
            ["Oracle", 4],
            ["Amazon", 3],
            ["Google", 2],
            ["Bloomberg", 2],
            ["ByteDance", 2]
          ],
          "occurence": 5,
          "tags": ["Hash Table", "Two Pointers", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "reverse-words-in-a-string-iii",
          "name": "Reverse Words in a String III",
          "link": "https://leetcode.com/problems/reverse-words-in-a-string-iii",
          "otherCompanies": [
            ["Amazon", 3],
            ["Bolt", 3],
            ["Yandex", 2],
            ["PayTM", 2],
            ["Facebook", 2],
            ["Apple", 2]
          ],
          "occurence": 5,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "sort-characters-by-frequency",
          "name": "Sort Characters By Frequency",
          "link": "https://leetcode.com/problems/sort-characters-by-frequency",
          "otherCompanies": [
            ["Facebook", 3],
            ["Amazon", 2],
            ["Bloomberg", 2],
            ["Apple", 2]
          ],
          "occurence": 5,
          "tags": [
            "Hash Table",
            "String",
            "Sorting",
            "Heap (Priority Queue)",
            "Bucket Sort",
            "Counting"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "encode-and-decode-tinyurl",
          "name": "Encode and Decode TinyURL",
          "link": "https://leetcode.com/problems/encode-and-decode-tinyurl",
          "otherCompanies": [
            ["Amazon", 4],
            ["Bloomberg", 2]
          ],
          "occurence": 5,
          "tags": ["Hash Table", "String", "Design", "Hash Function"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-moves-to-equal-array-elements-ii",
          "name": "Minimum Moves to Equal Array Elements II",
          "link": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Array", "Math", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-digit-one",
          "name": "Number of Digit One",
          "link": "https://leetcode.com/problems/number-of-digit-one",
          "otherCompanies": [["Google", 4]],
          "occurence": 4,
          "tags": ["Math", "Dynamic Programming", "Recursion"],
          "difficulty": "Hard"
        },
        {
          "slug": "the-skyline-problem",
          "name": "The Skyline Problem",
          "link": "https://leetcode.com/problems/the-skyline-problem",
          "otherCompanies": [
            ["Cruise Automation", 3],
            ["Google", 2],
            ["Uber", 2]
          ],
          "occurence": 4,
          "tags": [
            "Array",
            "Divide and Conquer",
            "Binary Indexed Tree",
            "Segment Tree",
            "Line Sweep",
            "Heap (Priority Queue)",
            "Ordered Set"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "excel-sheet-column-title",
          "name": "Excel Sheet Column Title",
          "link": "https://leetcode.com/problems/excel-sheet-column-title",
          "otherCompanies": [
            ["Google", 2],
            ["Amazon", 2]
          ],
          "occurence": 4,
          "tags": ["Math", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "construct-binary-tree-from-preorder-and-inorder-traversal",
          "name": "Construct Binary Tree from Preorder and Inorder Traversal",
          "link": "https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal",
          "otherCompanies": [
            ["Google", 3],
            ["Amazon", 3],
            ["Bloomberg", 3],
            ["Uber", 2],
            ["ByteDance", 2]
          ],
          "occurence": 4,
          "tags": [
            "Array",
            "Hash Table",
            "Divide and Conquer",
            "Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "read-n-characters-given-read4",
          "name": "Read N Characters Given Read4",
          "link": "https://leetcode.com/problems/read-n-characters-given-read4",
          "otherCompanies": [
            ["Facebook", 3],
            ["Lyft", 2],
            ["Amazon", 2],
            ["Rubrik", 2]
          ],
          "occurence": 4,
          "tags": ["String", "Simulation", "Interactive"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-insertions-to-balance-a-parentheses-string",
          "name": "Minimum Insertions to Balance a Parentheses String",
          "link": "https://leetcode.com/problems/minimum-insertions-to-balance-a-parentheses-string",
          "otherCompanies": [["Facebook", 4]],
          "occurence": 4,
          "tags": ["String", "Stack", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-circular-queue",
          "name": "Design Circular Queue",
          "link": "https://leetcode.com/problems/design-circular-queue",
          "otherCompanies": [
            ["Facebook", 4],
            ["Amazon", 4],
            ["Apple", 3],
            ["Airbnb", 3],
            ["Nvidia", 3]
          ],
          "occurence": 4,
          "tags": ["Array", "Linked List", "Design", "Queue"],
          "difficulty": "Medium"
        },
        {
          "slug": "distribute-coins-in-binary-tree",
          "name": "Distribute Coins in Binary Tree",
          "link": "https://leetcode.com/problems/distribute-coins-in-binary-tree",
          "otherCompanies": [
            ["Amazon", 2],
            ["Apple", 2],
            ["PhonePe", 2]
          ],
          "occurence": 4,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-tree-inorder-traversal",
          "name": "Binary Tree Inorder Traversal",
          "link": "https://leetcode.com/problems/binary-tree-inorder-traversal",
          "otherCompanies": [
            ["Amazon", 4],
            ["Apple", 3],
            ["Adobe", 2]
          ],
          "occurence": 4,
          "tags": ["Stack", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "rotate-list",
          "name": "Rotate List",
          "link": "https://leetcode.com/problems/rotate-list",
          "otherCompanies": [["Bloomberg", 3]],
          "occurence": 4,
          "tags": ["Linked List", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-nice-substring",
          "name": "Longest Nice Substring",
          "link": "https://leetcode.com/problems/longest-nice-substring",
          "otherCompanies": [],
          "occurence": 4,
          "tags": [
            "Hash Table",
            "String",
            "Divide and Conquer",
            "Bit Manipulation",
            "Sliding Window"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "reverse-words-in-a-string-ii",
          "name": "Reverse Words in a String II",
          "link": "https://leetcode.com/problems/reverse-words-in-a-string-ii",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "unique-binary-search-trees-ii",
          "name": "Unique Binary Search Trees II",
          "link": "https://leetcode.com/problems/unique-binary-search-trees-ii",
          "otherCompanies": [],
          "occurence": 4,
          "tags": [
            "Dynamic Programming",
            "Backtracking",
            "Tree",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-all-occurrences-of-a-substring",
          "name": "Remove All Occurrences of a Substring",
          "link": "https://leetcode.com/problems/remove-all-occurrences-of-a-substring",
          "otherCompanies": [
            ["Google", 2],
            ["MakeMyTrip", 2],
            ["Amazon", 2]
          ],
          "occurence": 3,
          "tags": ["String"],
          "difficulty": "Medium"
        },
        {
          "slug": "letter-tile-possibilities",
          "name": "Letter Tile Possibilities",
          "link": "https://leetcode.com/problems/letter-tile-possibilities",
          "otherCompanies": [["Google", 1]],
          "occurence": 3,
          "tags": ["Hash Table", "String", "Backtracking", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-univalue-subtrees",
          "name": "Count Univalue Subtrees",
          "link": "https://leetcode.com/problems/count-univalue-subtrees",
          "otherCompanies": [["Google", 2]],
          "occurence": 3,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "fizz-buzz",
          "name": "Fizz Buzz",
          "link": "https://leetcode.com/problems/fizz-buzz",
          "otherCompanies": [
            ["Facebook", 3],
            ["Apple", 2]
          ],
          "occurence": 3,
          "tags": ["Math", "String", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-good-pairs",
          "name": "Number of Good Pairs",
          "link": "https://leetcode.com/problems/number-of-good-pairs",
          "otherCompanies": [
            ["Amazon", 3],
            ["Adobe", 2]
          ],
          "occurence": 3,
          "tags": ["Array", "Hash Table", "Math", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "delete-node-in-a-linked-list",
          "name": "Delete Node in a Linked List",
          "link": "https://leetcode.com/problems/delete-node-in-a-linked-list",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 3,
          "tags": ["Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "n-ary-tree-level-order-traversal",
          "name": "N-ary Tree Level Order Traversal",
          "link": "https://leetcode.com/problems/n-ary-tree-level-order-traversal",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Tree", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "map-of-highest-peak",
          "name": "Map of Highest Peak",
          "link": "https://leetcode.com/problems/map-of-highest-peak",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["Array", "Breadth-First Search", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "redundant-connection",
          "name": "Redundant Connection",
          "link": "https://leetcode.com/problems/redundant-connection",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "linked-list-random-node",
          "name": "Linked List Random Node",
          "link": "https://leetcode.com/problems/linked-list-random-node",
          "otherCompanies": [
            ["Amazon", 2],
            ["Google", 1]
          ],
          "occurence": 2,
          "tags": ["Linked List", "Math", "Reservoir Sampling", "Randomized"],
          "difficulty": "Medium"
        },
        {
          "slug": "check-if-it-is-a-straight-line",
          "name": "Check If It Is a Straight Line",
          "link": "https://leetcode.com/problems/check-if-it-is-a-straight-line",
          "otherCompanies": [["Palantir Technologies", 1]],
          "occurence": 2,
          "tags": ["Array", "Math", "Geometry"],
          "difficulty": "Easy"
        },
        {
          "slug": "ways-to-make-a-fair-array",
          "name": "Ways to Make a Fair Array",
          "link": "https://leetcode.com/problems/ways-to-make-a-fair-array",
          "otherCompanies": [["Dunzo", 1]],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-number-of-balls-in-a-box",
          "name": "Maximum Number of Balls in a Box",
          "link": "https://leetcode.com/problems/maximum-number-of-balls-in-a-box",
          "otherCompanies": [["AppDynamics", 1]],
          "occurence": 2,
          "tags": ["Hash Table", "Math", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "linked-list-in-binary-tree",
          "name": "Linked List in Binary Tree",
          "link": "https://leetcode.com/problems/linked-list-in-binary-tree",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": [
            "Linked List",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-univalue-path",
          "name": "Longest Univalue Path",
          "link": "https://leetcode.com/problems/longest-univalue-path",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "heaters",
          "name": "Heaters",
          "link": "https://leetcode.com/problems/heaters",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Two Pointers", "Binary Search", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-number-of-eaten-apples",
          "name": "Maximum Number of Eaten Apples",
          "link": "https://leetcode.com/problems/maximum-number-of-eaten-apples",
          "otherCompanies": [["Uber", 1]],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-digit-from-number-to-maximize-result",
          "name": "Remove Digit From Number to Maximize Result",
          "link": "https://leetcode.com/problems/remove-digit-from-number-to-maximize-result",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Greedy", "Enumeration"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-number-is-a-sum-of-powers-of-three",
          "name": "Check if Number is a Sum of Powers of Three",
          "link": "https://leetcode.com/problems/check-if-number-is-a-sum-of-powers-of-three",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "replace-all-s-to-avoid-consecutive-repeating-characters",
          "name": "Replace All ?'s to Avoid Consecutive Repeating Characters",
          "link": "https://leetcode.com/problems/replace-all-s-to-avoid-consecutive-repeating-characters",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-operations-to-make-array-equal",
          "name": "Minimum Operations to Make Array Equal",
          "link": "https://leetcode.com/problems/minimum-operations-to-make-array-equal",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "running-sum-of-1d-array",
          "name": "Running Sum of 1d Array",
          "link": "https://leetcode.com/problems/running-sum-of-1d-array",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Easy"
        },
        {
          "slug": "generate-a-string-with-characters-that-have-odd-counts",
          "name": "Generate a String With Characters That Have Odd Counts",
          "link": "https://leetcode.com/problems/generate-a-string-with-characters-that-have-odd-counts",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "sort-the-matrix-diagonally",
          "name": "Sort the Matrix Diagonally",
          "link": "https://leetcode.com/problems/sort-the-matrix-diagonally",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Sorting", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-outermost-parentheses",
          "name": "Remove Outermost Parentheses",
          "link": "https://leetcode.com/problems/remove-outermost-parentheses",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Stack"],
          "difficulty": "Easy"
        },
        {
          "slug": "di-string-match",
          "name": "DI String Match",
          "link": "https://leetcode.com/problems/di-string-match",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Two Pointers", "String", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "sort-array-by-parity-ii",
          "name": "Sort Array By Parity II",
          "link": "https://leetcode.com/problems/sort-array-by-parity-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Two Pointers", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "letter-case-permutation",
          "name": "Letter Case Permutation",
          "link": "https://leetcode.com/problems/letter-case-permutation",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Backtracking", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "image-smoother",
          "name": "Image Smoother",
          "link": "https://leetcode.com/problems/image-smoother",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "4-keys-keyboard",
          "name": "4 Keys Keyboard",
          "link": "https://leetcode.com/problems/4-keys-keyboard",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "decode-ways-ii",
          "name": "Decode Ways II",
          "link": "https://leetcode.com/problems/decode-ways-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "maximum-vacation-days",
          "name": "Maximum Vacation Days",
          "link": "https://leetcode.com/problems/maximum-vacation-days",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Hard"
        },
        {
          "slug": "maximum-depth-of-n-ary-tree",
          "name": "Maximum Depth of N-ary Tree",
          "link": "https://leetcode.com/problems/maximum-depth-of-n-ary-tree",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Tree", "Depth-First Search", "Breadth-First Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "super-washing-machines",
          "name": "Super Washing Machines",
          "link": "https://leetcode.com/problems/super-washing-machines",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy"],
          "difficulty": "Hard"
        },
        {
          "slug": "smallest-good-base",
          "name": "Smallest Good Base",
          "link": "https://leetcode.com/problems/smallest-good-base",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Binary Search"],
          "difficulty": "Hard"
        },
        {
          "slug": "matchsticks-to-square",
          "name": "Matchsticks to Square",
          "link": "https://leetcode.com/problems/matchsticks-to-square",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Backtracking",
            "Bit Manipulation",
            "Bitmask"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "data-stream-as-disjoint-intervals",
          "name": "Data Stream as Disjoint Intervals",
          "link": "https://leetcode.com/problems/data-stream-as-disjoint-intervals",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Binary Search", "Design", "Ordered Set"],
          "difficulty": "Hard"
        },
        {
          "slug": "ugly-number-ii",
          "name": "Ugly Number II",
          "link": "https://leetcode.com/problems/ugly-number-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Hash Table",
            "Math",
            "Dynamic Programming",
            "Heap (Priority Queue)"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-operations-to-halve-array-sum",
          "name": "Minimum Operations to Halve Array Sum",
          "link": "https://leetcode.com/problems/minimum-operations-to-halve-array-sum",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        },
        {
          "slug": "divide-array-into-equal-pairs",
          "name": "Divide Array Into Equal Pairs",
          "link": "https://leetcode.com/problems/divide-array-into-equal-pairs",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Bit Manipulation", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "merge-nodes-in-between-zeros",
          "name": "Merge Nodes in Between Zeros",
          "link": "https://leetcode.com/problems/merge-nodes-in-between-zeros",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Linked List", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "check-if-all-as-appears-before-all-bs",
          "name": "Check if All A's Appears Before All B's",
          "link": "https://leetcode.com/problems/check-if-all-as-appears-before-all-bs",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-missing-observations",
          "name": "Find Missing Observations",
          "link": "https://leetcode.com/problems/find-missing-observations",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "three-divisors",
          "name": "Three Divisors",
          "link": "https://leetcode.com/problems/three-divisors",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-digits-of-string-after-convert",
          "name": "Sum of Digits of String After Convert",
          "link": "https://leetcode.com/problems/sum-of-digits-of-string-after-convert",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-center-of-star-graph",
          "name": "Find Center of Star Graph",
          "link": "https://leetcode.com/problems/find-center-of-star-graph",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Graph"],
          "difficulty": "Easy"
        },
        {
          "slug": "widest-vertical-area-between-two-points-containing-no-points",
          "name": "Widest Vertical Area Between Two Points Containing No Points",
          "link": "https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "delete-n-nodes-after-m-nodes-of-a-linked-list",
          "name": "Delete N Nodes After M Nodes of a Linked List",
          "link": "https://leetcode.com/problems/delete-n-nodes-after-m-nodes-of-a-linked-list",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Linked List"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-all-the-lonely-nodes",
          "name": "Find All The Lonely Nodes",
          "link": "https://leetcode.com/problems/find-all-the-lonely-nodes",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "the-k-th-lexicographical-string-of-all-happy-strings-of-length-n",
          "name": "The k-th Lexicographical String of All Happy Strings of Length n",
          "link": "https://leetcode.com/problems/the-k-th-lexicographical-string-of-all-happy-strings-of-length-n",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-lucky-integer-in-an-array",
          "name": "Find Lucky Integer in an Array",
          "link": "https://leetcode.com/problems/find-lucky-integer-in-an-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-the-longest-substring-containing-vowels-in-even-counts",
          "name": "Find the Longest Substring Containing Vowels in Even Counts",
          "link": "https://leetcode.com/problems/find-the-longest-substring-containing-vowels-in-even-counts",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "String", "Bit Manipulation", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "delete-tree-nodes",
          "name": "Delete Tree Nodes",
          "link": "https://leetcode.com/problems/delete-tree-nodes",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Tree", "Depth-First Search", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "bulb-switcher-ii",
          "name": "Bulb Switcher II",
          "link": "https://leetcode.com/problems/bulb-switcher-ii",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Math",
            "Bit Manipulation",
            "Depth-First Search",
            "Breadth-First Search"
          ],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Bloomberg",
      "problems": [
        {
          "slug": "design-underground-system",
          "name": "Design Underground System",
          "link": "https://leetcode.com/problems/design-underground-system",
          "otherCompanies": [],
          "occurence": 64,
          "tags": ["Hash Table", "String", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "decode-string",
          "name": "Decode String",
          "link": "https://leetcode.com/problems/decode-string",
          "otherCompanies": [
            ["Google", 19],
            ["Microsoft", 14],
            ["Amazon", 12],
            ["Facebook", 11],
            ["Cisco", 8],
            ["Oracle", 6],
            ["Snapchat", 5],
            ["Apple", 5],
            ["ByteDance", 5],
            ["Uber", 3],
            ["Adobe", 3],
            ["Sumologic", 2],
            ["Intuit", 2],
            ["Cruise Automation", 2],
            ["ByteDance", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 33,
          "tags": ["String", "Stack", "Recursion"],
          "difficulty": "Medium"
        },
        {
          "slug": "flatten-a-multilevel-doubly-linked-list",
          "name": "Flatten a Multilevel Doubly Linked List",
          "link": "https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list",
          "otherCompanies": [
            ["Google", 2],
            ["Amazon", 2],
            ["Oracle", 2]
          ],
          "occurence": 28,
          "tags": ["Linked List", "Depth-First Search", "Doubly-Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-all-adjacent-duplicates-in-string-ii",
          "name": "Remove All Adjacent Duplicates in String II",
          "link": "https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii",
          "otherCompanies": [
            ["Amazon", 8],
            ["Facebook", 7],
            ["Apple", 3],
            ["Goldman Sachs", 2],
            ["Visa", 2],
            ["Microsoft", 2],
            ["Spotify", 2]
          ],
          "occurence": 26,
          "tags": ["String", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "insert-delete-getrandom-o1",
          "name": "Insert Delete GetRandom O(1)",
          "link": "https://leetcode.com/problems/insert-delete-getrandom-o1",
          "otherCompanies": [
            ["Facebook", 23],
            ["Amazon", 17],
            ["LinkedIn", 15],
            ["Microsoft", 12],
            ["Affirm", 10],
            ["Uber", 7],
            ["Twitter", 5],
            ["Google", 4]
          ],
          "occurence": 23,
          "tags": ["Array", "Hash Table", "Math", "Design", "Randomized"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-an-ordered-stream",
          "name": "Design an Ordered Stream",
          "link": "https://leetcode.com/problems/design-an-ordered-stream",
          "otherCompanies": [],
          "occurence": 20,
          "tags": ["Array", "Hash Table", "Design", "Data Stream"],
          "difficulty": "Easy"
        },
        {
          "slug": "two-city-scheduling",
          "name": "Two City Scheduling",
          "link": "https://leetcode.com/problems/two-city-scheduling",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 14,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "knight-dialer",
          "name": "Knight Dialer",
          "link": "https://leetcode.com/problems/knight-dialer",
          "otherCompanies": [
            ["Facebook", 6],
            ["Amazon", 3],
            ["Snapchat", 2],
            ["Twilio", 2],
            ["Microsoft", 2]
          ],
          "occurence": 10,
          "tags": ["Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-browser-history",
          "name": "Design Browser History",
          "link": "https://leetcode.com/problems/design-browser-history",
          "otherCompanies": [
            ["Roblox", 5],
            ["Amazon", 3],
            ["Oracle", 2]
          ],
          "occurence": 9,
          "tags": [
            "Array",
            "Linked List",
            "Stack",
            "Design",
            "Doubly-Linked List",
            "Data Stream"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-number-of-steps-to-make-two-strings-anagram",
          "name": "Minimum Number of Steps to Make Two Strings Anagram",
          "link": "https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram",
          "otherCompanies": [
            ["DoorDash", 7],
            ["Twitter", 2],
            ["ByteDance", 2]
          ],
          "occurence": 8,
          "tags": ["Hash Table", "String", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "candy-crush",
          "name": "Candy Crush",
          "link": "https://leetcode.com/problems/candy-crush",
          "otherCompanies": [
            ["Capital One", 3],
            ["Facebook", 2],
            ["eBay", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Two Pointers", "Matrix", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "add-two-numbers-ii",
          "name": "Add Two Numbers II",
          "link": "https://leetcode.com/problems/add-two-numbers-ii",
          "otherCompanies": [
            ["Microsoft", 4],
            ["Amazon", 3],
            ["Oracle", 2]
          ],
          "occurence": 6,
          "tags": ["Linked List", "Math", "Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-nesting-depth-of-the-parentheses",
          "name": "Maximum Nesting Depth of the Parentheses",
          "link": "https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses",
          "otherCompanies": [["Facebook", 3]],
          "occurence": 4,
          "tags": ["String", "Stack"],
          "difficulty": "Easy"
        },
        {
          "slug": "binary-tree-paths",
          "name": "Binary Tree Paths",
          "link": "https://leetcode.com/problems/binary-tree-paths",
          "otherCompanies": [
            ["Amazon", 3],
            ["Google", 2],
            ["Facebook", 2],
            ["Microsoft", 2]
          ],
          "occurence": 3,
          "tags": [
            "String",
            "Backtracking",
            "Tree",
            "Depth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "different-ways-to-add-parentheses",
          "name": "Different Ways to Add Parentheses",
          "link": "https://leetcode.com/problems/different-ways-to-add-parentheses",
          "otherCompanies": [
            ["Google", 3],
            ["Snapchat", 2]
          ],
          "occurence": 3,
          "tags": [
            "Math",
            "String",
            "Dynamic Programming",
            "Recursion",
            "Memoization"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "count-unhappy-friends",
          "name": "Count Unhappy Friends",
          "link": "https://leetcode.com/problems/count-unhappy-friends",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "non-decreasing-array",
          "name": "Non-decreasing Array",
          "link": "https://leetcode.com/problems/non-decreasing-array",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array"],
          "difficulty": "Medium"
        },
        {
          "slug": "shortest-palindrome",
          "name": "Shortest Palindrome",
          "link": "https://leetcode.com/problems/shortest-palindrome",
          "otherCompanies": [
            ["Microsoft", 3],
            ["Apple", 2]
          ],
          "occurence": 3,
          "tags": [
            "String",
            "Rolling Hash",
            "String Matching",
            "Hash Function"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "divisor-game",
          "name": "Divisor Game",
          "link": "https://leetcode.com/problems/divisor-game",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["Math", "Dynamic Programming", "Brainteaser", "Game Theory"],
          "difficulty": "Easy"
        },
        {
          "slug": "split-array-into-consecutive-subsequences",
          "name": "Split Array into Consecutive Subsequences",
          "link": "https://leetcode.com/problems/split-array-into-consecutive-subsequences",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Greedy", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-word-square",
          "name": "Valid Word Square",
          "link": "https://leetcode.com/problems/valid-word-square",
          "otherCompanies": [["Google", 1]],
          "occurence": 2,
          "tags": ["Array", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "reshape-the-matrix",
          "name": "Reshape the Matrix",
          "link": "https://leetcode.com/problems/reshape-the-matrix",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 2,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "matrix-diagonal-sum",
          "name": "Matrix Diagonal Sum",
          "link": "https://leetcode.com/problems/matrix-diagonal-sum",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "self-dividing-numbers",
          "name": "Self Dividing Numbers",
          "link": "https://leetcode.com/problems/self-dividing-numbers",
          "otherCompanies": [
            ["Amazon", 2],
            ["Adobe", 2],
            ["Epic Systems", 1]
          ],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-square-numbers",
          "name": "Sum of Square Numbers",
          "link": "https://leetcode.com/problems/sum-of-square-numbers",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Math", "Two Pointers", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "arithmetic-slices",
          "name": "Arithmetic Slices",
          "link": "https://leetcode.com/problems/arithmetic-slices",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-bitset",
          "name": "Design Bitset",
          "link": "https://leetcode.com/problems/design-bitset",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-score-from-removing-stones",
          "name": "Maximum Score From Removing Stones",
          "link": "https://leetcode.com/problems/maximum-score-from-removing-stones",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Greedy", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        },
        {
          "slug": "arithmetic-subarrays",
          "name": "Arithmetic Subarrays",
          "link": "https://leetcode.com/problems/arithmetic-subarrays",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "xor-operation-in-an-array",
          "name": "XOR Operation in an Array",
          "link": "https://leetcode.com/problems/xor-operation-in-an-array",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "pseudo-palindromic-paths-in-a-binary-tree",
          "name": "Pseudo-Palindromic Paths in a Binary Tree",
          "link": "https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Bit Manipulation",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",
          "name": "Find the Kth Smallest Sum of a Matrix With Sorted Rows",
          "link": "https://leetcode.com/problems/find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Binary Search", "Heap (Priority Queue)", "Matrix"],
          "difficulty": "Hard"
        },
        {
          "slug": "remove-palindromic-subsequences",
          "name": "Remove Palindromic Subsequences",
          "link": "https://leetcode.com/problems/remove-palindromic-subsequences",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-mutated-array-closest-to-target",
          "name": "Sum of Mutated Array Closest to Target",
          "link": "https://leetcode.com/problems/sum-of-mutated-array-closest-to-target",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Binary Search", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "shift-2d-grid",
          "name": "Shift 2D Grid",
          "link": "https://leetcode.com/problems/shift-2d-grid",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "play-with-chips",
          "name": "Play with Chips",
          "link": "https://leetcode.com/problems/play-with-chips",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "push-dominoes",
          "name": "Push Dominoes",
          "link": "https://leetcode.com/problems/push-dominoes",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Two Pointers", "String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-distance-between-bst-nodes",
          "name": "Minimum Distance Between BST Nodes",
          "link": "https://leetcode.com/problems/minimum-distance-between-bst-nodes",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "couples-holding-hands",
          "name": "Couples Holding Hands",
          "link": "https://leetcode.com/problems/couples-holding-hands",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Greedy",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "course-schedule-iii",
          "name": "Course Schedule III",
          "link": "https://leetcode.com/problems/course-schedule-iii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Heap (Priority Queue)"],
          "difficulty": "Hard"
        },
        {
          "slug": "construct-the-rectangle",
          "name": "Construct the Rectangle",
          "link": "https://leetcode.com/problems/construct-the-rectangle",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-xor-of-two-numbers-in-an-array",
          "name": "Maximum XOR of Two Numbers in an Array",
          "link": "https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array",
          "otherCompanies": [["Adobe", 2]],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Bit Manipulation", "Trie"],
          "difficulty": "Medium"
        },
        {
          "slug": "integer-replacement",
          "name": "Integer Replacement",
          "link": "https://leetcode.com/problems/integer-replacement",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Dynamic Programming",
            "Greedy",
            "Bit Manipulation",
            "Memoization"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "wiggle-subsequence",
          "name": "Wiggle Subsequence",
          "link": "https://leetcode.com/problems/wiggle-subsequence",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-numbers-with-unique-digits",
          "name": "Count Numbers with Unique Digits",
          "link": "https://leetcode.com/problems/count-numbers-with-unique-digits",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Dynamic Programming", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "reverse-vowels-of-a-string",
          "name": "Reverse Vowels of a String",
          "link": "https://leetcode.com/problems/reverse-vowels-of-a-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-product-of-word-lengths",
          "name": "Maximum Product of Word Lengths",
          "link": "https://leetcode.com/problems/maximum-product-of-word-lengths",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "String", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "add-digits",
          "name": "Add Digits",
          "link": "https://leetcode.com/problems/add-digits",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Simulation", "Number Theory"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-all-the-integers-in-a-range-are-covered",
          "name": "Check if All the Integers in a Range Are Covered",
          "link": "https://leetcode.com/problems/check-if-all-the-integers-in-a-range-are-covered",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Prefix Sum"],
          "difficulty": "Easy"
        },
        {
          "slug": "truncate-sentence",
          "name": "Truncate Sentence",
          "link": "https://leetcode.com/problems/truncate-sentence",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Adobe",
      "problems": [
        {
          "slug": "reverse-integer",
          "name": "Reverse Integer",
          "link": "https://leetcode.com/problems/reverse-integer",
          "otherCompanies": [
            ["Amazon", 11],
            ["Google", 5],
            ["Facebook", 4],
            ["Apple", 4],
            ["Yahoo", 2],
            ["Bloomberg", 2],
            ["Visa", 2],
            ["Oracle", 2],
            ["Microsoft", 2],
            ["Samsung", 2]
          ],
          "occurence": 13,
          "tags": ["Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "unique-number-of-occurrences",
          "name": "Unique Number of Occurrences",
          "link": "https://leetcode.com/problems/unique-number-of-occurrences",
          "otherCompanies": [
            ["Amazon", 5],
            ["Facebook", 4],
            ["Apple", 4],
            ["Bloomberg", 3],
            ["Google", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Easy"
        },
        {
          "slug": "kth-largest-element-in-a-stream",
          "name": "Kth Largest Element in a Stream",
          "link": "https://leetcode.com/problems/kth-largest-element-in-a-stream",
          "otherCompanies": [
            ["Google", 4],
            ["Amazon", 4],
            ["Facebook", 3],
            ["LinkedIn", 2]
          ],
          "occurence": 4,
          "tags": [
            "Tree",
            "Design",
            "Binary Search Tree",
            "Heap (Priority Queue)",
            "Binary Tree",
            "Data Stream"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "guess-number-higher-or-lower",
          "name": "Guess Number Higher or Lower",
          "link": "https://leetcode.com/problems/guess-number-higher-or-lower",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 4,
          "tags": ["Binary Search", "Interactive"],
          "difficulty": "Easy"
        },
        {
          "slug": "complement-of-base-10-integer",
          "name": "Complement of Base 10 Integer",
          "link": "https://leetcode.com/problems/complement-of-base-10-integer",
          "otherCompanies": [["Apple", 2]],
          "occurence": 4,
          "tags": ["Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "count-items-matching-a-rule",
          "name": "Count Items Matching a Rule",
          "link": "https://leetcode.com/problems/count-items-matching-a-rule",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 3,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-all-odd-length-subarrays",
          "name": "Sum of All Odd Length Subarrays",
          "link": "https://leetcode.com/problems/sum-of-all-odd-length-subarrays",
          "otherCompanies": [
            ["Amazon", 2],
            ["Apple", 2]
          ],
          "occurence": 3,
          "tags": ["Array", "Math", "Prefix Sum"],
          "difficulty": "Easy"
        },
        {
          "slug": "array-nesting",
          "name": "Array Nesting",
          "link": "https://leetcode.com/problems/array-nesting",
          "otherCompanies": [["Apple", 1]],
          "occurence": 3,
          "tags": ["Array", "Depth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "nim-game",
          "name": "Nim Game",
          "link": "https://leetcode.com/problems/nim-game",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 3,
          "tags": ["Math", "Brainteaser", "Game Theory"],
          "difficulty": "Easy"
        },
        {
          "slug": "set-mismatch",
          "name": "Set Mismatch",
          "link": "https://leetcode.com/problems/set-mismatch",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Hash Table", "Bit Manipulation", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "reverse-string-ii",
          "name": "Reverse String II",
          "link": "https://leetcode.com/problems/reverse-string-ii",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-duplicates-from-sorted-array-ii",
          "name": "Remove Duplicates from Sorted Array II",
          "link": "https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "sorting-the-sentence",
          "name": "Sorting the Sentence",
          "link": "https://leetcode.com/problems/sorting-the-sentence",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["String", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "replace-all-digits-with-characters",
          "name": "Replace All Digits with Characters",
          "link": "https://leetcode.com/problems/replace-all-digits-with-characters",
          "otherCompanies": [["Google", 1]],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "make-the-string-great",
          "name": "Make The String Great",
          "link": "https://leetcode.com/problems/make-the-string-great",
          "otherCompanies": [["Google", 1]],
          "occurence": 2,
          "tags": ["String", "Stack"],
          "difficulty": "Easy"
        },
        {
          "slug": "binary-tree-preorder-traversal",
          "name": "Binary Tree Preorder Traversal",
          "link": "https://leetcode.com/problems/binary-tree-preorder-traversal",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["Stack", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-substrings-containing-all-three-characters",
          "name": "Number of Substrings Containing All Three Characters",
          "link": "https://leetcode.com/problems/number-of-substrings-containing-all-three-characters",
          "otherCompanies": [
            ["Microsoft", 2],
            ["DE Shaw", 1]
          ],
          "occurence": 2,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "permutation-sequence",
          "name": "Permutation Sequence",
          "link": "https://leetcode.com/problems/permutation-sequence",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 2,
          "tags": ["Math", "Recursion"],
          "difficulty": "Hard"
        },
        {
          "slug": "maximum-absolute-sum-of-any-subarray",
          "name": "Maximum Absolute Sum of Any Subarray",
          "link": "https://leetcode.com/problems/maximum-absolute-sum-of-any-subarray",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-good-meals",
          "name": "Count Good Meals",
          "link": "https://leetcode.com/problems/count-good-meals",
          "otherCompanies": [
            ["Amazon", 2],
            ["Robinhood", 1]
          ],
          "occurence": 2,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-number-of-achievable-transfer-requests",
          "name": "Maximum Number of Achievable Transfer Requests",
          "link": "https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests",
          "otherCompanies": [["Amazon", 1]],
          "occurence": 2,
          "tags": ["Array", "Backtracking", "Bit Manipulation", "Enumeration"],
          "difficulty": "Hard"
        },
        {
          "slug": "number-of-equivalent-domino-pairs",
          "name": "Number of Equivalent Domino Pairs",
          "link": "https://leetcode.com/problems/number-of-equivalent-domino-pairs",
          "otherCompanies": [["Amazon", 1]],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "3sum-with-multiplicity",
          "name": "3Sum With Multiplicity",
          "link": "https://leetcode.com/problems/3sum-with-multiplicity",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": [
            "Array",
            "Hash Table",
            "Two Pointers",
            "Sorting",
            "Counting"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "total-hamming-distance",
          "name": "Total Hamming Distance",
          "link": "https://leetcode.com/problems/total-hamming-distance",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Math", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "determine-whether-matrix-can-be-obtained-by-rotation",
          "name": "Determine Whether Matrix Can Be Obtained By Rotation",
          "link": "https://leetcode.com/problems/determine-whether-matrix-can-be-obtained-by-rotation",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-all-subset-xor-totals",
          "name": "Sum of All Subset XOR Totals",
          "link": "https://leetcode.com/problems/sum-of-all-subset-xor-totals",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Math",
            "Backtracking",
            "Bit Manipulation",
            "Combinatorics"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "count-of-matches-in-tournament",
          "name": "Count of Matches in Tournament",
          "link": "https://leetcode.com/problems/count-of-matches-in-tournament",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "richest-customer-wealth",
          "name": "Richest Customer Wealth",
          "link": "https://leetcode.com/problems/richest-customer-wealth",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "smallest-string-with-a-given-numeric-value",
          "name": "Smallest String With A Given Numeric Value",
          "link": "https://leetcode.com/problems/smallest-string-with-a-given-numeric-value",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "circle-and-rectangle-overlapping",
          "name": "Circle and Rectangle Overlapping",
          "link": "https://leetcode.com/problems/circle-and-rectangle-overlapping",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Geometry"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-number-of-balloons",
          "name": "Maximum Number of Balloons",
          "link": "https://leetcode.com/problems/maximum-number-of-balloons",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "reveal-cards-in-increasing-order",
          "name": "Reveal Cards In Increasing Order",
          "link": "https://leetcode.com/problems/reveal-cards-in-increasing-order",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Queue", "Sorting", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "k-th-symbol-in-grammar",
          "name": "K-th Symbol in Grammar",
          "link": "https://leetcode.com/problems/k-th-symbol-in-grammar",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Bit Manipulation", "Recursion"],
          "difficulty": "Medium"
        },
        {
          "slug": "perfect-number",
          "name": "Perfect Number",
          "link": "https://leetcode.com/problems/perfect-number",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-left-leaves",
          "name": "Sum of Left Leaves",
          "link": "https://leetcode.com/problems/sum-of-left-leaves",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "super-pow",
          "name": "Super Pow",
          "link": "https://leetcode.com/problems/super-pow",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "Divide and Conquer"],
          "difficulty": "Medium"
        },
        {
          "slug": "wiggle-sort-ii",
          "name": "Wiggle Sort II",
          "link": "https://leetcode.com/problems/wiggle-sort-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Divide and Conquer", "Sorting", "Quickselect"],
          "difficulty": "Medium"
        },
        {
          "slug": "bitwise-and-of-numbers-range",
          "name": "Bitwise AND of Numbers Range",
          "link": "https://leetcode.com/problems/bitwise-and-of-numbers-range",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "partition-list",
          "name": "Partition List",
          "link": "https://leetcode.com/problems/partition-list",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Linked List", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "smallest-range-i",
          "name": "Smallest Range I",
          "link": "https://leetcode.com/problems/smallest-range-i",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Apple",
      "problems": [
        {
          "slug": "build-array-from-permutation",
          "name": "Build Array from Permutation",
          "link": "https://leetcode.com/problems/build-array-from-permutation",
          "otherCompanies": [
            ["Adobe", 3],
            ["Google", 2],
            ["Uber", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "perfect-rectangle",
          "name": "Perfect Rectangle",
          "link": "https://leetcode.com/problems/perfect-rectangle",
          "otherCompanies": [["Google", 2]],
          "occurence": 4,
          "tags": ["Array", "Line Sweep"],
          "difficulty": "Hard"
        },
        {
          "slug": "interleaving-string",
          "name": "Interleaving String",
          "link": "https://leetcode.com/problems/interleaving-string",
          "otherCompanies": [
            ["Amazon", 4],
            ["Google", 3],
            ["Bloomberg", 2],
            ["Uber", 2]
          ],
          "occurence": 4,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-duplicate-letters",
          "name": "Remove Duplicate Letters",
          "link": "https://leetcode.com/problems/remove-duplicate-letters",
          "otherCompanies": [
            ["Facebook", 2],
            ["Amazon", 2],
            ["Salesforce", 2]
          ],
          "occurence": 4,
          "tags": ["String", "Stack", "Greedy", "Monotonic Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "consecutive-characters",
          "name": "Consecutive Characters",
          "link": "https://leetcode.com/problems/consecutive-characters",
          "otherCompanies": [["Google", 2]],
          "occurence": 3,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "transpose-matrix",
          "name": "Transpose Matrix",
          "link": "https://leetcode.com/problems/transpose-matrix",
          "otherCompanies": [
            ["Citadel", 2],
            ["Amazon", 2],
            ["Microsoft", 2]
          ],
          "occurence": 3,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "shuffle-the-array",
          "name": "Shuffle the Array",
          "link": "https://leetcode.com/problems/shuffle-the-array",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 3,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "decompress-run-length-encoded-list",
          "name": "Decompress Run-Length Encoded List",
          "link": "https://leetcode.com/problems/decompress-run-length-encoded-list",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 3,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "friend-circles",
          "name": "Friend Circles",
          "link": "https://leetcode.com/problems/friend-circles",
          "otherCompanies": [
            ["Amazon", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 3,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-highest-altitude",
          "name": "Find the Highest Altitude",
          "link": "https://leetcode.com/problems/find-the-highest-altitude",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-time-visiting-all-points",
          "name": "Minimum Time Visiting All Points",
          "link": "https://leetcode.com/problems/minimum-time-visiting-all-points",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Math", "Geometry"],
          "difficulty": "Easy"
        },
        {
          "slug": "nth-digit",
          "name": "Nth Digit",
          "link": "https://leetcode.com/problems/nth-digit",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Math", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-sub-arrays-with-odd-sum",
          "name": "Number of Sub-arrays With Odd Sum",
          "link": "https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["Array", "Math", "Dynamic Programming", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-town-judge",
          "name": "Find the Town Judge",
          "link": "https://leetcode.com/problems/find-the-town-judge",
          "otherCompanies": [
            ["Google", 2],
            ["Amazon", 2],
            ["Adobe", 2]
          ],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Graph"],
          "difficulty": "Easy"
        },
        {
          "slug": "increasing-subsequences",
          "name": "Increasing Subsequences",
          "link": "https://leetcode.com/problems/increasing-subsequences",
          "otherCompanies": [
            ["Google", 2],
            ["Yahoo", 1]
          ],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Backtracking", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "max-consecutive-ones",
          "name": "Max Consecutive Ones",
          "link": "https://leetcode.com/problems/max-consecutive-ones",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "third-maximum-number",
          "name": "Third Maximum Number",
          "link": "https://leetcode.com/problems/third-maximum-number",
          "otherCompanies": [
            ["Google", 2],
            ["Amazon", 2]
          ],
          "occurence": 2,
          "tags": ["Array", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "create-maximum-number",
          "name": "Create Maximum Number",
          "link": "https://leetcode.com/problems/create-maximum-number",
          "otherCompanies": [["Google", 1]],
          "occurence": 2,
          "tags": ["Stack", "Greedy", "Monotonic Stack"],
          "difficulty": "Hard"
        },
        {
          "slug": "super-ugly-number",
          "name": "Super Ugly Number",
          "link": "https://leetcode.com/problems/super-ugly-number",
          "otherCompanies": [
            ["Google", 2],
            ["Bloomberg", 2]
          ],
          "occurence": 2,
          "tags": ["Array", "Math", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "perfect-squares",
          "name": "Perfect Squares",
          "link": "https://leetcode.com/problems/perfect-squares",
          "otherCompanies": [
            ["Google", 2],
            ["Amazon", 2],
            ["Microsoft", 2]
          ],
          "occurence": 2,
          "tags": ["Math", "Dynamic Programming", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "unique-substrings-in-wraparound-string",
          "name": "Unique Substrings in Wraparound String",
          "link": "https://leetcode.com/problems/unique-substrings-in-wraparound-string",
          "otherCompanies": [["MAQ Software", 1]],
          "occurence": 2,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-operations-to-make-the-array-increasing",
          "name": "Minimum Operations to Make the Array Increasing",
          "link": "https://leetcode.com/problems/minimum-operations-to-make-the-array-increasing",
          "otherCompanies": [["Deutsche Bank", 1]],
          "occurence": 2,
          "tags": ["Array", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-two-string-arrays-are-equivalent",
          "name": "Check If Two String Arrays are Equivalent",
          "link": "https://leetcode.com/problems/check-if-two-string-arrays-are-equivalent",
          "otherCompanies": [["Facebook", 1]],
          "occurence": 2,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "create-target-array-in-the-given-order",
          "name": "Create Target Array in the Given Order",
          "link": "https://leetcode.com/problems/create-target-array-in-the-given-order",
          "otherCompanies": [
            ["Amazon", 2],
            ["Visa", 1]
          ],
          "occurence": 2,
          "tags": ["Array", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-complement",
          "name": "Number Complement",
          "link": "https://leetcode.com/problems/number-complement",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "group-the-people-given-the-group-size-they-belong-to",
          "name": "Group the People Given the Group Size They Belong To",
          "link": "https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 2,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Medium"
        },
        {
          "slug": "shortest-distance-to-a-character",
          "name": "Shortest Distance to a Character",
          "link": "https://leetcode.com/problems/shortest-distance-to-a-character",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 2,
          "tags": ["Array", "Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-numbers-are-ascending-in-a-sentence",
          "name": "Check if Numbers Are Ascending in a Sentence",
          "link": "https://leetcode.com/problems/check-if-numbers-are-ascending-in-a-sentence",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "partitioning-into-minimum-number-of-deci-binary-numbers",
          "name": "Partitioning Into Minimum Number Of Deci-Binary Numbers",
          "link": "https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "goal-parser-interpretation",
          "name": "Goal Parser Interpretation",
          "link": "https://leetcode.com/problems/goal-parser-interpretation",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "lucky-numbers-in-a-matrix",
          "name": "Lucky Numbers in a Matrix",
          "link": "https://leetcode.com/problems/lucky-numbers-in-a-matrix",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "deepest-leaves-sum",
          "name": "Deepest Leaves Sum",
          "link": "https://leetcode.com/problems/deepest-leaves-sum",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "day-of-the-week",
          "name": "Day of the Week",
          "link": "https://leetcode.com/problems/day-of-the-week",
          "otherCompanies": [["United Health Group", 1]],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "smallest-string-starting-from-leaf",
          "name": "Smallest String Starting From Leaf",
          "link": "https://leetcode.com/problems/smallest-string-starting-from-leaf",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-and-replace-pattern",
          "name": "Find and Replace Pattern",
          "link": "https://leetcode.com/problems/find-and-replace-pattern",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "1-bit-and-2-bit-characters",
          "name": "1-bit and 2-bit Characters",
          "link": "https://leetcode.com/problems/1-bit-and-2-bit-characters",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "longest-uncommon-subsequence-ii",
          "name": "Longest Uncommon Subsequence II",
          "link": "https://leetcode.com/problems/longest-uncommon-subsequence-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Two Pointers", "String", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "most-frequent-subtree-sum",
          "name": "Most Frequent Subtree Sum",
          "link": "https://leetcode.com/problems/most-frequent-subtree-sum",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "ones-and-zeroes",
          "name": "Ones and Zeroes",
          "link": "https://leetcode.com/problems/ones-and-zeroes",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "assign-cookies",
          "name": "Assign Cookies",
          "link": "https://leetcode.com/problems/assign-cookies",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Two Pointers", "Greedy", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-segments-in-a-string",
          "name": "Number of Segments in a String",
          "link": "https://leetcode.com/problems/number-of-segments-in-a-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "LinkedIn",
      "problems": [
        {
          "slug": "shortest-word-distance-ii",
          "name": "Shortest Word Distance II",
          "link": "https://leetcode.com/problems/shortest-word-distance-ii",
          "otherCompanies": [],
          "occurence": 71,
          "tags": ["Array", "Hash Table", "Two Pointers", "String", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "nested-list-weight-sum-ii",
          "name": "Nested List Weight Sum II",
          "link": "https://leetcode.com/problems/nested-list-weight-sum-ii",
          "otherCompanies": [],
          "occurence": 48,
          "tags": ["Stack", "Depth-First Search", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-subarray",
          "name": "Maximum Subarray",
          "link": "https://leetcode.com/problems/maximum-subarray",
          "otherCompanies": [
            ["Amazon", 35],
            ["Apple", 17],
            ["Microsoft", 15],
            ["Adobe", 12],
            ["Google", 11],
            ["Facebook", 11],
            ["Cisco", 11],
            ["JPMorgan", 5],
            ["Shopee", 5],
            ["Bloomberg", 4],
            ["Uber", 4],
            ["VMware", 4],
            ["Docusign", 3],
            ["Oracle", 3],
            ["Samsung", 3],
            ["Salesforce", 3],
            ["ByteDance", 3],
            ["Infosys", 2],
            ["PayTM", 2],
            ["ServiceNow", 2],
            ["Goldman Sachs", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 43,
          "tags": ["Array", "Divide and Conquer", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "max-stack",
          "name": "Max Stack",
          "link": "https://leetcode.com/problems/max-stack",
          "otherCompanies": [
            ["Yandex", 3],
            ["Facebook", 3],
            ["Amazon", 3],
            ["Microsoft", 3],
            ["VMware", 3],
            ["Lyft", 2]
          ],
          "occurence": 33,
          "tags": [
            "Linked List",
            "Stack",
            "Design",
            "Doubly-Linked List",
            "Ordered Set"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "maximum-product-subarray",
          "name": "Maximum Product Subarray",
          "link": "https://leetcode.com/problems/maximum-product-subarray",
          "otherCompanies": [
            ["Amazon", 17],
            ["Infosys", 3],
            ["Bloomberg", 3],
            ["Microsoft", 3],
            ["Google", 2],
            ["Adobe", 2]
          ],
          "occurence": 29,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "closest-binary-search-tree-value-ii",
          "name": "Closest Binary Search Tree Value II",
          "link": "https://leetcode.com/problems/closest-binary-search-tree-value-ii",
          "otherCompanies": [["Google", 2]],
          "occurence": 26,
          "tags": [
            "Two Pointers",
            "Stack",
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Heap (Priority Queue)",
            "Binary Tree"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "can-place-flowers",
          "name": "Can Place Flowers",
          "link": "https://leetcode.com/problems/can-place-flowers",
          "otherCompanies": [
            ["Facebook", 13],
            ["Amazon", 3],
            ["Bloomberg", 3],
            ["Yahoo", 2]
          ],
          "occurence": 21,
          "tags": ["Array", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "lowest-common-ancestor-of-a-binary-search-tree",
          "name": "Lowest Common Ancestor of a Binary Search Tree",
          "link": "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree",
          "otherCompanies": [
            ["Facebook", 5],
            ["Amazon", 3],
            ["Apple", 3],
            ["Google", 2],
            ["Microsoft", 2]
          ],
          "occurence": 18,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "all-oone-data-structure",
          "name": "All O`one Data Structure",
          "link": "https://leetcode.com/problems/all-oone-data-structure",
          "otherCompanies": [
            ["Amazon", 3],
            ["VMware", 2]
          ],
          "occurence": 17,
          "tags": ["Hash Table", "Linked List", "Design", "Doubly-Linked List"],
          "difficulty": "Hard"
        },
        {
          "slug": "shortest-word-distance",
          "name": "Shortest Word Distance",
          "link": "https://leetcode.com/problems/shortest-word-distance",
          "otherCompanies": [
            ["Amazon", 3],
            ["Facebook", 2],
            ["Microsoft", 2],
            ["Salesforce", 2]
          ],
          "occurence": 11,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "second-minimum-node-in-a-binary-tree",
          "name": "Second Minimum Node In a Binary Tree",
          "link": "https://leetcode.com/problems/second-minimum-node-in-a-binary-tree",
          "otherCompanies": [],
          "occurence": 11,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "partition-to-k-equal-sum-subsets",
          "name": "Partition to K Equal Sum Subsets",
          "link": "https://leetcode.com/problems/partition-to-k-equal-sum-subsets",
          "otherCompanies": [
            ["Google", 2],
            ["Amazon", 2]
          ],
          "occurence": 10,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Backtracking",
            "Bit Manipulation",
            "Memoization",
            "Bitmask"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-parenthesis-string",
          "name": "Valid Parenthesis String",
          "link": "https://leetcode.com/problems/valid-parenthesis-string",
          "otherCompanies": [
            ["Amazon", 5],
            ["Facebook", 4],
            ["Google", 3],
            ["Yahoo", 3]
          ],
          "occurence": 10,
          "tags": ["String", "Dynamic Programming", "Stack", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-depth-of-binary-tree",
          "name": "Maximum Depth of Binary Tree",
          "link": "https://leetcode.com/problems/maximum-depth-of-binary-tree",
          "otherCompanies": [
            ["Google", 4],
            ["Amazon", 4],
            ["Spotify", 4],
            ["Microsoft", 3],
            ["Facebook", 2],
            ["Bloomberg", 2],
            ["Apple", 2]
          ],
          "occurence": 10,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "sort-transformed-array",
          "name": "Sort Transformed Array",
          "link": "https://leetcode.com/problems/sort-transformed-array",
          "otherCompanies": [],
          "occurence": 10,
          "tags": ["Array", "Math", "Two Pointers", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-tree-level-order-traversal",
          "name": "Binary Tree Level Order Traversal",
          "link": "https://leetcode.com/problems/binary-tree-level-order-traversal",
          "otherCompanies": [
            ["Amazon", 8],
            ["Microsoft", 7],
            ["Facebook", 6],
            ["Bloomberg", 6],
            ["Oracle", 4],
            ["Google", 3],
            ["ServiceNow", 3],
            ["Apple", 2]
          ],
          "occurence": 9,
          "tags": ["Tree", "Breadth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "sqrtx",
          "name": "Sqrt(x)",
          "link": "https://leetcode.com/problems/sqrtx",
          "otherCompanies": [
            ["Amazon", 9],
            ["Apple", 5],
            ["Google", 4],
            ["Adobe", 4],
            ["Microsoft", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 9,
          "tags": ["Math", "Binary Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "binary-tree-upside-down",
          "name": "Binary Tree Upside Down",
          "link": "https://leetcode.com/problems/binary-tree-upside-down",
          "otherCompanies": [],
          "occurence": 9,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "graph-valid-tree",
          "name": "Graph Valid Tree",
          "link": "https://leetcode.com/problems/graph-valid-tree",
          "otherCompanies": [
            ["Google", 3],
            ["Amazon", 2],
            ["Microsoft", 2]
          ],
          "occurence": 8,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "max-points-on-a-line",
          "name": "Max Points on a Line",
          "link": "https://leetcode.com/problems/max-points-on-a-line",
          "otherCompanies": [
            ["Amazon", 4],
            ["Google", 3],
            ["Oracle", 3],
            ["Sprinklr", 2]
          ],
          "occurence": 8,
          "tags": ["Array", "Hash Table", "Math", "Geometry"],
          "difficulty": "Hard"
        },
        {
          "slug": "flatten-nested-list-iterator",
          "name": "Flatten Nested List Iterator",
          "link": "https://leetcode.com/problems/flatten-nested-list-iterator",
          "otherCompanies": [
            ["Apple", 5],
            ["Facebook", 4],
            ["Airbnb", 4],
            ["Twitter", 3],
            ["Amazon", 2],
            ["Uber", 2],
            ["Salesforce", 2]
          ],
          "occurence": 8,
          "tags": [
            "Stack",
            "Tree",
            "Depth-First Search",
            "Design",
            "Queue",
            "Iterator"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-k-pairs-with-smallest-sums",
          "name": "Find K Pairs with Smallest Sums",
          "link": "https://leetcode.com/problems/find-k-pairs-with-smallest-sums",
          "otherCompanies": [
            ["Apple", 3],
            ["Amazon", 2],
            ["Hotstar", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 8,
          "tags": ["Array", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-celebrity",
          "name": "Find the Celebrity",
          "link": "https://leetcode.com/problems/find-the-celebrity",
          "otherCompanies": [
            ["Microsoft", 5],
            ["Amazon", 4],
            ["Pinterest", 3],
            ["Apple", 3],
            ["Facebook", 2]
          ],
          "occurence": 6,
          "tags": ["Two Pointers", "Greedy", "Graph", "Interactive"],
          "difficulty": "Medium"
        },
        {
          "slug": "same-tree",
          "name": "Same Tree",
          "link": "https://leetcode.com/problems/same-tree",
          "otherCompanies": [
            ["Amazon", 5],
            ["Google", 3],
            ["Apple", 3],
            ["Facebook", 2],
            ["Bloomberg", 2]
          ],
          "occurence": 6,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "paint-house",
          "name": "Paint House",
          "link": "https://leetcode.com/problems/paint-house",
          "otherCompanies": [
            ["Twitter", 4],
            ["Amazon", 3]
          ],
          "occurence": 5,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "repeated-dna-sequences",
          "name": "Repeated DNA Sequences",
          "link": "https://leetcode.com/problems/repeated-dna-sequences",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 5,
          "tags": [
            "Hash Table",
            "String",
            "Bit Manipulation",
            "Sliding Window",
            "Rolling Hash",
            "Hash Function"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "factor-combinations",
          "name": "Factor Combinations",
          "link": "https://leetcode.com/problems/factor-combinations",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Array", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-smallest-letter-greater-than-target",
          "name": "Find Smallest Letter Greater Than Target",
          "link": "https://leetcode.com/problems/find-smallest-letter-greater-than-target",
          "otherCompanies": [
            ["Amazon", 2],
            ["Bloomberg", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "bulb-switcher",
          "name": "Bulb Switcher",
          "link": "https://leetcode.com/problems/bulb-switcher",
          "otherCompanies": [["Microsoft", 3]],
          "occurence": 4,
          "tags": ["Math", "Brainteaser"],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-perfect-square",
          "name": "Valid Perfect Square",
          "link": "https://leetcode.com/problems/valid-perfect-square",
          "otherCompanies": [["Google", 3]],
          "occurence": 3,
          "tags": ["Math", "Binary Search"],
          "difficulty": "Easy"
        },
        {
          "slug": "paint-house-ii",
          "name": "Paint House II",
          "link": "https://leetcode.com/problems/paint-house-ii",
          "otherCompanies": [
            ["Walmart Global Tech", 2],
            ["Facebook", 1]
          ],
          "occurence": 3,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "insert-into-a-binary-search-tree",
          "name": "Insert into a Binary Search Tree",
          "link": "https://leetcode.com/problems/insert-into-a-binary-search-tree",
          "otherCompanies": [
            ["Amazon", 2],
            ["Goldman Sachs", 2]
          ],
          "occurence": 3,
          "tags": ["Tree", "Binary Search Tree", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "print-binary-tree",
          "name": "Print Binary Tree",
          "link": "https://leetcode.com/problems/print-binary-tree",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 3,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "can-i-win",
          "name": "Can I Win",
          "link": "https://leetcode.com/problems/can-i-win",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Math",
            "Dynamic Programming",
            "Bit Manipulation",
            "Memoization",
            "Game Theory",
            "Bitmask"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "valid-triangle-number",
          "name": "Valid Triangle Number",
          "link": "https://leetcode.com/problems/valid-triangle-number",
          "otherCompanies": [
            ["Amazon", 2],
            ["Bloomberg", 2]
          ],
          "occurence": 2,
          "tags": [
            "Array",
            "Two Pointers",
            "Binary Search",
            "Greedy",
            "Sorting"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "shortest-word-distance-iii",
          "name": "Shortest Word Distance III",
          "link": "https://leetcode.com/problems/shortest-word-distance-iii",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "two-sum-iii-data-structure-design",
          "name": "Two Sum III - Data structure design",
          "link": "https://leetcode.com/problems/two-sum-iii-data-structure-design",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Hash Table",
            "Two Pointers",
            "Design",
            "Data Stream"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold",
          "name": "Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold",
          "link": "https://leetcode.com/problems/number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Sliding Window"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Uber",
      "problems": [
        {
          "slug": "word-search-ii",
          "name": "Word Search II",
          "link": "https://leetcode.com/problems/word-search-ii",
          "otherCompanies": [
            ["Amazon", 31],
            ["Cisco", 16],
            ["Microsoft", 7],
            ["Google", 5],
            ["Snapchat", 5],
            ["Facebook", 5],
            ["Twitter", 5],
            ["Karat", 5],
            ["Apple", 4]
          ],
          "occurence": 36,
          "tags": ["Array", "String", "Backtracking", "Trie", "Matrix"],
          "difficulty": "Hard"
        },
        {
          "slug": "top-k-frequent-words",
          "name": "Top K Frequent Words",
          "link": "https://leetcode.com/problems/top-k-frequent-words",
          "otherCompanies": [
            ["Amazon", 12],
            ["Microsoft", 8],
            ["Google", 7],
            ["Yahoo", 4],
            ["Facebook", 4],
            ["Bloomberg", 4],
            ["Apple", 3],
            ["Two Sigma", 2]
          ],
          "occurence": 17,
          "tags": [
            "Hash Table",
            "String",
            "Trie",
            "Sorting",
            "Heap (Priority Queue)",
            "Bucket Sort",
            "Counting"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",
          "name": "Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit",
          "link": "https://leetcode.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit",
          "otherCompanies": [
            ["Amazon", 12],
            ["Google", 3]
          ],
          "occurence": 14,
          "tags": [
            "Array",
            "Queue",
            "Sliding Window",
            "Heap (Priority Queue)",
            "Ordered Set",
            "Monotonic Queue"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "evaluate-division",
          "name": "Evaluate Division",
          "link": "https://leetcode.com/problems/evaluate-division",
          "otherCompanies": [
            ["Amazon", 10],
            ["Google", 8],
            ["Facebook", 8],
            ["Snapchat", 5],
            ["ByteDance", 4],
            ["Adobe", 3],
            ["Bloomberg", 2],
            ["BlackRock", 2]
          ],
          "occurence": 14,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Union Find",
            "Graph",
            "Shortest Path"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "dungeon-game",
          "name": "Dungeon Game",
          "link": "https://leetcode.com/problems/dungeon-game",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 12,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Hard"
        },
        {
          "slug": "kth-smallest-element-in-a-bst",
          "name": "Kth Smallest Element in a BST",
          "link": "https://leetcode.com/problems/kth-smallest-element-in-a-bst",
          "otherCompanies": [
            ["Amazon", 9],
            ["Facebook", 6],
            ["LinkedIn", 2],
            ["Microsoft", 2]
          ],
          "occurence": 11,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "leftmost-column-with-at-least-a-one",
          "name": "Leftmost Column with at Least a One",
          "link": "https://leetcode.com/problems/leftmost-column-with-at-least-a-one",
          "otherCompanies": [
            ["Facebook", 10],
            ["Google", 2]
          ],
          "occurence": 10,
          "tags": ["Array", "Binary Search", "Matrix", "Interactive"],
          "difficulty": "Medium"
        },
        {
          "slug": "reconstruct-itinerary",
          "name": "Reconstruct Itinerary",
          "link": "https://leetcode.com/problems/reconstruct-itinerary",
          "otherCompanies": [
            ["Facebook", 6],
            ["Google", 4],
            ["Amazon", 4],
            ["Twitter", 4],
            ["Netflix", 2]
          ],
          "occurence": 10,
          "tags": ["Depth-First Search", "Graph", "Eulerian Circuit"],
          "difficulty": "Hard"
        },
        {
          "slug": "optimal-account-balancing",
          "name": "Optimal Account Balancing",
          "link": "https://leetcode.com/problems/optimal-account-balancing",
          "otherCompanies": [
            ["Google", 4],
            ["Amazon", 2],
            ["Affirm", 2]
          ],
          "occurence": 8,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Backtracking",
            "Bit Manipulation",
            "Bitmask"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "minesweeper",
          "name": "Minesweeper",
          "link": "https://leetcode.com/problems/minesweeper",
          "otherCompanies": [
            ["Facebook", 6],
            ["LiveRamp", 3],
            ["Docusign", 2],
            ["Amazon", 2],
            ["Bloomberg", 2],
            ["Microsoft", 2]
          ],
          "occurence": 7,
          "tags": [
            "Array",
            "Depth-First Search",
            "Breadth-First Search",
            "Matrix"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "construct-k-palindrome-strings",
          "name": "Construct K Palindrome Strings",
          "link": "https://leetcode.com/problems/construct-k-palindrome-strings",
          "otherCompanies": [],
          "occurence": 7,
          "tags": ["Hash Table", "String", "Greedy", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "set-intersection-size-at-least-two",
          "name": "Set Intersection Size At Least Two",
          "link": "https://leetcode.com/problems/set-intersection-size-at-least-two",
          "otherCompanies": [["Drawbridge", 1]],
          "occurence": 7,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Hard"
        },
        {
          "slug": "number-of-islands-ii",
          "name": "Number of Islands II",
          "link": "https://leetcode.com/problems/number-of-islands-ii",
          "otherCompanies": [["Google", 2]],
          "occurence": 5,
          "tags": ["Array", "Union Find"],
          "difficulty": "Hard"
        },
        {
          "slug": "subtract-the-product-and-sum-of-digits-of-an-integer",
          "name": "Subtract the Product and Sum of Digits of an Integer",
          "link": "https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "ipo",
          "name": "IPO",
          "link": "https://leetcode.com/problems/ipo",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Array", "Greedy", "Sorting", "Heap (Priority Queue)"],
          "difficulty": "Hard"
        },
        {
          "slug": "my-calendar-i",
          "name": "My Calendar I",
          "link": "https://leetcode.com/problems/my-calendar-i",
          "otherCompanies": [
            ["Amazon", 4],
            ["Google", 3]
          ],
          "occurence": 4,
          "tags": ["Binary Search", "Design", "Segment Tree", "Ordered Set"],
          "difficulty": "Medium"
        },
        {
          "slug": "bomb-enemy",
          "name": "Bomb Enemy",
          "link": "https://leetcode.com/problems/bomb-enemy",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "word-pattern-ii",
          "name": "Word Pattern II",
          "link": "https://leetcode.com/problems/word-pattern-ii",
          "otherCompanies": [
            ["Pinterest", 2],
            ["Bolt", 2]
          ],
          "occurence": 3,
          "tags": ["Hash Table", "String", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-nice-pairs-in-an-array",
          "name": "Count Nice Pairs in an Array",
          "link": "https://leetcode.com/problems/count-nice-pairs-in-an-array",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Hash Table", "Math", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "merge-strings-alternately",
          "name": "Merge Strings Alternately",
          "link": "https://leetcode.com/problems/merge-strings-alternately",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "largest-plus-sign",
          "name": "Largest Plus Sign",
          "link": "https://leetcode.com/problems/largest-plus-sign",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "arithmetic-slices-ii-subsequence",
          "name": "Arithmetic Slices II - Subsequence",
          "link": "https://leetcode.com/problems/arithmetic-slices-ii-subsequence",
          "otherCompanies": [
            ["Google", 2],
            ["Adobe", 2],
            ["Baidu", 1]
          ],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "best-team-with-no-conflicts",
          "name": "Best Team With No Conflicts",
          "link": "https://leetcode.com/problems/best-team-with-no-conflicts",
          "otherCompanies": [["Morgan Stanley", 1]],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "fair-candy-swap",
          "name": "Fair Candy Swap",
          "link": "https://leetcode.com/problems/fair-candy-swap",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Binary Search", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "champagne-tower",
          "name": "Champagne Tower",
          "link": "https://leetcode.com/problems/champagne-tower",
          "otherCompanies": [
            ["Amazon", 2],
            ["Adobe", 2]
          ],
          "occurence": 2,
          "tags": ["Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "two-sum-iv-input-is-a-bst",
          "name": "Two Sum IV - Input is a BST",
          "link": "https://leetcode.com/problems/two-sum-iv-input-is-a-bst",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": [
            "Hash Table",
            "Two Pointers",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Search Tree",
            "Binary Tree"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "special-positions-in-a-binary-matrix",
          "name": "Special Positions in a Binary Matrix",
          "link": "https://leetcode.com/problems/special-positions-in-a-binary-matrix",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "thousand-separator",
          "name": "Thousand Separator",
          "link": "https://leetcode.com/problems/thousand-separator",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-the-distance-value-between-two-arrays",
          "name": "Find the Distance Value Between Two Arrays",
          "link": "https://leetcode.com/problems/find-the-distance-value-between-two-arrays",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Two Pointers", "Binary Search", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "iterator-for-combination",
          "name": "Iterator for Combination",
          "link": "https://leetcode.com/problems/iterator-for-combination",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Backtracking", "Design", "Iterator"],
          "difficulty": "Medium"
        },
        {
          "slug": "shortest-distance-to-target-color",
          "name": "Shortest Distance to Target Color",
          "link": "https://leetcode.com/problems/shortest-distance-to-target-color",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Binary Search", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "baseball-game",
          "name": "Baseball Game",
          "link": "https://leetcode.com/problems/baseball-game",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Stack", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "remove-boxes",
          "name": "Remove Boxes",
          "link": "https://leetcode.com/problems/remove-boxes",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming", "Memoization"],
          "difficulty": "Hard"
        },
        {
          "slug": "intersection-of-multiple-arrays",
          "name": "Intersection of Multiple Arrays",
          "link": "https://leetcode.com/problems/intersection-of-multiple-arrays",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "calculate-digit-sum-of-a-string",
          "name": "Calculate Digit Sum of a String",
          "link": "https://leetcode.com/problems/calculate-digit-sum-of-a-string",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-strings-that-appear-as-substrings-in-word",
          "name": "Number of Strings That Appear as Substrings in Word",
          "link": "https://leetcode.com/problems/number-of-strings-that-appear-as-substrings-in-word",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-string-is-a-prefix-of-array",
          "name": "Check If String Is a Prefix of Array",
          "link": "https://leetcode.com/problems/check-if-string-is-a-prefix-of-array",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-xor-for-each-query",
          "name": "Maximum XOR for Each Query",
          "link": "https://leetcode.com/problems/maximum-xor-for-each-query",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Bit Manipulation", "Prefix Sum"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Goldman Sachs",
      "problems": [
        {
          "slug": "height-checker",
          "name": "Height Checker",
          "link": "https://leetcode.com/problems/height-checker",
          "otherCompanies": [
            ["Apple", 2],
            ["Salesforce", 1]
          ],
          "occurence": 20,
          "tags": ["Array", "Sorting", "Counting Sort"],
          "difficulty": "Easy"
        },
        {
          "slug": "high-five",
          "name": "High Five",
          "link": "https://leetcode.com/problems/high-five",
          "otherCompanies": [],
          "occurence": 12,
          "tags": ["Array", "Hash Table", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "delete-and-earn",
          "name": "Delete and Earn",
          "link": "https://leetcode.com/problems/delete-and-earn",
          "otherCompanies": [
            ["Amazon", 5],
            ["Google", 2]
          ],
          "occurence": 11,
          "tags": ["Array", "Hash Table", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-number-of-teams",
          "name": "Count Number of Teams",
          "link": "https://leetcode.com/problems/count-number-of-teams",
          "otherCompanies": [
            ["Amazon", 3],
            ["Facebook", 2]
          ],
          "occurence": 7,
          "tags": ["Array", "Dynamic Programming", "Binary Indexed Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "fraction-addition-and-subtraction",
          "name": "Fraction Addition and Subtraction",
          "link": "https://leetcode.com/problems/fraction-addition-and-subtraction",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Math", "String", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-winner-of-the-circular-game",
          "name": "Find the Winner of the Circular Game",
          "link": "https://leetcode.com/problems/find-the-winner-of-the-circular-game",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 4,
          "tags": ["Array", "Math", "Recursion", "Queue", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "elimination-game",
          "name": "Elimination Game",
          "link": "https://leetcode.com/problems/elimination-game",
          "otherCompanies": [
            ["Bloomberg", 4],
            ["Adobe", 2]
          ],
          "occurence": 4,
          "tags": ["Math", "Recursion"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-moves-to-equal-array-elements",
          "name": "Minimum Moves to Equal Array Elements",
          "link": "https://leetcode.com/problems/minimum-moves-to-equal-array-elements",
          "otherCompanies": [
            ["Mathworks", 3],
            ["Twitter", 3],
            ["Visa", 3]
          ],
          "occurence": 4,
          "tags": ["Array", "Math"],
          "difficulty": "Medium"
        },
        {
          "slug": "greatest-common-divisor-of-strings",
          "name": "Greatest Common Divisor of Strings",
          "link": "https://leetcode.com/problems/greatest-common-divisor-of-strings",
          "otherCompanies": [["Atlassian", 2]],
          "occurence": 3,
          "tags": ["Math", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "coin-change-2",
          "name": "Coin Change 2",
          "link": "https://leetcode.com/problems/coin-change-2",
          "otherCompanies": [
            ["Apple", 3],
            ["Google", 2],
            ["Bloomberg", 2],
            ["Cisco", 2]
          ],
          "occurence": 3,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "check-if-the-sentence-is-pangram",
          "name": "Check if the Sentence Is Pangram",
          "link": "https://leetcode.com/problems/check-if-the-sentence-is-pangram",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 3,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-permutation",
          "name": "Find Permutation",
          "link": "https://leetcode.com/problems/find-permutation",
          "otherCompanies": [["Google", 1]],
          "occurence": 2,
          "tags": ["Array", "String", "Stack", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-number-of-arrows-to-burst-balloons",
          "name": "Minimum Number of Arrows to Burst Balloons",
          "link": "https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons",
          "otherCompanies": [
            ["Google", 2],
            ["Facebook", 2]
          ],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "remove-duplicates-from-an-unsorted-linked-list",
          "name": "Remove Duplicates From an Unsorted Linked List",
          "link": "https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 2,
          "tags": ["Hash Table", "Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "circular-array-loop",
          "name": "Circular Array Loop",
          "link": "https://leetcode.com/problems/circular-array-loop",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Two Pointers"],
          "difficulty": "Medium"
        },
        {
          "slug": "h-index-ii",
          "name": "H-Index II",
          "link": "https://leetcode.com/problems/h-index-ii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "pascals-triangle-ii",
          "name": "Pascal's Triangle II",
          "link": "https://leetcode.com/problems/pascals-triangle-ii",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Easy"
        },
        {
          "slug": "keep-multiplying-found-values-by-two",
          "name": "Keep Multiplying Found Values by Two",
          "link": "https://leetcode.com/problems/keep-multiplying-found-values-by-two",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Sorting", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-length-of-string-after-deleting-similar-ends",
          "name": "Minimum Length of String After Deleting Similar Ends",
          "link": "https://leetcode.com/problems/minimum-length-of-string-after-deleting-similar-ends",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "perform-string-shifts",
          "name": "Perform String Shifts",
          "link": "https://leetcode.com/problems/perform-string-shifts",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "ByteDance",
      "problems": [
        {
          "slug": "design-a-stack-with-increment-operation",
          "name": "Design a Stack With Increment Operation",
          "link": "https://leetcode.com/problems/design-a-stack-with-increment-operation",
          "otherCompanies": [],
          "occurence": 13,
          "tags": ["Array", "Stack", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "spiral-matrix-ii",
          "name": "Spiral Matrix II",
          "link": "https://leetcode.com/problems/spiral-matrix-ii",
          "otherCompanies": [
            ["Apple", 4],
            ["Amazon", 2]
          ],
          "occurence": 6,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "the-number-of-weak-characters-in-the-game",
          "name": "The Number of Weak Characters in the Game",
          "link": "https://leetcode.com/problems/the-number-of-weak-characters-in-the-game",
          "otherCompanies": [["Google", 3]],
          "occurence": 4,
          "tags": ["Array", "Stack", "Greedy", "Sorting", "Monotonic Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "the-maze",
          "name": "The Maze",
          "link": "https://leetcode.com/problems/the-maze",
          "otherCompanies": [
            ["Google", 3],
            ["Snapchat", 3],
            ["Square", 2],
            ["Facebook", 2],
            ["Amazon", 2],
            ["Microsoft", 2]
          ],
          "occurence": 4,
          "tags": ["Depth-First Search", "Breadth-First Search", "Graph"],
          "difficulty": "Medium"
        },
        {
          "slug": "path-sum-iii",
          "name": "Path Sum III",
          "link": "https://leetcode.com/problems/path-sum-iii",
          "otherCompanies": [
            ["Facebook", 4],
            ["Google", 3],
            ["DoorDash", 3]
          ],
          "occurence": 4,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "palindrome-partitioning",
          "name": "Palindrome Partitioning",
          "link": "https://leetcode.com/problems/palindrome-partitioning",
          "otherCompanies": [
            ["Google", 3],
            ["Apple", 3],
            ["Facebook", 2],
            ["Amazon", 2]
          ],
          "occurence": 3,
          "tags": ["String", "Dynamic Programming", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "plates-between-candles",
          "name": "Plates Between Candles",
          "link": "https://leetcode.com/problems/plates-between-candles",
          "otherCompanies": [["Amazon", 3]],
          "occurence": 3,
          "tags": ["Array", "String", "Binary Search", "Prefix Sum"],
          "difficulty": "Medium"
        },
        {
          "slug": "closest-dessert-cost",
          "name": "Closest Dessert Cost",
          "link": "https://leetcode.com/problems/closest-dessert-cost",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 3,
          "tags": ["Array", "Dynamic Programming", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "max-consecutive-ones-ii",
          "name": "Max Consecutive Ones II",
          "link": "https://leetcode.com/problems/max-consecutive-ones-ii",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 3,
          "tags": ["Array", "Dynamic Programming", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-time-to-type-word-using-special-typewriter",
          "name": "Minimum Time to Type Word Using Special Typewriter",
          "link": "https://leetcode.com/problems/minimum-time-to-type-word-using-special-typewriter",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["String", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "the-maze-ii",
          "name": "The Maze II",
          "link": "https://leetcode.com/problems/the-maze-ii",
          "otherCompanies": [
            ["Google", 2],
            ["Microsoft", 2]
          ],
          "occurence": 2,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Graph",
            "Heap (Priority Queue)",
            "Shortest Path"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "n-queens-ii",
          "name": "N-Queens II",
          "link": "https://leetcode.com/problems/n-queens-ii",
          "otherCompanies": [["Zenefits", 1]],
          "occurence": 2,
          "tags": ["Backtracking"],
          "difficulty": "Hard"
        },
        {
          "slug": "k-inverse-pairs-array",
          "name": "K Inverse Pairs Array",
          "link": "https://leetcode.com/problems/k-inverse-pairs-array",
          "otherCompanies": [["Works Applications", 1]],
          "occurence": 2,
          "tags": ["Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "k-th-smallest-in-lexicographical-order",
          "name": "K-th Smallest in Lexicographical Order",
          "link": "https://leetcode.com/problems/k-th-smallest-in-lexicographical-order",
          "otherCompanies": [["Hulu", 1]],
          "occurence": 2,
          "tags": ["Trie"],
          "difficulty": "Hard"
        },
        {
          "slug": "path-with-maximum-gold",
          "name": "Path with Maximum Gold",
          "link": "https://leetcode.com/problems/path-with-maximum-gold",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Backtracking", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "incremental-memory-leak",
          "name": "Incremental Memory Leak",
          "link": "https://leetcode.com/problems/incremental-memory-leak",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Simulation"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Yahoo",
      "problems": [
        {
          "slug": "restore-ip-addresses",
          "name": "Restore IP Addresses",
          "link": "https://leetcode.com/problems/restore-ip-addresses",
          "otherCompanies": [
            ["Amazon", 3],
            ["Microsoft", 3],
            ["ByteDance", 3],
            ["Facebook", 2],
            ["Arista Networks", 2],
            ["ByteDance", 2]
          ],
          "occurence": 5,
          "tags": ["String", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "intersection-of-two-arrays-ii",
          "name": "Intersection of Two Arrays II",
          "link": "https://leetcode.com/problems/intersection-of-two-arrays-ii",
          "otherCompanies": [
            ["Facebook", 4],
            ["Amazon", 4],
            ["Adobe", 3],
            ["Bloomberg", 2]
          ],
          "occurence": 4,
          "tags": [
            "Array",
            "Hash Table",
            "Two Pointers",
            "Binary Search",
            "Sorting"
          ],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-product-of-two-elements-in-an-array",
          "name": "Maximum Product of Two Elements in an Array",
          "link": "https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array",
          "otherCompanies": [
            ["Facebook", 2],
            ["Samsung", 1]
          ],
          "occurence": 2,
          "tags": ["Array", "Sorting", "Heap (Priority Queue)"],
          "difficulty": "Easy"
        },
        {
          "slug": "how-many-numbers-are-smaller-than-the-current-number",
          "name": "How Many Numbers Are Smaller Than the Current Number",
          "link": "https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Sorting", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "sum-of-root-to-leaf-binary-numbers",
          "name": "Sum of Root To Leaf Binary Numbers",
          "link": "https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers",
          "otherCompanies": [
            ["Amazon", 2],
            ["Apple", 2]
          ],
          "occurence": 2,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-bottom-left-tree-value",
          "name": "Find Bottom Left Tree Value",
          "link": "https://leetcode.com/problems/find-bottom-left-tree-value",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Tree",
            "Depth-First Search",
            "Breadth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "scramble-string",
          "name": "Scramble String",
          "link": "https://leetcode.com/problems/scramble-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "matrix-cells-in-distance-order",
          "name": "Matrix Cells in Distance Order",
          "link": "https://leetcode.com/problems/matrix-cells-in-distance-order",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Geometry", "Sorting", "Matrix"],
          "difficulty": "Easy"
        },
        {
          "slug": "binary-number-with-alternating-bits",
          "name": "Binary Number with Alternating Bits",
          "link": "https://leetcode.com/problems/binary-number-with-alternating-bits",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-distance-in-arrays",
          "name": "Maximum Distance in Arrays",
          "link": "https://leetcode.com/problems/maximum-distance-in-arrays",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "largest-palindrome-product",
          "name": "Largest Palindrome Product",
          "link": "https://leetcode.com/problems/largest-palindrome-product",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math"],
          "difficulty": "Hard"
        }
      ]
    },
    {
      "sectionName": "Salesforce",
      "problems": [
        {
          "slug": "maximum-product-of-three-numbers",
          "name": "Maximum Product of Three Numbers",
          "link": "https://leetcode.com/problems/maximum-product-of-three-numbers",
          "otherCompanies": [],
          "occurence": 7,
          "tags": ["Array", "Math", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "largest-number",
          "name": "Largest Number",
          "link": "https://leetcode.com/problems/largest-number",
          "otherCompanies": [
            ["Microsoft", 4],
            ["Facebook", 3],
            ["Amazon", 2],
            ["Apple", 2],
            ["Goldman Sachs", 2],
            ["Visa", 2],
            ["Oracle", 2],
            ["Adobe", 2]
          ],
          "occurence": 6,
          "tags": ["Array", "String", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "zuma-game",
          "name": "Zuma Game",
          "link": "https://leetcode.com/problems/zuma-game",
          "otherCompanies": [
            ["Bloomberg", 4],
            ["Baidu", 1]
          ],
          "occurence": 6,
          "tags": [
            "String",
            "Dynamic Programming",
            "Breadth-First Search",
            "Memoization"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "boats-to-save-people",
          "name": "Boats to Save People",
          "link": "https://leetcode.com/problems/boats-to-save-people",
          "otherCompanies": [
            ["Amazon", 4],
            ["Intuit", 3],
            ["Bloomberg", 2],
            ["Apple", 2],
            ["Uber", 2],
            ["Microsoft", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Two Pointers", "Greedy", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-absolute-difference",
          "name": "Minimum Absolute Difference",
          "link": "https://leetcode.com/problems/minimum-absolute-difference",
          "otherCompanies": [
            ["Google", 2],
            ["JPMorgan", 2]
          ],
          "occurence": 3,
          "tags": ["Array", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "construct-the-lexicographically-largest-valid-sequence",
          "name": "Construct the Lexicographically Largest Valid Sequence",
          "link": "https://leetcode.com/problems/construct-the-lexicographically-largest-valid-sequence",
          "otherCompanies": [["Facebook", 1]],
          "occurence": 3,
          "tags": ["Array", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "find-the-smallest-divisor-given-a-threshold",
          "name": "Find the Smallest Divisor Given a Threshold",
          "link": "https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold",
          "otherCompanies": [["Airbnb", 2]],
          "occurence": 3,
          "tags": ["Array", "Binary Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "teemo-attacking",
          "name": "Teemo Attacking",
          "link": "https://leetcode.com/problems/teemo-attacking",
          "otherCompanies": [["Riot Games", 1]],
          "occurence": 2,
          "tags": ["Array", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-whether-two-strings-are-almost-equivalent",
          "name": "Check Whether Two Strings are Almost Equivalent",
          "link": "https://leetcode.com/problems/check-whether-two-strings-are-almost-equivalent",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "String", "Counting"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Cisco",
      "problems": [
        {
          "slug": "rotate-image",
          "name": "Rotate Image",
          "link": "https://leetcode.com/problems/rotate-image",
          "otherCompanies": [
            ["Facebook", 12],
            ["Microsoft", 9],
            ["Amazon", 8],
            ["Apple", 8],
            ["Adobe", 5],
            ["Google", 4],
            ["Bloomberg", 3],
            ["Uber", 2],
            ["Rubrik", 2]
          ],
          "occurence": 16,
          "tags": ["Array", "Math", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "expressive-words",
          "name": "Expressive Words",
          "link": "https://leetcode.com/problems/expressive-words",
          "otherCompanies": [
            ["Google", 3],
            ["Facebook", 2]
          ],
          "occurence": 11,
          "tags": ["Array", "Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "decode-ways",
          "name": "Decode Ways",
          "link": "https://leetcode.com/problems/decode-ways",
          "otherCompanies": [
            ["Amazon", 9],
            ["Google", 8],
            ["Lyft", 7],
            ["Facebook", 4],
            ["Microsoft", 4],
            ["Bloomberg", 3],
            ["Apple", 3],
            ["Goldman Sachs", 3]
          ],
          "occurence": 9,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "validate-ip-address",
          "name": "Validate IP Address",
          "link": "https://leetcode.com/problems/validate-ip-address",
          "otherCompanies": [
            ["Amazon", 2],
            ["Microsoft", 2]
          ],
          "occurence": 8,
          "tags": ["String"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-difference-between-increasing-elements",
          "name": "Maximum Difference Between Increasing Elements",
          "link": "https://leetcode.com/problems/maximum-difference-between-increasing-elements",
          "otherCompanies": [["Expedia", 3]],
          "occurence": 6,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "beautiful-arrangement",
          "name": "Beautiful Arrangement",
          "link": "https://leetcode.com/problems/beautiful-arrangement",
          "otherCompanies": [],
          "occurence": 3,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Backtracking",
            "Bit Manipulation",
            "Bitmask"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-population-year",
          "name": "Maximum Population Year",
          "link": "https://leetcode.com/problems/maximum-population-year",
          "otherCompanies": [
            ["Google", 2],
            ["Bloomberg", 2]
          ],
          "occurence": 2,
          "tags": ["Array", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-binary-string-has-at-most-one-segment-of-ones",
          "name": "Check if Binary String Has at Most One Segment of Ones",
          "link": "https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Twitter",
      "problems": [
        {
          "slug": "finding-the-users-active-minutes",
          "name": "Finding the Users Active Minutes",
          "link": "https://leetcode.com/problems/finding-the-users-active-minutes",
          "otherCompanies": [],
          "occurence": 10,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Medium"
        },
        {
          "slug": "tweet-counts-per-frequency",
          "name": "Tweet Counts Per Frequency",
          "link": "https://leetcode.com/problems/tweet-counts-per-frequency",
          "otherCompanies": [],
          "occurence": 6,
          "tags": [
            "Hash Table",
            "Binary Search",
            "Design",
            "Sorting",
            "Ordered Set"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "design-log-storage-system",
          "name": "Design Log Storage System",
          "link": "https://leetcode.com/problems/design-log-storage-system",
          "otherCompanies": [],
          "occurence": 5,
          "tags": ["Hash Table", "String", "Design", "Ordered Set"],
          "difficulty": "Medium"
        },
        {
          "slug": "rearrange-string-k-distance-apart",
          "name": "Rearrange String k Distance Apart",
          "link": "https://leetcode.com/problems/rearrange-string-k-distance-apart",
          "otherCompanies": [
            ["Google", 3],
            ["Microsoft", 2],
            ["VMware", 2]
          ],
          "occurence": 3,
          "tags": [
            "Hash Table",
            "String",
            "Greedy",
            "Sorting",
            "Heap (Priority Queue)",
            "Counting"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "time-needed-to-buy-tickets",
          "name": "Time Needed to Buy Tickets",
          "link": "https://leetcode.com/problems/time-needed-to-buy-tickets",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Queue", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "design-authentication-manager",
          "name": "Design Authentication Manager",
          "link": "https://leetcode.com/problems/design-authentication-manager",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "Design"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-elements-to-add-to-form-a-given-sum",
          "name": "Minimum Elements to Add to Form a Given Sum",
          "link": "https://leetcode.com/problems/minimum-elements-to-add-to-form-a-given-sum",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-gap",
          "name": "Binary Gap",
          "link": "https://leetcode.com/problems/binary-gap",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Bit Manipulation"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Yandex",
      "problems": [
        {
          "slug": "maximize-distance-to-closest-person",
          "name": "Maximize Distance to Closest Person",
          "link": "https://leetcode.com/problems/maximize-distance-to-closest-person",
          "otherCompanies": [
            ["Microsoft", 5],
            ["Google", 3],
            ["Amazon", 3]
          ],
          "occurence": 8,
          "tags": ["Array"],
          "difficulty": "Medium"
        },
        {
          "slug": "zigzag-iterator",
          "name": "Zigzag Iterator",
          "link": "https://leetcode.com/problems/zigzag-iterator",
          "otherCompanies": [
            ["Amazon", 2],
            ["Apple", 2],
            ["Google", 1]
          ],
          "occurence": 6,
          "tags": ["Array", "Design", "Queue", "Iterator"],
          "difficulty": "Medium"
        },
        {
          "slug": "summary-ranges",
          "name": "Summary Ranges",
          "link": "https://leetcode.com/problems/summary-ranges",
          "otherCompanies": [["Qualtrics", 2]],
          "occurence": 6,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "longest-subarray-of-1s-after-deleting-one-element",
          "name": "Longest Subarray of 1's After Deleting One Element",
          "link": "https://leetcode.com/problems/longest-subarray-of-1s-after-deleting-one-element",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Dynamic Programming", "Sliding Window"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-recent-calls",
          "name": "Number of Recent Calls",
          "link": "https://leetcode.com/problems/number-of-recent-calls",
          "otherCompanies": [["Bloomberg", 1]],
          "occurence": 3,
          "tags": ["Design", "Queue", "Data Stream"],
          "difficulty": "Easy"
        },
        {
          "slug": "number-of-students-doing-homework-at-a-given-time",
          "name": "Number of Students Doing Homework at a Given Time",
          "link": "https://leetcode.com/problems/number-of-students-doing-homework-at-a-given-time",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array"],
          "difficulty": "Easy"
        },
        {
          "slug": "line-reflection",
          "name": "Line Reflection",
          "link": "https://leetcode.com/problems/line-reflection",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Math"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Airbnb",
      "problems": [
        {
          "slug": "palindrome-pairs",
          "name": "Palindrome Pairs",
          "link": "https://leetcode.com/problems/palindrome-pairs",
          "otherCompanies": [
            ["Google", 3],
            ["Apple", 3],
            ["Shopee", 3],
            ["Facebook", 2],
            ["Microsoft", 2]
          ],
          "occurence": 14,
          "tags": ["Array", "Hash Table", "String", "Trie"],
          "difficulty": "Hard"
        },
        {
          "slug": "flatten-2d-vector",
          "name": "Flatten 2D Vector",
          "link": "https://leetcode.com/problems/flatten-2d-vector",
          "otherCompanies": [],
          "occurence": 9,
          "tags": ["Array", "Two Pointers", "Design", "Iterator"],
          "difficulty": "Medium"
        },
        {
          "slug": "smallest-common-region",
          "name": "Smallest Common Region",
          "link": "https://leetcode.com/problems/smallest-common-region",
          "otherCompanies": [],
          "occurence": 7,
          "tags": [
            "Array",
            "Hash Table",
            "String",
            "Tree",
            "Depth-First Search",
            "Breadth-First Search"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "pour-water",
          "name": "Pour Water",
          "link": "https://leetcode.com/problems/pour-water",
          "otherCompanies": [],
          "occurence": 6,
          "tags": ["Array", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "tag-validator",
          "name": "Tag Validator",
          "link": "https://leetcode.com/problems/tag-validator",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["String", "Stack"],
          "difficulty": "Hard"
        },
        {
          "slug": "mini-parser",
          "name": "Mini Parser",
          "link": "https://leetcode.com/problems/mini-parser",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Stack", "Depth-First Search"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Expedia",
      "problems": [
        {
          "slug": "reformat-date",
          "name": "Reformat Date",
          "link": "https://leetcode.com/problems/reformat-date",
          "otherCompanies": [
            ["ByteDance", 10],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 14,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "making-file-names-unique",
          "name": "Making File Names Unique",
          "link": "https://leetcode.com/problems/making-file-names-unique",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 14,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "string-compression",
          "name": "String Compression",
          "link": "https://leetcode.com/problems/string-compression",
          "otherCompanies": [
            ["Amazon", 8],
            ["Apple", 6],
            ["Goldman Sachs", 6],
            ["Microsoft", 6],
            ["Facebook", 5],
            ["Visa", 4],
            ["Yandex", 3],
            ["Redfin", 3]
          ],
          "occurence": 8,
          "tags": ["Two Pointers", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "degree-of-an-array",
          "name": "Degree of an Array",
          "link": "https://leetcode.com/problems/degree-of-an-array",
          "otherCompanies": [
            ["Athenahealth", 4],
            ["Mathworks", 3],
            ["IBM", 3],
            ["Walmart Global Tech", 3],
            ["Adobe", 2],
            ["Nvidia", 2]
          ],
          "occurence": 5,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Easy"
        },
        {
          "slug": "best-meeting-point",
          "name": "Best Meeting Point",
          "link": "https://leetcode.com/problems/best-meeting-point",
          "otherCompanies": [
            ["Google", 2],
            ["Facebook", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "Math", "Sorting", "Matrix"],
          "difficulty": "Hard"
        },
        {
          "slug": "number-of-different-integers-in-a-string",
          "name": "Number of Different Integers in a String",
          "link": "https://leetcode.com/problems/number-of-different-integers-in-a-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Oracle",
      "problems": [
        {
          "slug": "substring-with-concatenation-of-all-words",
          "name": "Substring with Concatenation of All Words",
          "link": "https://leetcode.com/problems/substring-with-concatenation-of-all-words",
          "otherCompanies": [
            ["Amazon", 3],
            ["Google", 2],
            ["Apple", 2],
            ["Microsoft", 2]
          ],
          "occurence": 3,
          "tags": ["Hash Table", "String", "Sliding Window"],
          "difficulty": "Hard"
        },
        {
          "slug": "convert-binary-number-in-a-linked-list-to-integer",
          "name": "Convert Binary Number in a Linked List to Integer",
          "link": "https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Linked List", "Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "split-linked-list-in-parts",
          "name": "Split Linked List in Parts",
          "link": "https://leetcode.com/problems/split-linked-list-in-parts",
          "otherCompanies": [
            ["Amazon", 2],
            ["Apple", 2]
          ],
          "occurence": 2,
          "tags": ["Linked List"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-index-sum-of-two-lists",
          "name": "Minimum Index Sum of Two Lists",
          "link": "https://leetcode.com/problems/minimum-index-sum-of-two-lists",
          "otherCompanies": [
            ["Apple", 2],
            ["Yelp", 1]
          ],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "shifting-letters",
          "name": "Shifting Letters",
          "link": "https://leetcode.com/problems/shifting-letters",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "html-entity-parser",
          "name": "HTML Entity Parser",
          "link": "https://leetcode.com/problems/html-entity-parser",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "String"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Karat",
      "problems": [
        {
          "slug": "subdomain-visit-count",
          "name": "Subdomain Visit Count",
          "link": "https://leetcode.com/problems/subdomain-visit-count",
          "otherCompanies": [
            ["Indeed", 25],
            ["Wayfair", 9],
            ["Intuit", 2],
            ["Walmart Global Tech", 2]
          ],
          "occurence": 40,
          "tags": ["Array", "Hash Table", "String", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "alert-using-same-key-card-three-or-more-times-in-a-one-hour-period",
          "name": "Alert Using Same Key-Card Three or More Times in a One Hour Period",
          "link": "https://leetcode.com/problems/alert-using-same-key-card-three-or-more-times-in-a-one-hour-period",
          "otherCompanies": [
            ["Robinhood", 8],
            ["Wayfair", 5],
            ["Indeed", 4]
          ],
          "occurence": 16,
          "tags": ["Array", "Hash Table", "String", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-length-of-repeated-subarray",
          "name": "Maximum Length of Repeated Subarray",
          "link": "https://leetcode.com/problems/maximum-length-of-repeated-subarray",
          "otherCompanies": [
            ["Indeed", 8],
            ["Wayfair", 7]
          ],
          "occurence": 16,
          "tags": [
            "Array",
            "Binary Search",
            "Dynamic Programming",
            "Sliding Window",
            "Rolling Hash",
            "Hash Function"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "find-words-that-can-be-formed-by-characters",
          "name": "Find Words That Can Be Formed by Characters",
          "link": "https://leetcode.com/problems/find-words-that-can-be-formed-by-characters",
          "otherCompanies": [
            ["Indeed", 6],
            ["Google", 2],
            ["Amazon", 2]
          ],
          "occurence": 12,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "check-if-every-row-and-column-contains-all-numbers",
          "name": "Check if Every Row and Column Contains All Numbers",
          "link": "https://leetcode.com/problems/check-if-every-row-and-column-contains-all-numbers",
          "otherCompanies": [["instacart", 2]],
          "occurence": 4,
          "tags": ["Array", "Hash Table", "Matrix"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Hudson River Trading",
      "problems": [
        {
          "slug": "equal-sum-arrays-with-minimum-number-of-operations",
          "name": "Equal Sum Arrays With Minimum Number of Operations",
          "link": "https://leetcode.com/problems/equal-sum-arrays-with-minimum-number-of-operations",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 7,
          "tags": ["Array", "Hash Table", "Greedy", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "24-game",
          "name": "24 Game",
          "link": "https://leetcode.com/problems/24-game",
          "otherCompanies": [["Google", 2]],
          "occurence": 3,
          "tags": ["Array", "Math", "Backtracking"],
          "difficulty": "Hard"
        },
        {
          "slug": "detect-pattern-of-length-m-repeated-k-or-more-times",
          "name": "Detect Pattern of Length M Repeated K or More Times",
          "link": "https://leetcode.com/problems/detect-pattern-of-length-m-repeated-k-or-more-times",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Enumeration"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-69-number",
          "name": "Maximum 69 Number",
          "link": "https://leetcode.com/problems/maximum-69-number",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Greedy"],
          "difficulty": "Easy"
        },
        {
          "slug": "convert-integer-to-the-sum-of-two-no-zero-integers",
          "name": "Convert Integer to the Sum of Two No-Zero Integers",
          "link": "https://leetcode.com/problems/convert-integer-to-the-sum-of-two-no-zero-integers",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "JPMorgan",
      "problems": [
        {
          "slug": "reconstruct-original-digits-from-english",
          "name": "Reconstruct Original Digits from English",
          "link": "https://leetcode.com/problems/reconstruct-original-digits-from-english",
          "otherCompanies": [],
          "occurence": 69,
          "tags": ["Hash Table", "Math", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "even-odd-tree",
          "name": "Even Odd Tree",
          "link": "https://leetcode.com/problems/even-odd-tree",
          "otherCompanies": [["Bloomberg", 1]],
          "occurence": 3,
          "tags": ["Tree", "Breadth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "paint-fence",
          "name": "Paint Fence",
          "link": "https://leetcode.com/problems/paint-fence",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": ["Dynamic Programming"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-value-to-get-positive-step-by-step-sum",
          "name": "Minimum Value to Get Positive Step by Step Sum",
          "link": "https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Prefix Sum"],
          "difficulty": "Easy"
        },
        {
          "slug": "determine-color-of-a-chessboard-square",
          "name": "Determine Color of a Chessboard Square",
          "link": "https://leetcode.com/problems/determine-color-of-a-chessboard-square",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Virtu Financial",
      "problems": [
        {
          "slug": "hexspeak",
          "name": "Hexspeak",
          "link": "https://leetcode.com/problems/hexspeak",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "array-transformation",
          "name": "Array Transformation",
          "link": "https://leetcode.com/problems/array-transformation",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "how-many-apples-can-you-put-into-the-basket",
          "name": "How Many Apples Can You Put into the Basket",
          "link": "https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Greedy", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "count-substrings-with-only-one-distinct-letter",
          "name": "Count Substrings with Only One Distinct Letter",
          "link": "https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Math", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "count-number-of-homogenous-substrings",
          "name": "Count Number of Homogenous Substrings",
          "link": "https://leetcode.com/problems/count-number-of-homogenous-substrings",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "String"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Walmart Global Tech",
      "problems": [
        {
          "slug": "remove-colored-pieces-if-both-neighbors-are-the-same-color",
          "name": "Remove Colored Pieces if Both Neighbors are the Same Color",
          "link": "https://leetcode.com/problems/remove-colored-pieces-if-both-neighbors-are-the-same-color",
          "otherCompanies": [],
          "occurence": 9,
          "tags": ["Math", "String", "Greedy", "Game Theory"],
          "difficulty": "Medium"
        },
        {
          "slug": "strange-printer",
          "name": "Strange Printer",
          "link": "https://leetcode.com/problems/strange-printer",
          "otherCompanies": [["Google", 3]],
          "occurence": 4,
          "tags": ["String", "Dynamic Programming"],
          "difficulty": "Hard"
        },
        {
          "slug": "split-a-string-in-balanced-strings",
          "name": "Split a String in Balanced Strings",
          "link": "https://leetcode.com/problems/split-a-string-in-balanced-strings",
          "otherCompanies": [
            ["Amazon", 2],
            ["Bloomberg", 2],
            ["Adobe", 2]
          ],
          "occurence": 2,
          "tags": ["String", "Greedy", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-smallest-common-element-in-all-rows",
          "name": "Find Smallest Common Element in All Rows",
          "link": "https://leetcode.com/problems/find-smallest-common-element-in-all-rows",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Hash Table",
            "Binary Search",
            "Matrix",
            "Counting"
          ],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Snapchat",
      "problems": [
        {
          "slug": "android-unlock-patterns",
          "name": "Android Unlock Patterns",
          "link": "https://leetcode.com/problems/android-unlock-patterns",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 3,
          "tags": ["Dynamic Programming", "Backtracking"],
          "difficulty": "Medium"
        },
        {
          "slug": "predict-the-winner",
          "name": "Predict the Winner",
          "link": "https://leetcode.com/problems/predict-the-winner",
          "otherCompanies": [["Google", 2]],
          "occurence": 2,
          "tags": [
            "Array",
            "Math",
            "Dynamic Programming",
            "Recursion",
            "Game Theory"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-height-trees",
          "name": "Minimum Height Trees",
          "link": "https://leetcode.com/problems/minimum-height-trees",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": [
            "Depth-First Search",
            "Breadth-First Search",
            "Graph",
            "Topological Sort"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "largest-merge-of-two-strings",
          "name": "Largest Merge Of Two Strings",
          "link": "https://leetcode.com/problems/largest-merge-of-two-strings",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Two Pointers", "String", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "ternary-expression-parser",
          "name": "Ternary Expression Parser",
          "link": "https://leetcode.com/problems/ternary-expression-parser",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Stack", "Recursion"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Capital One",
      "problems": [
        {
          "slug": "license-key-formatting",
          "name": "License Key Formatting",
          "link": "https://leetcode.com/problems/license-key-formatting",
          "otherCompanies": [["Google", 1]],
          "occurence": 18,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "count-primes",
          "name": "Count Primes",
          "link": "https://leetcode.com/problems/count-primes",
          "otherCompanies": [
            ["Amazon", 4],
            ["Microsoft", 4],
            ["Apple", 2],
            ["Adobe", 2],
            ["ByteDance", 2],
            ["SAP", 2]
          ],
          "occurence": 14,
          "tags": ["Array", "Math", "Enumeration", "Number Theory"],
          "difficulty": "Medium"
        },
        {
          "slug": "restore-the-array-from-adjacent-pairs",
          "name": "Restore the Array From Adjacent Pairs",
          "link": "https://leetcode.com/problems/restore-the-array-from-adjacent-pairs",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Medium"
        },
        {
          "slug": "four-divisors",
          "name": "Four Divisors",
          "link": "https://leetcode.com/problems/four-divisors",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Quora",
      "problems": [
        {
          "slug": "construct-target-array-with-multiple-sums",
          "name": "Construct Target Array With Multiple Sums",
          "link": "https://leetcode.com/problems/construct-target-array-with-multiple-sums",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Heap (Priority Queue)"],
          "difficulty": "Hard"
        },
        {
          "slug": "range-frequency-queries",
          "name": "Range Frequency Queries",
          "link": "https://leetcode.com/problems/range-frequency-queries",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Array",
            "Hash Table",
            "Binary Search",
            "Design",
            "Segment Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-number-of-words-you-can-type",
          "name": "Maximum Number of Words You Can Type",
          "link": "https://leetcode.com/problems/maximum-number-of-words-you-can-type",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "substrings-of-size-three-with-distinct-characters",
          "name": "Substrings of Size Three with Distinct Characters",
          "link": "https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "String", "Sliding Window", "Counting"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "VMware",
      "problems": [
        {
          "slug": "verify-preorder-sequence-in-binary-search-tree",
          "name": "Verify Preorder Sequence in Binary Search Tree",
          "link": "https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree",
          "otherCompanies": [
            ["Oracle", 2],
            ["Zenefits", 1]
          ],
          "occurence": 4,
          "tags": [
            "Stack",
            "Tree",
            "Binary Search Tree",
            "Recursion",
            "Monotonic Stack",
            "Binary Tree"
          ],
          "difficulty": "Medium"
        },
        {
          "slug": "rearrange-words-in-a-sentence",
          "name": "Rearrange Words in a Sentence",
          "link": "https://leetcode.com/problems/rearrange-words-in-a-sentence",
          "otherCompanies": [
            ["Amazon", 2],
            ["Expedia", 1]
          ],
          "occurence": 2,
          "tags": ["String", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "missing-number-in-arithmetic-progression",
          "name": "Missing Number In Arithmetic Progression",
          "link": "https://leetcode.com/problems/missing-number-in-arithmetic-progression",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "longest-repeating-substring",
          "name": "Longest Repeating Substring",
          "link": "https://leetcode.com/problems/longest-repeating-substring",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "String",
            "Binary Search",
            "Dynamic Programming",
            "Rolling Hash",
            "Suffix Array",
            "Hash Function"
          ],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Wayfair",
      "problems": [
        {
          "slug": "the-number-of-full-rounds-you-have-played",
          "name": "The Number of Full Rounds You Have Played",
          "link": "https://leetcode.com/problems/the-number-of-full-rounds-you-have-played",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Math", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "max-chunks-to-make-sorted",
          "name": "Max Chunks To Make Sorted",
          "link": "https://leetcode.com/problems/max-chunks-to-make-sorted",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Stack", "Greedy", "Sorting", "Monotonic Stack"],
          "difficulty": "Medium"
        },
        {
          "slug": "minimum-moves-to-reach-target-score",
          "name": "Minimum Moves to Reach Target Score",
          "link": "https://leetcode.com/problems/minimum-moves-to-reach-target-score",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "delete-characters-to-make-fancy-string",
          "name": "Delete Characters to Make Fancy String",
          "link": "https://leetcode.com/problems/delete-characters-to-make-fancy-string",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "IBM",
      "problems": [
        {
          "slug": "backspace-string-compare",
          "name": "Backspace String Compare",
          "link": "https://leetcode.com/problems/backspace-string-compare",
          "otherCompanies": [
            ["Google", 3],
            ["Apple", 3],
            ["Visa", 3],
            ["Booking", 3],
            ["Bloomberg", 2],
            ["ByteDance", 2]
          ],
          "occurence": 6,
          "tags": ["Two Pointers", "String", "Stack", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "most-visited-sector-in-a-circular-track",
          "name": "Most Visited Sector in a Circular Track",
          "link": "https://leetcode.com/problems/most-visited-sector-in-a-circular-track",
          "otherCompanies": [],
          "occurence": 6,
          "tags": ["Array", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "water-bottles",
          "name": "Water Bottles",
          "link": "https://leetcode.com/problems/water-bottles",
          "otherCompanies": [
            ["Amazon", 2],
            ["Microsoft", 1]
          ],
          "occurence": 4,
          "tags": ["Math", "Simulation"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "DoorDash",
      "problems": [
        {
          "slug": "binary-tree-maximum-path-sum",
          "name": "Binary Tree Maximum Path Sum",
          "link": "https://leetcode.com/problems/binary-tree-maximum-path-sum",
          "otherCompanies": [
            ["Amazon", 17],
            ["Facebook", 16],
            ["Microsoft", 7],
            ["Google", 6],
            ["ByteDance", 6],
            ["Snapchat", 3],
            ["Oracle", 3],
            ["Twilio", 2],
            ["Bloomberg", 2],
            ["TuSimple", 2],
            ["Sprinklr", 2],
            ["Twitter", 2],
            ["Adobe", 2]
          ],
          "occurence": 18,
          "tags": [
            "Dynamic Programming",
            "Tree",
            "Depth-First Search",
            "Binary Tree"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "buddy-strings",
          "name": "Buddy Strings",
          "link": "https://leetcode.com/problems/buddy-strings",
          "otherCompanies": [["Facebook", 2]],
          "occurence": 13,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-nearest-point-that-has-the-same-x-or-y-coordinate",
          "name": "Find Nearest Point That Has the Same X or Y Coordinate",
          "link": "https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Flipkart",
      "problems": [
        {
          "slug": "number-of-students-unable-to-eat-lunch",
          "name": "Number of Students Unable to Eat Lunch",
          "link": "https://leetcode.com/problems/number-of-students-unable-to-eat-lunch",
          "otherCompanies": [],
          "occurence": 7,
          "tags": ["Array", "Stack", "Queue", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "maximum-number-of-coins-you-can-get",
          "name": "Maximum Number of Coins You Can Get",
          "link": "https://leetcode.com/problems/maximum-number-of-coins-you-can-get",
          "otherCompanies": [["Dunzo", 2]],
          "occurence": 3,
          "tags": ["Array", "Math", "Greedy", "Sorting", "Game Theory"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-length-of-pair-chain",
          "name": "Maximum Length of Pair Chain",
          "link": "https://leetcode.com/problems/maximum-length-of-pair-chain",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Dynamic Programming", "Greedy", "Sorting"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Square",
      "problems": [
        {
          "slug": "available-captures-for-rook",
          "name": "Available Captures for Rook",
          "link": "https://leetcode.com/problems/available-captures-for-rook",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "unique-morse-code-words",
          "name": "Unique Morse Code Words",
          "link": "https://leetcode.com/problems/unique-morse-code-words",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "squirrel-simulation",
          "name": "Squirrel Simulation",
          "link": "https://leetcode.com/problems/squirrel-simulation",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "SAP",
      "problems": [
        {
          "slug": "monotone-increasing-digits",
          "name": "Monotone Increasing Digits",
          "link": "https://leetcode.com/problems/monotone-increasing-digits",
          "otherCompanies": [
            ["Microsoft", 2],
            ["Amazon", 1]
          ],
          "occurence": 9,
          "tags": ["Math", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "prison-cells-after-n-days",
          "name": "Prison Cells After N Days",
          "link": "https://leetcode.com/problems/prison-cells-after-n-days",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Math", "Bit Manipulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-students-taking-exam",
          "name": "Maximum Students Taking Exam",
          "link": "https://leetcode.com/problems/maximum-students-taking-exam",
          "otherCompanies": [],
          "occurence": 1,
          "tags": [
            "Array",
            "Dynamic Programming",
            "Bit Manipulation",
            "Matrix",
            "Bitmask"
          ],
          "difficulty": "Hard"
        }
      ]
    },
    {
      "sectionName": "Dropbox",
      "problems": [
        {
          "slug": "find-duplicate-file-in-system",
          "name": "Find Duplicate File in System",
          "link": "https://leetcode.com/problems/find-duplicate-file-in-system",
          "otherCompanies": [["Apple", 2]],
          "occurence": 6,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-phone-directory",
          "name": "Design Phone Directory",
          "link": "https://leetcode.com/problems/design-phone-directory",
          "otherCompanies": [["Amazon", 2]],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "Linked List", "Design", "Queue"],
          "difficulty": "Medium"
        },
        {
          "slug": "seat-reservation-manager",
          "name": "Seat Reservation Manager",
          "link": "https://leetcode.com/problems/seat-reservation-manager",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Design", "Heap (Priority Queue)"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Mercari",
      "problems": [
        {
          "slug": "crawler-log-folder",
          "name": "Crawler Log Folder",
          "link": "https://leetcode.com/problems/crawler-log-folder",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "String", "Stack"],
          "difficulty": "Easy"
        },
        {
          "slug": "max-difference-you-can-get-from-changing-an-integer",
          "name": "Max Difference You Can Get From Changing an Integer",
          "link": "https://leetcode.com/problems/max-difference-you-can-get-from-changing-an-integer",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Greedy"],
          "difficulty": "Medium"
        },
        {
          "slug": "count-largest-group",
          "name": "Count Largest Group",
          "link": "https://leetcode.com/problems/count-largest-group",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "Math"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Tesla",
      "problems": [
        {
          "slug": "largest-perimeter-triangle",
          "name": "Largest Perimeter Triangle",
          "link": "https://leetcode.com/problems/largest-perimeter-triangle",
          "otherCompanies": [],
          "occurence": 3,
          "tags": ["Array", "Math", "Greedy", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "minimum-changes-to-make-alternating-binary-string",
          "name": "Minimum Changes To Make Alternating Binary String",
          "link": "https://leetcode.com/problems/minimum-changes-to-make-alternating-binary-string",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["String"],
          "difficulty": "Easy"
        },
        {
          "slug": "spiral-matrix-iii",
          "name": "Spiral Matrix III",
          "link": "https://leetcode.com/problems/spiral-matrix-iii",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Postmates",
      "problems": [
        {
          "slug": "print-words-vertically",
          "name": "Print Words Vertically",
          "link": "https://leetcode.com/problems/print-words-vertically",
          "otherCompanies": [["Microsoft", 1]],
          "occurence": 2,
          "tags": ["Array", "String", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "most-beautiful-item-for-each-query",
          "name": "Most Beautiful Item for Each Query",
          "link": "https://leetcode.com/problems/most-beautiful-item-for-each-query",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Binary Search", "Sorting"],
          "difficulty": "Medium"
        },
        {
          "slug": "determine-if-two-strings-are-close",
          "name": "Determine if Two Strings Are Close",
          "link": "https://leetcode.com/problems/determine-if-two-strings-are-close",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Hash Table", "String", "Sorting"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Grab",
      "problems": [
        {
          "slug": "bulb-switcher-iii",
          "name": "Bulb Switcher III",
          "link": "https://leetcode.com/problems/bulb-switcher-iii",
          "otherCompanies": [["Microsoft", 2]],
          "occurence": 4,
          "tags": ["Array"],
          "difficulty": "Medium"
        },
        {
          "slug": "number-of-steps-to-reduce-a-number-to-zero",
          "name": "Number of Steps to Reduce a Number to Zero",
          "link": "https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero",
          "otherCompanies": [
            ["Apple", 2],
            ["Microsoft", 2]
          ],
          "occurence": 2,
          "tags": ["Math", "Bit Manipulation"],
          "difficulty": "Easy"
        },
        {
          "slug": "brick-wall",
          "name": "Brick Wall",
          "link": "https://leetcode.com/problems/brick-wall",
          "otherCompanies": [["Bloomberg", 2]],
          "occurence": 2,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Atlassian",
      "problems": [
        {
          "slug": "rank-teams-by-votes",
          "name": "Rank Teams by Votes",
          "link": "https://leetcode.com/problems/rank-teams-by-votes",
          "otherCompanies": [
            ["Google", 2],
            ["Square", 2],
            ["Coursera", 2]
          ],
          "occurence": 18,
          "tags": ["Array", "Hash Table", "String", "Sorting", "Counting"],
          "difficulty": "Medium"
        },
        {
          "slug": "lemonade-change",
          "name": "Lemonade Change",
          "link": "https://leetcode.com/problems/lemonade-change",
          "otherCompanies": [
            ["Amazon", 3],
            ["Apple", 2]
          ],
          "occurence": 4,
          "tags": ["Array", "Greedy"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Yelp",
      "problems": [
        {
          "slug": "destination-city",
          "name": "Destination City",
          "link": "https://leetcode.com/problems/destination-city",
          "otherCompanies": [["Google", 2]],
          "occurence": 5,
          "tags": ["Hash Table", "String"],
          "difficulty": "Easy"
        },
        {
          "slug": "filter-restaurants-by-vegan-friendly-price-and-distance",
          "name": "Filter Restaurants by Vegan-Friendly, Price and Distance",
          "link": "https://leetcode.com/problems/filter-restaurants-by-vegan-friendly-price-and-distance",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Array", "Sorting"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Nvidia",
      "problems": [
        {
          "slug": "lonely-pixel-i",
          "name": "Lonely Pixel I",
          "link": "https://leetcode.com/problems/lonely-pixel-i",
          "otherCompanies": [
            ["Microsoft", 3],
            ["Google", 1]
          ],
          "occurence": 3,
          "tags": ["Array", "Hash Table", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "k-empty-slots",
          "name": "K Empty Slots",
          "link": "https://leetcode.com/problems/k-empty-slots",
          "otherCompanies": [["Google", 1]],
          "occurence": 2,
          "tags": [
            "Array",
            "Binary Indexed Tree",
            "Sliding Window",
            "Ordered Set"
          ],
          "difficulty": "Hard"
        }
      ]
    },
    {
      "sectionName": "Opendoor",
      "problems": [
        {
          "slug": "game-of-life",
          "name": "Game of Life",
          "link": "https://leetcode.com/problems/game-of-life",
          "otherCompanies": [
            ["Amazon", 6],
            ["Dropbox", 5],
            ["Bloomberg", 4],
            ["Adobe", 4],
            ["Google", 3],
            ["Microsoft", 3],
            ["Snapchat", 2],
            ["Apple", 2]
          ],
          "occurence": 10,
          "tags": ["Array", "Matrix", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "design-excel-sum-formula",
          "name": "Design Excel Sum Formula",
          "link": "https://leetcode.com/problems/design-excel-sum-formula",
          "otherCompanies": [["Google", 3]],
          "occurence": 3,
          "tags": ["Graph", "Design", "Topological Sort"],
          "difficulty": "Hard"
        }
      ]
    },
    {
      "sectionName": "Spotify",
      "problems": [
        {
          "slug": "ransom-note",
          "name": "Ransom Note",
          "link": "https://leetcode.com/problems/ransom-note",
          "otherCompanies": [
            ["Google", 3],
            ["Apple", 3],
            ["Adobe", 2]
          ],
          "occurence": 10,
          "tags": ["Hash Table", "String", "Counting"],
          "difficulty": "Easy"
        },
        {
          "slug": "valid-anagram",
          "name": "Valid Anagram",
          "link": "https://leetcode.com/problems/valid-anagram",
          "otherCompanies": [
            ["Facebook", 8],
            ["Amazon", 8],
            ["Bloomberg", 8],
            ["Microsoft", 6],
            ["Goldman Sachs", 3],
            ["Affirm", 3],
            ["Google", 2],
            ["Apple", 2]
          ],
          "occurence": 8,
          "tags": ["Hash Table", "String", "Sorting"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Lyft",
      "problems": [
        {
          "slug": "read-n-characters-given-read4-ii-call-multiple-times",
          "name": "Read N Characters Given Read4 II - Call multiple times",
          "link": "https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times",
          "otherCompanies": [
            ["Google", 4],
            ["Facebook", 2],
            ["Microsoft", 2]
          ],
          "occurence": 8,
          "tags": ["String", "Simulation", "Interactive"],
          "difficulty": "Hard"
        },
        {
          "slug": "water-and-jug-problem",
          "name": "Water and Jug Problem",
          "link": "https://leetcode.com/problems/water-and-jug-problem",
          "otherCompanies": [],
          "occurence": 4,
          "tags": ["Math", "Depth-First Search", "Breadth-First Search"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Cruise Automation",
      "problems": [
        {
          "slug": "unique-paths-ii",
          "name": "Unique Paths II",
          "link": "https://leetcode.com/problems/unique-paths-ii",
          "otherCompanies": [
            ["Facebook", 8],
            ["Amazon", 7],
            ["Qualtrics", 4],
            ["Google", 3],
            ["Cisco", 3],
            ["Oracle", 2],
            ["Microsoft", 2]
          ],
          "occurence": 9,
          "tags": ["Array", "Dynamic Programming", "Matrix"],
          "difficulty": "Medium"
        },
        {
          "slug": "synonymous-sentences",
          "name": "Synonymous Sentences",
          "link": "https://leetcode.com/problems/synonymous-sentences",
          "otherCompanies": [["Amazon", 3]],
          "occurence": 3,
          "tags": [
            "Array",
            "Hash Table",
            "String",
            "Backtracking",
            "Union Find"
          ],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Dunzo",
      "problems": [
        {
          "slug": "max-sum-of-rectangle-no-larger-than-k",
          "name": "Max Sum of Rectangle No Larger Than K",
          "link": "https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k",
          "otherCompanies": [],
          "occurence": 2,
          "tags": [
            "Array",
            "Binary Search",
            "Matrix",
            "Prefix Sum",
            "Ordered Set"
          ],
          "difficulty": "Hard"
        },
        {
          "slug": "stone-game-vii",
          "name": "Stone Game VII",
          "link": "https://leetcode.com/problems/stone-game-vii",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Math", "Dynamic Programming", "Game Theory"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "LiveRamp",
      "problems": [
        {
          "slug": "longest-harmonious-subsequence",
          "name": "Longest Harmonious Subsequence",
          "link": "https://leetcode.com/problems/longest-harmonious-subsequence",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Sorting"],
          "difficulty": "Easy"
        },
        {
          "slug": "distribute-candies",
          "name": "Distribute Candies",
          "link": "https://leetcode.com/problems/distribute-candies",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Mathworks",
      "problems": [
        {
          "slug": "fraction-to-recurring-decimal",
          "name": "Fraction to Recurring Decimal",
          "link": "https://leetcode.com/problems/fraction-to-recurring-decimal",
          "otherCompanies": [
            ["Facebook", 4],
            ["Goldman Sachs", 3],
            ["Airbnb", 3]
          ],
          "occurence": 5,
          "tags": ["Hash Table", "Math", "String"],
          "difficulty": "Medium"
        },
        {
          "slug": "keyboard-row",
          "name": "Keyboard Row",
          "link": "https://leetcode.com/problems/keyboard-row",
          "otherCompanies": [],
          "occurence": 2,
          "tags": ["Array", "Hash Table", "String"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Accenture",
      "problems": [
        {
          "slug": "count-odd-numbers-in-an-interval-range",
          "name": "Count Odd Numbers in an Interval Range",
          "link": "https://leetcode.com/problems/count-odd-numbers-in-an-interval-range",
          "otherCompanies": [
            ["Amazon", 2],
            ["Apple", 2],
            ["Adobe", 2]
          ],
          "occurence": 2,
          "tags": ["Math"],
          "difficulty": "Easy"
        },
        {
          "slug": "find-subsequence-of-length-k-with-the-largest-sum",
          "name": "Find Subsequence of Length K With the Largest Sum",
          "link": "https://leetcode.com/problems/find-subsequence-of-length-k-with-the-largest-sum",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "Sorting", "Heap (Priority Queue)"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Two Sigma",
      "problems": [
        {
          "slug": "maximum-product-of-splitted-binary-tree",
          "name": "Maximum Product of Splitted Binary Tree",
          "link": "https://leetcode.com/problems/maximum-product-of-splitted-binary-tree",
          "otherCompanies": [["Amazon", 4]],
          "occurence": 4,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Medium"
        },
        {
          "slug": "power-of-four",
          "name": "Power of Four",
          "link": "https://leetcode.com/problems/power-of-four",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Bit Manipulation", "Recursion"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "Sprinklr",
      "problems": [
        {
          "slug": "next-greater-numerically-balanced-number",
          "name": "Next Greater Numerically Balanced Number",
          "link": "https://leetcode.com/problems/next-greater-numerically-balanced-number",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Math", "Backtracking", "Enumeration"],
          "difficulty": "Medium"
        },
        {
          "slug": "maximum-subarray-sum-after-one-operation",
          "name": "Maximum Subarray Sum After One Operation",
          "link": "https://leetcode.com/problems/maximum-subarray-sum-after-one-operation",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Dynamic Programming"],
          "difficulty": "Medium"
        }
      ]
    },
    {
      "sectionName": "Indeed",
      "problems": [
        {
          "slug": "sum-of-even-numbers-after-queries",
          "name": "Sum of Even Numbers After Queries",
          "link": "https://leetcode.com/problems/sum-of-even-numbers-after-queries",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Simulation"],
          "difficulty": "Medium"
        },
        {
          "slug": "binary-tree-tilt",
          "name": "Binary Tree Tilt",
          "link": "https://leetcode.com/problems/binary-tree-tilt",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Tree", "Depth-First Search", "Binary Tree"],
          "difficulty": "Easy"
        }
      ]
    },
    {
      "sectionName": "JP Morgan",
      "problems": [
        {
          "slug": "lexicographically-smallest-string-after-applying-operations",
          "name": "Lexicographically Smallest String After Applying Operations",
          "link": "https://leetcode.com/problems/lexicographically-smallest-string-after-applying-operations",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["String", "Breadth-First Search"],
          "difficulty": "Medium"
        },
        {
          "slug": "display-table-of-food-orders-in-a-restaurant",
          "name": "Display Table of Food Orders in a Restaurant",
          "link": "https://leetcode.com/problems/display-table-of-food-orders-in-a-restaurant",
          "otherCompanies": [],
          "occurence": 1,
          "tags": ["Array", "Hash Table", "String", "Sorting", "Ordered Set"],
          "difficulty": "Medium"
        }
      ]
    }
  ]
}