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.156105 |
Easy
| 401 | false | false |
Binary Watch
|
binary-watch
|
['Backtracking', 'Bit Manipulation']
| false | false |
34.580903 |
Medium
| 402 | false | false |
Remove K Digits
|
remove-k-digits
|
['String', 'Stack', 'Greedy', 'Monotonic Stack']
| true | false |
46.43819 |
Hard
| 403 | false | false |
Frog Jump
|
frog-jump
|
['Array', 'Dynamic Programming']
| true | false |
61.438085 |
Easy
| 404 | false | false |
Sum of Left Leaves
|
sum-of-left-leaves
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
50.485485 |
Easy
| 405 | false | false |
Convert a Number to Hexadecimal
|
convert-a-number-to-hexadecimal
|
['Math', 'Bit Manipulation']
| false | false |
74.048849 |
Medium
| 406 | false | false |
Queue Reconstruction by Height
|
queue-reconstruction-by-height
|
['Array', 'Binary Indexed Tree', 'Segment Tree', 'Sorting']
| true | false |
58.73707 |
Hard
| 407 | false | false |
Trapping Rain Water II
|
trapping-rain-water-ii
|
['Array', 'Breadth-First Search', 'Heap (Priority Queue)', 'Matrix']
| true | false |
36.710264 |
Easy
| 408 | false | true |
Valid Word Abbreviation
|
valid-word-abbreviation
|
['Two Pointers', 'String']
| false | false |
55.481277 |
Easy
| 409 | false | false |
Longest Palindrome
|
longest-palindrome
|
['Hash Table', 'String', 'Greedy']
| true | false |
57.606076 |
Hard
| 410 | false | false |
Split Array Largest Sum
|
split-array-largest-sum
|
['Array', 'Binary Search', 'Dynamic Programming', 'Greedy', 'Prefix Sum']
| true | false |
40.107937 |
Hard
| 411 | false | true |
Minimum Unique Word Abbreviation
|
minimum-unique-word-abbreviation
|
['Array', 'String', 'Backtracking', 'Bit Manipulation']
| false | false |
74.077046 |
Easy
| 412 | false | false |
Fizz Buzz
|
fizz-buzz
|
['Math', 'String', 'Simulation']
| true | true |
64.842639 |
Medium
| 413 | false | false |
Arithmetic Slices
|
arithmetic-slices
|
['Array', 'Dynamic Programming', 'Sliding Window']
| true | false |
36.825028 |
Easy
| 414 | false | false |
Third Maximum Number
|
third-maximum-number
|
['Array', 'Sorting']
| true | false |
51.784928 |
Easy
| 415 | false | false |
Add Strings
|
add-strings
|
['Math', 'String', 'Simulation']
| true | false |
48.180795 |
Medium
| 416 | false | false |
Partition Equal Subset Sum
|
partition-equal-subset-sum
|
['Array', 'Dynamic Programming']
| true | true |
57.105292 |
Medium
| 417 | false | false |
Pacific Atlantic Water Flow
|
pacific-atlantic-water-flow
|
['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']
| true | false |
36.316945 |
Medium
| 418 | false | true |
Sentence Screen Fitting
|
sentence-screen-fitting
|
['Array', 'String', 'Dynamic Programming']
| false | false |
76.334679 |
Medium
| 419 | false | false |
Battleships in a Board
|
battleships-in-a-board
|
['Array', 'Depth-First Search', 'Matrix']
| false | false |
14.457352 |
Hard
| 420 | false | false |
Strong Password Checker
|
strong-password-checker
|
['String', 'Greedy', 'Heap (Priority Queue)']
| false | false |
53.190331 |
Medium
| 421 | false | false |
Maximum XOR of Two Numbers in an Array
|
maximum-xor-of-two-numbers-in-an-array
|
['Array', 'Hash Table', 'Bit Manipulation', 'Trie']
| true | false |
41.902329 |
Easy
| 422 | false | true |
Valid Word Square
|
valid-word-square
|
['Array', 'Matrix']
| true | false |
51.507292 |
Medium
| 423 | false | false |
Reconstruct Original Digits from English
|
reconstruct-original-digits-from-english
|
['Hash Table', 'Math', 'String']
| true | false |
56.67613 |
Medium
| 424 | false | false |
Longest Repeating Character Replacement
|
longest-repeating-character-replacement
|
['Hash Table', 'String', 'Sliding Window']
| true | false |
53.843556 |
Hard
| 425 | false | true |
Word Squares
|
word-squares
|
['Array', 'String', 'Backtracking', 'Trie']
| true | false |
65.403064 |
Medium
| 426 | false | true |
Convert Binary Search Tree to Sorted Doubly Linked List
|
convert-binary-search-tree-to-sorted-doubly-linked-list
|
['Linked List', 'Stack', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree', 'Doubly-Linked List']
| true | false |
76.7786 |
Medium
| 427 | false | false |
Construct Quad Tree
|
construct-quad-tree
|
['Array', 'Divide and Conquer', 'Tree', 'Matrix']
| true | false |
68.13072 |
Hard
| 428 | false | true |
Serialize and Deserialize N-ary Tree
|
serialize-and-deserialize-n-ary-tree
|
['String', 'Tree', 'Depth-First Search', 'Breadth-First Search']
| true | false |
71.188169 |
Medium
| 429 | false | false |
N-ary Tree Level Order Traversal
|
n-ary-tree-level-order-traversal
|
['Tree', 'Breadth-First Search']
| true | false |
61.06364 |
Medium
| 430 | false | false |
Flatten a Multilevel Doubly Linked List
|
flatten-a-multilevel-doubly-linked-list
|
['Linked List', 'Depth-First Search', 'Doubly-Linked List']
| true | false |
80.056141 |
Hard
| 431 | false | true |
Encode N-ary Tree to Binary Tree
|
encode-n-ary-tree-to-binary-tree
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Tree']
| true | false |
44.759212 |
Hard
| 432 | false | false |
All O`one Data Structure
|
all-oone-data-structure
|
['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']
| true | false |
55.18212 |
Medium
| 433 | false | false |
Minimum Genetic Mutation
|
minimum-genetic-mutation
|
['Hash Table', 'String', 'Breadth-First Search']
| true | false |
36.30344 |
Easy
| 434 | false | false |
Number of Segments in a String
|
number-of-segments-in-a-string
|
['String']
| true | false |
55.126328 |
Medium
| 435 | false | false |
Non-overlapping Intervals
|
non-overlapping-intervals
|
['Array', 'Dynamic Programming', 'Greedy', 'Sorting']
| true | false |
53.508458 |
Medium
| 436 | false | false |
Find Right Interval
|
find-right-interval
|
['Array', 'Binary Search', 'Sorting']
| false | false |
46.042967 |
Medium
| 437 | false | false |
Path Sum III
|
path-sum-iii
|
['Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
51.94766 |
Medium
| 438 | false | false |
Find All Anagrams in a String
|
find-all-anagrams-in-a-string
|
['Hash Table', 'String', 'Sliding Window']
| true | false |
61.869739 |
Medium
| 439 | false | true |
Ternary Expression Parser
|
ternary-expression-parser
|
['String', 'Stack', 'Recursion']
| true | false |
41.966205 |
Hard
| 440 | false | false |
K-th Smallest in Lexicographical Order
|
k-th-smallest-in-lexicographical-order
|
['Trie']
| true | false |
47.205667 |
Easy
| 441 | false | false |
Arranging Coins
|
arranging-coins
|
['Math', 'Binary Search']
| true | false |
76.296037 |
Medium
| 442 | false | false |
Find All Duplicates in an Array
|
find-all-duplicates-in-an-array
|
['Array', 'Hash Table']
| true | false |
57.573898 |
Medium
| 443 | false | false |
String Compression
|
string-compression
|
['Two Pointers', 'String']
| true | false |
29.254838 |
Medium
| 444 | false | true |
Sequence Reconstruction
|
sequence-reconstruction
|
['Array', 'Graph', 'Topological Sort']
| false | false |
61.602712 |
Medium
| 445 | false | false |
Add Two Numbers II
|
add-two-numbers-ii
|
['Linked List', 'Math', 'Stack']
| true | false |
54.52685 |
Hard
| 446 | false | false |
Arithmetic Slices II - Subsequence
|
arithmetic-slices-ii-subsequence
|
['Array', 'Dynamic Programming']
| true | false |
56.237188 |
Medium
| 447 | false | false |
Number of Boomerangs
|
number-of-boomerangs
|
['Array', 'Hash Table', 'Math']
| false | false |
62.137197 |
Easy
| 448 | false | false |
Find All Numbers Disappeared in an Array
|
find-all-numbers-disappeared-in-an-array
|
['Array', 'Hash Table']
| true | false |
58.417547 |
Medium
| 449 | false | false |
Serialize and Deserialize BST
|
serialize-and-deserialize-bst
|
['String', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Design', 'Binary Search Tree', 'Binary Tree']
| true | false |
52.698338 |
Medium
| 450 | false | false |
Delete Node in a BST
|
delete-node-in-a-bst
|
['Tree', 'Binary Search Tree', 'Binary Tree']
| true | false |
73.782723 |
Medium
| 451 | false | false |
Sort Characters By Frequency
|
sort-characters-by-frequency
|
['Hash Table', 'String', 'Sorting', 'Heap (Priority Queue)', 'Bucket Sort', 'Counting']
| true | false |
60.149975 |
Medium
| 452 | false | false |
Minimum Number of Arrows to Burst Balloons
|
minimum-number-of-arrows-to-burst-balloons
|
['Array', 'Greedy', 'Sorting']
| true | false |
57.594397 |
Medium
| 453 | false | false |
Minimum Moves to Equal Array Elements
|
minimum-moves-to-equal-array-elements
|
['Array', 'Math']
| true | false |
57.510894 |
Medium
| 454 | false | false |
4Sum II
|
4sum-ii
|
['Array', 'Hash Table']
| true | false |
53.579742 |
Easy
| 455 | false | false |
Assign Cookies
|
assign-cookies
|
['Array', 'Two Pointers', 'Greedy', 'Sorting']
| true | false |
33.943882 |
Medium
| 456 | false | false |
132 Pattern
|
132-pattern
|
['Array', 'Binary Search', 'Stack', 'Monotonic Stack', 'Ordered Set']
| true | true |
35.317942 |
Medium
| 457 | false | false |
Circular Array Loop
|
circular-array-loop
|
['Array', 'Hash Table', 'Two Pointers']
| false | false |
59.270682 |
Hard
| 458 | false | false |
Poor Pigs
|
poor-pigs
|
['Math', 'Dynamic Programming', 'Combinatorics']
| true | false |
46.691755 |
Easy
| 459 | false | false |
Repeated Substring Pattern
|
repeated-substring-pattern
|
['String', 'String Matching']
| true | false |
46.064146 |
Hard
| 460 | false | false |
LFU Cache
|
lfu-cache
|
['Hash Table', 'Linked List', 'Design', 'Doubly-Linked List']
| true | false |
75.927204 |
Easy
| 461 | false | false |
Hamming Distance
|
hamming-distance
|
['Bit Manipulation']
| true | false |
60.82885 |
Medium
| 462 | false | false |
Minimum Moves to Equal Array Elements II
|
minimum-moves-to-equal-array-elements-ii
|
['Array', 'Math', 'Sorting']
| true | false |
73.372204 |
Easy
| 463 | false | false |
Island Perimeter
|
island-perimeter
|
['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']
| true | false |
30.216131 |
Medium
| 464 | false | false |
Can I Win
|
can-i-win
|
['Math', 'Dynamic Programming', 'Bit Manipulation', 'Memoization', 'Game Theory', 'Bitmask']
| false | false |
49.761791 |
Hard
| 465 | false | true |
Optimal Account Balancing
|
optimal-account-balancing
|
['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']
| true | false |
31.482795 |
Hard
| 466 | false | false |
Count The Repetitions
|
count-the-repetitions
|
['String', 'Dynamic Programming']
| true | false |
40.920836 |
Medium
| 467 | false | false |
Unique Substrings in Wraparound String
|
unique-substrings-in-wraparound-string
|
['String', 'Dynamic Programming']
| false | false |
27.720434 |
Medium
| 468 | false | false |
Validate IP Address
|
validate-ip-address
|
['String']
| true | false |
39.802269 |
Medium
| 469 | false | true |
Convex Polygon
|
convex-polygon
|
['Array', 'Math', 'Geometry']
| false | false |
45.830859 |
Medium
| 470 | false | false |
Implement Rand10() Using Rand7()
|
implement-rand10-using-rand7
|
['Math', 'Rejection Sampling', 'Randomized', 'Probability and Statistics']
| true | false |
50.468953 |
Hard
| 471 | false | true |
Encode String with Shortest Length
|
encode-string-with-shortest-length
|
['String', 'Dynamic Programming']
| false | false |
49.376574 |
Hard
| 472 | false | false |
Concatenated Words
|
concatenated-words
|
['Array', 'String', 'Dynamic Programming', 'Depth-First Search', 'Trie']
| true | false |
40.767084 |
Medium
| 473 | false | false |
Matchsticks to Square
|
matchsticks-to-square
|
['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']
| true | false |
48.572464 |
Medium
| 474 | false | false |
Ones and Zeroes
|
ones-and-zeroes
|
['Array', 'String', 'Dynamic Programming']
| true | false |
39.572912 |
Medium
| 475 | false | false |
Heaters
|
heaters
|
['Array', 'Two Pointers', 'Binary Search', 'Sorting']
| false | false |
70.294825 |
Easy
| 476 | false | false |
Number Complement
|
number-complement
|
['Bit Manipulation']
| true | false |
53.568872 |
Medium
| 477 | false | false |
Total Hamming Distance
|
total-hamming-distance
|
['Array', 'Math', 'Bit Manipulation']
| true | false |
40.705569 |
Medium
| 478 | false | false |
Generate Random Point in a Circle
|
generate-random-point-in-a-circle
|
['Math', 'Geometry', 'Rejection Sampling', 'Randomized']
| true | false |
34.742419 |
Hard
| 479 | false | false |
Largest Palindrome Product
|
largest-palindrome-product
|
['Math', 'Enumeration']
| false | false |
38.565734 |
Hard
| 480 | false | false |
Sliding Window Median
|
sliding-window-median
|
['Array', 'Hash Table', 'Sliding Window', 'Heap (Priority Queue)']
| true | false |
52.181231 |
Medium
| 481 | false | false |
Magical String
|
magical-string
|
['Two Pointers', 'String']
| false | false |
44.536029 |
Easy
| 482 | false | false |
License Key Formatting
|
license-key-formatting
|
['String']
| true | false |
42.915893 |
Hard
| 483 | false | false |
Smallest Good Base
|
smallest-good-base
|
['Math', 'Binary Search']
| false | false |
66.917549 |
Medium
| 484 | false | true |
Find Permutation
|
find-permutation
|
['Array', 'String', 'Stack', 'Greedy']
| true | false |
61.999486 |
Easy
| 485 | false | false |
Max Consecutive Ones
|
max-consecutive-ones
|
['Array']
| true | false |
55.592905 |
Medium
| 486 | false | false |
Predict the Winner
|
predict-the-winner
|
['Array', 'Math', 'Dynamic Programming', 'Recursion', 'Game Theory']
| true | true |
51.404036 |
Medium
| 487 | false | true |
Max Consecutive Ones II
|
max-consecutive-ones-ii
|
['Array', 'Dynamic Programming', 'Sliding Window']
| true | false |
31.762099 |
Hard
| 488 | false | false |
Zuma Game
|
zuma-game
|
['String', 'Dynamic Programming', 'Stack', 'Breadth-First Search', 'Memoization']
| false | false |
77.304522 |
Hard
| 489 | false | true |
Robot Room Cleaner
|
robot-room-cleaner
|
['Backtracking', 'Interactive']
| true | false |
59.212013 |
Medium
| 490 | false | true |
The Maze
|
the-maze
|
['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']
| true | false |
61.473825 |
Medium
| 491 | false | false |
Non-decreasing Subsequences
|
non-decreasing-subsequences
|
['Array', 'Hash Table', 'Backtracking', 'Bit Manipulation']
| true | false |
60.173997 |
Easy
| 492 | false | false |
Construct the Rectangle
|
construct-the-rectangle
|
['Math']
| false | false |
31.820555 |
Hard
| 493 | false | false |
Reverse Pairs
|
reverse-pairs
|
['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']
| true | false |
50.442065 |
Medium
| 494 | false | false |
Target Sum
|
target-sum
|
['Array', 'Dynamic Programming', 'Backtracking']
| true | false |
56.870436 |
Easy
| 495 | false | false |
Teemo Attacking
|
teemo-attacking
|
['Array', 'Simulation']
| true | false |
74.108256 |
Easy
| 496 | false | false |
Next Greater Element I
|
next-greater-element-i
|
['Array', 'Hash Table', 'Stack', 'Monotonic Stack']
| true | false |
40.460714 |
Medium
| 497 | false | false |
Random Point in Non-overlapping Rectangles
|
random-point-in-non-overlapping-rectangles
|
['Array', 'Math', 'Binary Search', 'Reservoir Sampling', 'Prefix Sum', 'Ordered Set', 'Randomized']
| true | false |
62.707557 |
Medium
| 498 | false | false |
Diagonal Traverse
|
diagonal-traverse
|
['Array', 'Matrix', 'Simulation']
| true | false |
50.374433 |
Hard
| 499 | false | true |
The Maze III
|
the-maze-iii
|
['Array', 'String', 'Depth-First Search', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path']
| true | false |
72.211045 |
Easy
| 500 | false | false |
Keyboard Row
|
keyboard-row
|
['Array', 'Hash Table', 'String']
| false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.