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 |
---|---|---|---|---|---|---|---|---|---|
56.168283 |
Medium
| 2,201 | false | false |
Count Artifacts That Can Be Extracted
|
count-artifacts-that-can-be-extracted
|
['Array', 'Hash Table', 'Simulation']
| false | false |
23.325519 |
Medium
| 2,202 | false | false |
Maximize the Topmost Element After K Moves
|
maximize-the-topmost-element-after-k-moves
|
['Array', 'Greedy']
| false | false |
37.859523 |
Hard
| 2,203 | false | false |
Minimum Weighted Subgraph With the Required Paths
|
minimum-weighted-subgraph-with-the-required-paths
|
['Graph', 'Shortest Path']
| false | false |
72.733839 |
Hard
| 2,204 | false | true |
Distance to a Cycle in Undirected Graph
|
distance-to-a-cycle-in-undirected-graph
|
['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']
| true | false |
50.756314 |
Easy
| 2,205 | false | true |
The Number of Users That Are Eligible for Discount
|
the-number-of-users-that-are-eligible-for-discount
|
['Database']
| false | false |
79.244356 |
Easy
| 2,206 | false | false |
Divide Array Into Equal Pairs
|
divide-array-into-equal-pairs
|
['Array', 'Hash Table', 'Bit Manipulation', 'Counting']
| true | false |
34.98733 |
Medium
| 2,207 | false | false |
Maximize Number of Subsequences in a String
|
maximize-number-of-subsequences-in-a-string
|
['String', 'Greedy', 'Prefix Sum']
| false | false |
48.673749 |
Medium
| 2,208 | false | false |
Minimum Operations to Halve Array Sum
|
minimum-operations-to-halve-array-sum
|
['Array', 'Greedy', 'Heap (Priority Queue)']
| false | false |
36.730416 |
Hard
| 2,209 | false | false |
Minimum White Tiles After Covering With Carpets
|
minimum-white-tiles-after-covering-with-carpets
|
['String', 'Dynamic Programming', 'Prefix Sum']
| false | false |
61.462238 |
Easy
| 2,210 | false | false |
Count Hills and Valleys in an Array
|
count-hills-and-valleys-in-an-array
|
['Array']
| false | false |
44.149093 |
Medium
| 2,211 | false | false |
Count Collisions on a Road
|
count-collisions-on-a-road
|
['String', 'Stack', 'Simulation']
| false | false |
50.080962 |
Medium
| 2,212 | false | false |
Maximum Points in an Archery Competition
|
maximum-points-in-an-archery-competition
|
['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration']
| false | false |
32.760765 |
Hard
| 2,213 | false | false |
Longest Substring of One Repeating Character
|
longest-substring-of-one-repeating-character
|
['Array', 'String', 'Segment Tree', 'Ordered Set']
| false | false |
58.543982 |
Medium
| 2,214 | false | true |
Minimum Health to Beat Game
|
minimum-health-to-beat-game
|
['Array', 'Greedy']
| true | false |
80.581812 |
Easy
| 2,215 | false | false |
Find the Difference of Two Arrays
|
find-the-difference-of-two-arrays
|
['Array', 'Hash Table']
| true | false |
48.643484 |
Medium
| 2,216 | false | false |
Minimum Deletions to Make Array Beautiful
|
minimum-deletions-to-make-array-beautiful
|
['Array', 'Stack', 'Greedy']
| false | false |
37.302301 |
Medium
| 2,217 | false | false |
Find Palindrome With Fixed Length
|
find-palindrome-with-fixed-length
|
['Array', 'Math']
| false | false |
60.389004 |
Hard
| 2,218 | false | false |
Maximum Value of K Coins From Piles
|
maximum-value-of-k-coins-from-piles
|
['Array', 'Dynamic Programming', 'Prefix Sum']
| true | false |
61.985885 |
Medium
| 2,219 | false | true |
Maximum Sum Score of Array
|
maximum-sum-score-of-array
|
['Array', 'Prefix Sum']
| false | false |
87.474441 |
Easy
| 2,220 | false | false |
Minimum Bit Flips to Convert Number
|
minimum-bit-flips-to-convert-number
|
['Bit Manipulation']
| true | false |
78.739624 |
Medium
| 2,221 | false | false |
Find Triangular Sum of an Array
|
find-triangular-sum-of-an-array
|
['Array', 'Math', 'Simulation', 'Combinatorics']
| false | false |
50.403525 |
Medium
| 2,222 | false | false |
Number of Ways to Select Buildings
|
number-of-ways-to-select-buildings
|
['String', 'Dynamic Programming', 'Prefix Sum']
| false | false |
41.688882 |
Hard
| 2,223 | false | false |
Sum of Scores of Built Strings
|
sum-of-scores-of-built-strings
|
['String', 'Binary Search', 'Rolling Hash', 'Suffix Array', 'String Matching', 'Hash Function']
| false | false |
65.374917 |
Easy
| 2,224 | false | false |
Minimum Number of Operations to Convert Time
|
minimum-number-of-operations-to-convert-time
|
['String', 'Greedy']
| false | false |
72.670036 |
Medium
| 2,225 | false | false |
Find Players With Zero or One Losses
|
find-players-with-zero-or-one-losses
|
['Array', 'Hash Table', 'Sorting', 'Counting']
| true | false |
50.194706 |
Medium
| 2,226 | false | false |
Maximum Candies Allocated to K Children
|
maximum-candies-allocated-to-k-children
|
['Array', 'Binary Search']
| true | false |
41.324492 |
Hard
| 2,227 | false | false |
Encrypt and Decrypt Strings
|
encrypt-and-decrypt-strings
|
['Array', 'Hash Table', 'String', 'Design', 'Trie']
| false | false |
45.86415 |
Medium
| 2,228 | false | true |
Users With Two Purchases Within Seven Days
|
users-with-two-purchases-within-seven-days
|
['Database']
| false | false |
61.687341 |
Easy
| 2,229 | false | true |
Check if an Array Is Consecutive
|
check-if-an-array-is-consecutive
|
['Array', 'Hash Table', 'Sorting']
| false | false |
50.705002 |
Easy
| 2,230 | false | true |
The Users That Are Eligible for Discount
|
the-users-that-are-eligible-for-discount
|
['Database']
| false | false |
63.365702 |
Easy
| 2,231 | false | false |
Largest Number After Digit Swaps by Parity
|
largest-number-after-digit-swaps-by-parity
|
['Sorting', 'Heap (Priority Queue)']
| false | false |
67.340321 |
Medium
| 2,232 | false | false |
Minimize Result by Adding Parentheses to Expression
|
minimize-result-by-adding-parentheses-to-expression
|
['String', 'Enumeration']
| false | false |
42.11555 |
Medium
| 2,233 | false | false |
Maximum Product After K Increments
|
maximum-product-after-k-increments
|
['Array', 'Greedy', 'Heap (Priority Queue)']
| false | false |
29.887907 |
Hard
| 2,234 | false | false |
Maximum Total Beauty of the Gardens
|
maximum-total-beauty-of-the-gardens
|
['Array', 'Two Pointers', 'Binary Search', 'Greedy', 'Sorting', 'Enumeration', 'Prefix Sum']
| false | false |
88.124654 |
Easy
| 2,235 | false | false |
Add Two Integers
|
add-two-integers
|
['Math']
| false | false |
84.872446 |
Easy
| 2,236 | false | false |
Root Equals Sum of Children
|
root-equals-sum-of-children
|
['Tree', 'Binary Tree']
| false | false |
61.920971 |
Medium
| 2,237 | false | true |
Count Positions on Street With Required Brightness
|
count-positions-on-street-with-required-brightness
|
['Array', 'Prefix Sum']
| false | false |
71.971229 |
Medium
| 2,238 | false | true |
Number of Times a Driver Was a Passenger
|
number-of-times-a-driver-was-a-passenger
|
['Database']
| false | false |
46.971628 |
Easy
| 2,239 | false | false |
Find Closest Number to Zero
|
find-closest-number-to-zero
|
['Array']
| false | false |
55.731179 |
Medium
| 2,240 | false | false |
Number of Ways to Buy Pens and Pencils
|
number-of-ways-to-buy-pens-and-pencils
|
['Math', 'Enumeration']
| false | false |
44.02317 |
Medium
| 2,241 | false | false |
Design an ATM Machine
|
design-an-atm-machine
|
['Array', 'Greedy', 'Design']
| false | false |
38.764014 |
Hard
| 2,242 | false | false |
Maximum Score of a Node Sequence
|
maximum-score-of-a-node-sequence
|
['Array', 'Graph', 'Sorting', 'Enumeration']
| false | false |
66.374403 |
Easy
| 2,243 | false | false |
Calculate Digit Sum of a String
|
calculate-digit-sum-of-a-string
|
['String', 'Simulation']
| false | false |
62.903283 |
Medium
| 2,244 | false | false |
Minimum Rounds to Complete All Tasks
|
minimum-rounds-to-complete-all-tasks
|
['Array', 'Hash Table', 'Greedy', 'Counting']
| true | false |
36.463951 |
Medium
| 2,245 | false | false |
Maximum Trailing Zeros in a Cornered Path
|
maximum-trailing-zeros-in-a-cornered-path
|
['Array', 'Matrix', 'Prefix Sum']
| false | false |
53.918915 |
Hard
| 2,246 | false | false |
Longest Path With Different Adjacent Characters
|
longest-path-with-different-adjacent-characters
|
['Array', 'String', 'Tree', 'Depth-First Search', 'Graph', 'Topological Sort']
| true | false |
50 |
Hard
| 2,247 | false | true |
Maximum Cost of Trip With K Highways
|
maximum-cost-of-trip-with-k-highways
|
['Dynamic Programming', 'Bit Manipulation', 'Graph', 'Bitmask']
| false | false |
68.3246 |
Easy
| 2,248 | false | false |
Intersection of Multiple Arrays
|
intersection-of-multiple-arrays
|
['Array', 'Hash Table', 'Sorting', 'Counting']
| false | false |
54.74884 |
Medium
| 2,249 | false | false |
Count Lattice Points Inside a Circle
|
count-lattice-points-inside-a-circle
|
['Array', 'Hash Table', 'Math', 'Geometry', 'Enumeration']
| false | false |
35.787212 |
Medium
| 2,250 | false | false |
Count Number of Rectangles Containing Each Point
|
count-number-of-rectangles-containing-each-point
|
['Array', 'Hash Table', 'Binary Search', 'Binary Indexed Tree', 'Sorting']
| false | false |
57.049076 |
Hard
| 2,251 | false | false |
Number of Flowers in Full Bloom
|
number-of-flowers-in-full-bloom
|
['Array', 'Hash Table', 'Binary Search', 'Sorting', 'Prefix Sum', 'Ordered Set']
| true | false |
56.960874 |
Hard
| 2,252 | false | true |
Dynamic Pivoting of a Table
|
dynamic-pivoting-of-a-table
|
['Database']
| false | false |
67.907501 |
Hard
| 2,253 | false | true |
Dynamic Unpivoting of a Table
|
dynamic-unpivoting-of-a-table
|
['Database']
| false | false |
63.615946 |
Hard
| 2,254 | false | true |
Design Video Sharing Platform
|
design-video-sharing-platform
|
['Hash Table', 'Stack', 'Design', 'Ordered Set']
| false | false |
73.728909 |
Easy
| 2,255 | false | false |
Count Prefixes of a Given String
|
count-prefixes-of-a-given-string
|
['Array', 'String']
| false | false |
43.410543 |
Medium
| 2,256 | false | false |
Minimum Average Difference
|
minimum-average-difference
|
['Array', 'Prefix Sum']
| true | false |
65.806519 |
Medium
| 2,257 | false | false |
Count Unguarded Cells in the Grid
|
count-unguarded-cells-in-the-grid
|
['Array', 'Matrix', 'Simulation']
| true | false |
35.95887 |
Hard
| 2,258 | false | false |
Escape the Spreading Fire
|
escape-the-spreading-fire
|
['Array', 'Binary Search', 'Breadth-First Search', 'Matrix']
| false | false |
46.946404 |
Easy
| 2,259 | false | false |
Remove Digit From Number to Maximize Result
|
remove-digit-from-number-to-maximize-result
|
['String', 'Greedy', 'Enumeration']
| false | false |
52.384569 |
Medium
| 2,260 | false | false |
Minimum Consecutive Cards to Pick Up
|
minimum-consecutive-cards-to-pick-up
|
['Array', 'Hash Table', 'Sliding Window']
| false | false |
53.344257 |
Medium
| 2,261 | false | false |
K Divisible Elements Subarrays
|
k-divisible-elements-subarrays
|
['Array', 'Hash Table', 'Trie', 'Rolling Hash', 'Hash Function', 'Enumeration']
| false | false |
55.801267 |
Hard
| 2,262 | false | false |
Total Appeal of A String
|
total-appeal-of-a-string
|
['Hash Table', 'String', 'Dynamic Programming']
| false | false |
65.32056 |
Hard
| 2,263 | false | true |
Make Array Non-decreasing or Non-increasing
|
make-array-non-decreasing-or-non-increasing
|
['Dynamic Programming', 'Greedy']
| false | false |
69.03823 |
Easy
| 2,264 | false | false |
Largest 3-Same-Digit Number in String
|
largest-3-same-digit-number-in-string
|
['String']
| true | false |
86.276034 |
Medium
| 2,265 | false | false |
Count Nodes Equal to Average of Subtree
|
count-nodes-equal-to-average-of-subtree
|
['Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
48.546408 |
Medium
| 2,266 | false | false |
Count Number of Texts
|
count-number-of-texts
|
['Hash Table', 'Math', 'String', 'Dynamic Programming']
| false | false |
39.226228 |
Hard
| 2,267 | false | false |
Check if There Is a Valid Parentheses String Path
|
check-if-there-is-a-valid-parentheses-string-path
|
['Array', 'Dynamic Programming', 'Matrix']
| false | false |
71.201231 |
Medium
| 2,268 | false | true |
Minimum Number of Keypresses
|
minimum-number-of-keypresses
|
['Hash Table', 'String', 'Greedy', 'Sorting', 'Counting']
| false | false |
61.341167 |
Easy
| 2,269 | false | false |
Find the K-Beauty of a Number
|
find-the-k-beauty-of-a-number
|
['Math', 'String', 'Sliding Window']
| false | false |
56.090451 |
Medium
| 2,270 | false | false |
Number of Ways to Split Array
|
number-of-ways-to-split-array
|
['Array', 'Prefix Sum']
| true | false |
34.679085 |
Medium
| 2,271 | false | false |
Maximum White Tiles Covered by a Carpet
|
maximum-white-tiles-covered-by-a-carpet
|
['Array', 'Binary Search', 'Greedy', 'Sliding Window', 'Sorting', 'Prefix Sum']
| false | false |
45.895641 |
Hard
| 2,272 | false | false |
Substring With Largest Variance
|
substring-with-largest-variance
|
['Array', 'Dynamic Programming']
| true | false |
59.19902 |
Easy
| 2,273 | false | false |
Find Resultant Array After Removing Anagrams
|
find-resultant-array-after-removing-anagrams
|
['Array', 'Hash Table', 'String', 'Sorting']
| false | false |
51.896054 |
Medium
| 2,274 | false | false |
Maximum Consecutive Floors Without Special Floors
|
maximum-consecutive-floors-without-special-floors
|
['Array', 'Sorting']
| false | false |
80.919459 |
Medium
| 2,275 | false | false |
Largest Combination With Bitwise AND Greater Than Zero
|
largest-combination-with-bitwise-and-greater-than-zero
|
['Array', 'Hash Table', 'Bit Manipulation', 'Counting']
| true | false |
36.017266 |
Hard
| 2,276 | false | false |
Count Integers in Intervals
|
count-integers-in-intervals
|
['Design', 'Segment Tree', 'Ordered Set']
| false | false |
62.485308 |
Hard
| 2,277 | false | true |
Closest Node to Path in Tree
|
closest-node-to-path-in-tree
|
['Array', 'Tree', 'Depth-First Search', 'Breadth-First Search']
| false | false |
74.398967 |
Easy
| 2,278 | false | false |
Percentage of Letter in String
|
percentage-of-letter-in-string
|
['String']
| false | false |
67.512529 |
Medium
| 2,279 | false | false |
Maximum Bags With Full Capacity of Rocks
|
maximum-bags-with-full-capacity-of-rocks
|
['Array', 'Greedy', 'Sorting']
| true | false |
25.906536 |
Medium
| 2,280 | false | false |
Minimum Lines to Represent a Line Chart
|
minimum-lines-to-represent-a-line-chart
|
['Array', 'Math', 'Geometry', 'Sorting', 'Number Theory']
| false | false |
28.150194 |
Hard
| 2,281 | false | false |
Sum of Total Strength of Wizards
|
sum-of-total-strength-of-wizards
|
['Array', 'Stack', 'Monotonic Stack', 'Prefix Sum']
| true | false |
47.046546 |
Medium
| 2,282 | false | true |
Number of People That Can Be Seen in a Grid
|
number-of-people-that-can-be-seen-in-a-grid
|
['Array', 'Stack', 'Matrix', 'Monotonic Stack']
| false | false |
72.258267 |
Easy
| 2,283 | false | false |
Check if Number Has Equal Digit Count and Digit Value
|
check-if-number-has-equal-digit-count-and-digit-value
|
['Hash Table', 'String', 'Counting']
| false | false |
58.045663 |
Medium
| 2,284 | false | false |
Sender With Largest Word Count
|
sender-with-largest-word-count
|
['Array', 'Hash Table', 'String', 'Counting']
| false | false |
69.160648 |
Medium
| 2,285 | false | false |
Maximum Total Importance of Roads
|
maximum-total-importance-of-roads
|
['Greedy', 'Graph', 'Sorting', 'Heap (Priority Queue)']
| true | false |
18.518519 |
Hard
| 2,286 | false | false |
Booking Concert Tickets in Groups
|
booking-concert-tickets-in-groups
|
['Binary Search', 'Design', 'Binary Indexed Tree', 'Segment Tree']
| false | false |
59.910392 |
Easy
| 2,287 | false | false |
Rearrange Characters to Make Target String
|
rearrange-characters-to-make-target-string
|
['Hash Table', 'String', 'Counting']
| false | false |
32.472475 |
Medium
| 2,288 | false | false |
Apply Discount to Prices
|
apply-discount-to-prices
|
['String']
| false | false |
22.910146 |
Medium
| 2,289 | false | false |
Steps to Make Array Non-decreasing
|
steps-to-make-array-non-decreasing
|
['Array', 'Linked List', 'Stack', 'Monotonic Stack']
| false | false |
69.950815 |
Hard
| 2,290 | false | false |
Minimum Obstacle Removal to Reach Corner
|
minimum-obstacle-removal-to-reach-corner
|
['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']
| true | false |
46.382224 |
Medium
| 2,291 | false | true |
Maximum Profit From Trading Stocks
|
maximum-profit-from-trading-stocks
|
['Array', 'Dynamic Programming']
| false | false |
40.081855 |
Medium
| 2,292 | false | true |
Products With Three or More Orders in Two Consecutive Years
|
products-with-three-or-more-orders-in-two-consecutive-years
|
['Database']
| false | false |
63.613419 |
Easy
| 2,293 | false | false |
Min Max Game
|
min-max-game
|
['Array', 'Simulation']
| false | false |
74.309822 |
Medium
| 2,294 | false | false |
Partition Array Such That Maximum Difference Is K
|
partition-array-such-that-maximum-difference-is-k
|
['Array', 'Greedy', 'Sorting']
| false | false |
58.576575 |
Medium
| 2,295 | false | false |
Replace Elements in an Array
|
replace-elements-in-an-array
|
['Array', 'Hash Table', 'Simulation']
| false | false |
47.72904 |
Hard
| 2,296 | false | false |
Design a Text Editor
|
design-a-text-editor
|
['Linked List', 'String', 'Stack', 'Design', 'Simulation', 'Doubly-Linked List']
| false | false |
45.088619 |
Medium
| 2,297 | false | true |
Jump Game VIII
|
jump-game-viii
|
['Array', 'Dynamic Programming', 'Stack', 'Graph', 'Monotonic Stack', 'Shortest Path']
| false | false |
82.25016 |
Medium
| 2,298 | false | true |
Tasks Count in the Weekend
|
tasks-count-in-the-weekend
|
['Database']
| false | false |
54.788298 |
Easy
| 2,299 | false | false |
Strong Password Checker II
|
strong-password-checker-ii
|
['String']
| false | false |
45.078282 |
Medium
| 2,300 | false | false |
Successful Pairs of Spells and Potions
|
successful-pairs-of-spells-and-potions
|
['Array', 'Two Pointers', 'Binary Search', 'Sorting']
| true | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.