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 |
---|---|---|---|---|---|---|---|---|---|
67.332268 |
Medium
| 901 | false | false |
Online Stock Span
|
online-stock-span
|
['Stack', 'Design', 'Monotonic Stack', 'Data Stream']
| true | false |
43.157942 |
Hard
| 902 | false | false |
Numbers At Most N Given Digit Set
|
numbers-at-most-n-given-digit-set
|
['Array', 'Math', 'String', 'Binary Search', 'Dynamic Programming']
| true | false |
56.760833 |
Hard
| 903 | false | false |
Valid Permutations for DI Sequence
|
valid-permutations-for-di-sequence
|
['String', 'Dynamic Programming', 'Prefix Sum']
| true | false |
45.807032 |
Medium
| 904 | false | false |
Fruit Into Baskets
|
fruit-into-baskets
|
['Array', 'Hash Table', 'Sliding Window']
| true | false |
76.270826 |
Easy
| 905 | false | false |
Sort Array By Parity
|
sort-array-by-parity
|
['Array', 'Two Pointers', 'Sorting']
| true | false |
39.173793 |
Hard
| 906 | false | false |
Super Palindromes
|
super-palindromes
|
['Math', 'String', 'Enumeration']
| true | false |
37.411732 |
Medium
| 907 | false | false |
Sum of Subarray Minimums
|
sum-of-subarray-minimums
|
['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack']
| true | false |
71.588821 |
Easy
| 908 | false | false |
Smallest Range I
|
smallest-range-i
|
['Array', 'Math']
| true | false |
44.077568 |
Medium
| 909 | false | false |
Snakes and Ladders
|
snakes-and-ladders
|
['Array', 'Breadth-First Search', 'Matrix']
| true | false |
36.989934 |
Medium
| 910 | false | false |
Smallest Range II
|
smallest-range-ii
|
['Array', 'Math', 'Greedy', 'Sorting']
| true | false |
52.481183 |
Medium
| 911 | false | false |
Online Election
|
online-election
|
['Array', 'Hash Table', 'Binary Search', 'Design']
| true | false |
56.932326 |
Medium
| 912 | false | false |
Sort an Array
|
sort-an-array
|
['Array', 'Divide and Conquer', 'Sorting', 'Heap (Priority Queue)', 'Merge Sort', 'Bucket Sort', 'Radix Sort', 'Counting Sort']
| true | false |
33.984965 |
Hard
| 913 | false | false |
Cat and Mouse
|
cat-and-mouse
|
['Math', 'Dynamic Programming', 'Graph', 'Topological Sort', 'Memoization', 'Game Theory']
| true | false |
29.82988 |
Easy
| 914 | false | false |
X of a Kind in a Deck of Cards
|
x-of-a-kind-in-a-deck-of-cards
|
['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory']
| true | false |
48.949954 |
Medium
| 915 | false | false |
Partition Array into Disjoint Intervals
|
partition-array-into-disjoint-intervals
|
['Array']
| true | false |
55.647029 |
Medium
| 916 | false | false |
Word Subsets
|
word-subsets
|
['Array', 'Hash Table', 'String']
| true | false |
66.547528 |
Easy
| 917 | false | false |
Reverse Only Letters
|
reverse-only-letters
|
['Two Pointers', 'String']
| true | false |
47.121795 |
Medium
| 918 | false | false |
Maximum Sum Circular Subarray
|
maximum-sum-circular-subarray
|
['Array', 'Divide and Conquer', 'Dynamic Programming', 'Queue', 'Monotonic Queue']
| true | false |
66.285234 |
Medium
| 919 | false | false |
Complete Binary Tree Inserter
|
complete-binary-tree-inserter
|
['Tree', 'Breadth-First Search', 'Design', 'Binary Tree']
| true | false |
59.966893 |
Hard
| 920 | false | false |
Number of Music Playlists
|
number-of-music-playlists
|
['Math', 'Dynamic Programming', 'Combinatorics']
| true | false |
74.68293 |
Medium
| 921 | false | false |
Minimum Add to Make Parentheses Valid
|
minimum-add-to-make-parentheses-valid
|
['String', 'Stack', 'Greedy']
| true | false |
70.953071 |
Easy
| 922 | false | false |
Sort Array By Parity II
|
sort-array-by-parity-ii
|
['Array', 'Two Pointers', 'Sorting']
| true | true |
45.721543 |
Medium
| 923 | false | false |
3Sum With Multiplicity
|
3sum-with-multiplicity
|
['Array', 'Hash Table', 'Two Pointers', 'Sorting', 'Counting']
| true | false |
42.224148 |
Hard
| 924 | false | false |
Minimize Malware Spread
|
minimize-malware-spread
|
['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']
| true | false |
32.437046 |
Easy
| 925 | false | false |
Long Pressed Name
|
long-pressed-name
|
['Two Pointers', 'String']
| true | false |
61.559627 |
Medium
| 926 | false | false |
Flip String to Monotone Increasing
|
flip-string-to-monotone-increasing
|
['String', 'Dynamic Programming']
| true | false |
40.590731 |
Hard
| 927 | false | false |
Three Equal Parts
|
three-equal-parts
|
['Array', 'Math']
| true | false |
44.442743 |
Hard
| 928 | false | false |
Minimize Malware Spread II
|
minimize-malware-spread-ii
|
['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph']
| true | false |
67.501461 |
Easy
| 929 | false | false |
Unique Email Addresses
|
unique-email-addresses
|
['Array', 'Hash Table', 'String']
| true | false |
65.352792 |
Medium
| 930 | false | false |
Binary Subarrays With Sum
|
binary-subarrays-with-sum
|
['Array', 'Hash Table', 'Sliding Window', 'Prefix Sum']
| true | false |
61.812587 |
Medium
| 931 | false | false |
Minimum Falling Path Sum
|
minimum-falling-path-sum
|
['Array', 'Dynamic Programming', 'Matrix']
| true | false |
66.820388 |
Medium
| 932 | false | false |
Beautiful Array
|
beautiful-array
|
['Array', 'Math', 'Divide and Conquer']
| true | false |
77.284472 |
Easy
| 933 | false | false |
Number of Recent Calls
|
number-of-recent-calls
|
['Design', 'Queue', 'Data Stream']
| true | false |
58.401254 |
Medium
| 934 | false | false |
Shortest Bridge
|
shortest-bridge
|
['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix']
| true | false |
60.99821 |
Medium
| 935 | false | false |
Knight Dialer
|
knight-dialer
|
['Dynamic Programming']
| true | false |
61.874424 |
Hard
| 936 | false | false |
Stamping The Sequence
|
stamping-the-sequence
|
['String', 'Stack', 'Greedy', 'Queue']
| true | false |
56.706811 |
Medium
| 937 | false | false |
Reorder Data in Log Files
|
reorder-data-in-log-files
|
['Array', 'String', 'Sorting']
| true | false |
87.380421 |
Easy
| 938 | false | false |
Range Sum of BST
|
range-sum-of-bst
|
['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree']
| true | true |
54.86899 |
Medium
| 939 | false | false |
Minimum Area Rectangle
|
minimum-area-rectangle
|
['Array', 'Hash Table', 'Math', 'Geometry', 'Sorting']
| true | false |
43.437298 |
Hard
| 940 | false | false |
Distinct Subsequences II
|
distinct-subsequences-ii
|
['String', 'Dynamic Programming']
| true | true |
33.91261 |
Easy
| 941 | false | false |
Valid Mountain Array
|
valid-mountain-array
|
['Array']
| true | false |
79.792849 |
Easy
| 942 | false | false |
DI String Match
|
di-string-match
|
['Array', 'Two Pointers', 'String', 'Greedy']
| true | false |
44.161772 |
Hard
| 943 | false | false |
Find the Shortest Superstring
|
find-the-shortest-superstring
|
['Array', 'String', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask']
| true | false |
74.715737 |
Easy
| 944 | false | false |
Delete Columns to Make Sorted
|
delete-columns-to-make-sorted
|
['Array', 'String']
| true | false |
60.265956 |
Medium
| 945 | false | false |
Minimum Increment to Make Array Unique
|
minimum-increment-to-make-array-unique
|
['Array', 'Greedy', 'Sorting', 'Counting']
| true | false |
69.600582 |
Medium
| 946 | false | false |
Validate Stack Sequences
|
validate-stack-sequences
|
['Array', 'Stack', 'Simulation']
| true | false |
62.109197 |
Medium
| 947 | false | false |
Most Stones Removed with Same Row or Column
|
most-stones-removed-with-same-row-or-column
|
['Hash Table', 'Depth-First Search', 'Union Find', 'Graph']
| true | false |
59.093552 |
Medium
| 948 | false | false |
Bag of Tokens
|
bag-of-tokens
|
['Array', 'Two Pointers', 'Greedy', 'Sorting']
| true | false |
35.463833 |
Medium
| 949 | false | false |
Largest Time for Given Digits
|
largest-time-for-given-digits
|
['Array', 'String', 'Backtracking', 'Enumeration']
| true | false |
83.175455 |
Medium
| 950 | false | false |
Reveal Cards In Increasing Order
|
reveal-cards-in-increasing-order
|
['Array', 'Queue', 'Sorting', 'Simulation']
| true | false |
69.709017 |
Medium
| 951 | false | false |
Flip Equivalent Binary Trees
|
flip-equivalent-binary-trees
|
['Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
41.013657 |
Hard
| 952 | false | false |
Largest Component Size by Common Factor
|
largest-component-size-by-common-factor
|
['Array', 'Hash Table', 'Math', 'Union Find', 'Number Theory']
| true | false |
55.485487 |
Easy
| 953 | false | false |
Verifying an Alien Dictionary
|
verifying-an-alien-dictionary
|
['Array', 'Hash Table', 'String']
| true | false |
39.329844 |
Medium
| 954 | false | false |
Array of Doubled Pairs
|
array-of-doubled-pairs
|
['Array', 'Hash Table', 'Greedy', 'Sorting']
| true | false |
35.474709 |
Medium
| 955 | false | false |
Delete Columns to Make Sorted II
|
delete-columns-to-make-sorted-ii
|
['Array', 'String', 'Greedy']
| true | false |
51.912751 |
Hard
| 956 | false | false |
Tallest Billboard
|
tallest-billboard
|
['Array', 'Dynamic Programming']
| true | false |
38.942962 |
Medium
| 957 | false | false |
Prison Cells After N Days
|
prison-cells-after-n-days
|
['Array', 'Hash Table', 'Math', 'Bit Manipulation']
| true | false |
58.135398 |
Medium
| 958 | false | false |
Check Completeness of a Binary Tree
|
check-completeness-of-a-binary-tree
|
['Tree', 'Breadth-First Search', 'Binary Tree']
| true | false |
77.644808 |
Medium
| 959 | false | false |
Regions Cut By Slashes
|
regions-cut-by-slashes
|
['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix']
| true | false |
58.393489 |
Hard
| 960 | false | false |
Delete Columns to Make Sorted III
|
delete-columns-to-make-sorted-iii
|
['Array', 'String', 'Dynamic Programming']
| true | false |
77.328792 |
Easy
| 961 | false | false |
N-Repeated Element in Size 2N Array
|
n-repeated-element-in-size-2n-array
|
['Array', 'Hash Table']
| true | false |
55.632116 |
Medium
| 962 | false | false |
Maximum Width Ramp
|
maximum-width-ramp
|
['Array', 'Two Pointers', 'Stack', 'Monotonic Stack']
| true | false |
55.424734 |
Medium
| 963 | false | false |
Minimum Area Rectangle II
|
minimum-area-rectangle-ii
|
['Array', 'Math', 'Geometry']
| true | false |
48.433549 |
Hard
| 964 | false | false |
Least Operators to Express Number
|
least-operators-to-express-number
|
['Math', 'Dynamic Programming', 'Memoization']
| true | false |
71.900979 |
Easy
| 965 | false | false |
Univalued Binary Tree
|
univalued-binary-tree
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
51.502352 |
Medium
| 966 | false | false |
Vowel Spellchecker
|
vowel-spellchecker
|
['Array', 'Hash Table', 'String']
| true | false |
58.604903 |
Medium
| 967 | false | false |
Numbers With Same Consecutive Differences
|
numbers-with-same-consecutive-differences
|
['Backtracking', 'Breadth-First Search']
| true | false |
47.024391 |
Hard
| 968 | false | false |
Binary Tree Cameras
|
binary-tree-cameras
|
['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
71.044686 |
Medium
| 969 | false | false |
Pancake Sorting
|
pancake-sorting
|
['Array', 'Two Pointers', 'Greedy', 'Sorting']
| true | false |
43.917872 |
Medium
| 970 | false | false |
Powerful Integers
|
powerful-integers
|
['Hash Table', 'Math', 'Enumeration']
| true | false |
50.929121 |
Medium
| 971 | false | false |
Flip Binary Tree To Match Preorder Traversal
|
flip-binary-tree-to-match-preorder-traversal
|
['Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
44.470357 |
Hard
| 972 | false | false |
Equal Rational Numbers
|
equal-rational-numbers
|
['Math', 'String']
| true | false |
67.681118 |
Medium
| 973 | false | false |
K Closest Points to Origin
|
k-closest-points-to-origin
|
['Array', 'Math', 'Divide and Conquer', 'Geometry', 'Sorting', 'Heap (Priority Queue)', 'Quickselect']
| true | true |
55.559222 |
Medium
| 974 | false | false |
Subarray Sums Divisible by K
|
subarray-sums-divisible-by-k
|
['Array', 'Hash Table', 'Prefix Sum']
| true | false |
40.621479 |
Hard
| 975 | false | false |
Odd Even Jump
|
odd-even-jump
|
['Array', 'Dynamic Programming', 'Stack', 'Monotonic Stack', 'Ordered Set']
| true | false |
57.125393 |
Easy
| 976 | false | false |
Largest Perimeter Triangle
|
largest-perimeter-triangle
|
['Array', 'Math', 'Greedy', 'Sorting']
| true | false |
73.129364 |
Easy
| 977 | false | false |
Squares of a Sorted Array
|
squares-of-a-sorted-array
|
['Array', 'Two Pointers', 'Sorting']
| true | true |
47.852458 |
Medium
| 978 | false | false |
Longest Turbulent Subarray
|
longest-turbulent-subarray
|
['Array', 'Dynamic Programming', 'Sliding Window']
| true | false |
77.11491 |
Medium
| 979 | false | false |
Distribute Coins in Binary Tree
|
distribute-coins-in-binary-tree
|
['Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
82.243294 |
Hard
| 980 | false | false |
Unique Paths III
|
unique-paths-iii
|
['Array', 'Backtracking', 'Bit Manipulation', 'Matrix']
| true | false |
49.393764 |
Medium
| 981 | false | false |
Time Based Key-Value Store
|
time-based-key-value-store
|
['Hash Table', 'String', 'Binary Search', 'Design']
| true | false |
59.12237 |
Hard
| 982 | false | false |
Triples with Bitwise AND Equal To Zero
|
triples-with-bitwise-and-equal-to-zero
|
['Array', 'Hash Table', 'Bit Manipulation']
| false | false |
67.399504 |
Medium
| 983 | false | false |
Minimum Cost For Tickets
|
minimum-cost-for-tickets
|
['Array', 'Dynamic Programming']
| true | false |
44.387098 |
Medium
| 984 | false | false |
String Without AAA or BBB
|
string-without-aaa-or-bbb
|
['String', 'Greedy']
| true | false |
68.425196 |
Medium
| 985 | false | false |
Sum of Even Numbers After Queries
|
sum-of-even-numbers-after-queries
|
['Array', 'Simulation']
| true | false |
72.529394 |
Medium
| 986 | false | false |
Interval List Intersections
|
interval-list-intersections
|
['Array', 'Two Pointers', 'Line Sweep']
| true | false |
50.681343 |
Hard
| 987 | false | false |
Vertical Order Traversal of a Binary Tree
|
vertical-order-traversal-of-a-binary-tree
|
['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Sorting', 'Binary Tree']
| true | true |
60.709675 |
Medium
| 988 | false | false |
Smallest String Starting From Leaf
|
smallest-string-starting-from-leaf
|
['String', 'Backtracking', 'Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
44.993705 |
Easy
| 989 | false | false |
Add to Array-Form of Integer
|
add-to-array-form-of-integer
|
['Array', 'Math']
| true | false |
50.905062 |
Medium
| 990 | false | false |
Satisfiability of Equality Equations
|
satisfiability-of-equality-equations
|
['Array', 'String', 'Union Find', 'Graph']
| true | false |
55.003515 |
Medium
| 991 | false | false |
Broken Calculator
|
broken-calculator
|
['Math', 'Greedy']
| true | false |
65.351532 |
Hard
| 992 | false | false |
Subarrays with K Different Integers
|
subarrays-with-k-different-integers
|
['Array', 'Hash Table', 'Sliding Window', 'Counting']
| true | false |
57.854906 |
Easy
| 993 | false | false |
Cousins in Binary Tree
|
cousins-in-binary-tree
|
['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree']
| true | false |
56.168528 |
Medium
| 994 | false | false |
Rotting Oranges
|
rotting-oranges
|
['Array', 'Breadth-First Search', 'Matrix']
| true | false |
62.141624 |
Hard
| 995 | false | false |
Minimum Number of K Consecutive Bit Flips
|
minimum-number-of-k-consecutive-bit-flips
|
['Array', 'Bit Manipulation', 'Queue', 'Sliding Window', 'Prefix Sum']
| true | false |
50.395917 |
Hard
| 996 | false | false |
Number of Squareful Arrays
|
number-of-squareful-arrays
|
['Array', 'Hash Table', 'Math', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']
| true | false |
49.908667 |
Easy
| 997 | false | false |
Find the Town Judge
|
find-the-town-judge
|
['Array', 'Hash Table', 'Graph']
| true | false |
68.922884 |
Medium
| 998 | false | false |
Maximum Binary Tree II
|
maximum-binary-tree-ii
|
['Tree', 'Binary Tree']
| false | false |
70.130958 |
Easy
| 999 | false | false |
Available Captures for Rook
|
available-captures-for-rook
|
['Array', 'Matrix', 'Simulation']
| false | false |
44.100213 |
Hard
| 1,000 | false | false |
Minimum Cost to Merge Stones
|
minimum-cost-to-merge-stones
|
['Array', 'Dynamic Programming', 'Prefix Sum']
| false | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.