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 |
---|---|---|---|---|---|---|---|---|---|
41.831986 |
Hard
| 2,301 | false | false |
Match Substring After Replacement
|
match-substring-after-replacement
|
['Array', 'Hash Table', 'String', 'String Matching']
| false | false |
55.735762 |
Hard
| 2,302 | false | false |
Count Subarrays With Score Less Than K
|
count-subarrays-with-score-less-than-k
|
['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum']
| false | false |
66.976184 |
Easy
| 2,303 | false | false |
Calculate Amount Paid in Taxes
|
calculate-amount-paid-in-taxes
|
['Array', 'Simulation']
| false | false |
67.024093 |
Medium
| 2,304 | false | false |
Minimum Path Cost in a Grid
|
minimum-path-cost-in-a-grid
|
['Array', 'Dynamic Programming', 'Matrix']
| false | false |
69.298973 |
Medium
| 2,305 | false | false |
Fair Distribution of Cookies
|
fair-distribution-of-cookies
|
['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']
| true | false |
46.323777 |
Hard
| 2,306 | false | false |
Naming a Company
|
naming-a-company
|
['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Enumeration']
| true | false |
43.119266 |
Hard
| 2,307 | false | true |
Check for Contradictions in Equations
|
check-for-contradictions-in-equations
|
['Array', 'Depth-First Search', 'Union Find', 'Graph']
| false | false |
70.297607 |
Medium
| 2,308 | false | true |
Arrange Table by Gender
|
arrange-table-by-gender
|
['Database']
| false | false |
70.849135 |
Easy
| 2,309 | false | false |
Greatest English Letter in Upper and Lower Case
|
greatest-english-letter-in-upper-and-lower-case
|
['Hash Table', 'String', 'Enumeration']
| false | false |
27.153365 |
Medium
| 2,310 | false | false |
Sum of Numbers With Units Digit K
|
sum-of-numbers-with-units-digit-k
|
['Math', 'Dynamic Programming', 'Greedy', 'Enumeration']
| false | false |
38.084918 |
Medium
| 2,311 | false | false |
Longest Binary Subsequence Less Than or Equal to K
|
longest-binary-subsequence-less-than-or-equal-to-k
|
['String', 'Dynamic Programming', 'Greedy', 'Memoization']
| false | false |
51.331066 |
Hard
| 2,312 | false | false |
Selling Pieces of Wood
|
selling-pieces-of-wood
|
['Array', 'Dynamic Programming', 'Memoization']
| false | false |
56.673564 |
Hard
| 2,313 | false | true |
Minimum Flips in Binary Tree to Get Result
|
minimum-flips-in-binary-tree-to-get-result
|
['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']
| false | false |
73.073333 |
Medium
| 2,314 | false | true |
The First Day of the Maximum Recorded Degree in Each City
|
the-first-day-of-the-maximum-recorded-degree-in-each-city
|
['Database']
| false | false |
82.633059 |
Easy
| 2,315 | false | false |
Count Asterisks
|
count-asterisks
|
['String']
| false | false |
49.185761 |
Medium
| 2,316 | false | false |
Count Unreachable Pairs of Nodes in an Undirected Graph
|
count-unreachable-pairs-of-nodes-in-an-undirected-graph
|
['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']
| true | false |
79.159106 |
Medium
| 2,317 | false | false |
Maximum XOR After Operations
|
maximum-xor-after-operations
|
['Array', 'Math', 'Bit Manipulation']
| false | false |
57.067918 |
Hard
| 2,318 | false | false |
Number of Distinct Roll Sequences
|
number-of-distinct-roll-sequences
|
['Dynamic Programming', 'Memoization']
| false | false |
65.339884 |
Easy
| 2,319 | false | false |
Check if Matrix Is X-Matrix
|
check-if-matrix-is-x-matrix
|
['Array', 'Matrix']
| false | false |
42.54816 |
Medium
| 2,320 | false | false |
Count Number of Ways to Place Houses
|
count-number-of-ways-to-place-houses
|
['Dynamic Programming']
| false | false |
57.307744 |
Hard
| 2,321 | false | false |
Maximum Score Of Spliced Array
|
maximum-score-of-spliced-array
|
['Array', 'Dynamic Programming']
| false | false |
51.972349 |
Hard
| 2,322 | false | false |
Minimum Score After Removals on a Tree
|
minimum-score-after-removals-on-a-tree
|
['Array', 'Bit Manipulation', 'Tree', 'Depth-First Search']
| false | false |
65.600593 |
Medium
| 2,323 | false | true |
Find Minimum Time to Finish All Jobs II
|
find-minimum-time-to-finish-all-jobs-ii
|
['Array', 'Greedy', 'Sorting']
| false | false |
75.264134 |
Medium
| 2,324 | false | true |
Product Sales Analysis IV
|
product-sales-analysis-iv
|
['Database']
| false | false |
85.265429 |
Easy
| 2,325 | false | false |
Decode the Message
|
decode-the-message
|
['Hash Table', 'String']
| false | false |
82.173722 |
Medium
| 2,326 | false | false |
Spiral Matrix IV
|
spiral-matrix-iv
|
['Array', 'Linked List', 'Matrix', 'Simulation']
| true | false |
46.101485 |
Medium
| 2,327 | false | false |
Number of People Aware of a Secret
|
number-of-people-aware-of-a-secret
|
['Dynamic Programming', 'Queue', 'Simulation']
| false | false |
57.712047 |
Hard
| 2,328 | false | false |
Number of Increasing Paths in a Grid
|
number-of-increasing-paths-in-a-grid
|
['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort', 'Memoization', 'Matrix']
| true | false |
70.427257 |
Easy
| 2,329 | false | true |
Product Sales Analysis V
|
product-sales-analysis-v
|
['Database']
| false | false |
75.75427 |
Medium
| 2,330 | false | true |
Valid Palindrome IV
|
valid-palindrome-iv
|
['Two Pointers', 'String']
| false | false |
82.433575 |
Easy
| 2,331 | false | false |
Evaluate Boolean Binary Tree
|
evaluate-boolean-binary-tree
|
['Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
28.060232 |
Medium
| 2,332 | false | false |
The Latest Time to Catch a Bus
|
the-latest-time-to-catch-a-bus
|
['Array', 'Two Pointers', 'Binary Search', 'Sorting']
| false | false |
25.780407 |
Medium
| 2,333 | false | false |
Minimum Sum of Squared Difference
|
minimum-sum-of-squared-difference
|
['Array', 'Binary Search', 'Greedy', 'Sorting', 'Heap (Priority Queue)']
| false | false |
44.290264 |
Hard
| 2,334 | false | false |
Subarray With Elements Greater Than Varying Threshold
|
subarray-with-elements-greater-than-varying-threshold
|
['Array', 'Stack', 'Union Find', 'Monotonic Stack']
| false | false |
58.599094 |
Easy
| 2,335 | false | false |
Minimum Amount of Time to Fill Cups
|
minimum-amount-of-time-to-fill-cups
|
['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']
| false | false |
71.360318 |
Medium
| 2,336 | false | false |
Smallest Number in Infinite Set
|
smallest-number-in-infinite-set
|
['Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set']
| true | false |
56.905879 |
Medium
| 2,337 | false | false |
Move Pieces to Obtain a String
|
move-pieces-to-obtain-a-string
|
['Two Pointers', 'String']
| true | false |
27.423159 |
Hard
| 2,338 | false | false |
Count the Number of Ideal Arrays
|
count-the-number-of-ideal-arrays
|
['Math', 'Dynamic Programming', 'Combinatorics', 'Number Theory']
| false | false |
88.370822 |
Easy
| 2,339 | false | true |
All the Matches of the League
|
all-the-matches-of-the-league
|
['Database']
| false | false |
72.238834 |
Medium
| 2,340 | false | true |
Minimum Adjacent Swaps to Make a Valid Array
|
minimum-adjacent-swaps-to-make-a-valid-array
|
['Array', 'Greedy']
| false | false |
75.418118 |
Easy
| 2,341 | false | false |
Maximum Number of Pairs in Array
|
maximum-number-of-pairs-in-array
|
['Array', 'Hash Table', 'Counting']
| false | false |
65.994768 |
Medium
| 2,342 | false | false |
Max Sum of a Pair With Equal Sum of Digits
|
max-sum-of-a-pair-with-equal-sum-of-digits
|
['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)']
| true | false |
45.179554 |
Medium
| 2,343 | false | false |
Query Kth Smallest Trimmed Number
|
query-kth-smallest-trimmed-number
|
['Array', 'String', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Radix Sort', 'Quickselect']
| false | false |
57.02681 |
Hard
| 2,344 | false | false |
Minimum Deletions to Make Array Divisible
|
minimum-deletions-to-make-array-divisible
|
['Array', 'Math', 'Sorting', 'Heap (Priority Queue)', 'Number Theory']
| false | false |
36.630424 |
Medium
| 2,345 | false | true |
Finding the Number of Visible Mountains
|
finding-the-number-of-visible-mountains
|
['Array', 'Stack', 'Sorting', 'Monotonic Stack']
| false | false |
33.807068 |
Medium
| 2,346 | false | true |
Compute the Rank as a Percentage
|
compute-the-rank-as-a-percentage
|
['Database']
| false | false |
61.064087 |
Easy
| 2,347 | false | false |
Best Poker Hand
|
best-poker-hand
|
['Array', 'Hash Table', 'Counting']
| false | false |
66.665249 |
Medium
| 2,348 | false | false |
Number of Zero-Filled Subarrays
|
number-of-zero-filled-subarrays
|
['Array', 'Math']
| true | false |
58.102051 |
Medium
| 2,349 | false | false |
Design a Number Container System
|
design-a-number-container-system
|
['Hash Table', 'Design', 'Heap (Priority Queue)', 'Ordered Set']
| true | false |
68.506791 |
Hard
| 2,350 | false | false |
Shortest Impossible Sequence of Rolls
|
shortest-impossible-sequence-of-rolls
|
['Array', 'Hash Table', 'Greedy']
| false | false |
74.013762 |
Easy
| 2,351 | false | false |
First Letter to Appear Twice
|
first-letter-to-appear-twice
|
['Hash Table', 'String', 'Bit Manipulation', 'Counting']
| false | false |
70.38539 |
Medium
| 2,352 | false | false |
Equal Row and Column Pairs
|
equal-row-and-column-pairs
|
['Array', 'Hash Table', 'Matrix', 'Simulation']
| true | false |
45.245559 |
Medium
| 2,353 | false | false |
Design a Food Rating System
|
design-a-food-rating-system
|
['Array', 'Hash Table', 'String', 'Design', 'Heap (Priority Queue)', 'Ordered Set']
| true | false |
47.810156 |
Hard
| 2,354 | false | false |
Number of Excellent Pairs
|
number-of-excellent-pairs
|
['Array', 'Hash Table', 'Binary Search', 'Bit Manipulation']
| false | false |
39.250578 |
Hard
| 2,355 | false | true |
Maximum Number of Books You Can Take
|
maximum-number-of-books-you-can-take
|
['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack']
| true | false |
89.307598 |
Easy
| 2,356 | false | false |
Number of Unique Subjects Taught by Each Teacher
|
number-of-unique-subjects-taught-by-each-teacher
|
['Database']
| true | false |
73.182651 |
Easy
| 2,357 | false | false |
Make Array Zero by Subtracting Equal Amounts
|
make-array-zero-by-subtracting-equal-amounts
|
['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Simulation']
| false | false |
68.015027 |
Medium
| 2,358 | false | false |
Maximum Number of Groups Entering a Competition
|
maximum-number-of-groups-entering-a-competition
|
['Array', 'Math', 'Binary Search', 'Greedy']
| false | false |
45.690634 |
Medium
| 2,359 | false | false |
Find Closest Node to Given Two Nodes
|
find-closest-node-to-given-two-nodes
|
['Depth-First Search', 'Graph']
| true | false |
49.78399 |
Hard
| 2,360 | false | false |
Longest Cycle in a Graph
|
longest-cycle-in-a-graph
|
['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']
| true | false |
77.538822 |
Hard
| 2,361 | false | true |
Minimum Costs Using the Train Line
|
minimum-costs-using-the-train-line
|
['Array', 'Dynamic Programming']
| true | false |
76.145418 |
Hard
| 2,362 | false | true |
Generate the Invoice
|
generate-the-invoice
|
['Database']
| false | false |
76.588825 |
Easy
| 2,363 | false | false |
Merge Similar Items
|
merge-similar-items
|
['Array', 'Hash Table', 'Sorting', 'Ordered Set']
| false | false |
54.474414 |
Medium
| 2,364 | false | false |
Count Number of Bad Pairs
|
count-number-of-bad-pairs
|
['Array', 'Hash Table', 'Math', 'Counting']
| true | false |
53.800044 |
Medium
| 2,365 | false | false |
Task Scheduler II
|
task-scheduler-ii
|
['Array', 'Hash Table', 'Simulation']
| false | false |
53.265713 |
Hard
| 2,366 | false | false |
Minimum Replacements to Sort the Array
|
minimum-replacements-to-sort-the-array
|
['Array', 'Math', 'Greedy']
| true | false |
84.808883 |
Easy
| 2,367 | false | false |
Number of Arithmetic Triplets
|
number-of-arithmetic-triplets
|
['Array', 'Hash Table', 'Two Pointers', 'Enumeration']
| false | false |
59.270452 |
Medium
| 2,368 | false | false |
Reachable Nodes With Restrictions
|
reachable-nodes-with-restrictions
|
['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']
| true | false |
51.869758 |
Medium
| 2,369 | false | false |
Check if There is a Valid Partition For The Array
|
check-if-there-is-a-valid-partition-for-the-array
|
['Array', 'Dynamic Programming']
| true | false |
46.895198 |
Medium
| 2,370 | false | false |
Longest Ideal Subsequence
|
longest-ideal-subsequence
|
['Hash Table', 'String', 'Dynamic Programming']
| true | false |
70.674885 |
Hard
| 2,371 | false | true |
Minimize Maximum Value in a Grid
|
minimize-maximum-value-in-a-grid
|
['Array', 'Union Find', 'Graph', 'Topological Sort', 'Sorting', 'Matrix']
| true | false |
83.563691 |
Medium
| 2,372 | false | true |
Calculate the Influence of Each Salesperson
|
calculate-the-influence-of-each-salesperson
|
['Database']
| false | false |
87.765664 |
Easy
| 2,373 | false | false |
Largest Local Values in a Matrix
|
largest-local-values-in-a-matrix
|
['Array', 'Matrix']
| true | false |
48.223438 |
Medium
| 2,374 | false | false |
Node With Highest Edge Score
|
node-with-highest-edge-score
|
['Hash Table', 'Graph']
| false | false |
85.849099 |
Medium
| 2,375 | false | false |
Construct Smallest Number From DI String
|
construct-smallest-number-from-di-string
|
['String', 'Backtracking', 'Stack', 'Greedy']
| true | false |
39.330025 |
Hard
| 2,376 | false | false |
Count Special Integers
|
count-special-integers
|
['Math', 'Dynamic Programming']
| false | false |
79.448595 |
Easy
| 2,377 | false | true |
Sort the Olympic Table
|
sort-the-olympic-table
|
['Database']
| false | false |
56.121815 |
Medium
| 2,378 | false | true |
Choose Edges to Maximize Score in a Tree
|
choose-edges-to-maximize-score-in-a-tree
|
['Dynamic Programming', 'Tree', 'Depth-First Search']
| false | false |
68.476649 |
Easy
| 2,379 | false | false |
Minimum Recolors to Get K Consecutive Black Blocks
|
minimum-recolors-to-get-k-consecutive-black-blocks
|
['String', 'Sliding Window']
| true | false |
51.389212 |
Medium
| 2,380 | false | false |
Time Needed to Rearrange a Binary String
|
time-needed-to-rearrange-a-binary-string
|
['String', 'Dynamic Programming', 'Simulation']
| false | false |
53.239045 |
Medium
| 2,381 | false | false |
Shifting Letters II
|
shifting-letters-ii
|
['Array', 'String', 'Prefix Sum']
| true | false |
48.120198 |
Hard
| 2,382 | false | false |
Maximum Segment Sum After Removals
|
maximum-segment-sum-after-removals
|
['Array', 'Union Find', 'Prefix Sum', 'Ordered Set']
| false | false |
41.708845 |
Easy
| 2,383 | false | false |
Minimum Hours of Training to Win a Competition
|
minimum-hours-of-training-to-win-a-competition
|
['Array', 'Greedy']
| false | false |
36.278562 |
Medium
| 2,384 | false | false |
Largest Palindromic Number
|
largest-palindromic-number
|
['Hash Table', 'String', 'Greedy', 'Counting']
| false | false |
63.271349 |
Medium
| 2,385 | false | false |
Amount of Time for Binary Tree to Be Infected
|
amount-of-time-for-binary-tree-to-be-infected
|
['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
39.419659 |
Hard
| 2,386 | false | false |
Find the K-Sum of an Array
|
find-the-k-sum-of-an-array
|
['Array', 'Sorting', 'Heap (Priority Queue)']
| false | false |
69.345149 |
Medium
| 2,387 | false | true |
Median of a Row Wise Sorted Matrix
|
median-of-a-row-wise-sorted-matrix
|
['Array', 'Binary Search', 'Matrix']
| false | false |
51.360104 |
Medium
| 2,388 | false | true |
Change Null Values in a Table to the Previous Value
|
change-null-values-in-a-table-to-the-previous-value
|
['Database']
| false | false |
72.625437 |
Easy
| 2,389 | false | false |
Longest Subsequence With Limited Sum
|
longest-subsequence-with-limited-sum
|
['Array', 'Binary Search', 'Greedy', 'Sorting', 'Prefix Sum']
| true | false |
77.612841 |
Medium
| 2,390 | false | false |
Removing Stars From a String
|
removing-stars-from-a-string
|
['String', 'Stack', 'Simulation']
| true | false |
85.097014 |
Medium
| 2,391 | false | false |
Minimum Amount of Time to Collect Garbage
|
minimum-amount-of-time-to-collect-garbage
|
['Array', 'String', 'Prefix Sum']
| true | false |
79.238723 |
Hard
| 2,392 | false | false |
Build a Matrix With Conditions
|
build-a-matrix-with-conditions
|
['Array', 'Graph', 'Topological Sort', 'Matrix']
| true | false |
71.182219 |
Medium
| 2,393 | false | true |
Count Strictly Increasing Subarrays
|
count-strictly-increasing-subarrays
|
['Array', 'Math', 'Dynamic Programming']
| true | false |
41.907017 |
Medium
| 2,394 | false | true |
Employees With Deductions
|
employees-with-deductions
|
['Database']
| false | false |
66.04078 |
Easy
| 2,395 | false | false |
Find Subarrays With Equal Sum
|
find-subarrays-with-equal-sum
|
['Array', 'Hash Table']
| false | false |
88.029169 |
Medium
| 2,396 | false | false |
Strictly Palindromic Number
|
strictly-palindromic-number
|
['Math', 'Two Pointers', 'Brainteaser']
| false | false |
56.197523 |
Medium
| 2,397 | false | false |
Maximum Rows Covered by Columns
|
maximum-rows-covered-by-columns
|
['Array', 'Backtracking', 'Bit Manipulation', 'Matrix', 'Enumeration']
| false | false |
36.289812 |
Hard
| 2,398 | false | false |
Maximum Number of Robots Within Budget
|
maximum-number-of-robots-within-budget
|
['Array', 'Binary Search', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Prefix Sum', 'Monotonic Queue']
| false | false |
70.682827 |
Easy
| 2,399 | false | false |
Check Distances Between Same Letters
|
check-distances-between-same-letters
|
['Array', 'Hash Table', 'String']
| false | false |
35.924806 |
Medium
| 2,400 | false | false |
Number of Ways to Reach a Position After Exactly k Steps
|
number-of-ways-to-reach-a-position-after-exactly-k-steps
|
['Math', 'Dynamic Programming', 'Combinatorics']
| false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.