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 |
---|---|---|---|---|---|---|---|---|---|
21.251525 | Medium | 3,001 | false | false | Minimum Moves to Capture The Queen | minimum-moves-to-capture-the-queen | ['Math', 'Enumeration'] | false | false |
44.532273 | Medium | 3,002 | false | false | Maximum Size of a Set After Removals | maximum-size-of-a-set-after-removals | ['Array', 'Hash Table', 'Greedy'] | false | false |
27.124094 | Hard | 3,003 | false | false | Maximize the Number of Partitions After Operations | maximize-the-number-of-partitions-after-operations | ['String', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'] | false | false |
56.656347 | Medium | 3,004 | false | true | Maximum Subtree of the Same Color | maximum-subtree-of-the-same-color | ['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search'] | false | false |
77.888169 | Easy | 3,005 | false | false | Count Elements With Maximum Frequency | count-elements-with-maximum-frequency | ['Array', 'Hash Table', 'Counting'] | true | false |
37.860684 | Medium | 3,006 | false | false | Find Beautiful Indices in the Given Array I | find-beautiful-indices-in-the-given-array-i | ['Two Pointers', 'String', 'Binary Search', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
36.980949 | Medium | 3,007 | false | false | Maximum Number That Sum of the Prices Is Less Than or Equal to K | maximum-number-that-sum-of-the-prices-is-less-than-or-equal-to-k | ['Binary Search', 'Dynamic Programming', 'Bit Manipulation'] | false | false |
26.007292 | Hard | 3,008 | false | false | Find Beautiful Indices in the Given Array II | find-beautiful-indices-in-the-given-array-ii | ['Two Pointers', 'String', 'Binary Search', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
45.113611 | Hard | 3,009 | false | true | Maximum Number of Intersections on the Chart | maximum-number-of-intersections-on-the-chart | ['Array', 'Math', 'Binary Indexed Tree', 'Geometry'] | false | false |
65.502146 | Easy | 3,010 | false | false | Divide an Array Into Subarrays With Minimum Cost I | divide-an-array-into-subarrays-with-minimum-cost-i | ['Array', 'Sorting', 'Enumeration'] | false | false |
66.531433 | Medium | 3,011 | false | false | Find if Array Can Be Sorted | find-if-array-can-be-sorted | ['Array', 'Bit Manipulation', 'Sorting'] | true | false |
34.586902 | Medium | 3,012 | false | false | Minimize Length of Array Using Operations | minimize-length-of-array-using-operations | ['Array', 'Math', 'Greedy', 'Number Theory'] | false | false |
29.694745 | Hard | 3,013 | false | false | Divide an Array Into Subarrays With Minimum Cost II | divide-an-array-into-subarrays-with-minimum-cost-ii | ['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)'] | false | false |
65.99563 | Easy | 3,014 | false | false | Minimum Number of Pushes to Type Word I | minimum-number-of-pushes-to-type-word-i | ['Math', 'String', 'Greedy'] | false | false |
56.507905 | Medium | 3,015 | false | false | Count the Number of Houses at a Certain Distance I | count-the-number-of-houses-at-a-certain-distance-i | ['Breadth-First Search', 'Graph', 'Prefix Sum'] | false | false |
79.899317 | Medium | 3,016 | false | false | Minimum Number of Pushes to Type Word II | minimum-number-of-pushes-to-type-word-ii | ['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting'] | true | false |
21.367418 | Hard | 3,017 | false | false | Count the Number of Houses at a Certain Distance II | count-the-number-of-houses-at-a-certain-distance-ii | ['Graph', 'Prefix Sum'] | false | false |
43.044822 | Hard | 3,018 | false | true | Maximum Number of Removal Queries That Can Be Processed I | maximum-number-of-removal-queries-that-can-be-processed-i | ['Array', 'Dynamic Programming'] | false | false |
79.509694 | Easy | 3,019 | false | false | Number of Changing Keys | number-of-changing-keys | ['String'] | false | false |
26.265562 | Medium | 3,020 | false | false | Find the Maximum Number of Elements in Subset | find-the-maximum-number-of-elements-in-subset | ['Array', 'Hash Table', 'Enumeration'] | false | false |
46.945239 | Medium | 3,021 | false | false | Alice and Bob Playing Flower Game | alice-and-bob-playing-flower-game | ['Math'] | false | false |
28.663342 | Hard | 3,022 | false | false | Minimize OR of Remaining Elements Using Operations | minimize-or-of-remaining-elements-using-operations | ['Array', 'Greedy', 'Bit Manipulation'] | false | false |
56.461001 | Medium | 3,023 | false | true | Find Pattern in Infinite Stream I | find-pattern-in-infinite-stream-i | ['Array', 'Sliding Window', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
37.966001 | Easy | 3,024 | false | false | Type of Triangle | type-of-triangle | ['Array', 'Math', 'Sorting'] | false | false |
40.524958 | Medium | 3,025 | false | false | Find the Number of Ways to Place People I | find-the-number-of-ways-to-place-people-i | ['Array', 'Math', 'Geometry', 'Sorting', 'Enumeration'] | false | false |
20.002197 | Medium | 3,026 | false | false | Maximum Good Subarray Sum | maximum-good-subarray-sum | ['Array', 'Hash Table', 'Prefix Sum'] | false | false |
45.717879 | Hard | 3,027 | false | false | Find the Number of Ways to Place People II | find-the-number-of-ways-to-place-people-ii | ['Array', 'Math', 'Geometry', 'Sorting', 'Enumeration'] | false | false |
73.473937 | Easy | 3,028 | false | false | Ant on the Boundary | ant-on-the-boundary | ['Array', 'Simulation', 'Prefix Sum'] | false | false |
41.036534 | Medium | 3,029 | false | false | Minimum Time to Revert Word to Initial State I | minimum-time-to-revert-word-to-initial-state-i | ['String', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
41.964493 | Medium | 3,030 | false | false | Find the Grid of Region Average | find-the-grid-of-region-average | ['Array', 'Matrix'] | false | false |
34.173077 | Hard | 3,031 | false | false | Minimum Time to Revert Word to Initial State II | minimum-time-to-revert-word-to-initial-state-ii | ['String', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
88.007201 | Easy | 3,032 | false | true | Count Numbers With Unique Digits II | count-numbers-with-unique-digits-ii | ['Hash Table', 'Math', 'Dynamic Programming'] | false | false |
68.174143 | Easy | 3,033 | false | false | Modify the Matrix | modify-the-matrix | ['Array', 'Matrix'] | false | false |
66.243374 | Medium | 3,034 | false | false | Number of Subarrays That Match a Pattern I | number-of-subarrays-that-match-a-pattern-i | ['Array', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
42.821954 | Medium | 3,035 | false | false | Maximum Palindromes After Operations | maximum-palindromes-after-operations | ['Array', 'Hash Table', 'String', 'Greedy', 'Sorting', 'Counting'] | false | false |
31.801133 | Hard | 3,036 | false | false | Number of Subarrays That Match a Pattern II | number-of-subarrays-that-match-a-pattern-ii | ['Array', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
68.173599 | Hard | 3,037 | false | true | Find Pattern in Infinite Stream II | find-pattern-in-infinite-stream-ii | ['Array', 'Sliding Window', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
51.684387 | Easy | 3,038 | false | false | Maximum Number of Operations With the Same Score I | maximum-number-of-operations-with-the-same-score-i | ['Array', 'Simulation'] | false | false |
55.881783 | Medium | 3,039 | false | false | Apply Operations to Make String Empty | apply-operations-to-make-string-empty | ['Array', 'Hash Table', 'Sorting', 'Counting'] | false | false |
32.897782 | Medium | 3,040 | false | false | Maximum Number of Operations With the Same Score II | maximum-number-of-operations-with-the-same-score-ii | ['Array', 'Dynamic Programming', 'Memoization'] | false | false |
32.003593 | Hard | 3,041 | false | false | Maximize Consecutive Elements in an Array After Modification | maximize-consecutive-elements-in-an-array-after-modification | ['Array', 'Dynamic Programming', 'Sorting'] | false | false |
77.626726 | Easy | 3,042 | false | false | Count Prefix and Suffix Pairs I | count-prefix-and-suffix-pairs-i | ['Array', 'String', 'Trie', 'Rolling Hash', 'String Matching', 'Hash Function'] | true | false |
56.269635 | Medium | 3,043 | false | false | Find the Length of the Longest Common Prefix | find-the-length-of-the-longest-common-prefix | ['Array', 'Hash Table', 'String', 'Trie'] | true | false |
44.707121 | Medium | 3,044 | false | false | Most Frequent Prime | most-frequent-prime | ['Array', 'Hash Table', 'Math', 'Matrix', 'Counting', 'Enumeration', 'Number Theory'] | false | false |
26.874075 | Hard | 3,045 | false | false | Count Prefix and Suffix Pairs II | count-prefix-and-suffix-pairs-ii | ['Array', 'String', 'Trie', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
58.859973 | Easy | 3,046 | false | false | Split the Array | split-the-array | ['Array', 'Hash Table', 'Counting'] | false | false |
44.810282 | Medium | 3,047 | false | false | Find the Largest Area of Square Inside Two Rectangles | find-the-largest-area-of-square-inside-two-rectangles | ['Array', 'Math', 'Geometry'] | false | false |
34.122713 | Medium | 3,048 | false | false | Earliest Second to Mark Indices I | earliest-second-to-mark-indices-i | ['Array', 'Binary Search'] | false | false |
20.096278 | Hard | 3,049 | false | false | Earliest Second to Mark Indices II | earliest-second-to-mark-indices-ii | ['Array', 'Binary Search', 'Greedy', 'Heap (Priority Queue)'] | false | false |
67.763348 | Medium | 3,050 | false | true | Pizza Toppings Cost Analysis | pizza-toppings-cost-analysis | ['Database'] | false | false |
76.051333 | Easy | 3,051 | false | true | Find Candidates for Data Scientist Position | find-candidates-for-data-scientist-position | ['Database'] | false | false |
74.78022 | Hard | 3,052 | false | true | Maximize Items | maximize-items | ['Database'] | false | false |
50.531108 | Easy | 3,053 | false | true | Classifying Triangles by Lengths | classifying-triangles-by-lengths | ['Database'] | true | false |
79.132172 | Medium | 3,054 | false | true | Binary Tree Nodes | binary-tree-nodes | ['Database'] | true | false |
58.385417 | Medium | 3,055 | false | true | Top Percentile Fraud | top-percentile-fraud | ['Database'] | false | false |
58.566131 | Medium | 3,056 | false | true | Snaps Analysis | snaps-analysis | ['Database'] | false | false |
68.634538 | Hard | 3,057 | false | true | Employees Project Allocation | employees-project-allocation | ['Database'] | false | false |
48.83502 | Medium | 3,058 | false | true | Friends With No Mutual Friends | friends-with-no-mutual-friends | ['Database'] | false | false |
70.190224 | Easy | 3,059 | false | true | Find All Unique Email Domains | find-all-unique-email-domains | ['Database'] | true | false |
39.648341 | Hard | 3,060 | false | true | User Activities within Time Bounds | user-activities-within-time-bounds | ['Database'] | true | false |
82.053073 | Hard | 3,061 | false | true | Calculate Trapping Rain Water | calculate-trapping-rain-water | ['Database'] | false | false |
79.012063 | Easy | 3,062 | false | true | Winner of the Linked List Game | winner-of-the-linked-list-game | ['Linked List'] | true | false |
85.682789 | Easy | 3,063 | false | true | Linked List Frequency | linked-list-frequency | ['Hash Table', 'Linked List', 'Counting'] | true | false |
90.237734 | Medium | 3,064 | false | true | Guess the Number Using Bitwise Questions I | guess-the-number-using-bitwise-questions-i | ['Bit Manipulation', 'Interactive'] | false | false |
85.861304 | Easy | 3,065 | false | false | Minimum Operations to Exceed Threshold Value I | minimum-operations-to-exceed-threshold-value-i | ['Array'] | false | false |
45.691411 | Medium | 3,066 | false | false | Minimum Operations to Exceed Threshold Value II | minimum-operations-to-exceed-threshold-value-ii | ['Array', 'Heap (Priority Queue)', 'Simulation'] | true | false |
53.779722 | Medium | 3,067 | false | false | Count Pairs of Connectable Servers in a Weighted Tree Network | count-pairs-of-connectable-servers-in-a-weighted-tree-network | ['Array', 'Tree', 'Depth-First Search'] | false | false |
65.21217 | Hard | 3,068 | false | false | Find the Maximum Sum of Node Values | find-the-maximum-sum-of-node-values | ['Array', 'Dynamic Programming', 'Greedy', 'Bit Manipulation', 'Tree', 'Sorting'] | true | false |
72.751082 | Easy | 3,069 | false | false | Distribute Elements Into Two Arrays I | distribute-elements-into-two-arrays-i | ['Array', 'Simulation'] | false | false |
56.915292 | Medium | 3,070 | false | false | Count Submatrices with Top-Left Element and Sum Less Than k | count-submatrices-with-top-left-element-and-sum-less-than-k | ['Array', 'Matrix', 'Prefix Sum'] | false | false |
61.158309 | Medium | 3,071 | false | false | Minimum Operations to Write the Letter Y on a Grid | minimum-operations-to-write-the-letter-y-on-a-grid | ['Array', 'Hash Table', 'Matrix', 'Counting'] | false | false |
29.014851 | Hard | 3,072 | false | false | Distribute Elements Into Two Arrays II | distribute-elements-into-two-arrays-ii | ['Array', 'Binary Indexed Tree', 'Segment Tree', 'Simulation'] | false | false |
35.323219 | Medium | 3,073 | false | true | Maximum Increasing Triplet Value | maximum-increasing-triplet-value | ['Array', 'Ordered Set'] | false | false |
67.838581 | Easy | 3,074 | false | false | Apple Redistribution into Boxes | apple-redistribution-into-boxes | ['Array', 'Greedy', 'Sorting'] | false | false |
54.799428 | Medium | 3,075 | false | false | Maximize Happiness of Selected Children | maximize-happiness-of-selected-children | ['Array', 'Greedy', 'Sorting'] | true | false |
47.288054 | Medium | 3,076 | false | false | Shortest Uncommon Substring in an Array | shortest-uncommon-substring-in-an-array | ['Array', 'Hash Table', 'String', 'Trie'] | false | false |
26.553567 | Hard | 3,077 | false | false | Maximum Strength of K Disjoint Subarrays | maximum-strength-of-k-disjoint-subarrays | ['Array', 'Dynamic Programming', 'Prefix Sum'] | false | false |
63.624679 | Medium | 3,078 | false | true | Match Alphanumerical Pattern in Matrix I | match-alphanumerical-pattern-in-matrix-i | ['Array', 'Hash Table', 'String', 'Matrix'] | false | false |
73.314875 | Easy | 3,079 | false | false | Find the Sum of Encrypted Integers | find-the-sum-of-encrypted-integers | ['Array', 'Math'] | false | false |
47.394358 | Medium | 3,080 | false | false | Mark Elements on Array by Performing Queries | mark-elements-on-array-by-performing-queries | ['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation'] | false | false |
27.570828 | Medium | 3,081 | false | false | Replace Question Marks in String to Minimize Its Value | replace-question-marks-in-string-to-minimize-its-value | ['Hash Table', 'String', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting'] | false | false |
36.149269 | Hard | 3,082 | false | false | Find the Sum of the Power of All Subsequences | find-the-sum-of-the-power-of-all-subsequences | ['Array', 'Dynamic Programming'] | false | false |
65.453119 | Easy | 3,083 | false | false | Existence of a Substring in a String and Its Reverse | existence-of-a-substring-in-a-string-and-its-reverse | ['Hash Table', 'String'] | false | false |
48.700384 | Medium | 3,084 | false | false | Count Substrings Starting and Ending with Given Character | count-substrings-starting-and-ending-with-given-character | ['Math', 'String', 'Counting'] | false | false |
44.197881 | Medium | 3,085 | false | false | Minimum Deletions to Make String K-Special | minimum-deletions-to-make-string-k-special | ['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting'] | false | false |
20.609987 | Hard | 3,086 | false | false | Minimum Moves to Pick K Ones | minimum-moves-to-pick-k-ones | ['Array', 'Greedy', 'Sliding Window', 'Prefix Sum'] | false | false |
61.456954 | Medium | 3,087 | false | true | Find Trending Hashtags | find-trending-hashtags | ['Database'] | false | false |
42.180095 | Hard | 3,088 | false | true | Make String Anti-palindrome | make-string-anti-palindrome | ['String', 'Greedy', 'Sorting', 'Counting Sort'] | false | false |
39.65825 | Medium | 3,089 | false | true | Find Bursty Behavior | find-bursty-behavior | ['Database'] | false | false |
63.074239 | Easy | 3,090 | false | false | Maximum Length Substring With Two Occurrences | maximum-length-substring-with-two-occurrences | ['Hash Table', 'String', 'Sliding Window'] | false | false |
43.186885 | Medium | 3,091 | false | false | Apply Operations to Make Sum of Array Greater Than or Equal to k | apply-operations-to-make-sum-of-array-greater-than-or-equal-to-k | ['Math', 'Greedy', 'Enumeration'] | false | false |
41.345681 | Medium | 3,092 | false | false | Most Frequent IDs | most-frequent-ids | ['Array', 'Hash Table', 'Heap (Priority Queue)', 'Ordered Set'] | false | false |
36.717063 | Hard | 3,093 | false | false | Longest Common Suffix Queries | longest-common-suffix-queries | ['Array', 'String', 'Trie'] | false | false |
83.107404 | Medium | 3,094 | false | true | Guess the Number Using Bitwise Questions II | guess-the-number-using-bitwise-questions-ii | ['Bit Manipulation', 'Interactive'] | false | false |
42.43942 | Easy | 3,095 | false | false | Shortest Subarray With OR at Least K I | shortest-subarray-with-or-at-least-k-i | ['Array', 'Bit Manipulation', 'Sliding Window'] | false | false |
38.847394 | Medium | 3,096 | false | false | Minimum Levels to Gain More Points | minimum-levels-to-gain-more-points | ['Array', 'Prefix Sum'] | false | false |
50.255969 | Medium | 3,097 | false | false | Shortest Subarray With OR at Least K II | shortest-subarray-with-or-at-least-k-ii | ['Array', 'Bit Manipulation', 'Sliding Window'] | true | false |
23.103099 | Hard | 3,098 | false | false | Find the Sum of Subsequence Powers | find-the-sum-of-subsequence-powers | ['Array', 'Dynamic Programming', 'Sorting'] | false | false |
83.047392 | Easy | 3,099 | false | false | Harshad Number | harshad-number | ['Math'] | false | false |
62.048033 | Medium | 3,100 | false | false | Water Bottles II | water-bottles-ii | ['Math', 'Simulation'] | false | false |
Subsets and Splits