acRate
float64 9.28
95.3
| difficulty
stringclasses 3
values | frontendQuestionId
int64 1
3.51k
| isFavor
bool 1
class | paidOnly
bool 2
classes | title
stringlengths 3
79
| titleSlug
stringlengths 3
79
| topicTags
stringlengths 2
153
| hasSolution
bool 2
classes | hasVideoSolution
bool 2
classes |
---|---|---|---|---|---|---|---|---|---|
52.867472 | Medium | 1,901 | false | false | Find a Peak Element II | find-a-peak-element-ii | ['Array', 'Binary Search', 'Matrix'] | false | false |
42.380192 | Medium | 1,902 | false | true | Depth of BST Given Insertion Order | depth-of-bst-given-insertion-order | ['Array', 'Tree', 'Binary Search Tree', 'Binary Tree', 'Ordered Set'] | false | false |
64.691396 | Easy | 1,903 | false | false | Largest Odd Number in String | largest-odd-number-in-string | ['Math', 'String', 'Greedy'] | true | false |
43.381137 | Medium | 1,904 | false | false | The Number of Full Rounds You Have Played | the-number-of-full-rounds-you-have-played | ['Math', 'String'] | false | false |
72.817957 | Medium | 1,905 | false | false | Count Sub Islands | count-sub-islands | ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'] | true | false |
44.630132 | Medium | 1,906 | false | false | Minimum Absolute Difference Queries | minimum-absolute-difference-queries | ['Array', 'Hash Table'] | false | false |
61.838864 | Medium | 1,907 | false | false | Count Salary Categories | count-salary-categories | ['Database'] | true | false |
62.898213 | Medium | 1,908 | false | true | Game of Nim | game-of-nim | ['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Brainteaser', 'Game Theory'] | true | false |
28.527817 | Easy | 1,909 | false | false | Remove One Element to Make the Array Strictly Increasing | remove-one-element-to-make-the-array-strictly-increasing | ['Array'] | false | false |
78.005662 | Medium | 1,910 | false | false | Remove All Occurrences of a Substring | remove-all-occurrences-of-a-substring | ['String', 'Stack', 'Simulation'] | true | false |
58.701355 | Medium | 1,911 | false | false | Maximum Alternating Subsequence Sum | maximum-alternating-subsequence-sum | ['Array', 'Dynamic Programming'] | false | false |
37.116057 | Hard | 1,912 | false | false | Design Movie Rental System | design-movie-rental-system | ['Array', 'Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set'] | false | false |
82.856257 | Easy | 1,913 | false | false | Maximum Product Difference Between Two Pairs | maximum-product-difference-between-two-pairs | ['Array', 'Sorting'] | true | false |
50.059201 | Medium | 1,914 | false | false | Cyclically Rotating a Grid | cyclically-rotating-a-grid | ['Array', 'Matrix', 'Simulation'] | false | false |
66.663835 | Medium | 1,915 | false | false | Number of Wonderful Substrings | number-of-wonderful-substrings | ['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum'] | true | false |
48.232364 | Hard | 1,916 | false | false | Count Ways to Build Rooms in an Ant Colony | count-ways-to-build-rooms-in-an-ant-colony | ['Math', 'Dynamic Programming', 'Tree', 'Graph', 'Topological Sort', 'Combinatorics'] | false | false |
27.722737 | Hard | 1,917 | false | true | Leetcodify Friends Recommendations | leetcodify-friends-recommendations | ['Database'] | false | false |
52.758944 | Medium | 1,918 | false | true | Kth Smallest Subarray Sum | kth-smallest-subarray-sum | ['Array', 'Binary Search', 'Sliding Window'] | false | false |
42.509375 | Hard | 1,919 | false | true | Leetcodify Similar Friends | leetcodify-similar-friends | ['Database'] | false | false |
90.237168 | Easy | 1,920 | false | false | Build Array from Permutation | build-array-from-permutation | ['Array', 'Simulation'] | false | false |
50.809334 | Medium | 1,921 | false | false | Eliminate Maximum Number of Monsters | eliminate-maximum-number-of-monsters | ['Array', 'Greedy', 'Sorting'] | true | false |
48.705956 | Medium | 1,922 | false | false | Count Good Numbers | count-good-numbers | ['Math', 'Recursion'] | true | false |
27.87166 | Hard | 1,923 | false | false | Longest Common Subpath | longest-common-subpath | ['Array', 'Binary Search', 'Rolling Hash', 'Suffix Array', 'Hash Function'] | false | false |
49.637243 | Hard | 1,924 | false | true | Erect the Fence II | erect-the-fence-ii | ['Array', 'Math', 'Geometry'] | false | false |
68.633528 | Easy | 1,925 | false | false | Count Square Sum Triples | count-square-sum-triples | ['Math', 'Enumeration'] | false | false |
47.307208 | Medium | 1,926 | false | false | Nearest Exit from Entrance in Maze | nearest-exit-from-entrance-in-maze | ['Array', 'Breadth-First Search', 'Matrix'] | true | false |
48.147374 | Medium | 1,927 | false | false | Sum Game | sum-game | ['Math', 'String', 'Greedy', 'Game Theory'] | false | false |
39.295809 | Hard | 1,928 | false | false | Minimum Cost to Reach Destination in Time | minimum-cost-to-reach-destination-in-time | ['Array', 'Dynamic Programming', 'Graph'] | false | false |
90.414301 | Easy | 1,929 | false | false | Concatenation of Array | concatenation-of-array | ['Array', 'Simulation'] | false | false |
70.872417 | Medium | 1,930 | false | false | Unique Length-3 Palindromic Subsequences | unique-length-3-palindromic-subsequences | ['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum'] | true | false |
56.78487 | Hard | 1,931 | false | false | Painting a Grid With Three Different Colors | painting-a-grid-with-three-different-colors | ['Dynamic Programming'] | false | false |
39.221935 | Hard | 1,932 | false | false | Merge BSTs to Create Single BST | merge-bsts-to-create-single-bst | ['Hash Table', 'Binary Search', 'Tree', 'Depth-First Search', 'Binary Tree'] | false | false |
50.658979 | Easy | 1,933 | false | true | Check if String Is Decomposable Into Value-Equal Substrings | check-if-string-is-decomposable-into-value-equal-substrings | ['String'] | false | false |
60.749038 | Medium | 1,934 | false | false | Confirmation Rate | confirmation-rate | ['Database'] | false | false |
74.430727 | Easy | 1,935 | false | false | Maximum Number of Words You Can Type | maximum-number-of-words-you-can-type | ['Hash Table', 'String'] | false | false |
43.204682 | Medium | 1,936 | false | false | Add Minimum Number of Rungs | add-minimum-number-of-rungs | ['Array', 'Greedy'] | false | false |
42.363141 | Medium | 1,937 | false | false | Maximum Number of Points with Cost | maximum-number-of-points-with-cost | ['Array', 'Dynamic Programming', 'Matrix'] | true | false |
43.80838 | Hard | 1,938 | false | false | Maximum Genetic Difference Query | maximum-genetic-difference-query | ['Array', 'Hash Table', 'Bit Manipulation', 'Depth-First Search', 'Trie'] | false | false |
56.580457 | Easy | 1,939 | false | true | Users That Actively Request Confirmation Messages | users-that-actively-request-confirmation-messages | ['Database'] | false | false |
81.291899 | Medium | 1,940 | false | true | Longest Common Subsequence Between Sorted Arrays | longest-common-subsequence-between-sorted-arrays | ['Array', 'Hash Table', 'Counting'] | true | false |
78.425234 | Easy | 1,941 | false | false | Check if All Characters Have Equal Number of Occurrences | check-if-all-characters-have-equal-number-of-occurrences | ['Hash Table', 'String', 'Counting'] | false | false |
60.504647 | Medium | 1,942 | false | false | The Number of the Smallest Unoccupied Chair | the-number-of-the-smallest-unoccupied-chair | ['Array', 'Hash Table', 'Heap (Priority Queue)'] | true | false |
50.770707 | Medium | 1,943 | false | false | Describe the Painting | describe-the-painting | ['Array', 'Hash Table', 'Sorting', 'Prefix Sum'] | false | false |
70.715493 | Hard | 1,944 | false | false | Number of Visible People in a Queue | number-of-visible-people-in-a-queue | ['Array', 'Stack', 'Monotonic Stack'] | false | false |
74.703663 | Easy | 1,945 | false | false | Sum of Digits of String After Convert | sum-of-digits-of-string-after-convert | ['String', 'Simulation'] | true | false |
36.564775 | Medium | 1,946 | false | false | Largest Number After Mutating Substring | largest-number-after-mutating-substring | ['Array', 'String', 'Greedy'] | false | false |
62.965105 | Medium | 1,947 | false | false | Maximum Compatibility Score Sum | maximum-compatibility-score-sum | ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'] | false | false |
53.539847 | Hard | 1,948 | false | false | Delete Duplicate Folders in System | delete-duplicate-folders-in-system | ['Array', 'Hash Table', 'String', 'Trie', 'Hash Function'] | false | false |
54.460112 | Medium | 1,949 | false | true | Strong Friendship | strong-friendship | ['Database'] | false | false |
47.911265 | Medium | 1,950 | false | true | Maximum of Minimum Values in All Subarrays | maximum-of-minimum-values-in-all-subarrays | ['Array', 'Stack', 'Monotonic Stack'] | false | false |
69.144863 | Medium | 1,951 | false | true | All the Pairs With the Maximum Number of Common Followers | all-the-pairs-with-the-maximum-number-of-common-followers | ['Database'] | false | false |
62.315117 | Easy | 1,952 | false | false | Three Divisors | three-divisors | ['Math', 'Enumeration', 'Number Theory'] | false | false |
41.104804 | Medium | 1,953 | false | false | Maximum Number of Weeks for Which You Can Work | maximum-number-of-weeks-for-which-you-can-work | ['Array', 'Greedy'] | false | false |
54.194178 | Medium | 1,954 | false | false | Minimum Garden Perimeter to Collect Enough Apples | minimum-garden-perimeter-to-collect-enough-apples | ['Math', 'Binary Search'] | false | false |
51.554978 | Hard | 1,955 | false | false | Count Number of Special Subsequences | count-number-of-special-subsequences | ['Array', 'Dynamic Programming'] | false | false |
48.973482 | Hard | 1,956 | false | true | Minimum Time For K Virus Variants to Spread | minimum-time-for-k-virus-variants-to-spread | ['Array', 'Math', 'Binary Search', 'Geometry', 'Enumeration'] | false | false |
71.607237 | Easy | 1,957 | false | false | Delete Characters to Make Fancy String | delete-characters-to-make-fancy-string | ['String'] | true | false |
49.07863 | Medium | 1,958 | false | false | Check if Move is Legal | check-if-move-is-legal | ['Array', 'Matrix', 'Enumeration'] | false | false |
42.627453 | Medium | 1,959 | false | false | Minimum Total Space Wasted With K Resizing Operations | minimum-total-space-wasted-with-k-resizing-operations | ['Array', 'Dynamic Programming'] | false | false |
30.341314 | Hard | 1,960 | false | false | Maximum Product of the Length of Two Palindromic Substrings | maximum-product-of-the-length-of-two-palindromic-substrings | ['String', 'Rolling Hash', 'Hash Function'] | false | false |
52.416554 | Easy | 1,961 | false | false | Check If String Is a Prefix of Array | check-if-string-is-a-prefix-of-array | ['Array', 'Two Pointers', 'String'] | false | false |
64.324756 | Medium | 1,962 | false | false | Remove Stones to Minimize the Total | remove-stones-to-minimize-the-total | ['Array', 'Greedy', 'Heap (Priority Queue)'] | true | false |
77.904894 | Medium | 1,963 | false | false | Minimum Number of Swaps to Make the String Balanced | minimum-number-of-swaps-to-make-the-string-balanced | ['Two Pointers', 'String', 'Stack', 'Greedy'] | true | false |
62.466854 | Hard | 1,964 | false | false | Find the Longest Valid Obstacle Course at Each Position | find-the-longest-valid-obstacle-course-at-each-position | ['Array', 'Binary Search', 'Binary Indexed Tree'] | true | false |
72.790168 | Easy | 1,965 | false | false | Employees With Missing Information | employees-with-missing-information | ['Database'] | true | false |
62.446396 | Medium | 1,966 | false | true | Binary Searchable Numbers in an Unsorted Array | binary-searchable-numbers-in-an-unsorted-array | ['Array', 'Binary Search'] | false | false |
81.694745 | Easy | 1,967 | false | false | Number of Strings That Appear as Substrings in Word | number-of-strings-that-appear-as-substrings-in-word | ['Array', 'String'] | false | false |
49.967413 | Medium | 1,968 | false | false | Array With Elements Not Equal to Average of Neighbors | array-with-elements-not-equal-to-average-of-neighbors | ['Array', 'Greedy', 'Sorting'] | false | false |
36.190681 | Medium | 1,969 | false | false | Minimum Non-Zero Product of the Array Elements | minimum-non-zero-product-of-the-array-elements | ['Math', 'Greedy', 'Recursion'] | false | false |
62.130774 | Hard | 1,970 | false | false | Last Day Where You Can Still Cross | last-day-where-you-can-still-cross | ['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'] | true | false |
53.899672 | Easy | 1,971 | false | false | Find if Path Exists in Graph | find-if-path-exists-in-graph | ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'] | true | false |
50.957462 | Hard | 1,972 | false | true | First and Last Call On the Same Day | first-and-last-call-on-the-same-day | ['Database'] | true | false |
76.973001 | Medium | 1,973 | false | true | Count Nodes Equal to Sum of Descendants | count-nodes-equal-to-sum-of-descendants | ['Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
77.0359 | Easy | 1,974 | false | false | Minimum Time to Type Word Using Special Typewriter | minimum-time-to-type-word-using-special-typewriter | ['String', 'Greedy'] | false | false |
65.945466 | Medium | 1,975 | false | false | Maximum Matrix Sum | maximum-matrix-sum | ['Array', 'Greedy', 'Matrix'] | true | false |
37.836732 | Medium | 1,976 | false | false | Number of Ways to Arrive at Destination | number-of-ways-to-arrive-at-destination | ['Dynamic Programming', 'Graph', 'Topological Sort', 'Shortest Path'] | true | false |
20.917525 | Hard | 1,977 | false | false | Number of Ways to Separate Numbers | number-of-ways-to-separate-numbers | ['String', 'Dynamic Programming', 'Suffix Array'] | false | false |
48.829022 | Easy | 1,978 | false | false | Employees Whose Manager Left the Company | employees-whose-manager-left-the-company | ['Database'] | false | false |
78.429261 | Easy | 1,979 | false | false | Find Greatest Common Divisor of Array | find-greatest-common-divisor-of-array | ['Array', 'Math', 'Number Theory'] | false | false |
79.349883 | Medium | 1,980 | false | false | Find Unique Binary String | find-unique-binary-string | ['Array', 'Hash Table', 'String', 'Backtracking'] | true | false |
35.708086 | Medium | 1,981 | false | false | Minimize the Difference Between Target and Chosen Elements | minimize-the-difference-between-target-and-chosen-elements | ['Array', 'Dynamic Programming', 'Matrix'] | false | false |
48.517918 | Hard | 1,982 | false | false | Find Array Given Subset Sums | find-array-given-subset-sums | ['Array', 'Divide and Conquer'] | false | false |
52.973062 | Medium | 1,983 | false | true | Widest Pair of Indices With Equal Range Sum | widest-pair-of-indices-with-equal-range-sum | ['Array', 'Hash Table', 'Prefix Sum'] | false | false |
58.195451 | Easy | 1,984 | false | false | Minimum Difference Between Highest and Lowest of K Scores | minimum-difference-between-highest-and-lowest-of-k-scores | ['Array', 'Sliding Window', 'Sorting'] | false | false |
46.607468 | Medium | 1,985 | false | false | Find the Kth Largest Integer in the Array | find-the-kth-largest-integer-in-the-array | ['Array', 'String', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Quickselect'] | false | false |
33.531648 | Medium | 1,986 | false | false | Minimum Number of Work Sessions to Finish the Tasks | minimum-number-of-work-sessions-to-finish-the-tasks | ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'] | false | false |
52.014769 | Hard | 1,987 | false | false | Number of Unique Good Subsequences | number-of-unique-good-subsequences | ['String', 'Dynamic Programming'] | false | false |
66.912623 | Medium | 1,988 | false | true | Find Cutoff Score for Each School | find-cutoff-score-for-each-school | ['Database'] | true | false |
49.989765 | Medium | 1,989 | false | true | Maximum Number of People That Can Be Caught in Tag | maximum-number-of-people-that-can-be-caught-in-tag | ['Array', 'Greedy'] | false | false |
49.01755 | Medium | 1,990 | false | true | Count the Number of Experiments | count-the-number-of-experiments | ['Database'] | false | false |
67.866433 | Easy | 1,991 | false | false | Find the Middle Index in Array | find-the-middle-index-in-array | ['Array', 'Prefix Sum'] | false | false |
75.491928 | Medium | 1,992 | false | false | Find All Groups of Farmland | find-all-groups-of-farmland | ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'] | true | false |
47.091924 | Medium | 1,993 | false | false | Operations on Tree | operations-on-tree | ['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design'] | false | false |
35.668886 | Hard | 1,994 | false | false | The Number of Good Subsets | the-number-of-good-subsets | ['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'] | false | false |
62.46542 | Easy | 1,995 | false | false | Count Special Quadruplets | count-special-quadruplets | ['Array', 'Hash Table', 'Enumeration'] | false | false |
44.135848 | Medium | 1,996 | false | false | The Number of Weak Characters in the Game | the-number-of-weak-characters-in-the-game | ['Array', 'Stack', 'Greedy', 'Sorting', 'Monotonic Stack'] | true | false |
39.432897 | Medium | 1,997 | false | false | First Day Where You Have Been in All the Rooms | first-day-where-you-have-been-in-all-the-rooms | ['Array', 'Dynamic Programming'] | false | false |
46.222391 | Hard | 1,998 | false | false | GCD Sort of an Array | gcd-sort-of-an-array | ['Array', 'Math', 'Union Find', 'Sorting', 'Number Theory'] | false | false |
48.105745 | Medium | 1,999 | false | true | Smallest Greater Multiple Made of Two Digits | smallest-greater-multiple-made-of-two-digits | ['Math', 'Enumeration'] | false | false |
86.385207 | Easy | 2,000 | false | false | Reverse Prefix of Word | reverse-prefix-of-word | ['Two Pointers', 'String', 'Stack'] | true | false |
Subsets and Splits