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 |
---|---|---|---|---|---|---|---|---|---|
48.619262 |
Medium
| 1,401 | false | false |
Circle and Rectangle Overlapping
|
circle-and-rectangle-overlapping
|
['Math', 'Geometry']
| false | false |
76.273328 |
Hard
| 1,402 | false | false |
Reducing Dishes
|
reducing-dishes
|
['Array', 'Dynamic Programming', 'Greedy', 'Sorting']
| true | false |
72.800115 |
Easy
| 1,403 | false | false |
Minimum Subsequence in Non-Increasing Order
|
minimum-subsequence-in-non-increasing-order
|
['Array', 'Greedy', 'Sorting']
| false | false |
61.390111 |
Medium
| 1,404 | false | false |
Number of Steps to Reduce a Number in Binary Representation to One
|
number-of-steps-to-reduce-a-number-in-binary-representation-to-one
|
['String', 'Bit Manipulation']
| true | false |
65.466169 |
Medium
| 1,405 | false | false |
Longest Happy String
|
longest-happy-string
|
['String', 'Greedy', 'Heap (Priority Queue)']
| true | false |
63.215464 |
Hard
| 1,406 | false | false |
Stone Game III
|
stone-game-iii
|
['Array', 'Math', 'Dynamic Programming', 'Game Theory']
| true | false |
57.140339 |
Easy
| 1,407 | false | false |
Top Travellers
|
top-travellers
|
['Database']
| true | false |
69.847868 |
Easy
| 1,408 | false | false |
String Matching in an Array
|
string-matching-in-an-array
|
['Array', 'String', 'String Matching']
| true | false |
84.461196 |
Medium
| 1,409 | false | false |
Queries on a Permutation With Key
|
queries-on-a-permutation-with-key
|
['Array', 'Binary Indexed Tree', 'Simulation']
| false | false |
50.232062 |
Medium
| 1,410 | false | false |
HTML Entity Parser
|
html-entity-parser
|
['Hash Table', 'String']
| false | false |
64.182783 |
Hard
| 1,411 | false | false |
Number of Ways to Paint N × 3 Grid
|
number-of-ways-to-paint-n-3-grid
|
['Dynamic Programming']
| false | false |
58.560456 |
Hard
| 1,412 | false | true |
Find the Quiet Students in All Exams
|
find-the-quiet-students-in-all-exams
|
['Database']
| false | false |
64.836115 |
Easy
| 1,413 | false | false |
Minimum Value to Get Positive Step by Step Sum
|
minimum-value-to-get-positive-step-by-step-sum
|
['Array', 'Prefix Sum']
| true | false |
64.232648 |
Medium
| 1,414 | false | false |
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K
|
find-the-minimum-number-of-fibonacci-numbers-whose-sum-is-k
|
['Math', 'Greedy']
| false | false |
85.082685 |
Medium
| 1,415 | false | false |
The k-th Lexicographical String of All Happy Strings of Length n
|
the-k-th-lexicographical-string-of-all-happy-strings-of-length-n
|
['String', 'Backtracking']
| true | false |
46.993161 |
Hard
| 1,416 | false | false |
Restore The Array
|
restore-the-array
|
['String', 'Dynamic Programming']
| true | false |
52.017297 |
Easy
| 1,417 | false | false |
Reformat The String
|
reformat-the-string
|
['String']
| false | false |
75.513356 |
Medium
| 1,418 | false | false |
Display Table of Food Orders in a Restaurant
|
display-table-of-food-orders-in-a-restaurant
|
['Array', 'Hash Table', 'String', 'Sorting', 'Ordered Set']
| false | false |
50.666631 |
Medium
| 1,419 | false | false |
Minimum Number of Frogs Croaking
|
minimum-number-of-frogs-croaking
|
['String', 'Counting']
| false | false |
66.988287 |
Hard
| 1,420 | false | false |
Build Array Where You Can Find The Maximum Exactly K Comparisons
|
build-array-where-you-can-find-the-maximum-exactly-k-comparisons
|
['Dynamic Programming', 'Prefix Sum']
| true | false |
82.980775 |
Easy
| 1,421 | false | true |
NPV Queries
|
npv-queries
|
['Database']
| true | false |
65.161585 |
Easy
| 1,422 | false | false |
Maximum Score After Splitting a String
|
maximum-score-after-splitting-a-string
|
['String', 'Prefix Sum']
| true | false |
55.099015 |
Medium
| 1,423 | false | false |
Maximum Points You Can Obtain from Cards
|
maximum-points-you-can-obtain-from-cards
|
['Array', 'Sliding Window', 'Prefix Sum']
| true | false |
57.81909 |
Medium
| 1,424 | false | false |
Diagonal Traverse II
|
diagonal-traverse-ii
|
['Array', 'Sorting', 'Heap (Priority Queue)']
| true | false |
56.401872 |
Hard
| 1,425 | false | false |
Constrained Subsequence Sum
|
constrained-subsequence-sum
|
['Array', 'Dynamic Programming', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue']
| true | false |
60.403096 |
Easy
| 1,426 | false | true |
Counting Elements
|
counting-elements
|
['Array', 'Hash Table']
| true | false |
55.795026 |
Easy
| 1,427 | false | true |
Perform String Shifts
|
perform-string-shifts
|
['Array', 'Math', 'String']
| true | false |
54.887634 |
Medium
| 1,428 | false | true |
Leftmost Column with at Least a One
|
leftmost-column-with-at-least-a-one
|
['Array', 'Binary Search', 'Matrix', 'Interactive']
| true | false |
55.149975 |
Medium
| 1,429 | false | true |
First Unique Number
|
first-unique-number
|
['Array', 'Hash Table', 'Design', 'Queue', 'Data Stream']
| true | false |
47.229946 |
Medium
| 1,430 | false | true |
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
|
check-if-a-string-is-a-valid-sequence-from-root-to-leaves-path-in-a-binary-tree
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| false | false |
88.057287 |
Easy
| 1,431 | false | false |
Kids With the Greatest Number of Candies
|
kids-with-the-greatest-number-of-candies
|
['Array']
| true | false |
40.250015 |
Medium
| 1,432 | false | false |
Max Difference You Can Get From Changing an Integer
|
max-difference-you-can-get-from-changing-an-integer
|
['Math', 'Greedy']
| false | false |
70.120225 |
Medium
| 1,433 | false | false |
Check If a String Can Break Another String
|
check-if-a-string-can-break-another-string
|
['String', 'Greedy', 'Sorting']
| false | false |
44.172076 |
Hard
| 1,434 | false | false |
Number of Ways to Wear Different Hats to Each Other
|
number-of-ways-to-wear-different-hats-to-each-other
|
['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']
| true | false |
75.003728 |
Easy
| 1,435 | false | true |
Create a Session Bar Chart
|
create-a-session-bar-chart
|
['Database']
| false | false |
79.428151 |
Easy
| 1,436 | false | false |
Destination City
|
destination-city
|
['Array', 'Hash Table', 'String']
| true | false |
58.015737 |
Easy
| 1,437 | false | false |
Check If All 1's Are at Least Length K Places Away
|
check-if-all-1s-are-at-least-length-k-places-away
|
['Array']
| true | false |
56.617459 |
Medium
| 1,438 | false | false |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
|
longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit
|
['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue']
| true | false |
61.874473 |
Hard
| 1,439 | false | false |
Find the Kth Smallest Sum of a Matrix With Sorted Rows
|
find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows
|
['Array', 'Binary Search', 'Heap (Priority Queue)', 'Matrix']
| false | false |
72.280753 |
Medium
| 1,440 | false | true |
Evaluate Boolean Expression
|
evaluate-boolean-expression
|
['Database']
| false | false |
80.10155 |
Medium
| 1,441 | false | false |
Build an Array With Stack Operations
|
build-an-array-with-stack-operations
|
['Array', 'Stack', 'Simulation']
| true | false |
84.796196 |
Medium
| 1,442 | false | false |
Count Triplets That Can Form Two Arrays of Equal XOR
|
count-triplets-that-can-form-two-arrays-of-equal-xor
|
['Array', 'Hash Table', 'Math', 'Bit Manipulation', 'Prefix Sum']
| true | false |
62.812209 |
Medium
| 1,443 | false | false |
Minimum Time to Collect All Apples in a Tree
|
minimum-time-to-collect-all-apples-in-a-tree
|
['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']
| true | false |
61.650589 |
Hard
| 1,444 | false | false |
Number of Ways of Cutting a Pizza
|
number-of-ways-of-cutting-a-pizza
|
['Array', 'Dynamic Programming', 'Memoization', 'Matrix', 'Prefix Sum']
| true | false |
86.067692 |
Medium
| 1,445 | false | true |
Apples & Oranges
|
apples-oranges
|
['Database']
| true | false |
60.071807 |
Easy
| 1,446 | false | false |
Consecutive Characters
|
consecutive-characters
|
['String']
| true | false |
68.00653 |
Medium
| 1,447 | false | false |
Simplified Fractions
|
simplified-fractions
|
['Math', 'String', 'Number Theory']
| false | false |
73.360372 |
Medium
| 1,448 | false | false |
Count Good Nodes in Binary Tree
|
count-good-nodes-in-binary-tree
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | true |
48.503064 |
Hard
| 1,449 | false | false |
Form Largest Integer With Digits That Add up to Target
|
form-largest-integer-with-digits-that-add-up-to-target
|
['Array', 'Dynamic Programming']
| false | false |
75.636861 |
Easy
| 1,450 | false | false |
Number of Students Doing Homework at a Given Time
|
number-of-students-doing-homework-at-a-given-time
|
['Array']
| false | false |
65.605023 |
Medium
| 1,451 | false | false |
Rearrange Words in a Sentence
|
rearrange-words-in-a-sentence
|
['String', 'Sorting']
| false | false |
58.981865 |
Medium
| 1,452 | false | false |
People Whose List of Favorite Companies Is Not a Subset of Another List
|
people-whose-list-of-favorite-companies-is-not-a-subset-of-another-list
|
['Array', 'Hash Table', 'String']
| false | false |
37.725812 |
Hard
| 1,453 | false | false |
Maximum Number of Darts Inside of a Circular Dartboard
|
maximum-number-of-darts-inside-of-a-circular-dartboard
|
['Array', 'Math', 'Geometry']
| false | false |
36.634016 |
Medium
| 1,454 | false | true |
Active Users
|
active-users
|
['Database']
| false | false |
68.756621 |
Easy
| 1,455 | false | false |
Check If a Word Occurs As a Prefix of Any Word in a Sentence
|
check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence
|
['Two Pointers', 'String', 'String Matching']
| true | false |
60.032415 |
Medium
| 1,456 | false | false |
Maximum Number of Vowels in a Substring of Given Length
|
maximum-number-of-vowels-in-a-substring-of-given-length
|
['String', 'Sliding Window']
| true | false |
68.313224 |
Medium
| 1,457 | false | false |
Pseudo-Palindromic Paths in a Binary Tree
|
pseudo-palindromic-paths-in-a-binary-tree
|
['Bit Manipulation', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
62.311431 |
Hard
| 1,458 | false | false |
Max Dot Product of Two Subsequences
|
max-dot-product-of-two-subsequences
|
['Array', 'Dynamic Programming']
| true | false |
68.655733 |
Medium
| 1,459 | false | true |
Rectangles Area
|
rectangles-area
|
['Database']
| false | false |
75.80978 |
Easy
| 1,460 | false | false |
Make Two Arrays Equal by Reversing Subarrays
|
make-two-arrays-equal-by-reversing-subarrays
|
['Array', 'Hash Table', 'Sorting']
| true | false |
56.569357 |
Medium
| 1,461 | false | false |
Check If a String Contains All Binary Codes of Size K
|
check-if-a-string-contains-all-binary-codes-of-size-k
|
['Hash Table', 'String', 'Bit Manipulation', 'Rolling Hash', 'Hash Function']
| true | false |
59.550477 |
Medium
| 1,462 | false | false |
Course Schedule IV
|
course-schedule-iv
|
['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']
| true | false |
71.852635 |
Hard
| 1,463 | false | false |
Cherry Pickup II
|
cherry-pickup-ii
|
['Array', 'Dynamic Programming', 'Matrix']
| true | false |
83.125364 |
Easy
| 1,464 | false | false |
Maximum Product of Two Elements in an Array
|
maximum-product-of-two-elements-in-an-array
|
['Array', 'Sorting', 'Heap (Priority Queue)']
| true | false |
41.18014 |
Medium
| 1,465 | false | false |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
|
maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts
|
['Array', 'Greedy', 'Sorting']
| true | false |
64.79446 |
Medium
| 1,466 | false | false |
Reorder Routes to Make All Paths Lead to the City Zero
|
reorder-routes-to-make-all-paths-lead-to-the-city-zero
|
['Depth-First Search', 'Breadth-First Search', 'Graph']
| true | false |
59.922673 |
Hard
| 1,467 | false | false |
Probability of a Two Boxes Having The Same Number of Distinct Balls
|
probability-of-a-two-boxes-having-the-same-number-of-distinct-balls
|
['Array', 'Math', 'Dynamic Programming', 'Backtracking', 'Combinatorics', 'Probability and Statistics']
| false | false |
78.152306 |
Medium
| 1,468 | false | true |
Calculate Salaries
|
calculate-salaries
|
['Database']
| false | false |
83.964773 |
Easy
| 1,469 | false | true |
Find All The Lonely Nodes
|
find-all-the-lonely-nodes
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
88.799387 |
Easy
| 1,470 | false | false |
Shuffle the Array
|
shuffle-the-array
|
['Array']
| true | false |
61.729825 |
Medium
| 1,471 | false | false |
The k Strongest Values in an Array
|
the-k-strongest-values-in-an-array
|
['Array', 'Two Pointers', 'Sorting']
| false | false |
77.992247 |
Medium
| 1,472 | false | false |
Design Browser History
|
design-browser-history
|
['Array', 'Linked List', 'Stack', 'Design', 'Doubly-Linked List', 'Data Stream']
| true | false |
60.974253 |
Hard
| 1,473 | false | false |
Paint House III
|
paint-house-iii
|
['Array', 'Dynamic Programming']
| true | false |
73.489219 |
Easy
| 1,474 | false | true |
Delete N Nodes After M Nodes of a Linked List
|
delete-n-nodes-after-m-nodes-of-a-linked-list
|
['Linked List']
| true | false |
83.191933 |
Easy
| 1,475 | false | false |
Final Prices With a Special Discount in a Shop
|
final-prices-with-a-special-discount-in-a-shop
|
['Array', 'Stack', 'Monotonic Stack']
| true | false |
88.313785 |
Medium
| 1,476 | false | false |
Subrectangle Queries
|
subrectangle-queries
|
['Array', 'Design', 'Matrix']
| false | false |
36.440413 |
Medium
| 1,477 | false | false |
Find Two Non-overlapping Sub-arrays Each With Target Sum
|
find-two-non-overlapping-sub-arrays-each-with-target-sum
|
['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sliding Window']
| false | false |
55.688032 |
Hard
| 1,478 | false | false |
Allocate Mailboxes
|
allocate-mailboxes
|
['Array', 'Math', 'Dynamic Programming', 'Sorting']
| false | false |
77.326545 |
Hard
| 1,479 | false | true |
Sales by Day of the Week
|
sales-by-day-of-the-week
|
['Database']
| true | false |
86.957094 |
Easy
| 1,480 | false | false |
Running Sum of 1d Array
|
running-sum-of-1d-array
|
['Array', 'Prefix Sum']
| true | true |
63.315193 |
Medium
| 1,481 | false | false |
Least Number of Unique Integers after K Removals
|
least-number-of-unique-integers-after-k-removals
|
['Array', 'Hash Table', 'Greedy', 'Sorting', 'Counting']
| true | false |
55.316031 |
Medium
| 1,482 | false | false |
Minimum Number of Days to Make m Bouquets
|
minimum-number-of-days-to-make-m-bouquets
|
['Array', 'Binary Search']
| true | false |
35.4597 |
Hard
| 1,483 | false | false |
Kth Ancestor of a Tree Node
|
kth-ancestor-of-a-tree-node
|
['Binary Search', 'Dynamic Programming', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design']
| false | false |
77.610922 |
Easy
| 1,484 | false | false |
Group Sold Products By The Date
|
group-sold-products-by-the-date
|
['Database']
| true | false |
80.827135 |
Medium
| 1,485 | false | true |
Clone Binary Tree With Random Pointer
|
clone-binary-tree-with-random-pointer
|
['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
86.69244 |
Easy
| 1,486 | false | false |
XOR Operation in an Array
|
xor-operation-in-an-array
|
['Math', 'Bit Manipulation']
| false | false |
37.727804 |
Medium
| 1,487 | false | false |
Making File Names Unique
|
making-file-names-unique
|
['Array', 'Hash Table', 'String']
| false | false |
27.251067 |
Medium
| 1,488 | false | false |
Avoid Flood in The City
|
avoid-flood-in-the-city
|
['Array', 'Hash Table', 'Binary Search', 'Greedy', 'Heap (Priority Queue)']
| false | false |
66.486422 |
Hard
| 1,489 | false | false |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree
|
find-critical-and-pseudo-critical-edges-in-minimum-spanning-tree
|
['Union Find', 'Graph', 'Sorting', 'Minimum Spanning Tree', 'Strongly Connected Component']
| true | false |
83.167905 |
Medium
| 1,490 | false | true |
Clone N-ary Tree
|
clone-n-ary-tree
|
['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search']
| true | false |
63.442072 |
Easy
| 1,491 | false | false |
Average Salary Excluding the Minimum and Maximum Salary
|
average-salary-excluding-the-minimum-and-maximum-salary
|
['Array', 'Sorting']
| true | false |
69.396742 |
Medium
| 1,492 | false | false |
The kth Factor of n
|
the-kth-factor-of-n
|
['Math', 'Number Theory']
| false | false |
68.932777 |
Medium
| 1,493 | false | false |
Longest Subarray of 1's After Deleting One Element
|
longest-subarray-of-1s-after-deleting-one-element
|
['Array', 'Dynamic Programming', 'Sliding Window']
| true | false |
29.46725 |
Hard
| 1,494 | false | false |
Parallel Courses II
|
parallel-courses-ii
|
['Dynamic Programming', 'Bit Manipulation', 'Graph', 'Bitmask']
| false | false |
48.96633 |
Easy
| 1,495 | false | true |
Friendly Movies Streamed Last Month
|
friendly-movies-streamed-last-month
|
['Database']
| true | false |
62.519439 |
Easy
| 1,496 | false | false |
Path Crossing
|
path-crossing
|
['Hash Table', 'String']
| true | false |
46.202739 |
Medium
| 1,497 | false | false |
Check If Array Pairs Are Divisible by k
|
check-if-array-pairs-are-divisible-by-k
|
['Array', 'Hash Table', 'Counting']
| true | false |
43.788617 |
Medium
| 1,498 | false | false |
Number of Subsequences That Satisfy the Given Sum Condition
|
number-of-subsequences-that-satisfy-the-given-sum-condition
|
['Array', 'Two Pointers', 'Binary Search', 'Sorting']
| true | false |
44.431635 |
Hard
| 1,499 | false | false |
Max Value of Equation
|
max-value-of-equation
|
['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Monotonic Queue']
| false | false |
41.66867 |
Medium
| 1,500 | false | true |
Design a File Sharing System
|
design-a-file-sharing-system
|
['Hash Table', 'Design', 'Sorting', 'Heap (Priority Queue)', 'Data Stream']
| false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.