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 |
---|---|---|---|---|---|---|---|---|---|
64.763137 |
Medium
| 2,401 | false | false |
Longest Nice Subarray
|
longest-nice-subarray
|
['Array', 'Bit Manipulation', 'Sliding Window']
| true | false |
43.897702 |
Hard
| 2,402 | false | false |
Meeting Rooms III
|
meeting-rooms-iii
|
['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)', 'Simulation']
| true | false |
55.750086 |
Hard
| 2,403 | false | true |
Minimum Time to Kill All Monsters
|
minimum-time-to-kill-all-monsters
|
['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']
| false | false |
51.517495 |
Easy
| 2,404 | false | false |
Most Frequent Even Element
|
most-frequent-even-element
|
['Array', 'Hash Table', 'Counting']
| false | false |
78.156192 |
Medium
| 2,405 | false | false |
Optimal Partition of String
|
optimal-partition-of-string
|
['Hash Table', 'String', 'Greedy']
| true | false |
63.680601 |
Medium
| 2,406 | false | false |
Divide Intervals Into Minimum Number of Groups
|
divide-intervals-into-minimum-number-of-groups
|
['Array', 'Two Pointers', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Prefix Sum']
| true | false |
25.335224 |
Hard
| 2,407 | false | false |
Longest Increasing Subsequence II
|
longest-increasing-subsequence-ii
|
['Array', 'Divide and Conquer', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree', 'Queue', 'Monotonic Queue']
| false | false |
71.68837 |
Medium
| 2,408 | false | true |
Design SQL
|
design-sql
|
['Array', 'Hash Table', 'String', 'Design']
| false | false |
46.225245 |
Easy
| 2,409 | false | false |
Count Days Spent Together
|
count-days-spent-together
|
['Math', 'String']
| false | false |
66.425949 |
Medium
| 2,410 | false | false |
Maximum Matching of Players With Trainers
|
maximum-matching-of-players-with-trainers
|
['Array', 'Two Pointers', 'Greedy', 'Sorting']
| false | false |
44.887773 |
Medium
| 2,411 | false | false |
Smallest Subarrays With Maximum Bitwise OR
|
smallest-subarrays-with-maximum-bitwise-or
|
['Array', 'Binary Search', 'Bit Manipulation', 'Sliding Window']
| false | false |
40.926535 |
Hard
| 2,412 | false | false |
Minimum Money Required Before Transactions
|
minimum-money-required-before-transactions
|
['Array', 'Greedy', 'Sorting']
| false | false |
88.040064 |
Easy
| 2,413 | false | false |
Smallest Even Multiple
|
smallest-even-multiple
|
['Math', 'Number Theory']
| false | false |
59.088167 |
Medium
| 2,414 | false | false |
Length of the Longest Alphabetical Continuous Substring
|
length-of-the-longest-alphabetical-continuous-substring
|
['String']
| false | false |
86.61842 |
Medium
| 2,415 | false | false |
Reverse Odd Levels of Binary Tree
|
reverse-odd-levels-of-binary-tree
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
60.686518 |
Hard
| 2,416 | false | false |
Sum of Prefix Scores of Strings
|
sum-of-prefix-scores-of-strings
|
['Array', 'String', 'Trie', 'Counting']
| true | false |
45.073375 |
Medium
| 2,417 | false | true |
Closest Fair Integer
|
closest-fair-integer
|
['Math', 'Enumeration']
| false | false |
84.804944 |
Easy
| 2,418 | false | false |
Sort the People
|
sort-the-people
|
['Array', 'Hash Table', 'String', 'Sorting']
| true | false |
61.785603 |
Medium
| 2,419 | false | false |
Longest Subarray With Maximum Bitwise AND
|
longest-subarray-with-maximum-bitwise-and
|
['Array', 'Bit Manipulation', 'Brainteaser']
| true | false |
39.571086 |
Medium
| 2,420 | false | false |
Find All Good Indices
|
find-all-good-indices
|
['Array', 'Dynamic Programming', 'Prefix Sum']
| false | false |
55.938347 |
Hard
| 2,421 | false | false |
Number of Good Paths
|
number-of-good-paths
|
['Array', 'Hash Table', 'Tree', 'Union Find', 'Graph', 'Sorting']
| true | false |
69.029602 |
Medium
| 2,422 | false | true |
Merge Operations to Turn Array Into a Palindrome
|
merge-operations-to-turn-array-into-a-palindrome
|
['Array', 'Two Pointers', 'Greedy']
| false | false |
18.032622 |
Easy
| 2,423 | false | false |
Remove Letter To Equalize Frequency
|
remove-letter-to-equalize-frequency
|
['Hash Table', 'String', 'Counting']
| false | false |
56.302096 |
Medium
| 2,424 | false | false |
Longest Uploaded Prefix
|
longest-uploaded-prefix
|
['Binary Search', 'Union Find', 'Design', 'Binary Indexed Tree', 'Segment Tree', 'Heap (Priority Queue)', 'Ordered Set']
| false | false |
67.038014 |
Medium
| 2,425 | false | false |
Bitwise XOR of All Pairings
|
bitwise-xor-of-all-pairings
|
['Array', 'Bit Manipulation', 'Brainteaser']
| true | false |
45.008712 |
Hard
| 2,426 | false | false |
Number of Pairs Satisfying Inequality
|
number-of-pairs-satisfying-inequality
|
['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']
| false | false |
79.396462 |
Easy
| 2,427 | false | false |
Number of Common Factors
|
number-of-common-factors
|
['Math', 'Enumeration', 'Number Theory']
| false | false |
75.769269 |
Medium
| 2,428 | false | false |
Maximum Sum of an Hourglass
|
maximum-sum-of-an-hourglass
|
['Array', 'Matrix', 'Prefix Sum']
| false | false |
62.439083 |
Medium
| 2,429 | false | false |
Minimize XOR
|
minimize-xor
|
['Greedy', 'Bit Manipulation']
| true | false |
34.350687 |
Hard
| 2,430 | false | false |
Maximum Deletions on a String
|
maximum-deletions-on-a-string
|
['String', 'Dynamic Programming', 'Rolling Hash', 'String Matching', 'Hash Function']
| false | false |
64.39523 |
Medium
| 2,431 | false | true |
Maximize Total Tastiness of Purchased Fruits
|
maximize-total-tastiness-of-purchased-fruits
|
['Array', 'Dynamic Programming']
| false | false |
50.396463 |
Easy
| 2,432 | false | false |
The Employee That Worked on the Longest Task
|
the-employee-that-worked-on-the-longest-task
|
['Array']
| false | false |
88.06687 |
Medium
| 2,433 | false | false |
Find The Original Array of Prefix Xor
|
find-the-original-array-of-prefix-xor
|
['Array', 'Bit Manipulation']
| true | false |
41.398513 |
Medium
| 2,434 | false | false |
Using a Robot to Print the Lexicographically Smallest String
|
using-a-robot-to-print-the-lexicographically-smallest-string
|
['Hash Table', 'String', 'Stack', 'Greedy']
| false | false |
43.847425 |
Hard
| 2,435 | false | false |
Paths in Matrix Whose Sum Is Divisible by K
|
paths-in-matrix-whose-sum-is-divisible-by-k
|
['Array', 'Dynamic Programming', 'Matrix']
| false | false |
69.975852 |
Medium
| 2,436 | false | true |
Minimum Split Into Subarrays With GCD Greater Than One
|
minimum-split-into-subarrays-with-gcd-greater-than-one
|
['Array', 'Math', 'Dynamic Programming', 'Greedy', 'Number Theory']
| false | false |
47.295659 |
Easy
| 2,437 | false | false |
Number of Valid Clock Times
|
number-of-valid-clock-times
|
['String', 'Enumeration']
| false | false |
41.632829 |
Medium
| 2,438 | false | false |
Range Product Queries of Powers
|
range-product-queries-of-powers
|
['Array', 'Bit Manipulation', 'Prefix Sum']
| false | false |
46.420375 |
Medium
| 2,439 | false | false |
Minimize Maximum of Array
|
minimize-maximum-of-array
|
['Array', 'Binary Search', 'Dynamic Programming', 'Greedy', 'Prefix Sum']
| true | false |
52.140452 |
Hard
| 2,440 | false | false |
Create Components With Same Value
|
create-components-with-same-value
|
['Array', 'Math', 'Tree', 'Depth-First Search', 'Enumeration']
| false | false |
74.701715 |
Easy
| 2,441 | false | false |
Largest Positive Integer That Exists With Its Negative
|
largest-positive-integer-that-exists-with-its-negative
|
['Array', 'Hash Table', 'Two Pointers', 'Sorting']
| true | false |
79.965148 |
Medium
| 2,442 | false | false |
Count Number of Distinct Integers After Reverse Operations
|
count-number-of-distinct-integers-after-reverse-operations
|
['Array', 'Hash Table', 'Math', 'Counting']
| false | false |
48.00317 |
Medium
| 2,443 | false | false |
Sum of Number and Its Reverse
|
sum-of-number-and-its-reverse
|
['Math', 'Enumeration']
| false | false |
67.682648 |
Hard
| 2,444 | false | false |
Count Subarrays With Fixed Bounds
|
count-subarrays-with-fixed-bounds
|
['Array', 'Queue', 'Sliding Window', 'Monotonic Queue']
| true | false |
65.550756 |
Medium
| 2,445 | false | true |
Number of Nodes With Value One
|
number-of-nodes-with-value-one
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| false | false |
52.133429 |
Easy
| 2,446 | false | false |
Determine if Two Events Have Conflict
|
determine-if-two-events-have-conflict
|
['Array', 'String']
| false | false |
50.828596 |
Medium
| 2,447 | false | false |
Number of Subarrays With GCD Equal to K
|
number-of-subarrays-with-gcd-equal-to-k
|
['Array', 'Math', 'Number Theory']
| false | false |
46.181385 |
Hard
| 2,448 | false | false |
Minimum Cost to Make Array Equal
|
minimum-cost-to-make-array-equal
|
['Array', 'Binary Search', 'Greedy', 'Sorting', 'Prefix Sum']
| true | false |
60.218588 |
Hard
| 2,449 | false | false |
Minimum Number of Operations to Make Arrays Similar
|
minimum-number-of-operations-to-make-arrays-similar
|
['Array', 'Greedy', 'Sorting']
| false | false |
63.438633 |
Medium
| 2,450 | false | true |
Number of Distinct Binary Strings After Applying Operations
|
number-of-distinct-binary-strings-after-applying-operations
|
['Math', 'String']
| false | false |
60.794795 |
Easy
| 2,451 | false | false |
Odd String Difference
|
odd-string-difference
|
['Array', 'Hash Table', 'String']
| false | false |
61.16447 |
Medium
| 2,452 | false | false |
Words Within Two Edits of Dictionary
|
words-within-two-edits-of-dictionary
|
['Array', 'String', 'Trie']
| false | false |
40.335249 |
Medium
| 2,453 | false | false |
Destroy Sequential Targets
|
destroy-sequential-targets
|
['Array', 'Hash Table', 'Counting']
| false | false |
39.690142 |
Hard
| 2,454 | false | false |
Next Greater Element IV
|
next-greater-element-iv
|
['Array', 'Binary Search', 'Stack', 'Sorting', 'Heap (Priority Queue)', 'Monotonic Stack']
| false | false |
61.132514 |
Easy
| 2,455 | false | false |
Average Value of Even Numbers That Are Divisible by Three
|
average-value-of-even-numbers-that-are-divisible-by-three
|
['Array', 'Math']
| false | false |
44.322165 |
Medium
| 2,456 | false | false |
Most Popular Video Creator
|
most-popular-video-creator
|
['Array', 'Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)']
| false | false |
37.844757 |
Medium
| 2,457 | false | false |
Minimum Addition to Make Integer Beautiful
|
minimum-addition-to-make-integer-beautiful
|
['Math', 'Greedy']
| false | false |
54.929922 |
Hard
| 2,458 | false | false |
Height of Binary Tree After Subtree Removal Queries
|
height-of-binary-tree-after-subtree-removal-queries
|
['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
44.537509 |
Hard
| 2,459 | false | true |
Sort Array by Moving Items to Empty Space
|
sort-array-by-moving-items-to-empty-space
|
['Array', 'Greedy', 'Sorting']
| false | false |
74.879049 |
Easy
| 2,460 | false | false |
Apply Operations to an Array
|
apply-operations-to-an-array
|
['Array', 'Two Pointers', 'Simulation']
| true | false |
42.67042 |
Medium
| 2,461 | false | false |
Maximum Sum of Distinct Subarrays With Length K
|
maximum-sum-of-distinct-subarrays-with-length-k
|
['Array', 'Hash Table', 'Sliding Window']
| true | false |
42.9403 |
Medium
| 2,462 | false | false |
Total Cost to Hire K Workers
|
total-cost-to-hire-k-workers
|
['Array', 'Two Pointers', 'Heap (Priority Queue)', 'Simulation']
| true | false |
59.060991 |
Hard
| 2,463 | false | false |
Minimum Total Distance Traveled
|
minimum-total-distance-traveled
|
['Array', 'Dynamic Programming', 'Sorting']
| true | false |
54.333201 |
Medium
| 2,464 | false | true |
Minimum Subarrays in a Valid Split
|
minimum-subarrays-in-a-valid-split
|
['Array', 'Math', 'Dynamic Programming', 'Number Theory']
| false | false |
58.368543 |
Easy
| 2,465 | false | false |
Number of Distinct Averages
|
number-of-distinct-averages
|
['Array', 'Hash Table', 'Two Pointers', 'Sorting']
| false | false |
59.255697 |
Medium
| 2,466 | false | false |
Count Ways To Build Good Strings
|
count-ways-to-build-good-strings
|
['Dynamic Programming']
| true | false |
67.798359 |
Medium
| 2,467 | false | false |
Most Profitable Path in a Tree
|
most-profitable-path-in-a-tree
|
['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph']
| true | false |
42.983139 |
Hard
| 2,468 | false | false |
Split Message Based on Limit
|
split-message-based-on-limit
|
['String', 'Binary Search', 'Enumeration']
| false | false |
90.058789 |
Easy
| 2,469 | false | false |
Convert the Temperature
|
convert-the-temperature
|
['Math']
| false | false |
39.596405 |
Medium
| 2,470 | false | false |
Number of Subarrays With LCM Equal to K
|
number-of-subarrays-with-lcm-equal-to-k
|
['Array', 'Math', 'Number Theory']
| false | false |
74.280838 |
Medium
| 2,471 | false | false |
Minimum Number of Operations to Sort a Binary Tree by Level
|
minimum-number-of-operations-to-sort-a-binary-tree-by-level
|
['Tree', 'Breadth-First Search', 'Binary Tree']
| true | false |
41.266076 |
Hard
| 2,472 | false | false |
Maximum Number of Non-overlapping Palindrome Substrings
|
maximum-number-of-non-overlapping-palindrome-substrings
|
['Two Pointers', 'String', 'Dynamic Programming', 'Greedy']
| false | false |
67.179284 |
Medium
| 2,473 | false | true |
Minimum Cost to Buy Apples
|
minimum-cost-to-buy-apples
|
['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']
| true | false |
47.937868 |
Hard
| 2,474 | false | true |
Customers With Strictly Increasing Purchases
|
customers-with-strictly-increasing-purchases
|
['Database']
| false | false |
72.051143 |
Easy
| 2,475 | false | false |
Number of Unequal Triplets in Array
|
number-of-unequal-triplets-in-array
|
['Array', 'Hash Table', 'Sorting']
| false | false |
42.182611 |
Medium
| 2,476 | false | false |
Closest Nodes Queries in a Binary Search Tree
|
closest-nodes-queries-in-a-binary-search-tree
|
['Array', 'Binary Search', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']
| false | false |
64.211583 |
Medium
| 2,477 | false | false |
Minimum Fuel Cost to Report to the Capital
|
minimum-fuel-cost-to-report-to-the-capital
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph']
| true | false |
32.029287 |
Hard
| 2,478 | false | false |
Number of Beautiful Partitions
|
number-of-beautiful-partitions
|
['String', 'Dynamic Programming']
| false | false |
49.447174 |
Hard
| 2,479 | false | true |
Maximum XOR of Two Non-Overlapping Subtrees
|
maximum-xor-of-two-non-overlapping-subtrees
|
['Tree', 'Depth-First Search', 'Graph', 'Trie']
| false | false |
78.526399 |
Easy
| 2,480 | false | true |
Form a Chemical Bond
|
form-a-chemical-bond
|
['Database']
| false | false |
54.895678 |
Easy
| 2,481 | false | false |
Minimum Cuts to Divide a Circle
|
minimum-cuts-to-divide-a-circle
|
['Math', 'Geometry']
| false | false |
84.274645 |
Medium
| 2,482 | false | false |
Difference Between Ones and Zeros in Row and Column
|
difference-between-ones-and-zeros-in-row-and-column
|
['Array', 'Matrix', 'Simulation']
| true | false |
67.551348 |
Medium
| 2,483 | false | false |
Minimum Penalty for a Shop
|
minimum-penalty-for-a-shop
|
['String', 'Prefix Sum']
| true | true |
38.875643 |
Hard
| 2,484 | false | false |
Count Palindromic Subsequences
|
count-palindromic-subsequences
|
['String', 'Dynamic Programming']
| false | false |
83.711398 |
Easy
| 2,485 | false | false |
Find the Pivot Integer
|
find-the-pivot-integer
|
['Math', 'Prefix Sum']
| true | false |
72.965158 |
Medium
| 2,486 | false | false |
Append Characters to String to Make Subsequence
|
append-characters-to-string-to-make-subsequence
|
['Two Pointers', 'String', 'Greedy']
| true | false |
74.249288 |
Medium
| 2,487 | false | false |
Remove Nodes From Linked List
|
remove-nodes-from-linked-list
|
['Linked List', 'Stack', 'Recursion', 'Monotonic Stack']
| true | false |
44.952619 |
Hard
| 2,488 | false | false |
Count Subarrays With Median K
|
count-subarrays-with-median-k
|
['Array', 'Hash Table', 'Prefix Sum']
| false | false |
55.478615 |
Medium
| 2,489 | false | true |
Number of Substrings With Fixed Ratio
|
number-of-substrings-with-fixed-ratio
|
['Hash Table', 'Math', 'String', 'Prefix Sum']
| false | false |
70.47666 |
Easy
| 2,490 | false | false |
Circular Sentence
|
circular-sentence
|
['String']
| true | false |
68.948362 |
Medium
| 2,491 | false | false |
Divide Players Into Teams of Equal Skill
|
divide-players-into-teams-of-equal-skill
|
['Array', 'Hash Table', 'Two Pointers', 'Sorting']
| true | false |
57.670753 |
Medium
| 2,492 | false | false |
Minimum Score of a Path Between Two Cities
|
minimum-score-of-a-path-between-two-cities
|
['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']
| true | false |
67.510205 |
Hard
| 2,493 | false | false |
Divide Nodes Into the Maximum Number of Groups
|
divide-nodes-into-the-maximum-number-of-groups
|
['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']
| true | false |
34.497941 |
Hard
| 2,494 | false | true |
Merge Overlapping Events in the Same Hall
|
merge-overlapping-events-in-the-same-hall
|
['Database']
| false | false |
61.019737 |
Medium
| 2,495 | false | true |
Number of Subarrays Having Even Product
|
number-of-subarrays-having-even-product
|
['Array', 'Math', 'Dynamic Programming']
| false | false |
73.239511 |
Easy
| 2,496 | false | false |
Maximum Value of a String in an Array
|
maximum-value-of-a-string-in-an-array
|
['Array', 'String']
| false | false |
40.592588 |
Medium
| 2,497 | false | false |
Maximum Star Sum of a Graph
|
maximum-star-sum-of-a-graph
|
['Array', 'Greedy', 'Graph', 'Sorting', 'Heap (Priority Queue)']
| false | false |
62.066129 |
Medium
| 2,498 | false | false |
Frog Jump II
|
frog-jump-ii
|
['Array', 'Binary Search', 'Greedy']
| false | false |
40.562774 |
Hard
| 2,499 | false | false |
Minimum Total Cost to Make Arrays Unequal
|
minimum-total-cost-to-make-arrays-unequal
|
['Array', 'Hash Table', 'Greedy', 'Counting']
| false | false |
78.782841 |
Easy
| 2,500 | false | false |
Delete Greatest Value in Each Row
|
delete-greatest-value-in-each-row
|
['Array', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Simulation']
| false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.