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 |
---|---|---|---|---|---|---|---|---|---|
65.632752 | Medium | 1,101 | false | true | The Earliest Moment When Everyone Become Friends | the-earliest-moment-when-everyone-become-friends | ['Array', 'Union Find', 'Sorting'] | true | false |
53.933782 | Medium | 1,102 | false | true | Path With Maximum Minimum Value | path-with-maximum-minimum-value | ['Array', 'Binary Search', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Heap (Priority Queue)', 'Matrix'] | true | false |
66.158127 | Easy | 1,103 | false | false | Distribute Candies to People | distribute-candies-to-people | ['Math', 'Simulation'] | true | false |
75.433971 | Medium | 1,104 | false | false | Path In Zigzag Labelled Binary Tree | path-in-zigzag-labelled-binary-tree | ['Math', 'Tree', 'Binary Tree'] | false | false |
68.700381 | Medium | 1,105 | false | false | Filling Bookcase Shelves | filling-bookcase-shelves | ['Array', 'Dynamic Programming'] | true | false |
69.989852 | Hard | 1,106 | false | false | Parsing A Boolean Expression | parsing-a-boolean-expression | ['String', 'Stack', 'Recursion'] | true | false |
44.931409 | Medium | 1,107 | false | true | New Users Daily Count | new-users-daily-count | ['Database'] | true | false |
89.606996 | Easy | 1,108 | false | false | Defanging an IP Address | defanging-an-ip-address | ['String'] | false | false |
63.799944 | Medium | 1,109 | false | false | Corporate Flight Bookings | corporate-flight-bookings | ['Array', 'Prefix Sum'] | false | false |
72.422547 | Medium | 1,110 | false | false | Delete Nodes And Return Forest | delete-nodes-and-return-forest | ['Array', 'Hash Table', 'Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
71.311377 | Medium | 1,111 | false | false | Maximum Nesting Depth of Two Valid Parentheses Strings | maximum-nesting-depth-of-two-valid-parentheses-strings | ['String', 'Stack'] | false | false |
71.09009 | Medium | 1,112 | false | true | Highest Grade For Each Student | highest-grade-for-each-student | ['Database'] | true | false |
65.100093 | Easy | 1,113 | false | true | Reported Posts | reported-posts | ['Database'] | true | false |
70.840843 | Easy | 1,114 | false | false | Print in Order | print-in-order | ['Concurrency'] | true | false |
68.914533 | Medium | 1,115 | false | false | Print FooBar Alternately | print-foobar-alternately | ['Concurrency'] | false | false |
63.053164 | Medium | 1,116 | false | false | Print Zero Even Odd | print-zero-even-odd | ['Concurrency'] | false | false |
57.499825 | Medium | 1,117 | false | false | Building H2O | building-h2o | ['Concurrency'] | false | false |
58.906922 | Easy | 1,118 | false | true | Number of Days in a Month | number-of-days-in-a-month | ['Math'] | false | false |
91.215016 | Easy | 1,119 | false | true | Remove Vowels from a String | remove-vowels-from-a-string | ['String'] | true | false |
66.776944 | Medium | 1,120 | false | true | Maximum Average Subtree | maximum-average-subtree | ['Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
60.455076 | Hard | 1,121 | false | true | Divide Array Into Increasing Sequences | divide-array-into-increasing-sequences | ['Array', 'Counting'] | false | false |
74.888864 | Easy | 1,122 | false | false | Relative Sort Array | relative-sort-array | ['Array', 'Hash Table', 'Sorting', 'Counting Sort'] | true | false |
78.781472 | Medium | 1,123 | false | false | Lowest Common Ancestor of Deepest Leaves | lowest-common-ancestor-of-deepest-leaves | ['Hash Table', 'Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'] | true | false |
35.689199 | Medium | 1,124 | false | false | Longest Well-Performing Interval | longest-well-performing-interval | ['Array', 'Hash Table', 'Stack', 'Monotonic Stack', 'Prefix Sum'] | false | false |
55.329087 | Hard | 1,125 | false | false | Smallest Sufficient Team | smallest-sufficient-team | ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'] | true | false |
65.87072 | Medium | 1,126 | false | true | Active Businesses | active-businesses | ['Database'] | true | false |
47.125326 | Hard | 1,127 | false | true | User Purchase Platform | user-purchase-platform | ['Database'] | false | false |
49.074493 | Easy | 1,128 | false | false | Number of Equivalent Domino Pairs | number-of-equivalent-domino-pairs | ['Array', 'Hash Table', 'Counting'] | false | false |
47.167668 | Medium | 1,129 | false | false | Shortest Path with Alternating Colors | shortest-path-with-alternating-colors | ['Breadth-First Search', 'Graph'] | true | false |
67.617033 | Medium | 1,130 | false | false | Minimum Cost Tree From Leaf Values | minimum-cost-tree-from-leaf-values | ['Array', 'Dynamic Programming', 'Stack', 'Greedy', 'Monotonic Stack'] | false | false |
48.199986 | Medium | 1,131 | false | false | Maximum of Absolute Value Expression | maximum-of-absolute-value-expression | ['Array', 'Math'] | false | false |
32.261944 | Medium | 1,132 | false | true | Reported Posts II | reported-posts-ii | ['Database'] | true | false |
70.731533 | Easy | 1,133 | false | true | Largest Unique Number | largest-unique-number | ['Array', 'Hash Table', 'Sorting'] | true | false |
77.814762 | Easy | 1,134 | false | true | Armstrong Number | armstrong-number | ['Math'] | true | false |
62.510281 | Medium | 1,135 | false | true | Connecting Cities With Minimum Cost | connecting-cities-with-minimum-cost | ['Union Find', 'Graph', 'Heap (Priority Queue)', 'Minimum Spanning Tree'] | true | false |
61.741031 | Medium | 1,136 | false | true | Parallel Courses | parallel-courses | ['Graph', 'Topological Sort'] | true | false |
63.631861 | Easy | 1,137 | false | false | N-th Tribonacci Number | n-th-tribonacci-number | ['Math', 'Dynamic Programming', 'Memoization'] | true | false |
51.574114 | Medium | 1,138 | false | false | Alphabet Board Path | alphabet-board-path | ['Hash Table', 'String'] | false | false |
50.573392 | Medium | 1,139 | false | false | Largest 1-Bordered Square | largest-1-bordered-square | ['Array', 'Dynamic Programming', 'Matrix'] | false | false |
73.020223 | Medium | 1,140 | false | false | Stone Game II | stone-game-ii | ['Array', 'Math', 'Dynamic Programming', 'Prefix Sum', 'Game Theory'] | false | false |
49.3381 | Easy | 1,141 | false | false | User Activity for the Past 30 Days I | user-activity-for-the-past-30-days-i | ['Database'] | true | false |
35.721392 | Easy | 1,142 | false | true | User Activity for the Past 30 Days II | user-activity-for-the-past-30-days-ii | ['Database'] | false | false |
58.072418 | Medium | 1,143 | false | false | Longest Common Subsequence | longest-common-subsequence | ['String', 'Dynamic Programming'] | true | false |
48.2827 | Medium | 1,144 | false | false | Decrease Elements To Make Array Zigzag | decrease-elements-to-make-array-zigzag | ['Array', 'Greedy'] | false | false |
52.383319 | Medium | 1,145 | false | false | Binary Tree Coloring Game | binary-tree-coloring-game | ['Tree', 'Depth-First Search', 'Binary Tree'] | false | false |
36.735148 | Medium | 1,146 | false | false | Snapshot Array | snapshot-array | ['Array', 'Hash Table', 'Binary Search', 'Design'] | true | false |
58.749229 | Hard | 1,147 | false | false | Longest Chunked Palindrome Decomposition | longest-chunked-palindrome-decomposition | ['Two Pointers', 'String', 'Dynamic Programming', 'Greedy', 'Rolling Hash', 'Hash Function'] | false | false |
77.176389 | Easy | 1,148 | false | false | Article Views I | article-views-i | ['Database'] | true | false |
47.206277 | Medium | 1,149 | false | true | Article Views II | article-views-ii | ['Database'] | true | false |
59.059862 | Easy | 1,150 | false | true | Check If a Number Is Majority Element in a Sorted Array | check-if-a-number-is-majority-element-in-a-sorted-array | ['Array', 'Binary Search'] | true | false |
61.091484 | Medium | 1,151 | false | true | Minimum Swaps to Group All 1's Together | minimum-swaps-to-group-all-1s-together | ['Array', 'Sliding Window'] | true | true |
43.387776 | Medium | 1,152 | false | true | Analyze User Website Visit Pattern | analyze-user-website-visit-pattern | ['Array', 'Hash Table', 'Sorting'] | false | false |
34.811663 | Hard | 1,153 | false | true | String Transforms Into Another String | string-transforms-into-another-string | ['Hash Table', 'String'] | true | false |
47.881665 | Easy | 1,154 | false | false | Day of the Year | day-of-the-year | ['Math', 'String'] | false | false |
61.481266 | Medium | 1,155 | false | false | Number of Dice Rolls With Target Sum | number-of-dice-rolls-with-target-sum | ['Dynamic Programming'] | true | false |
43.623331 | Medium | 1,156 | false | false | Swap For Longest Repeated Character Substring | swap-for-longest-repeated-character-substring | ['Hash Table', 'String', 'Sliding Window'] | false | false |
42.292624 | Hard | 1,157 | false | false | Online Majority Element In Subarray | online-majority-element-in-subarray | ['Array', 'Binary Search', 'Design', 'Binary Indexed Tree', 'Segment Tree'] | false | false |
57.150575 | Medium | 1,158 | false | false | Market Analysis I | market-analysis-i | ['Database'] | true | false |
57.71101 | Hard | 1,159 | false | true | Market Analysis II | market-analysis-ii | ['Database'] | true | false |
70.925432 | Easy | 1,160 | false | false | Find Words That Can Be Formed by Characters | find-words-that-can-be-formed-by-characters | ['Array', 'Hash Table', 'String', 'Counting'] | true | false |
67.286391 | Medium | 1,161 | false | false | Maximum Level Sum of a Binary Tree | maximum-level-sum-of-a-binary-tree | ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'] | true | false |
51.769934 | Medium | 1,162 | false | false | As Far from Land as Possible | as-far-from-land-as-possible | ['Array', 'Dynamic Programming', 'Breadth-First Search', 'Matrix'] | true | false |
34.372855 | Hard | 1,163 | false | false | Last Substring in Lexicographical Order | last-substring-in-lexicographical-order | ['Two Pointers', 'String'] | false | false |
57.230352 | Medium | 1,164 | false | false | Product Price at a Given Date | product-price-at-a-given-date | ['Database'] | true | false |
87.656312 | Easy | 1,165 | false | true | Single-Row Keyboard | single-row-keyboard | ['Hash Table', 'String'] | true | true |
63.894803 | Medium | 1,166 | false | true | Design File System | design-file-system | ['Hash Table', 'String', 'Design', 'Trie'] | true | false |
70.962943 | Medium | 1,167 | false | true | Minimum Cost to Connect Sticks | minimum-cost-to-connect-sticks | ['Array', 'Greedy', 'Heap (Priority Queue)'] | true | true |
65.107459 | Hard | 1,168 | false | true | Optimize Water Distribution in a Village | optimize-water-distribution-in-a-village | ['Union Find', 'Graph', 'Heap (Priority Queue)', 'Minimum Spanning Tree'] | true | false |
31.208159 | Medium | 1,169 | false | false | Invalid Transactions | invalid-transactions | ['Array', 'Hash Table', 'String', 'Sorting'] | false | false |
62.564173 | Medium | 1,170 | false | false | Compare Strings by Frequency of the Smallest Character | compare-strings-by-frequency-of-the-smallest-character | ['Array', 'Hash Table', 'String', 'Binary Search', 'Sorting'] | false | false |
52.807869 | Medium | 1,171 | false | false | Remove Zero Sum Consecutive Nodes from Linked List | remove-zero-sum-consecutive-nodes-from-linked-list | ['Hash Table', 'Linked List'] | true | false |
32.764413 | Hard | 1,172 | false | false | Dinner Plate Stacks | dinner-plate-stacks | ['Hash Table', 'Stack', 'Design', 'Heap (Priority Queue)'] | false | false |
80.884847 | Easy | 1,173 | false | true | Immediate Food Delivery I | immediate-food-delivery-i | ['Database'] | true | false |
53.924122 | Medium | 1,174 | false | false | Immediate Food Delivery II | immediate-food-delivery-ii | ['Database'] | false | false |
59.161248 | Easy | 1,175 | false | false | Prime Arrangements | prime-arrangements | ['Math'] | false | false |
54.035198 | Easy | 1,176 | false | true | Diet Plan Performance | diet-plan-performance | ['Array', 'Sliding Window'] | false | false |
39.961118 | Medium | 1,177 | false | false | Can Make Palindrome from Substring | can-make-palindrome-from-substring | ['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum'] | false | false |
46.998408 | Hard | 1,178 | false | false | Number of Valid Words for Each Puzzle | number-of-valid-words-for-each-puzzle | ['Array', 'Hash Table', 'String', 'Bit Manipulation', 'Trie'] | true | false |
76.766556 | Easy | 1,179 | false | false | Reformat Department Table | reformat-department-table | ['Database'] | true | false |
80.543196 | Easy | 1,180 | false | true | Count Substrings with Only One Distinct Letter | count-substrings-with-only-one-distinct-letter | ['Math', 'String'] | true | false |
46.459806 | Medium | 1,181 | false | true | Before and After Puzzle | before-and-after-puzzle | ['Array', 'Hash Table', 'String', 'Sorting'] | false | false |
55.437587 | Medium | 1,182 | false | true | Shortest Distance to Target Color | shortest-distance-to-target-color | ['Array', 'Binary Search', 'Dynamic Programming'] | true | false |
68.579911 | Hard | 1,183 | false | true | Maximum Number of Ones | maximum-number-of-ones | ['Math', 'Greedy', 'Sorting', 'Heap (Priority Queue)'] | true | false |
54.486079 | Easy | 1,184 | false | false | Distance Between Bus Stops | distance-between-bus-stops | ['Array'] | false | false |
58.348985 | Easy | 1,185 | false | false | Day of the Week | day-of-the-week | ['Math'] | false | false |
44.832335 | Medium | 1,186 | false | false | Maximum Subarray Sum with One Deletion | maximum-subarray-sum-with-one-deletion | ['Array', 'Dynamic Programming'] | false | false |
57.856688 | Hard | 1,187 | false | false | Make Array Strictly Increasing | make-array-strictly-increasing | ['Array', 'Binary Search', 'Dynamic Programming', 'Sorting'] | true | false |
72.942819 | Medium | 1,188 | false | true | Design Bounded Blocking Queue | design-bounded-blocking-queue | ['Concurrency'] | false | false |
59.710631 | Easy | 1,189 | false | false | Maximum Number of Balloons | maximum-number-of-balloons | ['Hash Table', 'String', 'Counting'] | true | false |
71.677851 | Medium | 1,190 | false | false | Reverse Substrings Between Each Pair of Parentheses | reverse-substrings-between-each-pair-of-parentheses | ['String', 'Stack'] | true | false |
24.125376 | Medium | 1,191 | false | false | K-Concatenation Maximum Sum | k-concatenation-maximum-sum | ['Array', 'Dynamic Programming'] | false | false |
57.390782 | Hard | 1,192 | false | false | Critical Connections in a Network | critical-connections-in-a-network | ['Depth-First Search', 'Graph', 'Biconnected Component'] | true | false |
58.26083 | Medium | 1,193 | false | false | Monthly Transactions I | monthly-transactions-i | ['Database'] | false | false |
49.693532 | Hard | 1,194 | false | true | Tournament Winners | tournament-winners | ['Database'] | true | false |
73.701258 | Medium | 1,195 | false | false | Fizz Buzz Multithreaded | fizz-buzz-multithreaded | ['Concurrency'] | false | false |
67.072717 | Easy | 1,196 | false | true | How Many Apples Can You Put into the Basket | how-many-apples-can-you-put-into-the-basket | ['Array', 'Greedy', 'Sorting'] | true | true |
41.203964 | Medium | 1,197 | false | true | Minimum Knight Moves | minimum-knight-moves | ['Breadth-First Search'] | true | false |
76.409761 | Medium | 1,198 | false | true | Find Smallest Common Element in All Rows | find-smallest-common-element-in-all-rows | ['Array', 'Hash Table', 'Binary Search', 'Matrix', 'Counting'] | true | true |
46.137368 | Hard | 1,199 | false | true | Minimum Time to Build Blocks | minimum-time-to-build-blocks | ['Array', 'Math', 'Greedy', 'Heap (Priority Queue)'] | true | false |
70.43357 | Easy | 1,200 | false | false | Minimum Absolute Difference | minimum-absolute-difference | ['Array', 'Sorting'] | true | false |
Subsets and Splits