1"use strict";(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[7560],{7560:e=>{e.exports=JSON.parse('{"source":"Community-reported dataset (open source, GitHub: liquidslr/leetcode-company-wise-problems)","fetched":"2026-07-18","questions":[{"t":"Minimum Edge Reversals So Every Node Is Reachable","d":"Hard","f":100,"l":"https://leetcode.com/problems/minimum-edge-reversals-so-every-node-is-reachable","topics":["Dynamic Programming","Depth-First Search","Breadth-First Search","Graph"]},{"t":"Number of Unique XOR Triplets I","d":"Medium","f":100,"l":"https://leetcode.com/problems/number-of-unique-xor-triplets-i","topics":["Array","Math","Bit Manipulation"],"recent":true},{"t":"Number of Unique XOR Triplets II","d":"Medium","f":100,"l":"https://leetcode.com/problems/number-of-unique-xor-triplets-ii","topics":["Array","Math","Bit Manipulation","Enumeration"],"recent":true},{"t":"Delete and Earn","d":"Medium","f":78,"l":"https://leetcode.com/problems/delete-and-earn","topics":["Array","Hash Table","Dynamic Programming"]},{"t":"Making A Large Island","d":"Hard","f":78,"l":"https://leetcode.com/problems/making-a-large-island","topics":["Array","Depth-First Search","Breadth-First Search","Union Find","Matrix"]},{"t":"Number of Strings Which Can Be Rearranged to Contain Substring","d":"Medium","f":78,"l":"https://leetcode.com/problems/number-of-strings-which-can-be-rearranged-to-contain-substring","topics":["Math","Dynamic Programming","Combinatorics"]},{"t":"Painting the Walls","d":"Hard","f":78,"l":"https://leetcode.com/problems/painting-the-walls","topics":["Array","Dynamic Programming"]},{"t":"Next Permutation","d":"Medium","f":73.9,"l":"https://leetcode.com/problems/next-permutation","topics":["Array","Two Pointers"],"recent":true},{"t":"Number of Ways to Form a Target String Given a Dictionary","d":"Hard","f":73.9,"l":"https://leetcode.com/problems/number-of-ways-to-form-a-target-string-given-a-dictionary","topics":["Array","String","Dynamic Programming"]},{"t":"Design Twitter","d":"Medium","f":71.1,"l":"https://leetcode.com/problems/design-twitter","topics":["Hash Table","Linked List","Design","Heap (Priority Queue)"]},{"t":"Minimum Number of Taps to Open to Water a Garden","d":"Hard","f":71.1,"l":"https://leetcode.com/problems/minimum-number-of-taps-to-open-to-water-a-garden","topics":["Array","Dynamic Programming","Greedy"]},{"t":"Subsequence With the Minimum Score","d":"Hard","f":71.1,"l":"https://leetcode.com/problems/subsequence-with-the-minimum-score","topics":["Two Pointers","String","Binary Search"]},{"t":"Two Sum","d":"Easy","f":71.1,"l":"https://leetcode.com/problems/two-sum","topics":["Array","Hash Table"]},{"t":"Count Subarrays With Fixed Bounds","d":"Hard","f":65.1,"l":"https://leetcode.com/problems/count-subarrays-with-fixed-bounds","topics":["Array","Queue","Sliding Window","Monotonic Queue"]},{"t":"Beautiful Arrangement","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/beautiful-arrangement","topics":["Array","Dynamic Programming","Backtracking","Bit Manipulation","Bitmask"]},{"t":"Car Pooling","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/car-pooling","topics":["Array","Sorting","Heap (Priority Queue)","Simulation","Prefix Sum"]},{"t":"Consecutive Numbers","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/consecutive-numbers","topics":["Database"]},{"t":"Count Complete Substrings","d":"Hard","f":61.3,"l":"https://leetcode.com/problems/count-complete-substrings","topics":["Hash Table","String","Sliding Window"]},{"t":"Find the Longest Equal Subarray","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/find-the-longest-equal-subarray","topics":["Array","Hash Table","Binary Search","Sliding Window"]},{"t":"Jump Game","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/jump-game","topics":["Array","Dynamic Programming","Greedy"]},{"t":"Longest Non-decreasing Subarray From Two Arrays","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/longest-non-decreasing-subarray-from-two-arrays","topics":["Array","Dynamic Programming"]},{"t":"Minimum Degree of a Connected Trio in a Graph","d":"Hard","f":61.3,"l":"https://leetcode.com/problems/minimum-degree-of-a-connected-trio-in-a-graph","topics":["Graph"]},{"t":"Minimum Time to Complete Trips","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/minimum-time-to-complete-trips","topics":["Array","Binary Search"]},{"t":"Number of Possible Sets of Closing Branches","d":"Hard","f":61.3,"l":"https://leetcode.com/problems/number-of-possible-sets-of-closing-branches","topics":["Bit Manipulation","Graph","Heap (Priority Queue)","Enumeration","Shortest Path"]},{"t":"Search Suggestions System","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/search-suggestions-system","topics":["Array","String","Binary Search","Trie","Sorting","Heap (Priority Queue)"]},{"t":"Second Highest Salary","d":"Medium","f":61.3,"l":"https://leetcode.com/problems/second-highest-salary","topics":["Database"]}]}')}}]);
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.