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 |
---|---|---|---|---|---|---|---|---|---|
37.801336 | Hard | 1,001 | false | false | Grid Illumination | grid-illumination | ['Array', 'Hash Table'] | false | false |
74.510122 | Easy | 1,002 | false | false | Find Common Characters | find-common-characters | ['Array', 'Hash Table', 'String'] | true | false |
59.955715 | Medium | 1,003 | false | false | Check If Word Is Valid After Substitutions | check-if-word-is-valid-after-substitutions | ['String', 'Stack'] | false | false |
65.47933 | Medium | 1,004 | false | false | Max Consecutive Ones III | max-consecutive-ones-iii | ['Array', 'Binary Search', 'Sliding Window', 'Prefix Sum'] | true | false |
52.089068 | Easy | 1,005 | false | false | Maximize Sum Of Array After K Negations | maximize-sum-of-array-after-k-negations | ['Array', 'Greedy', 'Sorting'] | false | false |
58.862737 | Medium | 1,006 | false | false | Clumsy Factorial | clumsy-factorial | ['Math', 'Stack', 'Simulation'] | false | false |
52.285141 | Medium | 1,007 | false | false | Minimum Domino Rotations For Equal Row | minimum-domino-rotations-for-equal-row | ['Array', 'Greedy'] | true | false |
83.050296 | Medium | 1,008 | false | false | Construct Binary Search Tree from Preorder Traversal | construct-binary-search-tree-from-preorder-traversal | ['Array', 'Stack', 'Tree', 'Binary Search Tree', 'Monotonic Stack', 'Binary Tree'] | true | false |
60.749959 | Easy | 1,009 | false | false | Complement of Base 10 Integer | complement-of-base-10-integer | ['Bit Manipulation'] | true | false |
53.184965 | Medium | 1,010 | false | false | Pairs of Songs With Total Durations Divisible by 60 | pairs-of-songs-with-total-durations-divisible-by-60 | ['Array', 'Hash Table', 'Counting'] | true | true |
71.611723 | Medium | 1,011 | false | false | Capacity To Ship Packages Within D Days | capacity-to-ship-packages-within-d-days | ['Array', 'Binary Search'] | true | false |
42.902618 | Hard | 1,012 | false | false | Numbers With Repeated Digits | numbers-with-repeated-digits | ['Math', 'Dynamic Programming'] | false | false |
41.990014 | Easy | 1,013 | false | false | Partition Array Into Three Parts With Equal Sum | partition-array-into-three-parts-with-equal-sum | ['Array', 'Greedy'] | false | false |
62.604491 | Medium | 1,014 | false | false | Best Sightseeing Pair | best-sightseeing-pair | ['Array', 'Dynamic Programming'] | true | false |
46.512538 | Medium | 1,015 | false | false | Smallest Integer Divisible by K | smallest-integer-divisible-by-k | ['Hash Table', 'Math'] | true | false |
57.887804 | Medium | 1,016 | false | false | Binary String With Substrings Representing 1 To N | binary-string-with-substrings-representing-1-to-n | ['String'] | false | false |
61.114299 | Medium | 1,017 | false | false | Convert to Base -2 | convert-to-base-2 | ['Math'] | false | false |
46.903261 | Easy | 1,018 | false | false | Binary Prefix Divisible By 5 | binary-prefix-divisible-by-5 | ['Array', 'Bit Manipulation'] | false | false |
61.985471 | Medium | 1,019 | false | false | Next Greater Node In Linked List | next-greater-node-in-linked-list | ['Array', 'Linked List', 'Stack', 'Monotonic Stack'] | true | false |
70.154432 | Medium | 1,020 | false | false | Number of Enclaves | number-of-enclaves | ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'] | true | false |
85.149582 | Easy | 1,021 | false | false | Remove Outermost Parentheses | remove-outermost-parentheses | ['String', 'Stack'] | false | false |
73.3207 | Easy | 1,022 | false | false | Sum of Root To Leaf Binary Numbers | sum-of-root-to-leaf-binary-numbers | ['Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
63.442474 | Medium | 1,023 | false | false | Camelcase Matching | camelcase-matching | ['Array', 'Two Pointers', 'String', 'Trie', 'String Matching'] | false | false |
51.839469 | Medium | 1,024 | false | false | Video Stitching | video-stitching | ['Array', 'Dynamic Programming', 'Greedy'] | false | false |
70.042971 | Easy | 1,025 | false | false | Divisor Game | divisor-game | ['Math', 'Dynamic Programming', 'Brainteaser', 'Game Theory'] | false | false |
78.04519 | Medium | 1,026 | false | false | Maximum Difference Between Node and Ancestor | maximum-difference-between-node-and-ancestor | ['Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
49.39246 | Medium | 1,027 | false | false | Longest Arithmetic Subsequence | longest-arithmetic-subsequence | ['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming'] | true | false |
83.261514 | Hard | 1,028 | false | false | Recover a Tree From Preorder Traversal | recover-a-tree-from-preorder-traversal | ['String', 'Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
67.514478 | Medium | 1,029 | false | false | Two City Scheduling | two-city-scheduling | ['Array', 'Greedy', 'Sorting'] | true | false |
72.462606 | Easy | 1,030 | false | false | Matrix Cells in Distance Order | matrix-cells-in-distance-order | ['Array', 'Math', 'Geometry', 'Sorting', 'Matrix'] | false | false |
60.118363 | Medium | 1,031 | false | false | Maximum Sum of Two Non-Overlapping Subarrays | maximum-sum-of-two-non-overlapping-subarrays | ['Array', 'Dynamic Programming', 'Sliding Window'] | false | false |
52.346793 | Hard | 1,032 | false | false | Stream of Characters | stream-of-characters | ['Array', 'String', 'Design', 'Trie', 'Data Stream'] | true | false |
49.194982 | Medium | 1,033 | false | false | Moving Stones Until Consecutive | moving-stones-until-consecutive | ['Math', 'Brainteaser'] | false | false |
49.593729 | Medium | 1,034 | false | false | Coloring A Border | coloring-a-border | ['Array', 'Depth-First Search', 'Breadth-First Search', 'Matrix'] | false | false |
64.075799 | Medium | 1,035 | false | false | Uncrossed Lines | uncrossed-lines | ['Array', 'Dynamic Programming'] | true | false |
35.182855 | Hard | 1,036 | false | false | Escape a Large Maze | escape-a-large-maze | ['Array', 'Hash Table', 'Depth-First Search', 'Breadth-First Search'] | false | false |
37.726123 | Easy | 1,037 | false | false | Valid Boomerang | valid-boomerang | ['Array', 'Math', 'Geometry'] | false | false |
88.225148 | Medium | 1,038 | false | false | Binary Search Tree to Greater Sum Tree | binary-search-tree-to-greater-sum-tree | ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'] | true | false |
59.948048 | Medium | 1,039 | false | false | Minimum Score Triangulation of Polygon | minimum-score-triangulation-of-polygon | ['Array', 'Dynamic Programming'] | false | false |
56.957406 | Medium | 1,040 | false | false | Moving Stones Until Consecutive II | moving-stones-until-consecutive-ii | ['Array', 'Math', 'Two Pointers', 'Sorting'] | false | false |
56.158563 | Medium | 1,041 | false | false | Robot Bounded In Circle | robot-bounded-in-circle | ['Math', 'String', 'Simulation'] | true | false |
52.109604 | Medium | 1,042 | false | false | Flower Planting With No Adjacent | flower-planting-with-no-adjacent | ['Depth-First Search', 'Breadth-First Search', 'Graph'] | false | false |
76.868041 | Medium | 1,043 | false | false | Partition Array for Maximum Sum | partition-array-for-maximum-sum | ['Array', 'Dynamic Programming'] | true | false |
30.682758 | Hard | 1,044 | false | false | Longest Duplicate Substring | longest-duplicate-substring | ['String', 'Binary Search', 'Sliding Window', 'Rolling Hash', 'Suffix Array', 'Hash Function'] | true | false |
62.955058 | Medium | 1,045 | false | false | Customers Who Bought All Products | customers-who-bought-all-products | ['Database'] | true | false |
65.825005 | Easy | 1,046 | false | false | Last Stone Weight | last-stone-weight | ['Array', 'Heap (Priority Queue)'] | true | false |
71.222587 | Easy | 1,047 | false | false | Remove All Adjacent Duplicates In String | remove-all-adjacent-duplicates-in-string | ['String', 'Stack'] | true | false |
61.786982 | Medium | 1,048 | false | false | Longest String Chain | longest-string-chain | ['Array', 'Hash Table', 'Two Pointers', 'String', 'Dynamic Programming', 'Sorting'] | true | false |
57.128321 | Medium | 1,049 | false | false | Last Stone Weight II | last-stone-weight-ii | ['Array', 'Dynamic Programming'] | false | false |
70.512122 | Easy | 1,050 | false | false | Actors and Directors Who Cooperated At Least Three Times | actors-and-directors-who-cooperated-at-least-three-times | ['Database'] | true | false |
81.053775 | Easy | 1,051 | false | false | Height Checker | height-checker | ['Array', 'Sorting', 'Counting Sort'] | true | false |
64.085173 | Medium | 1,052 | false | false | Grumpy Bookstore Owner | grumpy-bookstore-owner | ['Array', 'Sliding Window'] | true | false |
49.409367 | Medium | 1,053 | false | false | Previous Permutation With One Swap | previous-permutation-with-one-swap | ['Array', 'Greedy'] | false | false |
47.243028 | Medium | 1,054 | false | false | Distant Barcodes | distant-barcodes | ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)', 'Counting'] | false | false |
61.230771 | Medium | 1,055 | false | true | Shortest Way to Form String | shortest-way-to-form-string | ['Two Pointers', 'String', 'Binary Search', 'Greedy'] | true | false |
49.180754 | Easy | 1,056 | false | true | Confusing Number | confusing-number | ['Math'] | true | true |
58.896384 | Medium | 1,057 | false | true | Campus Bikes | campus-bikes | ['Array', 'Sorting', 'Heap (Priority Queue)'] | true | false |
45.362886 | Medium | 1,058 | false | true | Minimize Rounding Error to Meet Target | minimize-rounding-error-to-meet-target | ['Array', 'Math', 'String', 'Greedy', 'Sorting'] | false | false |
37.088876 | Medium | 1,059 | false | true | All Paths from Source Lead to Destination | all-paths-from-source-lead-to-destination | ['Graph', 'Topological Sort'] | true | true |
58.347196 | Medium | 1,060 | false | true | Missing Element in Sorted Array | missing-element-in-sorted-array | ['Array', 'Binary Search'] | true | false |
76.559806 | Medium | 1,061 | false | false | Lexicographically Smallest Equivalent String | lexicographically-smallest-equivalent-string | ['String', 'Union Find'] | true | false |
62.909151 | Medium | 1,062 | false | true | Longest Repeating Substring | longest-repeating-substring | ['String', 'Binary Search', 'Dynamic Programming', 'Rolling Hash', 'Suffix Array', 'Hash Function'] | true | false |
79.13196 | Hard | 1,063 | false | true | Number of Valid Subarrays | number-of-valid-subarrays | ['Array', 'Stack', 'Monotonic Stack'] | true | false |
63.932341 | Easy | 1,064 | false | true | Fixed Point | fixed-point | ['Array', 'Binary Search'] | true | false |
68.109298 | Easy | 1,065 | false | true | Index Pairs of a String | index-pairs-of-a-string | ['Array', 'String', 'Trie', 'Sorting'] | true | false |
55.260356 | Medium | 1,066 | false | true | Campus Bikes II | campus-bikes-ii | ['Array', 'Dynamic Programming', 'Backtracking', 'Bit Manipulation', 'Bitmask'] | true | false |
45.995591 | Hard | 1,067 | false | true | Digit Count in Range | digit-count-in-range | ['Math', 'Dynamic Programming'] | false | false |
84.235677 | Easy | 1,068 | false | false | Product Sales Analysis I | product-sales-analysis-i | ['Database'] | true | false |
82.107763 | Easy | 1,069 | false | true | Product Sales Analysis II | product-sales-analysis-ii | ['Database'] | true | false |
44.068546 | Medium | 1,070 | false | false | Product Sales Analysis III | product-sales-analysis-iii | ['Database'] | true | false |
52.699005 | Easy | 1,071 | false | false | Greatest Common Divisor of Strings | greatest-common-divisor-of-strings | ['Math', 'String'] | true | false |
78.484081 | Medium | 1,072 | false | false | Flip Columns For Maximum Number of Equal Rows | flip-columns-for-maximum-number-of-equal-rows | ['Array', 'Hash Table', 'Matrix'] | true | false |
36.773422 | Medium | 1,073 | false | false | Adding Two Negabinary Numbers | adding-two-negabinary-numbers | ['Array', 'Math'] | false | false |
74.413375 | Hard | 1,074 | false | false | Number of Submatrices That Sum to Target | number-of-submatrices-that-sum-to-target | ['Array', 'Hash Table', 'Matrix', 'Prefix Sum'] | true | false |
65.272423 | Easy | 1,075 | false | false | Project Employees I | project-employees-i | ['Database'] | true | false |
50.222885 | Easy | 1,076 | false | true | Project Employees II | project-employees-ii | ['Database'] | false | false |
77.063542 | Medium | 1,077 | false | true | Project Employees III | project-employees-iii | ['Database'] | true | false |
63.622528 | Easy | 1,078 | false | false | Occurrences After Bigram | occurrences-after-bigram | ['String'] | false | false |
83.528338 | Medium | 1,079 | false | false | Letter Tile Possibilities | letter-tile-possibilities | ['Hash Table', 'String', 'Backtracking', 'Counting'] | true | false |
57.567456 | Medium | 1,080 | false | false | Insufficient Nodes in Root to Leaf Paths | insufficient-nodes-in-root-to-leaf-paths | ['Tree', 'Depth-First Search', 'Binary Tree'] | false | false |
61.727157 | Medium | 1,081 | false | false | Smallest Subsequence of Distinct Characters | smallest-subsequence-of-distinct-characters | ['String', 'Stack', 'Greedy', 'Monotonic Stack'] | false | false |
74.655654 | Easy | 1,082 | false | true | Sales Analysis I | sales-analysis-i | ['Database'] | true | false |
49.883163 | Easy | 1,083 | false | true | Sales Analysis II | sales-analysis-ii | ['Database'] | true | false |
46.655884 | Easy | 1,084 | false | false | Sales Analysis III | sales-analysis-iii | ['Database'] | true | false |
76.574307 | Easy | 1,085 | false | true | Sum of Digits in the Minimum Number | sum-of-digits-in-the-minimum-number | ['Array', 'Math'] | false | false |
74.39961 | Easy | 1,086 | false | true | High Five | high-five | ['Array', 'Hash Table', 'Sorting', 'Heap (Priority Queue)'] | true | false |
66.653642 | Medium | 1,087 | false | true | Brace Expansion | brace-expansion | ['String', 'Backtracking', 'Breadth-First Search'] | true | false |
47.082985 | Hard | 1,088 | false | true | Confusing Number II | confusing-number-ii | ['Math', 'Backtracking'] | true | false |
52.644773 | Easy | 1,089 | false | false | Duplicate Zeros | duplicate-zeros | ['Array', 'Two Pointers'] | true | false |
62.923254 | Medium | 1,090 | false | false | Largest Values From Labels | largest-values-from-labels | ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Counting'] | false | false |
49.339373 | Medium | 1,091 | false | false | Shortest Path in Binary Matrix | shortest-path-in-binary-matrix | ['Array', 'Breadth-First Search', 'Matrix'] | true | false |
61.262654 | Hard | 1,092 | false | false | Shortest Common Supersequence | shortest-common-supersequence | ['String', 'Dynamic Programming'] | true | false |
42.156384 | Medium | 1,093 | false | false | Statistics from a Large Sample | statistics-from-a-large-sample | ['Array', 'Math', 'Probability and Statistics'] | false | false |
55.978471 | Medium | 1,094 | false | false | Car Pooling | car-pooling | ['Array', 'Sorting', 'Heap (Priority Queue)', 'Simulation', 'Prefix Sum'] | true | false |
40.253532 | Hard | 1,095 | false | false | Find in Mountain Array | find-in-mountain-array | ['Array', 'Binary Search', 'Interactive'] | true | false |
63.14611 | Hard | 1,096 | false | false | Brace Expansion II | brace-expansion-ii | ['String', 'Backtracking', 'Stack', 'Breadth-First Search'] | false | false |
50.782582 | Hard | 1,097 | false | true | Game Play Analysis V | game-play-analysis-v | ['Database'] | true | false |
43.305116 | Medium | 1,098 | false | true | Unpopular Books | unpopular-books | ['Database'] | false | false |
61.981729 | Easy | 1,099 | false | true | Two Sum Less Than K | two-sum-less-than-k | ['Array', 'Two Pointers', 'Binary Search', 'Sorting'] | true | true |
76.220804 | Medium | 1,100 | false | true | Find K-Length Substrings With No Repeated Characters | find-k-length-substrings-with-no-repeated-characters | ['Hash Table', 'String', 'Sliding Window'] | true | false |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.