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 |
---|---|---|---|---|---|---|---|---|---|
73.059249 |
Medium
| 1,701 | false | false |
Average Waiting Time
|
average-waiting-time
|
['Array', 'Simulation']
| true | false |
46.816596 |
Medium
| 1,702 | false | false |
Maximum Binary String After Change
|
maximum-binary-string-after-change
|
['String', 'Greedy']
| false | false |
42.069902 |
Hard
| 1,703 | false | false |
Minimum Adjacent Swaps for K Consecutive Ones
|
minimum-adjacent-swaps-for-k-consecutive-ones
|
['Array', 'Greedy', 'Sliding Window', 'Prefix Sum']
| false | false |
78.629043 |
Easy
| 1,704 | false | false |
Determine if String Halves Are Alike
|
determine-if-string-halves-are-alike
|
['String', 'Counting']
| true | false |
40.279502 |
Medium
| 1,705 | false | false |
Maximum Number of Eaten Apples
|
maximum-number-of-eaten-apples
|
['Array', 'Greedy', 'Heap (Priority Queue)']
| true | false |
71.970635 |
Medium
| 1,706 | false | false |
Where Will the Ball Fall
|
where-will-the-ball-fall
|
['Array', 'Matrix', 'Simulation']
| true | false |
54.036662 |
Hard
| 1,707 | false | false |
Maximum XOR With an Element From Array
|
maximum-xor-with-an-element-from-array
|
['Array', 'Bit Manipulation', 'Trie']
| false | false |
65.14255 |
Easy
| 1,708 | false | true |
Largest Subarray Length K
|
largest-subarray-length-k
|
['Array', 'Greedy']
| false | false |
70.321991 |
Medium
| 1,709 | false | true |
Biggest Window Between Visits
|
biggest-window-between-visits
|
['Database']
| true | false |
74.119635 |
Easy
| 1,710 | false | false |
Maximum Units on a Truck
|
maximum-units-on-a-truck
|
['Array', 'Greedy', 'Sorting']
| true | false |
31.361084 |
Medium
| 1,711 | false | false |
Count Good Meals
|
count-good-meals
|
['Array', 'Hash Table']
| false | false |
33.313282 |
Medium
| 1,712 | false | false |
Ways to Split Array Into Three Subarrays
|
ways-to-split-array-into-three-subarrays
|
['Array', 'Two Pointers', 'Binary Search', 'Prefix Sum']
| false | false |
48.28592 |
Hard
| 1,713 | false | false |
Minimum Operations to Make a Subsequence
|
minimum-operations-to-make-a-subsequence
|
['Array', 'Hash Table', 'Binary Search', 'Greedy']
| false | false |
49.106303 |
Hard
| 1,714 | false | true |
Sum Of Special Evenly-Spaced Elements In Array
|
sum-of-special-evenly-spaced-elements-in-array
|
['Array', 'Dynamic Programming']
| false | false |
75.907302 |
Medium
| 1,715 | false | true |
Count Apples and Oranges
|
count-apples-and-oranges
|
['Database']
| false | false |
78.414868 |
Easy
| 1,716 | false | false |
Calculate Money in Leetcode Bank
|
calculate-money-in-leetcode-bank
|
['Math']
| true | false |
62.799056 |
Medium
| 1,717 | false | false |
Maximum Score From Removing Substrings
|
maximum-score-from-removing-substrings
|
['String', 'Stack', 'Greedy']
| true | false |
73.215794 |
Medium
| 1,718 | false | false |
Construct the Lexicographically Largest Valid Sequence
|
construct-the-lexicographically-largest-valid-sequence
|
['Array', 'Backtracking']
| true | false |
44.067797 |
Hard
| 1,719 | false | false |
Number Of Ways To Reconstruct A Tree
|
number-of-ways-to-reconstruct-a-tree
|
['Tree', 'Graph']
| false | false |
86.845518 |
Easy
| 1,720 | false | false |
Decode XORed Array
|
decode-xored-array
|
['Array', 'Bit Manipulation']
| false | false |
68.321577 |
Medium
| 1,721 | false | false |
Swapping Nodes in a Linked List
|
swapping-nodes-in-a-linked-list
|
['Linked List', 'Two Pointers']
| true | false |
47.940289 |
Medium
| 1,722 | false | false |
Minimize Hamming Distance After Swap Operations
|
minimize-hamming-distance-after-swap-operations
|
['Array', 'Depth-First Search', 'Union Find']
| false | false |
43.069011 |
Hard
| 1,723 | false | false |
Find Minimum Time to Finish All Jobs
|
find-minimum-time-to-finish-all-jobs
|
['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']
| false | false |
51.318488 |
Hard
| 1,724 | false | true |
Checking Existence of Edge Length Limited Paths II
|
checking-existence-of-edge-length-limited-paths-ii
|
['Union Find', 'Graph', 'Minimum Spanning Tree']
| false | false |
78.933665 |
Easy
| 1,725 | false | false |
Number Of Rectangles That Can Form The Largest Square
|
number-of-rectangles-that-can-form-the-largest-square
|
['Array']
| false | false |
70.206807 |
Medium
| 1,726 | false | false |
Tuple with Same Product
|
tuple-with-same-product
|
['Array', 'Hash Table', 'Counting']
| true | false |
75.167101 |
Medium
| 1,727 | false | false |
Largest Submatrix With Rearrangements
|
largest-submatrix-with-rearrangements
|
['Array', 'Greedy', 'Sorting', 'Matrix']
| true | false |
39.483001 |
Hard
| 1,728 | false | false |
Cat and Mouse II
|
cat-and-mouse-ii
|
['Array', 'Math', 'Dynamic Programming', 'Graph', 'Topological Sort', 'Memoization', 'Matrix', 'Game Theory']
| false | false |
69.495484 |
Easy
| 1,729 | false | false |
Find Followers Count
|
find-followers-count
|
['Database']
| true | false |
56.526743 |
Medium
| 1,730 | false | true |
Shortest Path to Get Food
|
shortest-path-to-get-food
|
['Array', 'Breadth-First Search', 'Matrix']
| true | false |
51.762192 |
Easy
| 1,731 | false | false |
The Number of Employees Which Report to Each Employee
|
the-number-of-employees-which-report-to-each-employee
|
['Database']
| true | false |
83.785139 |
Easy
| 1,732 | false | false |
Find the Highest Altitude
|
find-the-highest-altitude
|
['Array', 'Prefix Sum']
| true | false |
43.331101 |
Medium
| 1,733 | false | false |
Minimum Number of People to Teach
|
minimum-number-of-people-to-teach
|
['Array', 'Hash Table', 'Greedy']
| false | false |
65.563744 |
Medium
| 1,734 | false | false |
Decode XORed Permutation
|
decode-xored-permutation
|
['Array', 'Bit Manipulation']
| false | false |
52.407892 |
Hard
| 1,735 | false | false |
Count Ways to Make Array With Product
|
count-ways-to-make-array-with-product
|
['Array', 'Math', 'Dynamic Programming', 'Combinatorics', 'Number Theory']
| false | false |
42.962644 |
Easy
| 1,736 | false | false |
Latest Time by Replacing Hidden Digits
|
latest-time-by-replacing-hidden-digits
|
['String', 'Greedy']
| false | false |
36.970469 |
Medium
| 1,737 | false | false |
Change Minimum Characters to Satisfy One of Three Conditions
|
change-minimum-characters-to-satisfy-one-of-three-conditions
|
['Hash Table', 'String', 'Counting', 'Prefix Sum']
| false | false |
62.55145 |
Medium
| 1,738 | false | false |
Find Kth Largest XOR Coordinate Value
|
find-kth-largest-xor-coordinate-value
|
['Array', 'Divide and Conquer', 'Bit Manipulation', 'Sorting', 'Heap (Priority Queue)', 'Matrix', 'Prefix Sum', 'Quickselect']
| false | false |
51.692606 |
Hard
| 1,739 | false | false |
Building Boxes
|
building-boxes
|
['Math', 'Binary Search', 'Greedy']
| false | false |
73.91314 |
Medium
| 1,740 | false | true |
Find Distance in a Binary Tree
|
find-distance-in-a-binary-tree
|
['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
86.864908 |
Easy
| 1,741 | false | false |
Find Total Time Spent by Each Employee
|
find-total-time-spent-by-each-employee
|
['Database']
| true | false |
74.11246 |
Easy
| 1,742 | false | false |
Maximum Number of Balls in a Box
|
maximum-number-of-balls-in-a-box
|
['Hash Table', 'Math', 'Counting']
| false | false |
74.695579 |
Medium
| 1,743 | false | false |
Restore the Array From Adjacent Pairs
|
restore-the-array-from-adjacent-pairs
|
['Array', 'Hash Table', 'Depth-First Search']
| true | false |
34.418926 |
Medium
| 1,744 | false | false |
Can You Eat Your Favorite Candy on Your Favorite Day?
|
can-you-eat-your-favorite-candy-on-your-favorite-day
|
['Array', 'Prefix Sum']
| false | false |
44.6353 |
Hard
| 1,745 | false | false |
Palindrome Partitioning IV
|
palindrome-partitioning-iv
|
['String', 'Dynamic Programming']
| false | false |
65.179678 |
Medium
| 1,746 | false | true |
Maximum Subarray Sum After One Operation
|
maximum-subarray-sum-after-one-operation
|
['Array', 'Dynamic Programming']
| true | false |
62.400337 |
Medium
| 1,747 | false | true |
Leetflex Banned Accounts
|
leetflex-banned-accounts
|
['Database']
| true | false |
78.859623 |
Easy
| 1,748 | false | false |
Sum of Unique Elements
|
sum-of-unique-elements
|
['Array', 'Hash Table', 'Counting']
| false | false |
71.509268 |
Medium
| 1,749 | false | false |
Maximum Absolute Sum of Any Subarray
|
maximum-absolute-sum-of-any-subarray
|
['Array', 'Dynamic Programming']
| true | false |
55.873426 |
Medium
| 1,750 | false | false |
Minimum Length of String After Deleting Similar Ends
|
minimum-length-of-string-after-deleting-similar-ends
|
['Two Pointers', 'String']
| true | false |
60.893084 |
Hard
| 1,751 | false | false |
Maximum Number of Events That Can Be Attended II
|
maximum-number-of-events-that-can-be-attended-ii
|
['Array', 'Binary Search', 'Dynamic Programming', 'Sorting']
| true | false |
54.961652 |
Easy
| 1,752 | false | false |
Check if Array Is Sorted and Rotated
|
check-if-array-is-sorted-and-rotated
|
['Array']
| true | false |
67.625136 |
Medium
| 1,753 | false | false |
Maximum Score From Removing Stones
|
maximum-score-from-removing-stones
|
['Math', 'Greedy', 'Heap (Priority Queue)']
| false | false |
50.594612 |
Medium
| 1,754 | false | false |
Largest Merge Of Two Strings
|
largest-merge-of-two-strings
|
['Two Pointers', 'String', 'Greedy']
| false | false |
41.2383 |
Hard
| 1,755 | false | false |
Closest Subsequence Sum
|
closest-subsequence-sum
|
['Array', 'Two Pointers', 'Dynamic Programming', 'Bit Manipulation', 'Sorting', 'Bitmask']
| false | false |
77.68147 |
Medium
| 1,756 | false | true |
Design Most Recently Used Queue
|
design-most-recently-used-queue
|
['Array', 'Hash Table', 'Stack', 'Design', 'Binary Indexed Tree', 'Ordered Set']
| true | false |
89.342763 |
Easy
| 1,757 | false | false |
Recyclable and Low Fat Products
|
recyclable-and-low-fat-products
|
['Database']
| true | false |
63.69106 |
Easy
| 1,758 | false | false |
Minimum Changes To Make Alternating Binary String
|
minimum-changes-to-make-alternating-binary-string
|
['String']
| true | false |
57.452853 |
Medium
| 1,759 | false | false |
Count Number of Homogenous Substrings
|
count-number-of-homogenous-substrings
|
['Math', 'String']
| true | false |
67.60799 |
Medium
| 1,760 | false | false |
Minimum Limit of Balls in a Bag
|
minimum-limit-of-balls-in-a-bag
|
['Array', 'Binary Search']
| true | false |
43.112975 |
Hard
| 1,761 | false | false |
Minimum Degree of a Connected Trio in a Graph
|
minimum-degree-of-a-connected-trio-in-a-graph
|
['Graph']
| false | false |
80.627384 |
Medium
| 1,762 | false | true |
Buildings With an Ocean View
|
buildings-with-an-ocean-view
|
['Array', 'Stack', 'Monotonic Stack']
| true | false |
61.968541 |
Easy
| 1,763 | false | false |
Longest Nice Substring
|
longest-nice-substring
|
['Hash Table', 'String', 'Divide and Conquer', 'Bit Manipulation', 'Sliding Window']
| false | false |
53.618881 |
Medium
| 1,764 | false | false |
Form Array by Concatenating Subarrays of Another Array
|
form-array-by-concatenating-subarrays-of-another-array
|
['Array', 'Two Pointers', 'Greedy', 'String Matching']
| false | false |
75.023771 |
Medium
| 1,765 | false | false |
Map of Highest Peak
|
map-of-highest-peak
|
['Array', 'Breadth-First Search', 'Matrix']
| true | false |
41.820369 |
Hard
| 1,766 | false | false |
Tree of Coprimes
|
tree-of-coprimes
|
['Array', 'Math', 'Tree', 'Depth-First Search', 'Number Theory']
| false | false |
78.062867 |
Hard
| 1,767 | false | true |
Find the Subtasks That Did Not Execute
|
find-the-subtasks-that-did-not-execute
|
['Database']
| false | false |
82.049055 |
Easy
| 1,768 | false | false |
Merge Strings Alternately
|
merge-strings-alternately
|
['Two Pointers', 'String']
| true | true |
90.117611 |
Medium
| 1,769 | false | false |
Minimum Number of Operations to Move All Balls to Each Box
|
minimum-number-of-operations-to-move-all-balls-to-each-box
|
['Array', 'String', 'Prefix Sum']
| true | false |
41.934275 |
Hard
| 1,770 | false | false |
Maximum Score from Performing Multiplication Operations
|
maximum-score-from-performing-multiplication-operations
|
['Array', 'Dynamic Programming']
| true | false |
37.033393 |
Hard
| 1,771 | false | false |
Maximize Palindrome Length From Subsequences
|
maximize-palindrome-length-from-subsequences
|
['String', 'Dynamic Programming']
| false | false |
65.737705 |
Medium
| 1,772 | false | true |
Sort Features by Popularity
|
sort-features-by-popularity
|
['Array', 'Hash Table', 'String', 'Sorting']
| false | false |
84.870209 |
Easy
| 1,773 | false | false |
Count Items Matching a Rule
|
count-items-matching-a-rule
|
['Array', 'String']
| false | false |
47.623001 |
Medium
| 1,774 | false | false |
Closest Dessert Cost
|
closest-dessert-cost
|
['Array', 'Dynamic Programming', 'Backtracking']
| false | false |
53.826297 |
Medium
| 1,775 | false | false |
Equal Sum Arrays With Minimum Number of Operations
|
equal-sum-arrays-with-minimum-number-of-operations
|
['Array', 'Hash Table', 'Greedy', 'Counting']
| false | false |
56.096762 |
Hard
| 1,776 | false | false |
Car Fleet II
|
car-fleet-ii
|
['Array', 'Math', 'Stack', 'Heap (Priority Queue)', 'Monotonic Stack']
| false | false |
82.477998 |
Easy
| 1,777 | false | true |
Product's Price for Each Store
|
products-price-for-each-store
|
['Database']
| true | false |
44.021676 |
Medium
| 1,778 | false | true |
Shortest Path in a Hidden Grid
|
shortest-path-in-a-hidden-grid
|
['Depth-First Search', 'Breadth-First Search', 'Graph', 'Interactive']
| false | false |
69.223261 |
Easy
| 1,779 | false | false |
Find Nearest Point That Has the Same X or Y Coordinate
|
find-nearest-point-that-has-the-same-x-or-y-coordinate
|
['Array']
| false | false |
79.262168 |
Medium
| 1,780 | false | false |
Check if Number is a Sum of Powers of Three
|
check-if-number-is-a-sum-of-powers-of-three
|
['Math']
| true | false |
69.941886 |
Medium
| 1,781 | false | false |
Sum of Beauty of All Substrings
|
sum-of-beauty-of-all-substrings
|
['Hash Table', 'String', 'Counting']
| false | false |
40.507217 |
Hard
| 1,782 | false | false |
Count Pairs Of Nodes
|
count-pairs-of-nodes
|
['Array', 'Two Pointers', 'Binary Search', 'Graph', 'Sorting']
| false | false |
83.174437 |
Medium
| 1,783 | false | true |
Grand Slam Titles
|
grand-slam-titles
|
['Database']
| false | false |
39.011097 |
Easy
| 1,784 | false | false |
Check if Binary String Has at Most One Segment of Ones
|
check-if-binary-string-has-at-most-one-segment-of-ones
|
['String']
| false | false |
44.156691 |
Medium
| 1,785 | false | false |
Minimum Elements to Add to Form a Given Sum
|
minimum-elements-to-add-to-form-a-given-sum
|
['Array', 'Greedy']
| false | false |
39.754559 |
Medium
| 1,786 | false | false |
Number of Restricted Paths From First to Last Node
|
number-of-restricted-paths-from-first-to-last-node
|
['Dynamic Programming', 'Graph', 'Topological Sort', 'Heap (Priority Queue)', 'Shortest Path']
| false | false |
39.725576 |
Hard
| 1,787 | false | false |
Make the XOR of All Segments Equal to Zero
|
make-the-xor-of-all-segments-equal-to-zero
|
['Array', 'Dynamic Programming', 'Bit Manipulation']
| false | false |
63.620387 |
Hard
| 1,788 | false | true |
Maximize the Beauty of the Garden
|
maximize-the-beauty-of-the-garden
|
['Array', 'Hash Table', 'Greedy', 'Prefix Sum']
| false | false |
70.749221 |
Easy
| 1,789 | false | false |
Primary Department for Each Employee
|
primary-department-for-each-employee
|
['Database']
| true | false |
49.441601 |
Easy
| 1,790 | false | false |
Check if One String Swap Can Make Strings Equal
|
check-if-one-string-swap-can-make-strings-equal
|
['Hash Table', 'String', 'Counting']
| true | false |
86.600618 |
Easy
| 1,791 | false | false |
Find Center of Star Graph
|
find-center-of-star-graph
|
['Graph']
| true | false |
71.560601 |
Medium
| 1,792 | false | false |
Maximum Average Pass Ratio
|
maximum-average-pass-ratio
|
['Array', 'Greedy', 'Heap (Priority Queue)']
| true | false |
64.219777 |
Hard
| 1,793 | false | false |
Maximum Score of a Good Subarray
|
maximum-score-of-a-good-subarray
|
['Array', 'Two Pointers', 'Binary Search', 'Stack', 'Monotonic Stack']
| true | false |
63.62603 |
Medium
| 1,794 | false | true |
Count Pairs of Equal Substrings With Minimum Difference
|
count-pairs-of-equal-substrings-with-minimum-difference
|
['Hash Table', 'String', 'Greedy']
| false | false |
85.565318 |
Easy
| 1,795 | false | false |
Rearrange Products Table
|
rearrange-products-table
|
['Database']
| true | false |
51.632209 |
Easy
| 1,796 | false | false |
Second Largest Digit in a String
|
second-largest-digit-in-a-string
|
['Hash Table', 'String']
| false | false |
58.011099 |
Medium
| 1,797 | false | false |
Design Authentication Manager
|
design-authentication-manager
|
['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']
| false | false |
61.629905 |
Medium
| 1,798 | false | false |
Maximum Number of Consecutive Values You Can Make
|
maximum-number-of-consecutive-values-you-can-make
|
['Array', 'Greedy', 'Sorting']
| false | false |
57.797288 |
Hard
| 1,799 | false | false |
Maximize Score After N Operations
|
maximize-score-after-n-operations
|
['Array', 'Math', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Number Theory', 'Bitmask']
| true | false |
66.55052 |
Easy
| 1,800 | false | false |
Maximum Ascending Subarray Sum
|
maximum-ascending-subarray-sum
|
['Array']
| true | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.