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 |
---|---|---|---|---|---|---|---|---|---|
40.750588 | Hard | 1,301 | false | false | Number of Paths with Max Score | number-of-paths-with-max-score | ['Array', 'Dynamic Programming', 'Matrix'] | false | false |
86.27408 | Medium | 1,302 | false | false | Deepest Leaves Sum | deepest-leaves-sum | ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'] | true | false |
89.660481 | Easy | 1,303 | false | true | Find the Team Size | find-the-team-size | ['Database'] | false | false |
76.147471 | Easy | 1,304 | false | false | Find N Unique Integers Sum up to Zero | find-n-unique-integers-sum-up-to-zero | ['Array', 'Math'] | false | false |
79.975653 | Medium | 1,305 | false | false | All Elements in Two Binary Search Trees | all-elements-in-two-binary-search-trees | ['Tree', 'Depth-First Search', 'Binary Search Tree', 'Sorting', 'Binary Tree'] | true | false |
65.850651 | Medium | 1,306 | false | false | Jump Game III | jump-game-iii | ['Array', 'Depth-First Search', 'Breadth-First Search'] | true | true |
34.701691 | Hard | 1,307 | false | false | Verbal Arithmetic Puzzle | verbal-arithmetic-puzzle | ['Array', 'Math', 'String', 'Backtracking'] | false | false |
86.385299 | Medium | 1,308 | false | true | Running Total for Different Genders | running-total-for-different-genders | ['Database'] | false | false |
80.106939 | Easy | 1,309 | false | false | Decrypt String from Alphabet to Integer Mapping | decrypt-string-from-alphabet-to-integer-mapping | ['String'] | false | false |
78.443232 | Medium | 1,310 | false | false | XOR Queries of a Subarray | xor-queries-of-a-subarray | ['Array', 'Bit Manipulation', 'Prefix Sum'] | true | false |
48.89991 | Medium | 1,311 | false | false | Get Watched Videos by Your Friends | get-watched-videos-by-your-friends | ['Array', 'Hash Table', 'Breadth-First Search', 'Graph', 'Sorting'] | false | false |
72.038556 | Hard | 1,312 | false | false | Minimum Insertion Steps to Make a String Palindrome | minimum-insertion-steps-to-make-a-string-palindrome | ['String', 'Dynamic Programming'] | true | false |
85.979264 | Easy | 1,313 | false | false | Decompress Run-Length Encoded List | decompress-run-length-encoded-list | ['Array'] | false | false |
75.82948 | Medium | 1,314 | false | false | Matrix Block Sum | matrix-block-sum | ['Array', 'Matrix', 'Prefix Sum'] | false | false |
85.659641 | Medium | 1,315 | false | false | Sum of Nodes with Even-Valued Grandparent | sum-of-nodes-with-even-valued-grandparent | ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'] | true | false |
51.721375 | Hard | 1,316 | false | false | Distinct Echo Substrings | distinct-echo-substrings | ['String', 'Trie', 'Rolling Hash', 'Hash Function'] | false | false |
54.072359 | Easy | 1,317 | false | false | Convert Integer to the Sum of Two No-Zero Integers | convert-integer-to-the-sum-of-two-no-zero-integers | ['Math'] | false | false |
71.504709 | Medium | 1,318 | false | false | Minimum Flips to Make a OR b Equal to c | minimum-flips-to-make-a-or-b-equal-to-c | ['Bit Manipulation'] | true | false |
64.204802 | Medium | 1,319 | false | false | Number of Operations to Make Network Connected | number-of-operations-to-make-network-connected | ['Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph'] | true | false |
59.035487 | Hard | 1,320 | false | false | Minimum Distance to Type a Word Using Two Fingers | minimum-distance-to-type-a-word-using-two-fingers | ['String', 'Dynamic Programming'] | false | false |
55.99027 | Medium | 1,321 | false | false | Restaurant Growth | restaurant-growth | ['Database'] | false | false |
59.284108 | Easy | 1,322 | false | true | Ads Performance | ads-performance | ['Database'] | true | false |
82.524969 | Easy | 1,323 | false | false | Maximum 69 Number | maximum-69-number | ['Math', 'Greedy'] | true | false |
65.914365 | Medium | 1,324 | false | false | Print Words Vertically | print-words-vertically | ['Array', 'String', 'Simulation'] | false | false |
77.282761 | Medium | 1,325 | false | false | Delete Leaves With a Given Value | delete-leaves-with-a-given-value | ['Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
50.703971 | Hard | 1,326 | false | false | Minimum Number of Taps to Open to Water a Garden | minimum-number-of-taps-to-open-to-water-a-garden | ['Array', 'Dynamic Programming', 'Greedy'] | true | false |
71.818974 | Easy | 1,327 | false | false | List the Products Ordered in a Period | list-the-products-ordered-in-a-period | ['Database'] | false | false |
51.518281 | Medium | 1,328 | false | false | Break a Palindrome | break-a-palindrome | ['String', 'Greedy'] | true | false |
82.940786 | Medium | 1,329 | false | false | Sort the Matrix Diagonally | sort-the-matrix-diagonally | ['Array', 'Sorting', 'Matrix'] | true | true |
42.240048 | Hard | 1,330 | false | false | Reverse Subarray To Maximize Array Value | reverse-subarray-to-maximize-array-value | ['Array', 'Math', 'Greedy'] | false | false |
70.622565 | Easy | 1,331 | false | false | Rank Transform of an Array | rank-transform-of-an-array | ['Array', 'Hash Table', 'Sorting'] | true | false |
76.579342 | Easy | 1,332 | false | false | Remove Palindromic Subsequences | remove-palindromic-subsequences | ['Two Pointers', 'String'] | true | false |
62.979327 | Medium | 1,333 | false | false | Filter Restaurants by Vegan-Friendly, Price and Distance | filter-restaurants-by-vegan-friendly-price-and-distance | ['Array', 'Sorting'] | false | false |
69.554919 | Medium | 1,334 | false | false | Find the City With the Smallest Number of Neighbors at a Threshold Distance | find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance | ['Dynamic Programming', 'Graph', 'Shortest Path'] | true | false |
59.633501 | Hard | 1,335 | false | false | Minimum Difficulty of a Job Schedule | minimum-difficulty-of-a-job-schedule | ['Array', 'Dynamic Programming'] | true | false |
48.061228 | Hard | 1,336 | false | true | Number of Transactions per Visit | number-of-transactions-per-visit | ['Database'] | false | false |
73.891506 | Easy | 1,337 | false | false | The K Weakest Rows in a Matrix | the-k-weakest-rows-in-a-matrix | ['Array', 'Binary Search', 'Sorting', 'Heap (Priority Queue)', 'Matrix'] | true | false |
69.065691 | Medium | 1,338 | false | false | Reduce Array Size to The Half | reduce-array-size-to-the-half | ['Array', 'Hash Table', 'Greedy', 'Sorting', 'Heap (Priority Queue)'] | true | false |
47.831255 | Medium | 1,339 | false | false | Maximum Product of Splitted Binary Tree | maximum-product-of-splitted-binary-tree | ['Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
63.849407 | Hard | 1,340 | false | false | Jump Game V | jump-game-v | ['Array', 'Dynamic Programming', 'Sorting'] | false | false |
41.271228 | Medium | 1,341 | false | false | Movie Rating | movie-rating | ['Database'] | false | false |
85.557951 | Easy | 1,342 | false | false | Number of Steps to Reduce a Number to Zero | number-of-steps-to-reduce-a-number-to-zero | ['Math', 'Bit Manipulation'] | true | true |
69.9104 | Medium | 1,343 | false | false | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold | ['Array', 'Sliding Window'] | false | false |
64.132737 | Medium | 1,344 | false | false | Angle Between Hands of a Clock | angle-between-hands-of-a-clock | ['Math'] | true | false |
46.065227 | Hard | 1,345 | false | false | Jump Game IV | jump-game-iv | ['Array', 'Hash Table', 'Breadth-First Search'] | true | false |
41.119871 | Easy | 1,346 | false | false | Check If N and Its Double Exist | check-if-n-and-its-double-exist | ['Array', 'Hash Table', 'Two Pointers', 'Binary Search', 'Sorting'] | true | false |
82.101903 | Medium | 1,347 | false | false | Minimum Number of Steps to Make Two Strings Anagram | minimum-number-of-steps-to-make-two-strings-anagram | ['Hash Table', 'String', 'Counting'] | true | false |
45.181593 | Medium | 1,348 | false | false | Tweet Counts Per Frequency | tweet-counts-per-frequency | ['Hash Table', 'Binary Search', 'Design', 'Sorting', 'Ordered Set'] | false | false |
51.903234 | Hard | 1,349 | false | false | Maximum Students Taking Exam | maximum-students-taking-exam | ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Matrix', 'Bitmask'] | false | false |
89.895349 | Easy | 1,350 | false | true | Students With Invalid Departments | students-with-invalid-departments | ['Database'] | false | false |
77.619026 | Easy | 1,351 | false | false | Count Negative Numbers in a Sorted Matrix | count-negative-numbers-in-a-sorted-matrix | ['Array', 'Binary Search', 'Matrix'] | true | false |
62.867547 | Medium | 1,352 | false | false | Product of the Last K Numbers | product-of-the-last-k-numbers | ['Array', 'Math', 'Design', 'Data Stream', 'Prefix Sum'] | true | false |
32.814731 | Medium | 1,353 | false | false | Maximum Number of Events That Can Be Attended | maximum-number-of-events-that-can-be-attended | ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'] | false | false |
36.235371 | Hard | 1,354 | false | false | Construct Target Array With Multiple Sums | construct-target-array-with-multiple-sums | ['Array', 'Heap (Priority Queue)'] | true | false |
72.37542 | Medium | 1,355 | false | true | Activity Participants | activity-participants | ['Database'] | true | false |
78.594538 | Easy | 1,356 | false | false | Sort Integers by The Number of 1 Bits | sort-integers-by-the-number-of-1-bits | ['Array', 'Bit Manipulation', 'Sorting', 'Counting'] | true | false |
71.553019 | Medium | 1,357 | false | false | Apply Discount Every n Orders | apply-discount-every-n-orders | ['Array', 'Hash Table', 'Design'] | false | false |
72.963066 | Medium | 1,358 | false | false | Number of Substrings Containing All Three Characters | number-of-substrings-containing-all-three-characters | ['Hash Table', 'String', 'Sliding Window'] | true | false |
64.871171 | Hard | 1,359 | false | false | Count All Valid Pickup and Delivery Options | count-all-valid-pickup-and-delivery-options | ['Math', 'Dynamic Programming', 'Combinatorics'] | true | false |
51.102803 | Easy | 1,360 | false | false | Number of Days Between Two Dates | number-of-days-between-two-dates | ['Math', 'String'] | false | false |
43.85955 | Medium | 1,361 | false | false | Validate Binary Tree Nodes | validate-binary-tree-nodes | ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Graph', 'Binary Tree'] | true | false |
61.161677 | Medium | 1,362 | false | false | Closest Divisors | closest-divisors | ['Math'] | false | false |
32.6892 | Hard | 1,363 | false | false | Largest Multiple of Three | largest-multiple-of-three | ['Array', 'Math', 'Dynamic Programming', 'Greedy', 'Sorting'] | false | false |
75.221506 | Medium | 1,364 | false | true | Number of Trusted Contacts of a Customer | number-of-trusted-contacts-of-a-customer | ['Database'] | true | false |
87.066039 | Easy | 1,365 | false | false | How Many Numbers Are Smaller Than the Current Number | how-many-numbers-are-smaller-than-the-current-number | ['Array', 'Hash Table', 'Sorting', 'Counting Sort'] | false | false |
59.184624 | Medium | 1,366 | false | false | Rank Teams by Votes | rank-teams-by-votes | ['Array', 'Hash Table', 'String', 'Sorting', 'Counting'] | false | false |
51.945802 | Medium | 1,367 | false | false | Linked List in Binary Tree | linked-list-in-binary-tree | ['Linked List', 'Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
70.682525 | Hard | 1,368 | false | false | Minimum Cost to Make at Least One Valid Path in a Grid | minimum-cost-to-make-at-least-one-valid-path-in-a-grid | ['Array', 'Breadth-First Search', 'Graph', 'Heap (Priority Queue)', 'Matrix', 'Shortest Path'] | true | false |
67.500495 | Hard | 1,369 | false | true | Get the Second Most Recent Activity | get-the-second-most-recent-activity | ['Database'] | false | false |
76.556317 | Easy | 1,370 | false | false | Increasing Decreasing String | increasing-decreasing-string | ['Hash Table', 'String', 'Counting'] | false | false |
75.79313 | Medium | 1,371 | false | false | Find the Longest Substring Containing Vowels in Even Counts | find-the-longest-substring-containing-vowels-in-even-counts | ['Hash Table', 'String', 'Bit Manipulation', 'Prefix Sum'] | true | false |
66.415056 | Medium | 1,372 | false | false | Longest ZigZag Path in a Binary Tree | longest-zigzag-path-in-a-binary-tree | ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Tree'] | true | false |
43.490298 | Hard | 1,373 | false | false | Maximum Sum BST in Binary Tree | maximum-sum-bst-in-binary-tree | ['Dynamic Programming', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'] | false | false |
77.969607 | Easy | 1,374 | false | false | Generate a String With Characters That Have Odd Counts | generate-a-string-with-characters-that-have-odd-counts | ['String'] | false | false |
65.678981 | Medium | 1,375 | false | false | Number of Times Binary String Is Prefix-Aligned | number-of-times-binary-string-is-prefix-aligned | ['Array'] | false | false |
60.176539 | Medium | 1,376 | false | false | Time Needed to Inform All Employees | time-needed-to-inform-all-employees | ['Tree', 'Depth-First Search', 'Breadth-First Search'] | true | false |
35.692124 | Hard | 1,377 | false | false | Frog Position After T Seconds | frog-position-after-t-seconds | ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Graph'] | false | false |
83.608294 | Easy | 1,378 | false | false | Replace Employee ID With The Unique Identifier | replace-employee-id-with-the-unique-identifier | ['Database'] | true | false |
85.733417 | Easy | 1,379 | false | false | Find a Corresponding Node of a Binary Tree in a Clone of That Tree | find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree | ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'] | true | false |
79.880028 | Easy | 1,380 | false | false | Lucky Numbers in a Matrix | lucky-numbers-in-a-matrix | ['Array', 'Matrix'] | true | false |
80.451341 | Medium | 1,381 | false | false | Design a Stack With Increment Operation | design-a-stack-with-increment-operation | ['Array', 'Stack', 'Design'] | true | false |
84.627262 | Medium | 1,382 | false | false | Balance a Binary Search Tree | balance-a-binary-search-tree | ['Divide and Conquer', 'Greedy', 'Tree', 'Depth-First Search', 'Binary Search Tree', 'Binary Tree'] | true | false |
47.505865 | Hard | 1,383 | false | false | Maximum Performance of a Team | maximum-performance-of-a-team | ['Array', 'Greedy', 'Sorting', 'Heap (Priority Queue)'] | true | false |
61.439674 | Hard | 1,384 | false | true | Total Sales Amount by Year | total-sales-amount-by-year | ['Database'] | false | false |
69.91572 | Easy | 1,385 | false | false | Find the Distance Value Between Two Arrays | find-the-distance-value-between-two-arrays | ['Array', 'Two Pointers', 'Binary Search', 'Sorting'] | false | false |
42.550031 | Medium | 1,386 | false | false | Cinema Seat Allocation | cinema-seat-allocation | ['Array', 'Hash Table', 'Greedy', 'Bit Manipulation'] | false | false |
70.634509 | Medium | 1,387 | false | false | Sort Integers by The Power Value | sort-integers-by-the-power-value | ['Dynamic Programming', 'Memoization', 'Sorting'] | false | false |
52.695347 | Hard | 1,388 | false | false | Pizza With 3n Slices | pizza-with-3n-slices | ['Array', 'Dynamic Programming', 'Greedy', 'Heap (Priority Queue)'] | false | false |
86.176214 | Easy | 1,389 | false | false | Create Target Array in the Given Order | create-target-array-in-the-given-order | ['Array', 'Simulation'] | false | false |
44.502941 | Medium | 1,390 | false | false | Four Divisors | four-divisors | ['Array', 'Math'] | false | false |
48.699795 | Medium | 1,391 | false | false | Check if There is a Valid Path in a Grid | check-if-there-is-a-valid-path-in-a-grid | ['Array', 'Depth-First Search', 'Breadth-First Search', 'Union Find', 'Matrix'] | false | false |
48.352934 | Hard | 1,392 | false | false | Longest Happy Prefix | longest-happy-prefix | ['String', 'Rolling Hash', 'String Matching', 'Hash Function'] | false | false |
84.990854 | Medium | 1,393 | false | false | Capital Gain/Loss | capital-gainloss | ['Database'] | true | false |
68.960376 | Easy | 1,394 | false | false | Find Lucky Integer in an Array | find-lucky-integer-in-an-array | ['Array', 'Hash Table', 'Counting'] | true | false |
70.07412 | Medium | 1,395 | false | false | Count Number of Teams | count-number-of-teams | ['Array', 'Dynamic Programming', 'Binary Indexed Tree', 'Segment Tree'] | true | false |
74.851565 | Medium | 1,396 | false | false | Design Underground System | design-underground-system | ['Hash Table', 'String', 'Design'] | true | false |
43.319049 | Hard | 1,397 | false | false | Find All Good Strings | find-all-good-strings | ['String', 'Dynamic Programming', 'String Matching'] | false | false |
72.079071 | Medium | 1,398 | false | true | Customers Who Bought Products A and B but Not C | customers-who-bought-products-a-and-b-but-not-c | ['Database'] | true | false |
66.508817 | Easy | 1,399 | false | false | Count Largest Group | count-largest-group | ['Hash Table', 'Math'] | false | false |
68.733539 | Medium | 1,400 | false | false | Construct K Palindrome Strings | construct-k-palindrome-strings | ['Hash Table', 'String', 'Greedy', 'Counting'] | true | false |
Subsets and Splits