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.996067 |
Hard
| 301 | false | false |
Remove Invalid Parentheses
|
remove-invalid-parentheses
|
['String', 'Backtracking', 'Breadth-First Search']
| true | false |
59.48578 |
Hard
| 302 | false | true |
Smallest Rectangle Enclosing Black Pixels
|
smallest-rectangle-enclosing-black-pixels
|
['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Matrix']
| true | false |
67.697898 |
Easy
| 303 | false | false |
Range Sum Query - Immutable
|
range-sum-query-immutable
|
['Array', 'Design', 'Prefix Sum']
| true | true |
56.21715 |
Medium
| 304 | false | false |
Range Sum Query 2D - Immutable
|
range-sum-query-2d-immutable
|
['Array', 'Design', 'Matrix', 'Prefix Sum']
| true | true |
40.024561 |
Hard
| 305 | false | true |
Number of Islands II
|
number-of-islands-ii
|
['Array', 'Hash Table', 'Union Find']
| true | false |
32.373544 |
Medium
| 306 | false | false |
Additive Number
|
additive-number
|
['String', 'Backtracking']
| false | false |
41.632216 |
Medium
| 307 | false | false |
Range Sum Query - Mutable
|
range-sum-query-mutable
|
['Array', 'Design', 'Binary Indexed Tree', 'Segment Tree']
| true | false |
44.758118 |
Medium
| 308 | false | true |
Range Sum Query 2D - Mutable
|
range-sum-query-2d-mutable
|
['Array', 'Design', 'Binary Indexed Tree', 'Segment Tree', 'Matrix']
| true | true |
59.981676 |
Medium
| 309 | false | false |
Best Time to Buy and Sell Stock with Cooldown
|
best-time-to-buy-and-sell-stock-with-cooldown
|
['Array', 'Dynamic Programming']
| true | false |
41.922507 |
Medium
| 310 | false | false |
Minimum Height Trees
|
minimum-height-trees
|
['Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort']
| true | false |
68.636257 |
Medium
| 311 | false | true |
Sparse Matrix Multiplication
|
sparse-matrix-multiplication
|
['Array', 'Hash Table', 'Matrix']
| true | false |
60.8333 |
Hard
| 312 | false | false |
Burst Balloons
|
burst-balloons
|
['Array', 'Dynamic Programming']
| true | false |
45.401767 |
Medium
| 313 | false | false |
Super Ugly Number
|
super-ugly-number
|
['Array', 'Math', 'Dynamic Programming']
| false | false |
56.809827 |
Medium
| 314 | false | true |
Binary Tree Vertical Order Traversal
|
binary-tree-vertical-order-traversal
|
['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Sorting', 'Binary Tree']
| true | false |
42.730455 |
Hard
| 315 | false | false |
Count of Smaller Numbers After Self
|
count-of-smaller-numbers-after-self
|
['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']
| true | false |
50.977576 |
Medium
| 316 | false | false |
Remove Duplicate Letters
|
remove-duplicate-letters
|
['String', 'Stack', 'Greedy', 'Monotonic Stack']
| true | false |
44.144789 |
Hard
| 317 | false | true |
Shortest Distance from All Buildings
|
shortest-distance-from-all-buildings
|
['Array', 'Breadth-First Search', 'Matrix']
| true | false |
60.435039 |
Medium
| 318 | false | false |
Maximum Product of Word Lengths
|
maximum-product-of-word-lengths
|
['Array', 'String', 'Bit Manipulation']
| true | false |
53.820916 |
Medium
| 319 | false | false |
Bulb Switcher
|
bulb-switcher
|
['Math', 'Brainteaser']
| true | false |
59.965443 |
Medium
| 320 | false | true |
Generalized Abbreviation
|
generalized-abbreviation
|
['String', 'Backtracking', 'Bit Manipulation']
| true | false |
31.998009 |
Hard
| 321 | false | false |
Create Maximum Number
|
create-maximum-number
|
['Array', 'Two Pointers', 'Stack', 'Greedy', 'Monotonic Stack']
| false | false |
46.035762 |
Medium
| 322 | false | false |
Coin Change
|
coin-change
|
['Array', 'Dynamic Programming', 'Breadth-First Search']
| true | true |
63.960525 |
Medium
| 323 | false | true |
Number of Connected Components in an Undirected Graph
|
number-of-connected-components-in-an-undirected-graph
|
['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']
| true | true |
35.423376 |
Medium
| 324 | false | false |
Wiggle Sort II
|
wiggle-sort-ii
|
['Array', 'Divide and Conquer', 'Greedy', 'Sorting', 'Quickselect']
| false | false |
50.278305 |
Medium
| 325 | false | true |
Maximum Size Subarray Sum Equals k
|
maximum-size-subarray-sum-equals-k
|
['Array', 'Hash Table', 'Prefix Sum']
| true | false |
47.731025 |
Easy
| 326 | false | false |
Power of Three
|
power-of-three
|
['Math', 'Recursion']
| true | false |
36.756108 |
Hard
| 327 | false | false |
Count of Range Sum
|
count-of-range-sum
|
['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']
| false | false |
61.877863 |
Medium
| 328 | false | false |
Odd Even Linked List
|
odd-even-linked-list
|
['Linked List']
| true | false |
55.036278 |
Hard
| 329 | false | false |
Longest Increasing Path in a Matrix
|
longest-increasing-path-in-a-matrix
|
['Array', 'Dynamic Programming', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Topological Sort', 'Memoization', 'Matrix']
| true | false |
53.392615 |
Hard
| 330 | false | false |
Patching Array
|
patching-array
|
['Array', 'Greedy']
| true | false |
45.968824 |
Medium
| 331 | false | false |
Verify Preorder Serialization of a Binary Tree
|
verify-preorder-serialization-of-a-binary-tree
|
['String', 'Stack', 'Tree', 'Binary Tree']
| true | false |
43.454141 |
Hard
| 332 | false | false |
Reconstruct Itinerary
|
reconstruct-itinerary
|
['Depth-First Search', 'Graph', 'Eulerian Circuit']
| false | false |
45.206268 |
Medium
| 333 | false | true |
Largest BST Subtree
|
largest-bst-subtree
|
['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']
| true | false |
39.144039 |
Medium
| 334 | false | false |
Increasing Triplet Subsequence
|
increasing-triplet-subsequence
|
['Array', 'Greedy']
| true | false |
31.764972 |
Hard
| 335 | false | false |
Self Crossing
|
self-crossing
|
['Array', 'Math', 'Geometry']
| false | false |
36.089906 |
Hard
| 336 | false | false |
Palindrome Pairs
|
palindrome-pairs
|
['Array', 'Hash Table', 'String', 'Trie']
| true | false |
54.774496 |
Medium
| 337 | false | false |
House Robber III
|
house-robber-iii
|
['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
79.496429 |
Easy
| 338 | false | false |
Counting Bits
|
counting-bits
|
['Dynamic Programming', 'Bit Manipulation']
| true | false |
85.324738 |
Medium
| 339 | false | true |
Nested List Weight Sum
|
nested-list-weight-sum
|
['Depth-First Search', 'Breadth-First Search']
| true | true |
49.384069 |
Medium
| 340 | false | true |
Longest Substring with At Most K Distinct Characters
|
longest-substring-with-at-most-k-distinct-characters
|
['Hash Table', 'String', 'Sliding Window']
| true | true |
65.236997 |
Medium
| 341 | false | false |
Flatten Nested List Iterator
|
flatten-nested-list-iterator
|
['Stack', 'Tree', 'Depth-First Search', 'Design', 'Queue', 'Iterator']
| true | false |
49.199515 |
Easy
| 342 | false | false |
Power of Four
|
power-of-four
|
['Math', 'Bit Manipulation', 'Recursion']
| true | false |
60.9892 |
Medium
| 343 | false | false |
Integer Break
|
integer-break
|
['Math', 'Dynamic Programming']
| true | false |
79.572384 |
Easy
| 344 | false | false |
Reverse String
|
reverse-string
|
['Two Pointers', 'String']
| true | true |
57.427146 |
Easy
| 345 | false | false |
Reverse Vowels of a String
|
reverse-vowels-of-a-string
|
['Two Pointers', 'String']
| true | true |
79.746989 |
Easy
| 346 | false | true |
Moving Average from Data Stream
|
moving-average-from-data-stream
|
['Array', 'Design', 'Queue', 'Data Stream']
| true | true |
64.241056 |
Medium
| 347 | false | false |
Top K Frequent Elements
|
top-k-frequent-elements
|
['Array', 'Hash Table', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting', 'Quickselect']
| true | true |
58.495608 |
Medium
| 348 | false | true |
Design Tic-Tac-Toe
|
design-tic-tac-toe
|
['Array', 'Hash Table', 'Design', 'Matrix', 'Simulation']
| true | false |
76.157565 |
Easy
| 349 | false | false |
Intersection of Two Arrays
|
intersection-of-two-arrays
|
['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting']
| true | false |
58.937561 |
Easy
| 350 | false | false |
Intersection of Two Arrays II
|
intersection-of-two-arrays-ii
|
['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting']
| true | false |
53.237357 |
Medium
| 351 | false | true |
Android Unlock Patterns
|
android-unlock-patterns
|
['Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']
| true | false |
60.347101 |
Hard
| 352 | false | false |
Data Stream as Disjoint Intervals
|
data-stream-as-disjoint-intervals
|
['Binary Search', 'Design', 'Ordered Set']
| true | false |
39.069553 |
Medium
| 353 | false | true |
Design Snake Game
|
design-snake-game
|
['Array', 'Hash Table', 'Design', 'Queue', 'Simulation']
| true | false |
37.205784 |
Hard
| 354 | false | false |
Russian Doll Envelopes
|
russian-doll-envelopes
|
['Array', 'Binary Search', 'Dynamic Programming', 'Sorting']
| true | false |
41.754525 |
Medium
| 355 | false | false |
Design Twitter
|
design-twitter
|
['Hash Table', 'Linked List', 'Design', 'Heap (Priority Queue)']
| false | false |
35.898789 |
Medium
| 356 | false | true |
Line Reflection
|
line-reflection
|
['Array', 'Hash Table', 'Math']
| false | false |
54.071849 |
Medium
| 357 | false | false |
Count Numbers with Unique Digits
|
count-numbers-with-unique-digits
|
['Math', 'Dynamic Programming', 'Backtracking']
| false | false |
39.308741 |
Hard
| 358 | false | true |
Rearrange String k Distance Apart
|
rearrange-string-k-distance-apart
|
['Hash Table', 'String', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting']
| true | false |
76.400692 |
Easy
| 359 | false | true |
Logger Rate Limiter
|
logger-rate-limiter
|
['Hash Table', 'Design', 'Data Stream']
| true | true |
56.877679 |
Medium
| 360 | false | true |
Sort Transformed Array
|
sort-transformed-array
|
['Array', 'Math', 'Two Pointers', 'Sorting']
| true | false |
52.040077 |
Medium
| 361 | false | true |
Bomb Enemy
|
bomb-enemy
|
['Array', 'Dynamic Programming', 'Matrix']
| true | false |
69.06354 |
Medium
| 362 | false | true |
Design Hit Counter
|
design-hit-counter
|
['Array', 'Binary Search', 'Design', 'Queue', 'Data Stream']
| true | false |
44.543562 |
Hard
| 363 | false | false |
Max Sum of Rectangle No Larger Than K
|
max-sum-of-rectangle-no-larger-than-k
|
['Array', 'Binary Search', 'Matrix', 'Prefix Sum', 'Ordered Set']
| true | false |
65.223454 |
Medium
| 364 | false | true |
Nested List Weight Sum II
|
nested-list-weight-sum-ii
|
['Stack', 'Depth-First Search', 'Breadth-First Search']
| true | false |
42.689623 |
Medium
| 365 | false | false |
Water and Jug Problem
|
water-and-jug-problem
|
['Math', 'Depth-First Search', 'Breadth-First Search']
| false | false |
80.999929 |
Medium
| 366 | false | true |
Find Leaves of Binary Tree
|
find-leaves-of-binary-tree
|
['Tree', 'Depth-First Search', 'Binary Tree']
| true | true |
44.087418 |
Easy
| 367 | false | false |
Valid Perfect Square
|
valid-perfect-square
|
['Math', 'Binary Search']
| true | false |
48.693992 |
Medium
| 368 | false | false |
Largest Divisible Subset
|
largest-divisible-subset
|
['Array', 'Math', 'Dynamic Programming', 'Sorting']
| true | false |
61.136776 |
Medium
| 369 | false | true |
Plus One Linked List
|
plus-one-linked-list
|
['Linked List', 'Math']
| true | true |
72.187313 |
Medium
| 370 | false | true |
Range Addition
|
range-addition
|
['Array', 'Prefix Sum']
| true | false |
53.348406 |
Medium
| 371 | false | false |
Sum of Two Integers
|
sum-of-two-integers
|
['Math', 'Bit Manipulation']
| true | false |
35.328438 |
Medium
| 372 | false | false |
Super Pow
|
super-pow
|
['Math', 'Divide and Conquer']
| false | false |
40.51175 |
Medium
| 373 | false | false |
Find K Pairs with Smallest Sums
|
find-k-pairs-with-smallest-sums
|
['Array', 'Heap (Priority Queue)']
| true | false |
55.404669 |
Easy
| 374 | false | false |
Guess Number Higher or Lower
|
guess-number-higher-or-lower
|
['Binary Search', 'Interactive']
| true | true |
50.823353 |
Medium
| 375 | false | false |
Guess Number Higher or Lower II
|
guess-number-higher-or-lower-ii
|
['Math', 'Dynamic Programming', 'Game Theory']
| true | false |
48.782082 |
Medium
| 376 | false | false |
Wiggle Subsequence
|
wiggle-subsequence
|
['Array', 'Dynamic Programming', 'Greedy']
| true | false |
54.57406 |
Medium
| 377 | false | false |
Combination Sum IV
|
combination-sum-iv
|
['Array', 'Dynamic Programming']
| true | false |
63.345915 |
Medium
| 378 | false | false |
Kth Smallest Element in a Sorted Matrix
|
kth-smallest-element-in-a-sorted-matrix
|
['Array', 'Binary Search', 'Sorting', 'Heap (Priority Queue)', 'Matrix']
| true | false |
52.254822 |
Medium
| 379 | false | true |
Design Phone Directory
|
design-phone-directory
|
['Array', 'Hash Table', 'Linked List', 'Design', 'Queue']
| true | false |
54.966186 |
Medium
| 380 | false | false |
Insert Delete GetRandom O(1)
|
insert-delete-getrandom-o1
|
['Array', 'Hash Table', 'Math', 'Design', 'Randomized']
| true | false |
35.843903 |
Hard
| 381 | false | false |
Insert Delete GetRandom O(1) - Duplicates allowed
|
insert-delete-getrandom-o1-duplicates-allowed
|
['Array', 'Hash Table', 'Math', 'Design', 'Randomized']
| true | false |
63.833205 |
Medium
| 382 | false | false |
Linked List Random Node
|
linked-list-random-node
|
['Linked List', 'Math', 'Reservoir Sampling', 'Randomized']
| true | false |
64.130115 |
Easy
| 383 | false | false |
Ransom Note
|
ransom-note
|
['Hash Table', 'String', 'Counting']
| true | true |
58.896139 |
Medium
| 384 | false | false |
Shuffle an Array
|
shuffle-an-array
|
['Array', 'Math', 'Design', 'Randomized']
| true | false |
39.794067 |
Medium
| 385 | false | false |
Mini Parser
|
mini-parser
|
['String', 'Stack', 'Depth-First Search']
| false | false |
73.036935 |
Medium
| 386 | false | false |
Lexicographical Numbers
|
lexicographical-numbers
|
['Depth-First Search', 'Trie']
| true | false |
63.380828 |
Easy
| 387 | false | false |
First Unique Character in a String
|
first-unique-character-in-a-string
|
['Hash Table', 'String', 'Queue', 'Counting']
| true | true |
48.209865 |
Medium
| 388 | false | false |
Longest Absolute File Path
|
longest-absolute-file-path
|
['String', 'Stack', 'Depth-First Search']
| false | false |
59.63395 |
Easy
| 389 | false | false |
Find the Difference
|
find-the-difference
|
['Hash Table', 'String', 'Bit Manipulation', 'Sorting']
| true | false |
44.662015 |
Medium
| 390 | false | false |
Elimination Game
|
elimination-game
|
['Math', 'Recursion']
| false | false |
34.909262 |
Hard
| 391 | false | false |
Perfect Rectangle
|
perfect-rectangle
|
['Array', 'Line Sweep']
| false | false |
48.273048 |
Easy
| 392 | false | false |
Is Subsequence
|
is-subsequence
|
['Two Pointers', 'String', 'Dynamic Programming']
| true | false |
45.451955 |
Medium
| 393 | false | false |
UTF-8 Validation
|
utf-8-validation
|
['Array', 'Bit Manipulation']
| true | false |
60.832597 |
Medium
| 394 | false | false |
Decode String
|
decode-string
|
['String', 'Stack', 'Recursion']
| true | false |
45.345917 |
Medium
| 395 | false | false |
Longest Substring with At Least K Repeating Characters
|
longest-substring-with-at-least-k-repeating-characters
|
['Hash Table', 'String', 'Divide and Conquer', 'Sliding Window']
| true | false |
43.729394 |
Medium
| 396 | false | false |
Rotate Function
|
rotate-function
|
['Array', 'Math', 'Dynamic Programming']
| false | false |
36.373182 |
Medium
| 397 | false | false |
Integer Replacement
|
integer-replacement
|
['Dynamic Programming', 'Greedy', 'Bit Manipulation', 'Memoization']
| false | false |
64.374519 |
Medium
| 398 | false | false |
Random Pick Index
|
random-pick-index
|
['Hash Table', 'Math', 'Reservoir Sampling', 'Randomized']
| true | false |
62.880355 |
Medium
| 399 | false | false |
Evaluate Division
|
evaluate-division
|
['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Shortest Path']
| true | false |
35.445441 |
Medium
| 400 | false | false |
Nth Digit
|
nth-digit
|
['Math', 'Binary Search']
| false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.