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 |
---|---|---|---|---|---|---|---|---|---|
55.588407 | Medium | 2,601 | false | false | Prime Subtraction Operation | prime-subtraction-operation | ['Array', 'Math', 'Binary Search', 'Greedy', 'Number Theory'] | true | false |
36.551007 | Medium | 2,602 | false | false | Minimum Operations to Make All Array Elements Equal | minimum-operations-to-make-all-array-elements-equal | ['Array', 'Binary Search', 'Sorting', 'Prefix Sum'] | false | false |
35.517606 | Hard | 2,603 | false | false | Collect Coins in a Tree | collect-coins-in-a-tree | ['Array', 'Tree', 'Graph', 'Topological Sort'] | false | false |
39.314612 | Hard | 2,604 | false | true | Minimum Time to Eat All Grains | minimum-time-to-eat-all-grains | ['Array', 'Two Pointers', 'Binary Search', 'Sorting'] | false | false |
54.131825 | Easy | 2,605 | false | false | Form Smallest Number From Two Digit Arrays | form-smallest-number-from-two-digit-arrays | ['Array', 'Hash Table', 'Enumeration'] | false | false |
56.50598 | Medium | 2,606 | false | false | Find the Substring With Maximum Cost | find-the-substring-with-maximum-cost | ['Array', 'Hash Table', 'String', 'Dynamic Programming'] | false | false |
36.179782 | Medium | 2,607 | false | false | Make K-Subarray Sums Equal | make-k-subarray-sums-equal | ['Array', 'Math', 'Greedy', 'Sorting', 'Number Theory'] | false | false |
37.109312 | Hard | 2,608 | false | false | Shortest Cycle in a Graph | shortest-cycle-in-a-graph | ['Breadth-First Search', 'Graph'] | false | false |
45.244366 | Easy | 2,609 | false | false | Find the Longest Balanced Substring of a Binary String | find-the-longest-balanced-substring-of-a-binary-string | ['String'] | false | false |
86.285363 | Medium | 2,610 | false | false | Convert an Array Into a 2D Array With Conditions | convert-an-array-into-a-2d-array-with-conditions | ['Array', 'Hash Table'] | true | false |
46.924167 | Medium | 2,611 | false | false | Mice and Cheese | mice-and-cheese | ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'] | false | false |
16.03379 | Hard | 2,612 | false | false | Minimum Reverse Operations | minimum-reverse-operations | ['Array', 'Breadth-First Search', 'Ordered Set'] | false | false |
40.198511 | Hard | 2,613 | false | true | Beautiful Pairs | beautiful-pairs | ['Array', 'Math', 'Divide and Conquer', 'Geometry', 'Sorting', 'Ordered Set'] | false | false |
35.830127 | Easy | 2,614 | false | false | Prime In Diagonal | prime-in-diagonal | ['Array', 'Math', 'Matrix', 'Number Theory'] | false | false |
30.95825 | Medium | 2,615 | false | false | Sum of Distances | sum-of-distances | ['Array', 'Hash Table', 'Prefix Sum'] | false | false |
43.65746 | Medium | 2,616 | false | false | Minimize the Maximum Difference of Pairs | minimize-the-maximum-difference-of-pairs | ['Array', 'Binary Search', 'Greedy'] | true | false |
22.514957 | Hard | 2,617 | false | false | Minimum Number of Visited Cells in a Grid | minimum-number-of-visited-cells-in-a-grid | ['Array', 'Dynamic Programming', 'Stack', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix', 'Monotonic Stack'] | false | false |
27.913441 | Medium | 2,618 | false | false | Check if Object Instance of Class | check-if-object-instance-of-class | [] | true | false |
74.445584 | Easy | 2,619 | false | false | Array Prototype Last | array-prototype-last | [] | true | false |
82.127232 | Easy | 2,620 | false | false | Counter | counter | [] | true | false |
87.728126 | Easy | 2,621 | false | false | Sleep | sleep | [] | true | false |
75.604737 | Medium | 2,622 | false | false | Cache With Time Limit | cache-with-time-limit | [] | true | false |
63.213205 | Medium | 2,623 | false | false | Memoize | memoize | [] | true | false |
66.917037 | Medium | 2,624 | false | false | Snail Traversal | snail-traversal | [] | true | false |
64.124671 | Medium | 2,625 | false | false | Flatten Deeply Nested Array | flatten-deeply-nested-array | [] | true | false |
85.362547 | Easy | 2,626 | false | false | Array Reduce Transformation | array-reduce-transformation | [] | true | false |
91.741347 | Medium | 2,627 | false | false | Debounce | debounce | [] | true | false |
39.102672 | Medium | 2,628 | false | true | JSON Deep Equal | json-deep-equal | [] | true | false |
86.944003 | Easy | 2,629 | false | false | Function Composition | function-composition | [] | true | false |
32.219437 | Hard | 2,630 | false | false | Memoize II | memoize-ii | [] | true | false |
81.053022 | Medium | 2,631 | false | false | Group By | group-by | [] | true | false |
89.355066 | Medium | 2,632 | false | true | Curry | curry | [] | true | false |
77.824621 | Medium | 2,633 | false | true | Convert Object to JSON String | convert-object-to-json-string | [] | true | false |
85.403355 | Easy | 2,634 | false | false | Filter Elements from Array | filter-elements-from-array | [] | true | false |
86.047857 | Easy | 2,635 | false | false | Apply Transform Over Each Element in Array | apply-transform-over-each-element-in-array | [] | true | false |
79.868963 | Medium | 2,636 | false | true | Promise Pool | promise-pool | [] | true | false |
82.616353 | Medium | 2,637 | false | false | Promise Time Limit | promise-time-limit | [] | true | false |
46.605719 | Medium | 2,638 | false | true | Count the Number of K-Free Subsets | count-the-number-of-k-free-subsets | ['Array', 'Math', 'Dynamic Programming', 'Sorting', 'Combinatorics'] | false | false |
68.954064 | Easy | 2,639 | false | false | Find the Width of Columns of a Grid | find-the-width-of-columns-of-a-grid | ['Array', 'Matrix'] | false | false |
71.812424 | Medium | 2,640 | false | false | Find the Score of All Prefixes of an Array | find-the-score-of-all-prefixes-of-an-array | ['Array', 'Prefix Sum'] | false | false |
75.375263 | Medium | 2,641 | false | false | Cousins in Binary Tree II | cousins-in-binary-tree-ii | ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'] | true | false |
70.521099 | Hard | 2,642 | false | false | Design Graph With Shortest Path Calculator | design-graph-with-shortest-path-calculator | ['Graph', 'Design', 'Heap (Priority Queue)', 'Shortest Path'] | true | false |
74.731974 | Easy | 2,643 | false | false | Row With Maximum Ones | row-with-maximum-ones | ['Array', 'Matrix'] | false | false |
50.186844 | Easy | 2,644 | false | false | Find the Maximum Divisibility Score | find-the-maximum-divisibility-score | ['Array'] | false | false |
50.0702 | Medium | 2,645 | false | false | Minimum Additions to Make Valid String | minimum-additions-to-make-valid-string | ['String', 'Dynamic Programming', 'Stack', 'Greedy'] | false | false |
45.653393 | Hard | 2,646 | false | false | Minimize the Total Price of the Trips | minimize-the-total-price-of-the-trips | ['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Graph'] | false | false |
59.165425 | Hard | 2,647 | false | true | Color the Triangle Red | color-the-triangle-red | ['Array', 'Math'] | false | false |
83.573893 | Easy | 2,648 | false | false | Generate Fibonacci Sequence | generate-fibonacci-sequence | [] | true | false |
79.704129 | Medium | 2,649 | false | false | Nested Array Generator | nested-array-generator | [] | true | false |
51.393457 | Hard | 2,650 | false | false | Design Cancellable Function | design-cancellable-function | [] | false | false |
76.956609 | Easy | 2,651 | false | false | Calculate Delayed Arrival Time | calculate-delayed-arrival-time | ['Math'] | false | false |
85.015912 | Easy | 2,652 | false | false | Sum Multiples | sum-multiples | ['Math'] | false | false |
33.543925 | Medium | 2,653 | false | false | Sliding Subarray Beauty | sliding-subarray-beauty | ['Array', 'Hash Table', 'Sliding Window'] | false | false |
33.474313 | Medium | 2,654 | false | false | Minimum Number of Operations to Make All Array Elements Equal to 1 | minimum-number-of-operations-to-make-all-array-elements-equal-to-1 | ['Array', 'Math', 'Number Theory'] | false | false |
48.539196 | Medium | 2,655 | false | true | Find Maximal Uncovered Ranges | find-maximal-uncovered-ranges | ['Array', 'Sorting'] | false | false |
79.608019 | Easy | 2,656 | false | false | Maximum Sum With Exactly K Elements | maximum-sum-with-exactly-k-elements | ['Array', 'Greedy'] | false | false |
87.059216 | Medium | 2,657 | false | false | Find the Prefix Common Array of Two Arrays | find-the-prefix-common-array-of-two-arrays | ['Array', 'Hash Table', 'Bit Manipulation'] | true | false |
70.465144 | Medium | 2,658 | false | false | Maximum Number of Fish in a Grid | maximum-number-of-fish-in-a-grid | ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'] | true | false |
25.246068 | Hard | 2,659 | false | false | Make Array Empty | make-array-empty | ['Array', 'Binary Search', 'Greedy', 'Binary Indexed Tree', 'Segment Tree', 'Sorting', 'Ordered Set'] | false | false |
35.334658 | Easy | 2,660 | false | false | Determine the Winner of a Bowling Game | determine-the-winner-of-a-bowling-game | ['Array', 'Simulation'] | false | false |
63.962606 | Medium | 2,661 | false | false | First Completely Painted Row or Column | first-completely-painted-row-or-column | ['Array', 'Hash Table', 'Matrix'] | true | false |
39.913862 | Medium | 2,662 | false | false | Minimum Cost of a Path With Special Roads | minimum-cost-of-a-path-with-special-roads | ['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'] | false | false |
38.904322 | Hard | 2,663 | false | false | Lexicographically Smallest Beautiful String | lexicographically-smallest-beautiful-string | ['String', 'Greedy'] | false | false |
72.947381 | Medium | 2,664 | false | true | The Knight’s Tour | the-knights-tour | ['Array', 'Backtracking', 'Matrix'] | true | false |
80.991591 | Easy | 2,665 | false | false | Counter II | counter-ii | [] | true | false |
86.579568 | Easy | 2,666 | false | false | Allow One Function Call | allow-one-function-call | [] | true | false |
82.043284 | Easy | 2,667 | false | false | Create Hello World Function | create-hello-world-function | [] | true | false |
74.581605 | Easy | 2,668 | false | true | Find Latest Salaries | find-latest-salaries | ['Database'] | true | false |
74.117647 | Easy | 2,669 | false | true | Count Artist Occurrences On Spotify Ranking List | count-artist-occurrences-on-spotify-ranking-list | ['Database'] | false | false |
75.832379 | Easy | 2,670 | false | false | Find the Distinct Difference Array | find-the-distinct-difference-array | ['Array', 'Hash Table'] | false | false |
30.835102 | Medium | 2,671 | false | false | Frequency Tracker | frequency-tracker | ['Hash Table', 'Design'] | false | false |
54.338302 | Medium | 2,672 | false | false | Number of Adjacent Elements With the Same Color | number-of-adjacent-elements-with-the-same-color | ['Array'] | false | false |
56.131783 | Medium | 2,673 | false | false | Make Costs of Paths Equal in a Binary Tree | make-costs-of-paths-equal-in-a-binary-tree | ['Array', 'Dynamic Programming', 'Greedy', 'Tree', 'Binary Tree'] | false | false |
76.184338 | Medium | 2,674 | false | true | Split a Circular Linked List | split-a-circular-linked-list | ['Linked List', 'Two Pointers'] | false | false |
68.681942 | Hard | 2,675 | false | true | Array of Objects to Matrix | array-of-objects-to-matrix | [] | true | false |
83.216337 | Medium | 2,676 | false | true | Throttle | throttle | [] | true | false |
84.440797 | Easy | 2,677 | false | false | Chunk Array | chunk-array | [] | true | false |
81.314989 | Easy | 2,678 | false | false | Number of Senior Citizens | number-of-senior-citizens | ['Array', 'String'] | true | false |
58.792223 | Medium | 2,679 | false | false | Sum in a Matrix | sum-in-a-matrix | ['Array', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Simulation'] | false | false |
40.929601 | Medium | 2,680 | false | false | Maximum OR | maximum-or | ['Array', 'Greedy', 'Bit Manipulation', 'Prefix Sum'] | false | false |
29.34451 | Hard | 2,681 | false | false | Power of Heroes | power-of-heroes | ['Array', 'Math', 'Dynamic Programming', 'Sorting', 'Prefix Sum'] | false | false |
48.66217 | Easy | 2,682 | false | false | Find the Losers of the Circular Game | find-the-losers-of-the-circular-game | ['Array', 'Hash Table', 'Simulation'] | false | false |
79.7372 | Medium | 2,683 | false | false | Neighboring Bitwise XOR | neighboring-bitwise-xor | ['Array', 'Bit Manipulation'] | true | false |
58.846559 | Medium | 2,684 | false | false | Maximum Number of Moves in a Grid | maximum-number-of-moves-in-a-grid | ['Array', 'Dynamic Programming', 'Matrix'] | true | false |
77.695886 | Medium | 2,685 | false | false | Count the Number of Complete Components | count-the-number-of-complete-components | ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'] | true | false |
69.261787 | Medium | 2,686 | false | true | Immediate Food Delivery III | immediate-food-delivery-iii | ['Database'] | false | false |
81.300946 | Easy | 2,687 | false | true | Bikes Last Time Used | bikes-last-time-used | ['Database'] | false | false |
44.318402 | Medium | 2,688 | false | true | Find Active Users | find-active-users | ['Database'] | false | false |
73.984991 | Easy | 2,689 | false | true | Extract Kth Character From The Rope Tree | extract-kth-character-from-the-rope-tree | ['Tree', 'Depth-First Search', 'Binary Tree'] | false | false |
92.975664 | Easy | 2,690 | false | true | Infinite Method Object | infinite-method-object | [] | true | false |
41.123883 | Hard | 2,691 | false | true | Immutability Helper | immutability-helper | [] | false | false |
64.916201 | Medium | 2,692 | false | true | Make Object Immutable | make-object-immutable | [] | true | false |
78.737282 | Medium | 2,693 | false | false | Call Function with Custom Context | call-function-with-custom-context | [] | true | false |
74.377283 | Medium | 2,694 | false | false | Event Emitter | event-emitter | [] | true | false |
89.103682 | Easy | 2,695 | false | false | Array Wrapper | array-wrapper | [] | true | false |
77.057696 | Easy | 2,696 | false | false | Minimum String Length After Removing Substrings | minimum-string-length-after-removing-substrings | ['String', 'Stack', 'Simulation'] | true | false |
78.92322 | Easy | 2,697 | false | false | Lexicographically Smallest Palindrome | lexicographically-smallest-palindrome | ['Two Pointers', 'String', 'Greedy'] | false | false |
81.844009 | Medium | 2,698 | false | false | Find the Punishment Number of an Integer | find-the-punishment-number-of-an-integer | ['Math', 'Backtracking'] | true | false |
56.16029 | Hard | 2,699 | false | false | Modify Graph Edge Weights | modify-graph-edge-weights | ['Graph', 'Heap (Priority Queue)', 'Shortest Path'] | true | false |
75.20221 | Medium | 2,700 | false | true | Differences Between Two Objects | differences-between-two-objects | [] | true | false |
Subsets and Splits