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 |
---|---|---|---|---|---|---|---|---|---|
50.434548 |
Medium
| 1,501 | false | true |
Countries You Can Safely Invest In
|
countries-you-can-safely-invest-in
|
['Database']
| false | false |
69.414928 |
Easy
| 1,502 | false | false |
Can Make Arithmetic Progression From Sequence
|
can-make-arithmetic-progression-from-sequence
|
['Array', 'Sorting']
| true | false |
68.197335 |
Medium
| 1,503 | false | false |
Last Moment Before All Ants Fall Out of a Plank
|
last-moment-before-all-ants-fall-out-of-a-plank
|
['Array', 'Brainteaser', 'Simulation']
| true | false |
57.173354 |
Medium
| 1,504 | false | false |
Count Submatrices With All Ones
|
count-submatrices-with-all-ones
|
['Array', 'Dynamic Programming', 'Stack', 'Matrix', 'Monotonic Stack']
| false | false |
39.779274 |
Hard
| 1,505 | false | false |
Minimum Possible Integer After at Most K Adjacent Swaps On Digits
|
minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits
|
['String', 'Greedy', 'Binary Indexed Tree', 'Segment Tree']
| false | false |
78.395356 |
Medium
| 1,506 | false | true |
Find Root of N-Ary Tree
|
find-root-of-n-ary-tree
|
['Hash Table', 'Bit Manipulation', 'Tree', 'Depth-First Search']
| true | false |
67.185102 |
Easy
| 1,507 | false | false |
Reformat Date
|
reformat-date
|
['String']
| false | false |
63.122583 |
Medium
| 1,508 | false | false |
Range Sum of Sorted Subarray Sums
|
range-sum-of-sorted-subarray-sums
|
['Array', 'Two Pointers', 'Binary Search', 'Sorting', 'Prefix Sum']
| true | false |
59.174585 |
Medium
| 1,509 | false | false |
Minimum Difference Between Largest and Smallest Value in Three Moves
|
minimum-difference-between-largest-and-smallest-value-in-three-moves
|
['Array', 'Greedy', 'Sorting']
| true | false |
59.454472 |
Hard
| 1,510 | false | false |
Stone Game IV
|
stone-game-iv
|
['Math', 'Dynamic Programming', 'Game Theory']
| true | false |
66.983479 |
Easy
| 1,511 | false | true |
Customer Order Frequency
|
customer-order-frequency
|
['Database']
| true | false |
89.520649 |
Easy
| 1,512 | false | false |
Number of Good Pairs
|
number-of-good-pairs
|
['Array', 'Hash Table', 'Math', 'Counting']
| true | false |
47.609334 |
Medium
| 1,513 | false | false |
Number of Substrings With Only 1s
|
number-of-substrings-with-only-1s
|
['Math', 'String']
| false | false |
65.290728 |
Medium
| 1,514 | false | false |
Path with Maximum Probability
|
path-with-maximum-probability
|
['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path']
| true | false |
34.752739 |
Hard
| 1,515 | false | false |
Best Position for a Service Centre
|
best-position-for-a-service-centre
|
['Array', 'Math', 'Geometry', 'Randomized']
| false | false |
60.107949 |
Hard
| 1,516 | false | true |
Move Sub-Tree of N-Ary Tree
|
move-sub-tree-of-n-ary-tree
|
['Tree', 'Depth-First Search']
| false | false |
44.245487 |
Easy
| 1,517 | false | false |
Find Users With Valid E-Mails
|
find-users-with-valid-e-mails
|
['Database']
| true | false |
70.81117 |
Easy
| 1,518 | false | false |
Water Bottles
|
water-bottles
|
['Math', 'Simulation']
| true | false |
54.980291 |
Medium
| 1,519 | false | false |
Number of Nodes in the Sub-Tree With the Same Label
|
number-of-nodes-in-the-sub-tree-with-the-same-label
|
['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Counting']
| true | false |
39.554744 |
Hard
| 1,520 | false | false |
Maximum Number of Non-Overlapping Substrings
|
maximum-number-of-non-overlapping-substrings
|
['String', 'Greedy']
| false | false |
45.536889 |
Hard
| 1,521 | false | false |
Find a Value of a Mysterious Function Closest to Target
|
find-a-value-of-a-mysterious-function-closest-to-target
|
['Array', 'Binary Search', 'Bit Manipulation', 'Segment Tree']
| false | false |
74.921346 |
Medium
| 1,522 | false | true |
Diameter of N-Ary Tree
|
diameter-of-n-ary-tree
|
['Tree', 'Depth-First Search']
| true | false |
50.302352 |
Easy
| 1,523 | false | false |
Count Odd Numbers in an Interval Range
|
count-odd-numbers-in-an-interval-range
|
['Math']
| true | false |
56.082351 |
Medium
| 1,524 | false | false |
Number of Sub-arrays With Odd Sum
|
number-of-sub-arrays-with-odd-sum
|
['Array', 'Math', 'Dynamic Programming', 'Prefix Sum']
| true | false |
68.293868 |
Medium
| 1,525 | false | false |
Number of Good Ways to Split a String
|
number-of-good-ways-to-split-a-string
|
['Hash Table', 'String', 'Dynamic Programming', 'Bit Manipulation']
| false | false |
72.031672 |
Hard
| 1,526 | false | false |
Minimum Number of Increments on Subarrays to Form a Target Array
|
minimum-number-of-increments-on-subarrays-to-form-a-target-array
|
['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack']
| false | false |
39.371342 |
Easy
| 1,527 | false | false |
Patients With a Condition
|
patients-with-a-condition
|
['Database']
| true | false |
85.057051 |
Easy
| 1,528 | false | false |
Shuffle String
|
shuffle-string
|
['Array', 'String']
| false | false |
73.39334 |
Medium
| 1,529 | false | false |
Minimum Suffix Flips
|
minimum-suffix-flips
|
['String', 'Greedy']
| false | false |
71.775306 |
Medium
| 1,530 | false | false |
Number of Good Leaf Nodes Pairs
|
number-of-good-leaf-nodes-pairs
|
['Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
52.005602 |
Hard
| 1,531 | false | false |
String Compression II
|
string-compression-ii
|
['String', 'Dynamic Programming']
| true | false |
68.926531 |
Medium
| 1,532 | false | true |
The Most Recent Three Orders
|
the-most-recent-three-orders
|
['Database']
| false | false |
56.216936 |
Medium
| 1,533 | false | true |
Find the Index of the Large Integer
|
find-the-index-of-the-large-integer
|
['Array', 'Binary Search', 'Interactive']
| true | false |
81.815698 |
Easy
| 1,534 | false | false |
Count Good Triplets
|
count-good-triplets
|
['Array', 'Enumeration']
| true | false |
56.74698 |
Medium
| 1,535 | false | false |
Find the Winner of an Array Game
|
find-the-winner-of-an-array-game
|
['Array', 'Simulation']
| true | false |
47.704176 |
Medium
| 1,536 | false | false |
Minimum Swaps to Arrange a Binary Grid
|
minimum-swaps-to-arrange-a-binary-grid
|
['Array', 'Greedy', 'Matrix']
| false | false |
39.833854 |
Hard
| 1,537 | false | false |
Get the Maximum Score
|
get-the-maximum-score
|
['Array', 'Two Pointers', 'Dynamic Programming', 'Greedy']
| false | false |
69.452619 |
Medium
| 1,538 | false | true |
Guess the Majority in a Hidden Array
|
guess-the-majority-in-a-hidden-array
|
['Array', 'Math', 'Interactive']
| true | false |
61.963421 |
Easy
| 1,539 | false | false |
Kth Missing Positive Number
|
kth-missing-positive-number
|
['Array', 'Binary Search']
| true | false |
35.750048 |
Medium
| 1,540 | false | false |
Can Convert String in K Moves
|
can-convert-string-in-k-moves
|
['Hash Table', 'String']
| false | false |
53.046338 |
Medium
| 1,541 | false | false |
Minimum Insertions to Balance a Parentheses String
|
minimum-insertions-to-balance-a-parentheses-string
|
['String', 'Stack', 'Greedy']
| false | false |
44.935294 |
Hard
| 1,542 | false | false |
Find Longest Awesome Substring
|
find-longest-awesome-substring
|
['Hash Table', 'String', 'Bit Manipulation']
| false | false |
58.977758 |
Easy
| 1,543 | false | true |
Fix Product Name Format
|
fix-product-name-format
|
['Database']
| false | false |
68.208917 |
Easy
| 1,544 | false | false |
Make The String Great
|
make-the-string-great
|
['String', 'Stack']
| true | false |
70.186762 |
Medium
| 1,545 | false | false |
Find Kth Bit in Nth Binary String
|
find-kth-bit-in-nth-binary-string
|
['String', 'Recursion', 'Simulation']
| true | false |
47.831026 |
Medium
| 1,546 | false | false |
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target
|
maximum-number-of-non-overlapping-subarrays-with-sum-equals-target
|
['Array', 'Hash Table', 'Greedy', 'Prefix Sum']
| false | false |
61.794007 |
Hard
| 1,547 | false | false |
Minimum Cost to Cut a Stick
|
minimum-cost-to-cut-a-stick
|
['Array', 'Dynamic Programming', 'Sorting']
| true | false |
59.277141 |
Hard
| 1,548 | false | true |
The Most Similar Path in a Graph
|
the-most-similar-path-in-a-graph
|
['Dynamic Programming', 'Graph']
| true | false |
64.819934 |
Medium
| 1,549 | false | true |
The Most Recent Orders for Each Product
|
the-most-recent-orders-for-each-product
|
['Database']
| true | false |
68.044493 |
Easy
| 1,550 | false | false |
Three Consecutive Odds
|
three-consecutive-odds
|
['Array']
| true | false |
82.205485 |
Medium
| 1,551 | false | false |
Minimum Operations to Make Array Equal
|
minimum-operations-to-make-array-equal
|
['Math']
| true | false |
71.16646 |
Medium
| 1,552 | false | false |
Magnetic Force Between Two Balls
|
magnetic-force-between-two-balls
|
['Array', 'Binary Search', 'Sorting']
| true | false |
35.561047 |
Hard
| 1,553 | false | false |
Minimum Number of Days to Eat N Oranges
|
minimum-number-of-days-to-eat-n-oranges
|
['Dynamic Programming', 'Memoization']
| false | false |
41.195438 |
Medium
| 1,554 | false | true |
Strings Differ by One Character
|
strings-differ-by-one-character
|
['Hash Table', 'String', 'Rolling Hash', 'Hash Function']
| false | false |
51.850626 |
Medium
| 1,555 | false | true |
Bank Account Summary
|
bank-account-summary
|
['Database']
| false | false |
53.509697 |
Easy
| 1,556 | false | false |
Thousand Separator
|
thousand-separator
|
['String']
| false | false |
81.064638 |
Medium
| 1,557 | false | false |
Minimum Number of Vertices to Reach All Nodes
|
minimum-number-of-vertices-to-reach-all-nodes
|
['Graph']
| true | false |
62.474971 |
Medium
| 1,558 | false | false |
Minimum Numbers of Function Calls to Make Target Array
|
minimum-numbers-of-function-calls-to-make-target-array
|
['Array', 'Greedy', 'Bit Manipulation']
| false | false |
49.786647 |
Medium
| 1,559 | false | false |
Detect Cycles in 2D Grid
|
detect-cycles-in-2d-grid
|
['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']
| false | false |
58.954205 |
Easy
| 1,560 | false | false |
Most Visited Sector in a Circular Track
|
most-visited-sector-in-a-circular-track
|
['Array', 'Simulation']
| false | false |
84.405479 |
Medium
| 1,561 | false | false |
Maximum Number of Coins You Can Get
|
maximum-number-of-coins-you-can-get
|
['Array', 'Math', 'Greedy', 'Sorting', 'Game Theory']
| true | false |
42.870356 |
Medium
| 1,562 | false | false |
Find Latest Group of Size M
|
find-latest-group-of-size-m
|
['Array', 'Hash Table', 'Binary Search', 'Simulation']
| false | false |
41.011036 |
Hard
| 1,563 | false | false |
Stone Game V
|
stone-game-v
|
['Array', 'Math', 'Dynamic Programming', 'Game Theory']
| false | false |
67.125118 |
Medium
| 1,564 | false | true |
Put Boxes Into the Warehouse I
|
put-boxes-into-the-warehouse-i
|
['Array', 'Greedy', 'Sorting']
| true | false |
82.166826 |
Easy
| 1,565 | false | true |
Unique Orders and Customers Per Month
|
unique-orders-and-customers-per-month
|
['Database']
| false | false |
43.403146 |
Easy
| 1,566 | false | false |
Detect Pattern of Length M Repeated K or More Times
|
detect-pattern-of-length-m-repeated-k-or-more-times
|
['Array', 'Enumeration']
| false | false |
44.335836 |
Medium
| 1,567 | false | false |
Maximum Length of Subarray With Positive Product
|
maximum-length-of-subarray-with-positive-product
|
['Array', 'Dynamic Programming', 'Greedy']
| false | false |
59.166531 |
Hard
| 1,568 | false | false |
Minimum Number of Days to Disconnect Island
|
minimum-number-of-days-to-disconnect-island
|
['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix', 'Strongly Connected Component']
| true | false |
53.483809 |
Hard
| 1,569 | false | false |
Number of Ways to Reorder Array to Get Same BST
|
number-of-ways-to-reorder-array-to-get-same-bst
|
['Array', 'Math', 'Divide and Conquer', 'Dynamic Programming', 'Tree', 'Union Find', 'Binary Search Tree', 'Memoization', 'Combinatorics', 'Binary Tree']
| true | false |
89.927407 |
Medium
| 1,570 | false | true |
Dot Product of Two Sparse Vectors
|
dot-product-of-two-sparse-vectors
|
['Array', 'Hash Table', 'Two Pointers', 'Design']
| true | false |
87.48091 |
Easy
| 1,571 | false | true |
Warehouse Manager
|
warehouse-manager
|
['Database']
| true | false |
83.591563 |
Easy
| 1,572 | false | false |
Matrix Diagonal Sum
|
matrix-diagonal-sum
|
['Array', 'Matrix']
| true | false |
33.718518 |
Medium
| 1,573 | false | false |
Number of Ways to Split a String
|
number-of-ways-to-split-a-string
|
['Math', 'String']
| false | false |
51.530492 |
Medium
| 1,574 | false | false |
Shortest Subarray to be Removed to Make Array Sorted
|
shortest-subarray-to-be-removed-to-make-array-sorted
|
['Array', 'Two Pointers', 'Binary Search', 'Stack', 'Monotonic Stack']
| true | false |
64.949138 |
Hard
| 1,575 | false | false |
Count All Possible Routes
|
count-all-possible-routes
|
['Array', 'Dynamic Programming', 'Memoization']
| true | false |
45.210301 |
Easy
| 1,576 | false | false |
Replace All ?'s to Avoid Consecutive Repeating Characters
|
replace-all-s-to-avoid-consecutive-repeating-characters
|
['String']
| false | false |
41.78098 |
Medium
| 1,577 | false | false |
Number of Ways Where Square of Number Is Equal to Product of Two Numbers
|
number-of-ways-where-square-of-number-is-equal-to-product-of-two-numbers
|
['Array', 'Hash Table', 'Math', 'Two Pointers']
| false | false |
63.470436 |
Medium
| 1,578 | false | false |
Minimum Time to Make Rope Colorful
|
minimum-time-to-make-rope-colorful
|
['Array', 'String', 'Dynamic Programming', 'Greedy']
| true | false |
70.468673 |
Hard
| 1,579 | false | false |
Remove Max Number of Edges to Keep Graph Fully Traversable
|
remove-max-number-of-edges-to-keep-graph-fully-traversable
|
['Union Find', 'Graph']
| true | false |
65.502623 |
Medium
| 1,580 | false | true |
Put Boxes Into the Warehouse II
|
put-boxes-into-the-warehouse-ii
|
['Array', 'Greedy', 'Sorting']
| true | false |
67.45726 |
Easy
| 1,581 | false | false |
Customer Who Visited but Did Not Make Any Transactions
|
customer-who-visited-but-did-not-make-any-transactions
|
['Database']
| true | false |
68.664204 |
Easy
| 1,582 | false | false |
Special Positions in a Binary Matrix
|
special-positions-in-a-binary-matrix
|
['Array', 'Matrix']
| true | false |
61.88973 |
Medium
| 1,583 | false | false |
Count Unhappy Friends
|
count-unhappy-friends
|
['Array', 'Simulation']
| false | false |
68.556023 |
Medium
| 1,584 | false | false |
Min Cost to Connect All Points
|
min-cost-to-connect-all-points
|
['Array', 'Union Find', 'Graph', 'Minimum Spanning Tree']
| true | false |
48.11055 |
Hard
| 1,585 | false | false |
Check If String Is Transformable With Substring Sort Operations
|
check-if-string-is-transformable-with-substring-sort-operations
|
['String', 'Greedy', 'Sorting']
| false | false |
63.142622 |
Medium
| 1,586 | false | true |
Binary Search Tree Iterator II
|
binary-search-tree-iterator-ii
|
['Stack', 'Tree', 'Design', 'Binary Search Tree', 'Binary Tree', 'Iterator']
| true | false |
83.343882 |
Easy
| 1,587 | false | false |
Bank Account Summary II
|
bank-account-summary-ii
|
['Database']
| true | false |
83.439768 |
Easy
| 1,588 | false | false |
Sum of All Odd Length Subarrays
|
sum-of-all-odd-length-subarrays
|
['Array', 'Math', 'Prefix Sum']
| true | false |
38.940528 |
Medium
| 1,589 | false | false |
Maximum Sum Obtained of Any Permutation
|
maximum-sum-obtained-of-any-permutation
|
['Array', 'Greedy', 'Sorting', 'Prefix Sum']
| false | false |
39.499507 |
Medium
| 1,590 | false | false |
Make Sum Divisible by P
|
make-sum-divisible-by-p
|
['Array', 'Hash Table', 'Prefix Sum']
| true | false |
59.545955 |
Hard
| 1,591 | false | false |
Strange Printer II
|
strange-printer-ii
|
['Array', 'Graph', 'Topological Sort', 'Matrix']
| false | false |
43.894216 |
Easy
| 1,592 | false | false |
Rearrange Spaces Between Words
|
rearrange-spaces-between-words
|
['String']
| false | false |
68.290792 |
Medium
| 1,593 | false | false |
Split a String Into the Max Number of Unique Substrings
|
split-a-string-into-the-max-number-of-unique-substrings
|
['Hash Table', 'String', 'Backtracking']
| true | false |
34.432202 |
Medium
| 1,594 | false | false |
Maximum Non Negative Product in a Matrix
|
maximum-non-negative-product-in-a-matrix
|
['Array', 'Dynamic Programming', 'Matrix']
| false | false |
48.085322 |
Hard
| 1,595 | false | false |
Minimum Cost to Connect Two Groups of Points
|
minimum-cost-to-connect-two-groups-of-points
|
['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix', 'Bitmask']
| false | false |
77.958666 |
Medium
| 1,596 | false | true |
The Most Frequently Ordered Products for Each Customer
|
the-most-frequently-ordered-products-for-each-customer
|
['Database']
| false | false |
62.413593 |
Hard
| 1,597 | false | true |
Build Binary Expression Tree From Infix Expression
|
build-binary-expression-tree-from-infix-expression
|
['String', 'Stack', 'Tree', 'Binary Tree']
| false | false |
71.60783 |
Easy
| 1,598 | false | false |
Crawler Log Folder
|
crawler-log-folder
|
['Array', 'String', 'Stack']
| true | false |
43.795781 |
Medium
| 1,599 | false | false |
Maximum Profit of Operating a Centennial Wheel
|
maximum-profit-of-operating-a-centennial-wheel
|
['Array', 'Simulation']
| false | false |
66.610042 |
Medium
| 1,600 | false | false |
Throne Inheritance
|
throne-inheritance
|
['Hash Table', 'Tree', 'Depth-First Search', 'Design']
| false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.