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 |
---|---|---|---|---|---|---|---|---|---|
53.059671 |
Medium
| 2,501 | false | false |
Longest Square Streak in an Array
|
longest-square-streak-in-an-array
|
['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting']
| true | false |
53.047557 |
Medium
| 2,502 | false | false |
Design Memory Allocator
|
design-memory-allocator
|
['Array', 'Hash Table', 'Design', 'Simulation']
| false | false |
59.6316 |
Hard
| 2,503 | false | false |
Maximum Number of Points From Grid Queries
|
maximum-number-of-points-from-grid-queries
|
['Array', 'Two Pointers', 'Breadth-First Search', 'Union Find', 'Sorting', 'Heap (Priority Queue)', 'Matrix']
| true | false |
78.584217 |
Easy
| 2,504 | false | true |
Concatenate the Name and the Profession
|
concatenate-the-name-and-the-profession
|
['Database']
| false | false |
64.951058 |
Medium
| 2,505 | false | true |
Bitwise OR of All Subsequence Sums
|
bitwise-or-of-all-subsequence-sums
|
['Array', 'Math', 'Bit Manipulation', 'Brainteaser']
| false | false |
72.163664 |
Easy
| 2,506 | false | false |
Count Pairs Of Similar Strings
|
count-pairs-of-similar-strings
|
['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Counting']
| false | false |
48.957126 |
Medium
| 2,507 | false | false |
Smallest Value After Replacing With Sum of Prime Factors
|
smallest-value-after-replacing-with-sum-of-prime-factors
|
['Math', 'Simulation', 'Number Theory']
| false | false |
33.285018 |
Hard
| 2,508 | false | false |
Add Edges to Make Degrees of All Nodes Even
|
add-edges-to-make-degrees-of-all-nodes-even
|
['Hash Table', 'Graph']
| false | false |
57.833014 |
Hard
| 2,509 | false | false |
Cycle Length Queries in a Tree
|
cycle-length-queries-in-a-tree
|
['Array', 'Tree', 'Binary Tree']
| false | false |
51.238643 |
Medium
| 2,510 | false | true |
Check if There is a Path With Equal Number of 0's And 1's
|
check-if-there-is-a-path-with-equal-number-of-0s-and-1s
|
['Array', 'Dynamic Programming', 'Matrix']
| false | false |
39.778563 |
Easy
| 2,511 | false | false |
Maximum Enemy Forts That Can Be Captured
|
maximum-enemy-forts-that-can-be-captured
|
['Array', 'Two Pointers']
| false | false |
45.723466 |
Medium
| 2,512 | false | false |
Reward Top K Students
|
reward-top-k-students
|
['Array', 'Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)']
| false | false |
31.098416 |
Medium
| 2,513 | false | false |
Minimize the Maximum of Two Arrays
|
minimize-the-maximum-of-two-arrays
|
['Math', 'Binary Search', 'Number Theory']
| false | false |
34.794527 |
Hard
| 2,514 | false | false |
Count Anagrams
|
count-anagrams
|
['Hash Table', 'Math', 'String', 'Combinatorics', 'Counting']
| false | false |
50.279013 |
Easy
| 2,515 | false | false |
Shortest Distance to Target String in a Circular Array
|
shortest-distance-to-target-string-in-a-circular-array
|
['Array', 'String']
| false | false |
51.717802 |
Medium
| 2,516 | false | false |
Take K of Each Character From Left and Right
|
take-k-of-each-character-from-left-and-right
|
['Hash Table', 'String', 'Sliding Window']
| true | false |
65.695567 |
Medium
| 2,517 | false | false |
Maximum Tastiness of Candy Basket
|
maximum-tastiness-of-candy-basket
|
['Array', 'Binary Search', 'Greedy', 'Sorting']
| false | false |
32.235812 |
Hard
| 2,518 | false | false |
Number of Great Partitions
|
number-of-great-partitions
|
['Array', 'Dynamic Programming']
| false | false |
53.09869 |
Hard
| 2,519 | false | true |
Count the Number of K-Big Indices
|
count-the-number-of-k-big-indices
|
['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']
| false | false |
85.593368 |
Easy
| 2,520 | false | false |
Count the Digits That Divide a Number
|
count-the-digits-that-divide-a-number
|
['Math']
| false | false |
52.595296 |
Medium
| 2,521 | false | false |
Distinct Prime Factors of Product of Array
|
distinct-prime-factors-of-product-of-array
|
['Array', 'Hash Table', 'Math', 'Number Theory']
| false | false |
46.355906 |
Medium
| 2,522 | false | false |
Partition String Into Substrings With Values at Most K
|
partition-string-into-substrings-with-values-at-most-k
|
['String', 'Dynamic Programming', 'Greedy']
| false | false |
51.543035 |
Medium
| 2,523 | false | false |
Closest Prime Numbers in Range
|
closest-prime-numbers-in-range
|
['Math', 'Number Theory']
| true | false |
34.418605 |
Hard
| 2,524 | false | true |
Maximum Frequency Score of a Subarray
|
maximum-frequency-score-of-a-subarray
|
['Array', 'Hash Table', 'Math', 'Stack', 'Sliding Window']
| false | false |
37.140921 |
Easy
| 2,525 | false | false |
Categorize Box According to Criteria
|
categorize-box-according-to-criteria
|
['Math']
| false | false |
50.509678 |
Medium
| 2,526 | false | false |
Find Consecutive Integers from a Data Stream
|
find-consecutive-integers-from-a-data-stream
|
['Hash Table', 'Design', 'Queue', 'Counting', 'Data Stream']
| false | false |
68.954006 |
Medium
| 2,527 | false | false |
Find Xor-Beauty of Array
|
find-xor-beauty-of-array
|
['Array', 'Math', 'Bit Manipulation']
| false | false |
32.893642 |
Hard
| 2,528 | false | false |
Maximize the Minimum Powered City
|
maximize-the-minimum-powered-city
|
['Array', 'Binary Search', 'Greedy', 'Queue', 'Sliding Window', 'Prefix Sum']
| false | false |
74.548334 |
Easy
| 2,529 | false | false |
Maximum Count of Positive Integer and Negative Integer
|
maximum-count-of-positive-integer-and-negative-integer
|
['Array', 'Binary Search', 'Counting']
| true | false |
63.760752 |
Medium
| 2,530 | false | false |
Maximal Score After Applying K Operations
|
maximal-score-after-applying-k-operations
|
['Array', 'Greedy', 'Heap (Priority Queue)']
| true | false |
26.803382 |
Medium
| 2,531 | false | false |
Make Number of Distinct Characters Equal
|
make-number-of-distinct-characters-equal
|
['Hash Table', 'String', 'Counting']
| false | false |
43.401811 |
Hard
| 2,532 | false | false |
Time to Cross a Bridge
|
time-to-cross-a-bridge
|
['Array', 'Heap (Priority Queue)', 'Simulation']
| false | false |
52.368301 |
Medium
| 2,533 | false | true |
Number of Good Binary Strings
|
number-of-good-binary-strings
|
['Dynamic Programming']
| false | false |
48.987989 |
Hard
| 2,534 | false | true |
Time Taken to Cross the Door
|
time-taken-to-cross-the-door
|
['Array', 'Queue', 'Simulation']
| false | false |
84.749701 |
Easy
| 2,535 | false | false |
Difference Between Element Sum and Digit Sum of an Array
|
difference-between-element-sum-and-digit-sum-of-an-array
|
['Array', 'Math']
| false | false |
51.24115 |
Medium
| 2,536 | false | false |
Increment Submatrices by One
|
increment-submatrices-by-one
|
['Array', 'Matrix', 'Prefix Sum']
| false | false |
52.933858 |
Medium
| 2,537 | false | false |
Count the Number of Good Subarrays
|
count-the-number-of-good-subarrays
|
['Array', 'Hash Table', 'Sliding Window']
| false | false |
31.597382 |
Hard
| 2,538 | false | false |
Difference Between Maximum and Minimum Price Sum
|
difference-between-maximum-and-minimum-price-sum
|
['Array', 'Dynamic Programming', 'Tree', 'Depth-First Search']
| false | false |
51.554908 |
Medium
| 2,539 | false | true |
Count the Number of Good Subsequences
|
count-the-number-of-good-subsequences
|
['Hash Table', 'Math', 'String', 'Combinatorics', 'Counting']
| false | false |
58.260823 |
Easy
| 2,540 | false | false |
Minimum Common Value
|
minimum-common-value
|
['Array', 'Hash Table', 'Two Pointers', 'Binary Search']
| true | false |
32.204716 |
Medium
| 2,541 | false | false |
Minimum Operations to Make Array Equal II
|
minimum-operations-to-make-array-equal-ii
|
['Array', 'Math', 'Greedy']
| false | false |
54.144203 |
Medium
| 2,542 | false | false |
Maximum Subsequence Score
|
maximum-subsequence-score
|
['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']
| true | false |
43.147948 |
Hard
| 2,543 | false | false |
Check if Point Is Reachable
|
check-if-point-is-reachable
|
['Math', 'Number Theory']
| false | false |
68.356519 |
Easy
| 2,544 | false | false |
Alternating Digit Sum
|
alternating-digit-sum
|
['Math']
| false | false |
85.546667 |
Medium
| 2,545 | false | false |
Sort the Students by Their Kth Score
|
sort-the-students-by-their-kth-score
|
['Array', 'Sorting', 'Matrix']
| false | false |
41.513559 |
Medium
| 2,546 | false | false |
Apply Bitwise Operations to Make Strings Equal
|
apply-bitwise-operations-to-make-strings-equal
|
['String', 'Bit Manipulation']
| false | false |
41.793083 |
Hard
| 2,547 | false | false |
Minimum Cost to Split an Array
|
minimum-cost-to-split-an-array
|
['Array', 'Hash Table', 'Dynamic Programming', 'Counting']
| false | false |
63.467375 |
Medium
| 2,548 | false | true |
Maximum Price to Fill a Bag
|
maximum-price-to-fill-a-bag
|
['Array', 'Greedy', 'Sorting']
| false | false |
61.188571 |
Easy
| 2,549 | false | false |
Count Distinct Numbers on Board
|
count-distinct-numbers-on-board
|
['Array', 'Hash Table', 'Math', 'Simulation']
| false | false |
28.634734 |
Medium
| 2,550 | false | false |
Count Collisions of Monkeys on a Polygon
|
count-collisions-of-monkeys-on-a-polygon
|
['Math', 'Recursion']
| false | false |
72.608516 |
Hard
| 2,551 | false | false |
Put Marbles in Bags
|
put-marbles-in-bags
|
['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']
| true | false |
33.932161 |
Hard
| 2,552 | false | false |
Count Increasing Quadruplets
|
count-increasing-quadruplets
|
['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Enumeration', 'Prefix Sum']
| false | false |
80.093334 |
Easy
| 2,553 | false | false |
Separate the Digits in an Array
|
separate-the-digits-in-an-array
|
['Array', 'Simulation']
| false | false |
67.853783 |
Medium
| 2,554 | false | false |
Maximum Number of Integers to Choose From a Range I
|
maximum-number-of-integers-to-choose-from-a-range-i
|
['Array', 'Hash Table', 'Binary Search', 'Greedy', 'Sorting']
| true | false |
34.794673 |
Medium
| 2,555 | false | false |
Maximize Win From Two Segments
|
maximize-win-from-two-segments
|
['Array', 'Binary Search', 'Sliding Window']
| false | false |
27.248338 |
Medium
| 2,556 | false | false |
Disconnect Path in a Binary Matrix by at Most One Flip
|
disconnect-path-in-a-binary-matrix-by-at-most-one-flip
|
['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Matrix']
| false | false |
35.373665 |
Medium
| 2,557 | false | true |
Maximum Number of Integers to Choose From a Range II
|
maximum-number-of-integers-to-choose-from-a-range-ii
|
['Array', 'Binary Search', 'Greedy', 'Sorting']
| false | false |
75.698601 |
Easy
| 2,558 | false | false |
Take Gifts From the Richest Pile
|
take-gifts-from-the-richest-pile
|
['Array', 'Heap (Priority Queue)', 'Simulation']
| true | false |
67.910483 |
Medium
| 2,559 | false | false |
Count Vowel Strings in Ranges
|
count-vowel-strings-in-ranges
|
['Array', 'String', 'Prefix Sum']
| true | false |
65.173166 |
Medium
| 2,560 | false | false |
House Robber IV
|
house-robber-iv
|
['Array', 'Binary Search']
| true | false |
34.913601 |
Hard
| 2,561 | false | false |
Rearranging Fruits
|
rearranging-fruits
|
['Array', 'Hash Table', 'Greedy']
| false | false |
70.744359 |
Easy
| 2,562 | false | false |
Find the Array Concatenation Value
|
find-the-array-concatenation-value
|
['Array', 'Two Pointers', 'Simulation']
| false | false |
48.813547 |
Medium
| 2,563 | false | false |
Count the Number of Fair Pairs
|
count-the-number-of-fair-pairs
|
['Array', 'Two Pointers', 'Binary Search', 'Sorting']
| true | false |
34.273105 |
Medium
| 2,564 | false | false |
Substring XOR Queries
|
substring-xor-queries
|
['Array', 'Hash Table', 'String', 'Bit Manipulation']
| false | false |
32.467771 |
Hard
| 2,565 | false | false |
Subsequence With the Minimum Score
|
subsequence-with-the-minimum-score
|
['Two Pointers', 'String', 'Binary Search']
| false | false |
60.30285 |
Easy
| 2,566 | false | false |
Maximum Difference by Remapping a Digit
|
maximum-difference-by-remapping-a-digit
|
['Math', 'Greedy']
| false | false |
48.661952 |
Medium
| 2,567 | false | false |
Minimum Score by Changing Two Elements
|
minimum-score-by-changing-two-elements
|
['Array', 'Greedy', 'Sorting']
| false | false |
57.55871 |
Medium
| 2,568 | false | false |
Minimum Impossible OR
|
minimum-impossible-or
|
['Array', 'Bit Manipulation', 'Brainteaser']
| false | false |
29.037984 |
Hard
| 2,569 | false | false |
Handling Sum Queries After Update
|
handling-sum-queries-after-update
|
['Array', 'Segment Tree']
| false | false |
82.102807 |
Easy
| 2,570 | false | false |
Merge Two 2D Arrays by Summing Values
|
merge-two-2d-arrays-by-summing-values
|
['Array', 'Hash Table', 'Two Pointers']
| true | false |
56.855978 |
Medium
| 2,571 | false | false |
Minimum Operations to Reduce an Integer to 0
|
minimum-operations-to-reduce-an-integer-to-0
|
['Dynamic Programming', 'Greedy', 'Bit Manipulation']
| false | false |
24.64745 |
Medium
| 2,572 | false | false |
Count the Number of Square-Free Subsets
|
count-the-number-of-square-free-subsets
|
['Array', 'Math', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']
| false | false |
31.448576 |
Hard
| 2,573 | false | false |
Find the String with LCP
|
find-the-string-with-lcp
|
['Array', 'String', 'Dynamic Programming', 'Greedy', 'Union Find', 'Matrix']
| false | false |
87.329435 |
Easy
| 2,574 | false | false |
Left and Right Sum Differences
|
left-and-right-sum-differences
|
['Array', 'Prefix Sum']
| false | false |
34.277141 |
Medium
| 2,575 | false | false |
Find the Divisibility Array of a String
|
find-the-divisibility-array-of-a-string
|
['Array', 'Math', 'String']
| false | false |
39.645339 |
Medium
| 2,576 | false | false |
Find the Maximum Number of Marked Indices
|
find-the-maximum-number-of-marked-indices
|
['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting']
| false | false |
57.025688 |
Hard
| 2,577 | false | false |
Minimum Time to Visit a Cell In a Grid
|
minimum-time-to-visit-a-cell-in-a-grid
|
['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']
| true | false |
71.849959 |
Easy
| 2,578 | false | false |
Split With Minimum Sum
|
split-with-minimum-sum
|
['Math', 'Greedy', 'Sorting']
| false | false |
66.198688 |
Medium
| 2,579 | false | false |
Count Total Number of Colored Cells
|
count-total-number-of-colored-cells
|
['Math']
| true | false |
37.741267 |
Medium
| 2,580 | false | false |
Count Ways to Group Overlapping Ranges
|
count-ways-to-group-overlapping-ranges
|
['Array', 'Sorting']
| false | false |
46.070594 |
Hard
| 2,581 | false | false |
Count Number of Possible Root Nodes
|
count-number-of-possible-root-nodes
|
['Array', 'Hash Table', 'Dynamic Programming', 'Tree', 'Depth-First Search']
| false | false |
56.565014 |
Easy
| 2,582 | false | false |
Pass the Pillow
|
pass-the-pillow
|
['Math', 'Simulation']
| true | false |
59.303458 |
Medium
| 2,583 | false | false |
Kth Largest Sum in a Binary Tree
|
kth-largest-sum-in-a-binary-tree
|
['Tree', 'Breadth-First Search', 'Sorting', 'Binary Tree']
| true | false |
23.221923 |
Hard
| 2,584 | false | false |
Split the Array to Make Coprime Products
|
split-the-array-to-make-coprime-products
|
['Array', 'Hash Table', 'Math', 'Number Theory']
| false | false |
58.336715 |
Hard
| 2,585 | false | false |
Number of Ways to Earn Points
|
number-of-ways-to-earn-points
|
['Array', 'Dynamic Programming']
| false | false |
73.362552 |
Easy
| 2,586 | false | false |
Count the Number of Vowel Strings in Range
|
count-the-number-of-vowel-strings-in-range
|
['Array', 'String', 'Counting']
| false | false |
41.165275 |
Medium
| 2,587 | false | false |
Rearrange Array to Maximize Prefix Score
|
rearrange-array-to-maximize-prefix-score
|
['Array', 'Greedy', 'Sorting', 'Prefix Sum']
| false | false |
51.38845 |
Medium
| 2,588 | false | false |
Count the Number of Beautiful Subarrays
|
count-the-number-of-beautiful-subarrays
|
['Array', 'Hash Table', 'Bit Manipulation', 'Prefix Sum']
| false | false |
36.925202 |
Hard
| 2,589 | false | false |
Minimum Time to Complete All Tasks
|
minimum-time-to-complete-all-tasks
|
['Array', 'Binary Search', 'Stack', 'Greedy', 'Sorting']
| false | false |
58.713693 |
Medium
| 2,590 | false | true |
Design a Todo List
|
design-a-todo-list
|
['Array', 'Hash Table', 'String', 'Design', 'Sorting']
| false | false |
19.336284 |
Easy
| 2,591 | false | false |
Distribute Money to Maximum Children
|
distribute-money-to-maximum-children
|
['Math', 'Greedy']
| false | false |
57.922935 |
Medium
| 2,592 | false | false |
Maximize Greatness of an Array
|
maximize-greatness-of-an-array
|
['Array', 'Two Pointers', 'Greedy', 'Sorting']
| false | false |
64.681602 |
Medium
| 2,593 | false | false |
Find Score of an Array After Marking All Elements
|
find-score-of-an-array-after-marking-all-elements
|
['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation']
| true | false |
59.973312 |
Medium
| 2,594 | false | false |
Minimum Time to Repair Cars
|
minimum-time-to-repair-cars
|
['Array', 'Binary Search']
| true | false |
72.29004 |
Easy
| 2,595 | false | false |
Number of Even and Odd Bits
|
number-of-even-and-odd-bits
|
['Bit Manipulation']
| false | false |
57.191384 |
Medium
| 2,596 | false | false |
Check Knight Tour Configuration
|
check-knight-tour-configuration
|
['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix', 'Simulation']
| false | false |
50.703522 |
Medium
| 2,597 | false | false |
The Number of Beautiful Subsets
|
the-number-of-beautiful-subsets
|
['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Backtracking', 'Sorting', 'Combinatorics']
| true | false |
39.566499 |
Medium
| 2,598 | false | false |
Smallest Missing Non-negative Integer After Operations
|
smallest-missing-non-negative-integer-after-operations
|
['Array', 'Hash Table', 'Math', 'Greedy']
| false | false |
51.637778 |
Medium
| 2,599 | false | true |
Make the Prefix Sum Non-negative
|
make-the-prefix-sum-non-negative
|
['Array', 'Greedy', 'Heap (Priority Queue)']
| true | false |
60.723392 |
Easy
| 2,600 | false | false |
K Items With the Maximum Sum
|
k-items-with-the-maximum-sum
|
['Math', 'Greedy']
| false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.