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 |
---|---|---|---|---|---|---|---|---|---|
33.94921 | Hard | 2,701 | false | true | Consecutive Transactions with Increasing Amounts | consecutive-transactions-with-increasing-amounts | ['Database'] | true | false |
41.539863 | Hard | 2,702 | false | true | Minimum Operations to Make Numbers Non-positive | minimum-operations-to-make-numbers-non-positive | ['Array', 'Binary Search'] | false | false |
94.458423 | Easy | 2,703 | false | false | Return Length of Arguments Passed | return-length-of-arguments-passed | [] | true | false |
62.841715 | Easy | 2,704 | false | false | To Be Or Not To Be | to-be-or-not-to-be | [] | true | false |
66.682301 | Medium | 2,705 | false | false | Compact Object | compact-object | [] | true | false |
68.250679 | Easy | 2,706 | false | false | Buy Two Chocolates | buy-two-chocolates | ['Array', 'Greedy', 'Sorting'] | true | false |
56.989795 | Medium | 2,707 | false | false | Extra Characters in a String | extra-characters-in-a-string | ['Array', 'Hash Table', 'String', 'Dynamic Programming', 'Trie'] | true | false |
24.569798 | Medium | 2,708 | false | false | Maximum Strength of a Group | maximum-strength-of-a-group | ['Array', 'Dynamic Programming', 'Backtracking', 'Greedy', 'Bit Manipulation', 'Sorting', 'Enumeration'] | false | false |
41.798997 | Hard | 2,709 | false | false | Greatest Common Divisor Traversal | greatest-common-divisor-traversal | ['Array', 'Math', 'Union Find', 'Number Theory'] | true | false |
78.465704 | Easy | 2,710 | false | false | Remove Trailing Zeros From a String | remove-trailing-zeros-from-a-string | ['String'] | false | false |
67.598301 | Medium | 2,711 | false | false | Difference of Number of Distinct Values on Diagonals | difference-of-number-of-distinct-values-on-diagonals | ['Array', 'Hash Table', 'Matrix'] | false | false |
53.044963 | Medium | 2,712 | false | false | Minimum Cost to Make All Characters Equal | minimum-cost-to-make-all-characters-equal | ['String', 'Dynamic Programming', 'Greedy'] | false | false |
30.448901 | Hard | 2,713 | false | false | Maximum Strictly Increasing Cells in a Matrix | maximum-strictly-increasing-cells-in-a-matrix | ['Array', 'Hash Table', 'Binary Search', 'Dynamic Programming', 'Memoization', 'Sorting', 'Matrix', 'Ordered Set'] | false | false |
61.826923 | Hard | 2,714 | false | true | Find Shortest Path with K Hops | find-shortest-path-with-k-hops | ['Graph', 'Heap (Priority Queue)', 'Shortest Path'] | false | false |
89.51202 | Easy | 2,715 | false | false | Timeout Cancellation | timeout-cancellation | [] | true | false |
76.812515 | Easy | 2,716 | false | false | Minimize String Length | minimize-string-length | ['Hash Table', 'String'] | false | false |
63.071878 | Easy | 2,717 | false | false | Semi-Ordered Permutation | semi-ordered-permutation | ['Array', 'Simulation'] | false | false |
31.01638 | Medium | 2,718 | false | false | Sum of Matrix After Queries | sum-of-matrix-after-queries | ['Array', 'Hash Table'] | false | false |
37.412422 | Hard | 2,719 | false | false | Count of Integers | count-of-integers | ['Math', 'String', 'Dynamic Programming'] | false | false |
54.800651 | Hard | 2,720 | false | true | Popularity Percentage | popularity-percentage | ['Database'] | true | false |
77.284728 | Medium | 2,721 | false | false | Execute Asynchronous Functions in Parallel | execute-asynchronous-functions-in-parallel | [] | true | false |
55.918992 | Medium | 2,722 | false | false | Join Two Arrays by ID | join-two-arrays-by-id | [] | true | false |
91.751998 | Easy | 2,723 | false | false | Add Two Promises | add-two-promises | [] | true | false |
83.077049 | Easy | 2,724 | false | false | Sort By | sort-by | [] | true | false |
83.614645 | Easy | 2,725 | false | false | Interval Cancellation | interval-cancellation | [] | true | false |
77.216384 | Easy | 2,726 | false | false | Calculator with Method Chaining | calculator-with-method-chaining | [] | true | false |
81.302036 | Easy | 2,727 | false | false | Is Object Empty | is-object-empty | [] | true | false |
85.369724 | Easy | 2,728 | false | true | Count Houses in a Circular Street | count-houses-in-a-circular-street | ['Array', 'Interactive'] | false | false |
52.167032 | Easy | 2,729 | false | false | Check if The Number is Fascinating | check-if-the-number-is-fascinating | ['Hash Table', 'Math'] | false | false |
36.71258 | Medium | 2,730 | false | false | Find the Longest Semi-Repetitive Substring | find-the-longest-semi-repetitive-substring | ['String', 'Sliding Window'] | false | false |
26.930996 | Medium | 2,731 | false | false | Movement of Robots | movement-of-robots | ['Array', 'Brainteaser', 'Sorting', 'Prefix Sum'] | false | false |
45.758712 | Hard | 2,732 | false | false | Find a Good Subset of the Matrix | find-a-good-subset-of-the-matrix | ['Array', 'Hash Table', 'Bit Manipulation', 'Matrix'] | false | false |
75.841057 | Easy | 2,733 | false | false | Neither Minimum nor Maximum | neither-minimum-nor-maximum | ['Array', 'Sorting'] | false | false |
31.884705 | Medium | 2,734 | false | false | Lexicographically Smallest String After Substring Operation | lexicographically-smallest-string-after-substring-operation | ['String', 'Greedy'] | false | false |
33.427321 | Medium | 2,735 | false | false | Collecting Chocolates | collecting-chocolates | ['Array', 'Enumeration'] | false | false |
27.61448 | Hard | 2,736 | false | false | Maximum Sum Queries | maximum-sum-queries | ['Array', 'Binary Search', 'Stack', 'Binary Indexed Tree', 'Segment Tree', 'Sorting', 'Monotonic Stack'] | false | false |
64.650024 | Medium | 2,737 | false | true | Find the Closest Marked Node | find-the-closest-marked-node | ['Array', 'Graph', 'Heap (Priority Queue)', 'Shortest Path'] | true | false |
55.471363 | Medium | 2,738 | false | true | Count Occurrences in Text | count-occurrences-in-text | ['Database'] | true | false |
39.84447 | Easy | 2,739 | false | false | Total Distance Traveled | total-distance-traveled | ['Math', 'Simulation'] | false | false |
64.119035 | Medium | 2,740 | false | false | Find the Value of the Partition | find-the-value-of-the-partition | ['Array', 'Sorting'] | false | false |
28.265024 | Medium | 2,741 | false | false | Special Permutations | special-permutations | ['Array', 'Dynamic Programming', 'Bit Manipulation', 'Bitmask'] | false | false |
49.777386 | Hard | 2,742 | false | false | Painting the Walls | painting-the-walls | ['Array', 'Dynamic Programming'] | true | false |
75.941723 | Medium | 2,743 | false | true | Count Substrings Without Repeating Character | count-substrings-without-repeating-character | ['Hash Table', 'String', 'Sliding Window'] | true | false |
81.333262 | Easy | 2,744 | false | false | Find Maximum Number of String Pairs | find-maximum-number-of-string-pairs | ['Array', 'Hash Table', 'String', 'Simulation'] | false | false |
53.564174 | Medium | 2,745 | false | false | Construct the Longest New String | construct-the-longest-new-string | ['Math', 'Dynamic Programming', 'Greedy', 'Brainteaser'] | false | false |
25.949918 | Medium | 2,746 | false | false | Decremental String Concatenation | decremental-string-concatenation | ['Array', 'String', 'Dynamic Programming'] | false | false |
32.60193 | Medium | 2,747 | false | false | Count Zero Request Servers | count-zero-request-servers | ['Array', 'Hash Table', 'Sliding Window', 'Sorting'] | false | false |
50.527575 | Easy | 2,748 | false | false | Number of Beautiful Pairs | number-of-beautiful-pairs | ['Array', 'Hash Table', 'Math', 'Counting', 'Number Theory'] | false | false |
29.945754 | Medium | 2,749 | false | false | Minimum Operations to Make the Integer Zero | minimum-operations-to-make-the-integer-zero | ['Bit Manipulation', 'Brainteaser', 'Enumeration'] | false | false |
33.621843 | Medium | 2,750 | false | false | Ways to Split Array Into Good Subarrays | ways-to-split-array-into-good-subarrays | ['Array', 'Math', 'Dynamic Programming'] | false | false |
56.087395 | Hard | 2,751 | false | false | Robot Collisions | robot-collisions | ['Array', 'Stack', 'Sorting', 'Simulation'] | true | false |
40.76692 | Hard | 2,752 | false | true | Customers with Maximum Number of Transactions on Consecutive Days | customers-with-maximum-number-of-transactions-on-consecutive-days | ['Database'] | false | false |
61.148904 | Hard | 2,753 | false | true | Count Houses in a Circular Street II | count-houses-in-a-circular-street-ii | [] | true | false |
86.706349 | Medium | 2,754 | false | true | Bind Function to Context | bind-function-to-context | [] | true | false |
65.963303 | Medium | 2,755 | false | true | Deep Merge of Two Objects | deep-merge-of-two-objects | [] | true | false |
66.259542 | Hard | 2,756 | false | true | Query Batching | query-batching | [] | true | false |
73.315364 | Medium | 2,757 | false | true | Generate Circular Array Values | generate-circular-array-values | [] | true | false |
84.943371 | Easy | 2,758 | false | true | Next Day | next-day | [] | true | false |
61.877934 | Hard | 2,759 | false | true | Convert JSON String to Object | convert-json-string-to-object | [] | true | false |
29.965044 | Easy | 2,760 | false | false | Longest Even Odd Subarray With Threshold | longest-even-odd-subarray-with-threshold | ['Array', 'Sliding Window'] | false | false |
35.171947 | Medium | 2,761 | false | false | Prime Pairs With Target Sum | prime-pairs-with-target-sum | ['Array', 'Math', 'Enumeration', 'Number Theory'] | false | false |
58.048538 | Medium | 2,762 | false | false | Continuous Subarrays | continuous-subarrays | ['Array', 'Queue', 'Sliding Window', 'Heap (Priority Queue)', 'Ordered Set', 'Monotonic Queue'] | true | false |
41.867715 | Hard | 2,763 | false | false | Sum of Imbalance Numbers of All Subarrays | sum-of-imbalance-numbers-of-all-subarrays | ['Array', 'Hash Table', 'Ordered Set'] | false | false |
65.966011 | Medium | 2,764 | false | true | Is Array a Preorder of Some Binary Tree | is-array-a-preorder-of-some-binary-tree | ['Stack', 'Tree', 'Depth-First Search', 'Binary Tree'] | false | false |
34.252067 | Easy | 2,765 | false | false | Longest Alternating Subarray | longest-alternating-subarray | ['Array', 'Enumeration'] | false | false |
49.940273 | Medium | 2,766 | false | false | Relocate Marbles | relocate-marbles | ['Array', 'Hash Table', 'Sorting', 'Simulation'] | false | false |
52.236136 | Medium | 2,767 | false | false | Partition String Into Minimum Beautiful Substrings | partition-string-into-minimum-beautiful-substrings | ['Hash Table', 'String', 'Dynamic Programming', 'Backtracking'] | false | false |
37.302785 | Medium | 2,768 | false | false | Number of Black Blocks | number-of-black-blocks | ['Array', 'Hash Table', 'Enumeration'] | false | false |
90.768356 | Easy | 2,769 | false | false | Find the Maximum Achievable Number | find-the-maximum-achievable-number | ['Math'] | false | false |
30.97867 | Medium | 2,770 | false | false | Maximum Number of Jumps to Reach the Last Index | maximum-number-of-jumps-to-reach-the-last-index | ['Array', 'Dynamic Programming'] | false | false |
29.649158 | Medium | 2,771 | false | false | Longest Non-decreasing Subarray From Two Arrays | longest-non-decreasing-subarray-from-two-arrays | ['Array', 'Dynamic Programming'] | false | false |
32.350893 | Medium | 2,772 | false | false | Apply Operations to Make All Array Elements Equal to Zero | apply-operations-to-make-all-array-elements-equal-to-zero | ['Array', 'Prefix Sum'] | false | false |
73.402868 | Medium | 2,773 | false | true | Height of Special Binary Tree | height-of-special-binary-tree | ['Tree', 'Depth-First Search', 'Breadth-First Search', 'Binary Tree'] | false | false |
82.66129 | Easy | 2,774 | false | true | Array Upper Bound | array-upper-bound | [] | true | false |
70.477048 | Medium | 2,775 | false | true | Undefined to Null | undefined-to-null | [] | true | false |
92.335437 | Medium | 2,776 | false | true | Convert Callback Based Function to Promise Based Function | convert-callback-based-function-to-promise-based-function | [] | true | false |
82.055215 | Medium | 2,777 | false | true | Date Range Generator | date-range-generator | [] | true | false |
80.928273 | Easy | 2,778 | false | false | Sum of Squares of Special Elements | sum-of-squares-of-special-elements | ['Array', 'Enumeration'] | false | false |
58.00168 | Medium | 2,779 | false | false | Maximum Beauty of an Array After Applying Operation | maximum-beauty-of-an-array-after-applying-operation | ['Array', 'Binary Search', 'Sliding Window', 'Sorting'] | true | false |
75.84845 | Medium | 2,780 | false | false | Minimum Index of a Valid Split | minimum-index-of-a-valid-split | ['Array', 'Hash Table', 'Sorting'] | true | false |
37.572106 | Hard | 2,781 | false | false | Length of the Longest Valid Substring | length-of-the-longest-valid-substring | ['Array', 'Hash Table', 'String', 'Sliding Window'] | false | false |
82.862243 | Medium | 2,782 | false | true | Number of Unique Categories | number-of-unique-categories | ['Union Find', 'Interactive', 'Counting'] | true | false |
38.236807 | Medium | 2,783 | false | true | Flight Occupancy and Waitlist Analysis | flight-occupancy-and-waitlist-analysis | ['Database'] | true | false |
48.299331 | Easy | 2,784 | false | false | Check if Array is Good | check-if-array-is-good | ['Array', 'Hash Table', 'Sorting'] | false | false |
79.934446 | Medium | 2,785 | false | false | Sort Vowels in a String | sort-vowels-in-a-string | ['String', 'Sorting'] | true | false |
36.299336 | Medium | 2,786 | false | false | Visit Array Positions to Maximize Score | visit-array-positions-to-maximize-score | ['Array', 'Dynamic Programming'] | false | false |
33.434897 | Medium | 2,787 | false | false | Ways to Express an Integer as Sum of Powers | ways-to-express-an-integer-as-sum-of-powers | ['Dynamic Programming'] | false | false |
74.523283 | Easy | 2,788 | false | false | Split Strings by Separator | split-strings-by-separator | ['Array', 'String'] | false | false |
46.418182 | Medium | 2,789 | false | false | Largest Element in an Array after Merge Operations | largest-element-in-an-array-after-merge-operations | ['Array', 'Greedy'] | false | false |
21.624685 | Hard | 2,790 | false | false | Maximum Number of Groups With Increasing Length | maximum-number-of-groups-with-increasing-length | ['Array', 'Math', 'Binary Search', 'Greedy', 'Sorting'] | false | false |
45.150051 | Hard | 2,791 | false | false | Count Paths That Can Form a Palindrome in a Tree | count-paths-that-can-form-a-palindrome-in-a-tree | ['Dynamic Programming', 'Bit Manipulation', 'Tree', 'Depth-First Search', 'Bitmask'] | false | false |
57.632399 | Hard | 2,792 | false | true | Count Nodes That Are Great Enough | count-nodes-that-are-great-enough | ['Divide and Conquer', 'Tree', 'Depth-First Search', 'Binary Tree'] | false | false |
78.614824 | Hard | 2,793 | false | true | Status of Flight Tickets | status-of-flight-tickets | [] | false | false |
65.085389 | Easy | 2,794 | false | true | Create Object from Two Arrays | create-object-from-two-arrays | [] | true | false |
89.791438 | Medium | 2,795 | false | true | Parallel Execution of Promises for Individual Results Retrieval | parallel-execution-of-promises-for-individual-results-retrieval | [] | true | false |
93.196673 | Easy | 2,796 | false | true | Repeat String | repeat-string | [] | true | false |
89.434219 | Easy | 2,797 | false | true | Partial Function with Placeholders | partial-function-with-placeholders | [] | false | false |
87.571535 | Easy | 2,798 | false | false | Number of Employees Who Met the Target | number-of-employees-who-met-the-target | ['Array'] | false | false |
64.516304 | Medium | 2,799 | false | false | Count Complete Subarrays in an Array | count-complete-subarrays-in-an-array | ['Array', 'Hash Table', 'Sliding Window'] | false | false |
30.516645 | Medium | 2,800 | false | false | Shortest String That Contains Three Strings | shortest-string-that-contains-three-strings | ['String', 'Greedy', 'Enumeration'] | false | false |
Subsets and Splits