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 |
---|---|---|---|---|---|---|---|---|---|
51.342193 |
Medium
| 2,001 | false | false |
Number of Pairs of Interchangeable Rectangles
|
number-of-pairs-of-interchangeable-rectangles
|
['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory']
| false | false |
61.073814 |
Medium
| 2,002 | false | false |
Maximum Product of the Length of Two Palindromic Subsequences
|
maximum-product-of-the-length-of-two-palindromic-subsequences
|
['String', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask']
| false | false |
46.342414 |
Hard
| 2,003 | false | false |
Smallest Missing Genetic Value in Each Subtree
|
smallest-missing-genetic-value-in-each-subtree
|
['Dynamic Programming', 'Tree', 'Depth-First Search', 'Union Find']
| false | false |
44.854638 |
Hard
| 2,004 | false | true |
The Number of Seniors and Juniors to Join the Company
|
the-number-of-seniors-and-juniors-to-join-the-company
|
['Database']
| true | false |
57.056604 |
Hard
| 2,005 | false | true |
Subtree Removal Game with Fibonacci Tree
|
subtree-removal-game-with-fibonacci-tree
|
['Math', 'Dynamic Programming', 'Tree', 'Binary Tree', 'Game Theory']
| false | false |
84.597816 |
Easy
| 2,006 | false | false |
Count Number of Pairs With Absolute Difference K
|
count-number-of-pairs-with-absolute-difference-k
|
['Array', 'Hash Table', 'Counting']
| false | false |
40.446409 |
Medium
| 2,007 | false | false |
Find Original Array From Doubled Array
|
find-original-array-from-doubled-array
|
['Array', 'Hash Table', 'Greedy', 'Sorting']
| true | false |
44.617026 |
Medium
| 2,008 | false | false |
Maximum Earnings From Taxi
|
maximum-earnings-from-taxi
|
['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Sorting']
| false | false |
52.227617 |
Hard
| 2,009 | false | false |
Minimum Number of Operations to Make Array Continuous
|
minimum-number-of-operations-to-make-array-continuous
|
['Array', 'Hash Table', 'Binary Search', 'Sliding Window']
| true | false |
64.226601 |
Hard
| 2,010 | false | true |
The Number of Seniors and Juniors to Join the Company II
|
the-number-of-seniors-and-juniors-to-join-the-company-ii
|
['Database']
| false | false |
89.51052 |
Easy
| 2,011 | false | false |
Final Value of Variable After Performing Operations
|
final-value-of-variable-after-performing-operations
|
['Array', 'String', 'Simulation']
| false | false |
49.838029 |
Medium
| 2,012 | false | false |
Sum of Beauty in the Array
|
sum-of-beauty-in-the-array
|
['Array']
| false | false |
51.972535 |
Medium
| 2,013 | false | false |
Detect Squares
|
detect-squares
|
['Array', 'Hash Table', 'Design', 'Counting']
| false | false |
53.99126 |
Hard
| 2,014 | false | false |
Longest Subsequence Repeated k Times
|
longest-subsequence-repeated-k-times
|
['String', 'Backtracking', 'Greedy', 'Counting', 'Enumeration']
| false | false |
57.264151 |
Medium
| 2,015 | false | true |
Average Height of Buildings in Each Segment
|
average-height-of-buildings-in-each-segment
|
['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)']
| false | false |
58.887865 |
Easy
| 2,016 | false | false |
Maximum Difference Between Increasing Elements
|
maximum-difference-between-increasing-elements
|
['Array']
| false | false |
61.016483 |
Medium
| 2,017 | false | false |
Grid Game
|
grid-game
|
['Array', 'Matrix', 'Prefix Sum']
| true | false |
49.893063 |
Medium
| 2,018 | false | false |
Check if Word Can Be Placed In Crossword
|
check-if-word-can-be-placed-in-crossword
|
['Array', 'Matrix', 'Enumeration']
| false | false |
32.999757 |
Hard
| 2,019 | false | false |
The Score of Students Solving Math Expression
|
the-score-of-students-solving-math-expression
|
['Array', 'Math', 'String', 'Dynamic Programming', 'Stack', 'Memoization']
| false | false |
72.276466 |
Medium
| 2,020 | false | true |
Number of Accounts That Did Not Stream
|
number-of-accounts-that-did-not-stream
|
['Database']
| false | false |
60.903415 |
Medium
| 2,021 | false | true |
Brightest Position on Street
|
brightest-position-on-street
|
['Array', 'Sorting', 'Prefix Sum', 'Ordered Set']
| false | false |
71.716144 |
Easy
| 2,022 | false | false |
Convert 1D Array Into 2D Array
|
convert-1d-array-into-2d-array
|
['Array', 'Matrix', 'Simulation']
| true | false |
74.744565 |
Medium
| 2,023 | false | false |
Number of Pairs of Strings With Concatenation Equal to Target
|
number-of-pairs-of-strings-with-concatenation-equal-to-target
|
['Array', 'Hash Table', 'String', 'Counting']
| false | false |
68.284768 |
Medium
| 2,024 | false | false |
Maximize the Confusion of an Exam
|
maximize-the-confusion-of-an-exam
|
['String', 'Binary Search', 'Sliding Window', 'Prefix Sum']
| true | false |
34.512023 |
Hard
| 2,025 | false | false |
Maximum Number of Ways to Partition an Array
|
maximum-number-of-ways-to-partition-an-array
|
['Array', 'Hash Table', 'Counting', 'Enumeration', 'Prefix Sum']
| false | false |
84.576086 |
Easy
| 2,026 | false | true |
Low-Quality Problems
|
low-quality-problems
|
['Database']
| false | false |
56.236913 |
Easy
| 2,027 | false | false |
Minimum Moves to Convert String
|
minimum-moves-to-convert-string
|
['String', 'Greedy']
| false | false |
57.395334 |
Medium
| 2,028 | false | false |
Find Missing Observations
|
find-missing-observations
|
['Array', 'Math', 'Simulation']
| true | false |
28.643465 |
Medium
| 2,029 | false | false |
Stone Game IX
|
stone-game-ix
|
['Array', 'Math', 'Greedy', 'Counting', 'Game Theory']
| false | false |
38.730768 |
Hard
| 2,030 | false | false |
Smallest K-Length Subsequence With Occurrences of a Letter
|
smallest-k-length-subsequence-with-occurrences-of-a-letter
|
['String', 'Stack', 'Greedy', 'Monotonic Stack']
| false | false |
51.19294 |
Medium
| 2,031 | false | true |
Count Subarrays With More Ones Than Zeros
|
count-subarrays-with-more-ones-than-zeros
|
['Array', 'Binary Search', 'Divide and Conquer', 'Binary Indexed Tree', 'Segment Tree', 'Merge Sort', 'Ordered Set']
| false | false |
76.232413 |
Easy
| 2,032 | false | false |
Two Out of Three
|
two-out-of-three
|
['Array', 'Hash Table', 'Bit Manipulation']
| false | false |
67.435097 |
Medium
| 2,033 | false | false |
Minimum Operations to Make a Uni-Value Grid
|
minimum-operations-to-make-a-uni-value-grid
|
['Array', 'Math', 'Sorting', 'Matrix']
| true | false |
48.825132 |
Medium
| 2,034 | false | false |
Stock Price Fluctuation
|
stock-price-fluctuation
|
['Hash Table', 'Design', 'Heap (Priority Queue)', 'Data Stream', 'Ordered Set']
| true | false |
21.391969 |
Hard
| 2,035 | false | false |
Partition Array Into Two Arrays to Minimize Sum Difference
|
partition-array-into-two-arrays-to-minimize-sum-difference
|
['Array', 'Two Pointers', 'Binary Search', 'Dynamic Programming', 'Bit Manipulation', 'Ordered Set', 'Bitmask']
| false | false |
39.602791 |
Medium
| 2,036 | false | true |
Maximum Alternating Subarray Sum
|
maximum-alternating-subarray-sum
|
['Array', 'Dynamic Programming']
| false | false |
87.27372 |
Easy
| 2,037 | false | false |
Minimum Number of Moves to Seat Everyone
|
minimum-number-of-moves-to-seat-everyone
|
['Array', 'Greedy', 'Sorting', 'Counting Sort']
| true | false |
62.762366 |
Medium
| 2,038 | false | false |
Remove Colored Pieces if Both Neighbors are the Same Color
|
remove-colored-pieces-if-both-neighbors-are-the-same-color
|
['Math', 'String', 'Greedy', 'Game Theory']
| true | false |
53.23903 |
Medium
| 2,039 | false | false |
The Time When the Network Becomes Idle
|
the-time-when-the-network-becomes-idle
|
['Array', 'Breadth-First Search', 'Graph']
| false | false |
30.350528 |
Hard
| 2,040 | false | false |
Kth Smallest Product of Two Sorted Arrays
|
kth-smallest-product-of-two-sorted-arrays
|
['Array', 'Binary Search']
| false | false |
78.670524 |
Medium
| 2,041 | false | true |
Accepted Candidates From the Interviews
|
accepted-candidates-from-the-interviews
|
['Database']
| true | false |
71.374256 |
Easy
| 2,042 | false | false |
Check if Numbers Are Ascending in a Sentence
|
check-if-numbers-are-ascending-in-a-sentence
|
['String']
| false | false |
63.345176 |
Medium
| 2,043 | false | false |
Simple Bank System
|
simple-bank-system
|
['Array', 'Hash Table', 'Design', 'Simulation']
| false | false |
87.948163 |
Medium
| 2,044 | false | false |
Count Number of Maximum Bitwise-OR Subsets
|
count-number-of-maximum-bitwise-or-subsets
|
['Array', 'Backtracking', 'Bit Manipulation', 'Enumeration']
| true | false |
62.644843 |
Hard
| 2,045 | false | false |
Second Minimum Time to Reach Destination
|
second-minimum-time-to-reach-destination
|
['Breadth-First Search', 'Graph', 'Shortest Path']
| true | false |
66.864854 |
Medium
| 2,046 | false | true |
Sort Linked List Already Sorted Using Absolute Values
|
sort-linked-list-already-sorted-using-absolute-values
|
['Linked List', 'Two Pointers', 'Sorting']
| false | false |
29.739621 |
Easy
| 2,047 | false | false |
Number of Valid Words in a Sentence
|
number-of-valid-words-in-a-sentence
|
['String']
| false | false |
48.935568 |
Medium
| 2,048 | false | false |
Next Greater Numerically Balanced Number
|
next-greater-numerically-balanced-number
|
['Hash Table', 'Math', 'Backtracking', 'Counting', 'Enumeration']
| false | false |
50.839756 |
Medium
| 2,049 | false | false |
Count Nodes With the Highest Score
|
count-nodes-with-the-highest-score
|
['Array', 'Tree', 'Depth-First Search', 'Binary Tree']
| false | false |
66.780013 |
Hard
| 2,050 | false | false |
Parallel Courses III
|
parallel-courses-iii
|
['Array', 'Dynamic Programming', 'Graph', 'Topological Sort']
| true | false |
70.582042 |
Medium
| 2,051 | false | true |
The Category of Each Member in the Store
|
the-category-of-each-member-in-the-store
|
['Database']
| false | false |
50.262617 |
Medium
| 2,052 | false | true |
Minimum Cost to Separate Sentence Into Rows
|
minimum-cost-to-separate-sentence-into-rows
|
['Array', 'Dynamic Programming']
| false | false |
81.980019 |
Easy
| 2,053 | false | false |
Kth Distinct String in an Array
|
kth-distinct-string-in-an-array
|
['Array', 'Hash Table', 'String', 'Counting']
| true | false |
61.073806 |
Medium
| 2,054 | false | false |
Two Best Non-Overlapping Events
|
two-best-non-overlapping-events
|
['Array', 'Binary Search', 'Dynamic Programming', 'Sorting', 'Heap (Priority Queue)']
| true | false |
46.408646 |
Medium
| 2,055 | false | false |
Plates Between Candles
|
plates-between-candles
|
['Array', 'String', 'Binary Search', 'Prefix Sum']
| false | false |
47.485007 |
Hard
| 2,056 | false | false |
Number of Valid Move Combinations On Chessboard
|
number-of-valid-move-combinations-on-chessboard
|
['Array', 'String', 'Backtracking', 'Simulation']
| false | false |
72.397831 |
Easy
| 2,057 | false | false |
Smallest Index With Equal Value
|
smallest-index-with-equal-value
|
['Array']
| false | false |
69.447533 |
Medium
| 2,058 | false | false |
Find the Minimum and Maximum Number of Nodes Between Critical Points
|
find-the-minimum-and-maximum-number-of-nodes-between-critical-points
|
['Linked List']
| true | false |
50.288009 |
Medium
| 2,059 | false | false |
Minimum Operations to Convert Number
|
minimum-operations-to-convert-number
|
['Array', 'Breadth-First Search']
| false | false |
43.022243 |
Hard
| 2,060 | false | false |
Check if an Original String Exists Given Two Encoded Strings
|
check-if-an-original-string-exists-given-two-encoded-strings
|
['String', 'Dynamic Programming']
| false | false |
61.87907 |
Medium
| 2,061 | false | true |
Number of Spaces Cleaning Robot Cleaned
|
number-of-spaces-cleaning-robot-cleaned
|
['Array', 'Matrix', 'Simulation']
| true | false |
70.669262 |
Easy
| 2,062 | false | false |
Count Vowel Substrings of a String
|
count-vowel-substrings-of-a-string
|
['Hash Table', 'String']
| false | false |
54.539697 |
Medium
| 2,063 | false | false |
Vowels of All Substrings
|
vowels-of-all-substrings
|
['Math', 'String', 'Dynamic Programming', 'Combinatorics']
| false | false |
62.541394 |
Medium
| 2,064 | false | false |
Minimized Maximum of Products Distributed to Any Store
|
minimized-maximum-of-products-distributed-to-any-store
|
['Array', 'Binary Search', 'Greedy']
| true | false |
59.395578 |
Hard
| 2,065 | false | false |
Maximum Path Quality of a Graph
|
maximum-path-quality-of-a-graph
|
['Array', 'Backtracking', 'Graph']
| false | false |
82.242785 |
Medium
| 2,066 | false | true |
Account Balance
|
account-balance
|
['Database']
| false | false |
44.626106 |
Medium
| 2,067 | false | true |
Number of Equal Count Substrings
|
number-of-equal-count-substrings
|
['Hash Table', 'String', 'Sliding Window', 'Counting']
| false | false |
63.631719 |
Easy
| 2,068 | false | false |
Check Whether Two Strings are Almost Equivalent
|
check-whether-two-strings-are-almost-equivalent
|
['Hash Table', 'String', 'Counting']
| true | false |
26.678712 |
Medium
| 2,069 | false | false |
Walking Robot Simulation II
|
walking-robot-simulation-ii
|
['Design', 'Simulation']
| false | false |
62.048059 |
Medium
| 2,070 | false | false |
Most Beautiful Item for Each Query
|
most-beautiful-item-for-each-query
|
['Array', 'Binary Search', 'Sorting']
| true | false |
34.46208 |
Hard
| 2,071 | false | false |
Maximum Number of Tasks You Can Assign
|
maximum-number-of-tasks-you-can-assign
|
['Array', 'Binary Search', 'Greedy', 'Queue', 'Sorting', 'Monotonic Queue']
| false | false |
75.317949 |
Easy
| 2,072 | false | true |
The Winner University
|
the-winner-university
|
['Database']
| true | false |
70.463366 |
Easy
| 2,073 | false | false |
Time Needed to Buy Tickets
|
time-needed-to-buy-tickets
|
['Array', 'Queue', 'Simulation']
| true | false |
60.278623 |
Medium
| 2,074 | false | false |
Reverse Nodes in Even Length Groups
|
reverse-nodes-in-even-length-groups
|
['Linked List']
| false | false |
48.957439 |
Medium
| 2,075 | false | false |
Decode the Slanted Ciphertext
|
decode-the-slanted-ciphertext
|
['String', 'Simulation']
| false | false |
56.675998 |
Hard
| 2,076 | false | false |
Process Restricted Friend Requests
|
process-restricted-friend-requests
|
['Union Find', 'Graph']
| false | false |
55.844809 |
Medium
| 2,077 | false | true |
Paths in Maze That Lead to Same Room
|
paths-in-maze-that-lead-to-same-room
|
['Graph']
| false | false |
65.484948 |
Easy
| 2,078 | false | false |
Two Furthest Houses With Different Colors
|
two-furthest-houses-with-different-colors
|
['Array', 'Greedy']
| false | false |
79.934241 |
Medium
| 2,079 | false | false |
Watering Plants
|
watering-plants
|
['Array', 'Simulation']
| false | false |
41.443979 |
Medium
| 2,080 | false | false |
Range Frequency Queries
|
range-frequency-queries
|
['Array', 'Hash Table', 'Binary Search', 'Design', 'Segment Tree']
| false | false |
41.407512 |
Hard
| 2,081 | false | false |
Sum of k-Mirror Numbers
|
sum-of-k-mirror-numbers
|
['Math', 'Enumeration']
| false | false |
77.518549 |
Easy
| 2,082 | false | true |
The Number of Rich Customers
|
the-number-of-rich-customers
|
['Database']
| true | false |
74.181939 |
Medium
| 2,083 | false | true |
Substrings That Begin and End With the Same Letter
|
substrings-that-begin-and-end-with-the-same-letter
|
['Hash Table', 'Math', 'String', 'Counting', 'Prefix Sum']
| true | false |
87.197491 |
Medium
| 2,084 | false | true |
Drop Type 1 Orders for Customers With Type 0 Orders
|
drop-type-1-orders-for-customers-with-type-0-orders
|
['Database']
| false | false |
72.094484 |
Easy
| 2,085 | false | false |
Count Common Words With One Occurrence
|
count-common-words-with-one-occurrence
|
['Array', 'Hash Table', 'String', 'Counting']
| false | false |
46.819521 |
Medium
| 2,086 | false | false |
Minimum Number of Food Buckets to Feed the Hamsters
|
minimum-number-of-food-buckets-to-feed-the-hamsters
|
['String', 'Dynamic Programming', 'Greedy']
| false | false |
50.9933 |
Medium
| 2,087 | false | false |
Minimum Cost Homecoming of a Robot in a Grid
|
minimum-cost-homecoming-of-a-robot-in-a-grid
|
['Array', 'Greedy']
| false | false |
65.16 |
Hard
| 2,088 | false | false |
Count Fertile Pyramids in a Land
|
count-fertile-pyramids-in-a-land
|
['Array', 'Dynamic Programming', 'Matrix']
| false | false |
77.104953 |
Easy
| 2,089 | false | false |
Find Target Indices After Sorting Array
|
find-target-indices-after-sorting-array
|
['Array', 'Binary Search', 'Sorting']
| false | false |
45.966997 |
Medium
| 2,090 | false | false |
K Radius Subarray Averages
|
k-radius-subarray-averages
|
['Array', 'Sliding Window']
| true | false |
55.014227 |
Medium
| 2,091 | false | false |
Removing Minimum and Maximum From Array
|
removing-minimum-and-maximum-from-array
|
['Array', 'Greedy']
| false | false |
45.346111 |
Hard
| 2,092 | false | false |
Find All People With Secret
|
find-all-people-with-secret
|
['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Sorting']
| true | false |
59.858734 |
Medium
| 2,093 | false | true |
Minimum Cost to Reach City With Discounts
|
minimum-cost-to-reach-city-with-discounts
|
['Graph', 'Heap (Priority Queue)', 'Shortest Path']
| true | false |
63.640386 |
Easy
| 2,094 | false | false |
Finding 3-Digit Even Numbers
|
finding-3-digit-even-numbers
|
['Array', 'Hash Table', 'Sorting', 'Enumeration']
| false | false |
59.60572 |
Medium
| 2,095 | false | false |
Delete the Middle Node of a Linked List
|
delete-the-middle-node-of-a-linked-list
|
['Linked List', 'Two Pointers']
| true | false |
56.257534 |
Medium
| 2,096 | false | false |
Step-By-Step Directions From a Binary Tree Node to Another
|
step-by-step-directions-from-a-binary-tree-node-to-another
|
['String', 'Tree', 'Depth-First Search', 'Binary Tree']
| true | false |
66.358234 |
Hard
| 2,097 | false | false |
Valid Arrangement of Pairs
|
valid-arrangement-of-pairs
|
['Depth-First Search', 'Graph', 'Eulerian Circuit']
| true | false |
35.597047 |
Medium
| 2,098 | false | true |
Subsequence of Size K With the Largest Even Sum
|
subsequence-of-size-k-with-the-largest-even-sum
|
['Array', 'Greedy', 'Sorting']
| false | false |
45.104107 |
Easy
| 2,099 | false | false |
Find Subsequence of Length K With the Largest Sum
|
find-subsequence-of-length-k-with-the-largest-sum
|
['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)']
| false | false |
50.045301 |
Medium
| 2,100 | false | false |
Find Good Days to Rob the Bank
|
find-good-days-to-rob-the-bank
|
['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.