Rust source code for all 650 leetcode hard algorithmic problems available with no subscription.
Done as an exercise to practice coding in Rust.
Thanks to https://github.com/rust-practice/cargo-leet for environment for running code locally!
| # | Problem | Solution | ⚡ Runtime | 🧠 Memory | 📏 Lines | 📊 Ac % | 🟢 Accepted | 🔥 Level |
|---|---|---|---|---|---|---|---|---|
| 3804 | Maximize Active Section with Trade II | source | 79 ms |
10 MB |
142 | 19.0% | 1,100 | 🔴 Hard |
| 3851 | Find Sum of Array Product of Magical Sequences | source | 33 ms |
2.6 MB |
181 | 22.7% | 1,500 | 🔴 Hard |
| 3798 | Longest Special Path II | source | 63 ms |
22.1 MB |
114 | 16.1% | 1,500 | 🔴 Hard |
| 3713 | Frequencies of Shortest Supersequences | source | 1323 ms |
2.4 MB |
113 | 15.9% | 1,800 | 🔴 Hard |
| 3700 | Subsequences with a Unique Middle Mode I | source | 196 ms |
2.2 MB |
97 | 17.3% | 2,000 | 🔴 Hard |
| 3527 | Alternating Groups III | source | 341 ms |
7.6 MB |
214 | 15.2% | 2,100 | 🔴 Hard |
| 3689 | Maximum Area Rectangle With Point Constraints II | source | 101 ms |
7.8 MB |
109 | 20.2% | 2,200 | 🔴 Hard |
| 3775 | Separate Squares II | source | 133 ms |
18.8 MB |
241 | 19.1% | 2,300 | 🔴 Hard |
| 3840 | Find X Value of Array II | source | 841 ms |
25.5 MB |
122 | 27.4% | 2,300 | 🔴 Hard |
| 3658 | Minimize the Maximum Adjacent Element Difference | source | 55 ms |
3.4 MB |
117 | 16.1% | 2,500 | 🔴 Hard |
| 3411 | Find Products of Elements of Big Array | source | 59 ms |
2.4 MB |
99 | 21.9% | 2,500 | 🔴 Hard |
| 3470 | Maximum Score From Grid Operations | source | 1334 ms |
2.5 MB |
53 | 24.4% | 2,500 | 🔴 Hard |
| 3701 | Minimum Cost Good Caption | source | 964 ms |
95.9 MB |
106 | 18.9% | 2,700 | 🔴 Hard |
| 3789 | Maximize Subarrays After Removing One Conflicting Pair | source | 431 ms |
45.8 MB |
65 | 32.0% | 2,700 | 🔴 Hard |
| 3783 | Permutations IV | source | 0 ms |
2.2 MB |
53 | 28.3% | 2,800 | 🔴 Hard |
| 3852 | Path Existence Queries in a Graph II | source | 91 ms |
24.3 MB |
79 | 22.8% | 2,800 | 🔴 Hard |
| 3772 | Minimum Pair Removal to Sort Array II | source | 450 ms |
9.2 MB |
96 | 13.9% | 2,900 | 🔴 Hard |
| 3781 | Maximize the Distance Between Points on a Square | source | 7 ms |
3.5 MB |
197 | 19.3% | 2,900 | 🔴 Hard |
| 3635 | Smallest Divisible Digit Product II | source | 424 ms |
3.1 MB |
145 | 10.7% | 3,000 | 🔴 Hard |
| 3688 | Maximize Subarray Sum After Removing All Occurrences of One Element | source | 71 ms |
8.1 MB |
88 | 20.0% | 3,000 | 🔴 Hard |
| 3765 | Minimum Cost to Divide Array Into Subarrays | source | 22 ms |
2.3 MB |
40 | 23.2% | 3,100 | 🔴 Hard |
| 3289 | Earliest Second to Mark Indices II | source | 89 ms |
2.4 MB |
59 | 19.9% | 3,100 | 🔴 Hard |
| 3725 | Maximum and Minimum Sums of at Most Size K Subarrays | source | 26 ms |
5.5 MB |
55 | 22.6% | 3,200 | 🔴 Hard |
| 3717 | Minimum Operations to Make Elements Within K Subarrays Equal | source | 265 ms |
8 MB |
99 | 27.1% | 3,200 | 🔴 Hard |
| 3674 | Count Non-Decreasing Subarrays After K Operations | source | 7 ms |
4.5 MB |
69 | 21.2% | 3,200 | 🔴 Hard |
| 3762 | Maximize the Minimum Game Score | source | 150 ms |
3 MB |
56 | 24.7% | 3,300 | 🔴 Hard |
| 3739 | Manhattan Distances of All Arrangements of Pieces | source | 27 ms |
2.5 MB |
143 | 33.1% | 3,300 | 🔴 Hard |
| 3833 | Merge Operations for Minimum Travel Time | source | 6 ms |
2.5 MB |
65 | 27.6% | 3,400 | 🔴 Hard |
| 3562 | Maximum Score of Non-overlapping Intervals | source | 259 ms |
21.4 MB |
122 | 30.3% | 3,400 | 🔴 Hard |
| 3675 | Maximize Sum of Weights after Edge Removals | source | 106 ms |
41.3 MB |
56 | 28.6% | 3,600 | 🔴 Hard |
| 3261 | Minimize OR of Remaining Elements Using Operations | source | 124 ms |
18.7 MB |
62 | 28.4% | 3,700 | 🔴 Hard |
| 3327 | Minimum Moves to Pick K Ones | source | 4 ms |
4.2 MB |
61 | 20.5% | 3,700 | 🔴 Hard |
| 3648 | Find the Maximum Number of Fruits Collected | source | 19 ms |
10.3 MB |
59 | 39.8% | 3,700 | 🔴 Hard |
| 3770 | Lexicographically Smallest Generated String | source | 468 ms |
7.7 MB |
147 | 29.0% | 3,700 | 🔴 Hard |
| 3310 | Count the Number of Houses at a Certain Distance II | source | 35 ms |
6.3 MB |
154 | 22.2% | 3,800 | 🔴 Hard |
| 3203 | Palindrome Rearrangement Queries | source | 87 ms |
33.3 MB |
143 | 23.3% | 3,800 | 🔴 Hard |
| 3407 | Find All Possible Stable Binary Arrays II | source | 338 ms |
57 MB |
162 | 26.0% | 3,800 | 🔴 Hard |
| 3631 | Count K-Reducible Numbers Less Than N | source | 244 ms |
2.2 MB |
180 | 25.3% | 3,800 | 🔴 Hard |
| 3638 | Minimum Operations to Make Character Frequencies Equal | source | 144 ms |
2.3 MB |
77 | 25.0% | 3,800 | 🔴 Hard |
| 3578 | Construct 2D Grid Matching Graph Layout | source | 53 ms |
14.3 MB |
107 | 27.9% | 3,900 | 🔴 Hard |
| 3801 | Count Beautiful Numbers | source | 884 ms |
2.6 MB |
81 | 20.9% | 3,900 | 🔴 Hard |
| 3139 | Subarrays Distinct Element Sum of Squares II | source | 216 ms |
11.2 MB |
247 | 21.0% | 3,900 | 🔴 Hard |
| 3826 | Maximum Profit from Valid Topological Order in DAG | source | 867 ms |
51.2 MB |
48 | 27.2% | 3,900 | 🔴 Hard |
| 3829 | Shortest Path in a Weighted Tree | source | 163 ms |
44 MB |
211 | 32.4% | 3,900 | 🔴 Hard |
| 3680 | Count Connected Components in LCM Graph | source | 59 ms |
5.2 MB |
77 | 28.5% | 4,000 | 🔴 Hard |
| 3224 | Count the Number of Infection Sequences | source | 327 ms |
3.6 MB |
154 | 33.6% | 4,100 | 🔴 Hard |
| 3777 | Maximum Product of Subsequences With an Alternating Sum Equal to K | source | 166 ms |
5.2 MB |
121 | 11.1% | 4,100 | 🔴 Hard |
| 2222 | Abbreviating the Product of a Range | source | 435 ms |
2.6 MB |
120 | 24.5% | 4,200 | 🔴 Hard |
| 3233 | Maximize the Number of Partitions After Operations | source | 269 ms |
4.7 MB |
88 | 27.6% | 4,200 | 🔴 Hard |
| 3592 | Find X-Sum of All K-Long Subarrays II | source | 251 ms |
9.7 MB |
102 | 16.1% | 4,300 | 🔴 Hard |
| 3841 | Concatenated Divisibility | source | 97 ms |
16.8 MB |
84 | 26.1% | 4,400 | 🔴 Hard |
| 1336 | Maximum Product of the Length of Two Palindromic Substrings | source | 21 ms |
5.5 MB |
117 | 30.4% | 4,500 | 🔴 Hard |
| 3557 | Minimum Number of Valid Strings to Form Target II | source | 198 ms |
51.8 MB |
147 | 18.2% | 4,500 | 🔴 Hard |
| 3813 | Smallest Palindromic Rearrangement II | source | 380 ms |
2.5 MB |
104 | 12.3% | 4,600 | 🔴 Hard |
| 2879 | Minimum Changes to Make K Semi-palindromes | source | 223 ms |
66.6 MB |
97 | 35.0% | 4,600 | 🔴 Hard |
| 3580 | Find the Occurrence of First Almost Equal Substring | source | 28 ms |
5.9 MB |
77 | 14.0% | 4,600 | 🔴 Hard |
| 3604 | Find the Number of Possible Ways for an Event | source | 29 ms |
5.9 MB |
152 | 33.3% | 4,700 | 🔴 Hard |
| 2008 | Minimum Cost to Change the Final Value of Expression | source | 39 ms |
16.7 MB |
149 | 50.7% | 4,800 | 🔴 Hard |
| 3575 | Find the Maximum Sequence Value of Array | source | 122 ms |
2.5 MB |
57 | 18.8% | 4,800 | 🔴 Hard |
| 3687 | Longest Special Path | source | 43 ms |
18.3 MB |
95 | 20.1% | 4,800 | 🔴 Hard |
| 3583 | Sorted GCD Pair Queries | source | 28 ms |
5.6 MB |
47 | 19.9% | 4,800 | 🔴 Hard |
| 3784 | Longest Common Prefix of K Strings After Removal | source | 263 ms |
15.3 MB |
119 | 20.4% | 4,800 | 🔴 Hard |
| 3810 | Count Numbers with Non-Decreasing Digits | source | 19 ms |
2.1 MB |
235 | 34.3% | 4,800 | 🔴 Hard |
| 3571 | Length of the Longest Increasing Path | source | 32 ms |
13.3 MB |
69 | 17.0% | 4,900 | 🔴 Hard |
| 1941 | Minimum Number of Operations to Make String Sorted | source | 14 ms |
2.1 MB |
164 | 50.1% | 4,900 | 🔴 Hard |
| 3551 | Maximum XOR Score Subarray Queries | source | 79 ms |
23.6 MB |
47 | 42.1% | 4,900 | 🔴 Hard |
| 3546 | Count Substrings That Satisfy K-Constraint II | source | 247 ms |
16.5 MB |
147 | 21.5% | 5,000 | 🔴 Hard |
| 3542 | Maximum Value Sum by Placing Three Rooks II | source | 28 ms |
5.2 MB |
75 | 26.4% | 5,000 | 🔴 Hard |
| 3091 | Count of Sub-Multisets With Bounded Sum | source | 43 ms |
2.8 MB |
168 | 20.6% | 5,100 | 🔴 Hard |
| 2166 | Number of Valid Move Combinations On Chessboard | source | 71 ms |
2.3 MB |
114 | 47.8% | 5,100 | 🔴 Hard |
| 3696 | Count Substrings Divisible By Last Digit | source | 865 ms |
124.3 MB |
50 | 20.9% | 5,200 | 🔴 Hard |
| 3808 | Longest Palindrome After Substring Concatenation II | source | 105 ms |
9.9 MB |
74 | 15.9% | 5,200 | 🔴 Hard |
| 2642 | Time to Cross a Bridge | source | 49 ms |
3.3 MB |
146 | 43.6% | 5,200 | 🔴 Hard |
| 3459 | Find the Minimum Area to Cover All Ones II | source | 1833 ms |
2.2 MB |
169 | 28.8% | 5,300 | 🔴 Hard |
| 3211 | Find Maximum Non-decreasing Array Length | source | 143 ms |
8.1 MB |
49 | 17.1% | 5,400 | 🔴 Hard |
| 2952 | Minimum Time to Make Array Sum At Most x | source | 20 ms |
6.1 MB |
65 | 25.4% | 5,400 | 🔴 Hard |
| 3692 | Shortest Matching Substring | source | 55 ms |
7.4 MB |
119 | 22.0% | 5,400 | 🔴 Hard |
| 2592 | Minimum Total Cost to Make Arrays Unequal | source | 4 ms |
5.1 MB |
98 | 40.5% | 5,500 | 🔴 Hard |
| 3532 | Time Taken to Mark All Nodes | source | 81 ms |
26.7 MB |
92 | 24.8% | 5,500 | 🔴 Hard |
| 3603 | Check if DFS Strings Are Palindromes | source | 127 ms |
27.9 MB |
159 | 18.0% | 5,600 | 🔴 Hard |
| 1820 | Number Of Ways To Reconstruct A Tree | source | 31 ms |
11 MB |
115 | 44.3% | 5,600 | 🔴 Hard |
| 3402 | Minimum Cost to Equalize Array | source | 8 ms |
3.3 MB |
78 | 17.6% | 5,600 | 🔴 Hard |
| 3697 | Minimum Increments for Target Multiples in an Array | source | 34 ms |
10.4 MB |
65 | 25.7% | 5,700 | 🔴 Hard |
| 3744 | Minimum Operations to Make Array Elements Zero | source | 68 ms |
9.8 MB |
56 | 31.8% | 5,800 | 🔴 Hard |
| 2319 | Longest Substring of One Repeating Character | source | 245 ms |
10.9 MB |
133 | 33.1% | 5,800 | 🔴 Hard |
| 3032 | Maximize Value of Function in a Ball Passing Game | source | 509 ms |
63.6 MB |
52 | 29.1% | 5,900 | 🔴 Hard |
| 3431 | Find the Minimum Cost Array Permutation | source | 1185 ms |
7.1 MB |
86 | 23.8% | 5,900 | 🔴 Hard |
| 2726 | Minimum Reverse Operations | source | 84 ms |
4.7 MB |
71 | 15.4% | 6,000 | 🔴 Hard |
| 3706 | Smallest Substring With Identical Characters II | source | 47 ms |
2.4 MB |
82 | 39.9% | 6,000 | 🔴 Hard |
| 3238 | Minimum Cost to Convert String II | source | 801 ms |
10.7 MB |
155 | 25.6% | 6,000 | 🔴 Hard |
| 3024 | String Transformation | source | 31 ms |
17.9 MB |
212 | 25.4% | 6,000 | 🔴 Hard |
| 3364 | Minimum Sum of Values by Dividing Array | source | 23 ms |
2.3 MB |
103 | 26.9% | 6,100 | 🔴 Hard |
| 3316 | Find the Sum of Subsequence Powers | source | 288 ms |
2.3 MB |
163 | 23.6% | 6,100 | 🔴 Hard |
| 2028 | The Earliest and Latest Rounds Where Players Compete | source | 4 ms |
2.3 MB |
92 | 48.1% | 6,200 | 🔴 Hard |
| 1913 | Make the XOR of All Segments Equal to Zero | source | 25 ms |
2.4 MB |
76 | 40.0% | 6,200 | 🔴 Hard |
| 3560 | Maximum Number of Moves to Kill All Pawns | source | 148 ms |
5.9 MB |
105 | 32.3% | 6,400 | 🔴 Hard |
| 2708 | Find the String with LCP | source | 3 ms |
10.2 MB |
67 | 31.6% | 6,400 | 🔴 Hard |
| 3260 | Divide an Array Into Subarrays With Minimum Cost II | source | 197 ms |
6.3 MB |
95 | 30.5% | 6,500 | 🔴 Hard |
| 3608 | Find the Number of Subsequences With Equal GCD | source | 101 ms |
2.5 MB |
158 | 29.0% | 6,500 | 🔴 Hard |
| 3690 | Smallest Substring With Identical Characters I | source | 0 ms |
2.2 MB |
82 | 19.2% | 6,500 | 🔴 Hard |
| 3208 | Count Beautiful Substrings II | source | 403 ms |
21.1 MB |
65 | 24.9% | 6,600 | 🔴 Hard |
| 1778 | Maximize Grid Happiness | source | 42 ms |
2.4 MB |
116 | 39.8% | 6,700 | 🔴 Hard |
| 3733 | Length of Longest V-Shaped Diagonal Segment | source | 302 ms |
30.5 MB |
109 | 33.6% | 6,700 | 🔴 Hard |
| 2703 | Handling Sum Queries After Update | source | 74 ms |
14 MB |
147 | 29.3% | 6,800 | 🔴 Hard |
| 2068 | Maximum Genetic Difference Query | source | 163 ms |
35.1 MB |
105 | 44.5% | 6,900 | 🔴 Hard |
| 2109 | Find Array Given Subset Sums | source | 27 ms |
2.6 MB |
77 | 48.8% | 6,900 | 🔴 Hard |
| 3423 | Maximum Sum of Subsequence With Non-adjacent Elements | source | 471 ms |
25 MB |
111 | 15.3% | 7,000 | 🔴 Hard |
| 3536 | Find the Count of Monotonic Pairs II | source | 47 ms |
2.3 MB |
149 | 23.0% | 7,100 | 🔴 Hard |
| 2839 | Maximum Sum Queries | source | 33 ms |
13.5 MB |
103 | 28.2% | 7,100 | 🔴 Hard |
| 3478 | Check if the Rectangle Corner Is Reachable | source | 274 ms |
2.3 MB |
287 | 25.8% | 7,300 | 🔴 Hard |
| 3362 | Find the Median of the Uniqueness Array | source | 743 ms |
5.7 MB |
66 | 28.1% | 7,400 | 🔴 Hard |
| 1255 | Reverse Subarray To Maximize Array Value | source | 3 ms |
2.4 MB |
63 | 42.6% | 7,400 | 🔴 Hard |
| 1563 | Maximum Number of Darts Inside of a Circular Dartboard | source | 1 ms |
2.1 MB |
125 | 38.5% | 7,500 | 🔴 Hard |
| 3313 | Maximum Strength of K Disjoint Subarrays | source | 18 ms |
2.4 MB |
47 | 26.9% | 7,500 | 🔴 Hard |
| 2091 | Number of Ways to Separate Numbers | source | 157 ms |
194.2 MB |
133 | 21.0% | 7,600 | 🔴 Hard |
| 3197 | Maximum Strong Pair XOR II | source | 453 ms |
24.3 MB |
86 | 30.9% | 7,600 | 🔴 Hard |
| 1924 | Maximum Number of Groups Getting Fresh Donuts | source | 0 ms |
2.2 MB |
78 | 40.5% | 7,700 | 🔴 Hard |
| 2826 | Find a Good Subset of the Matrix | source | 46 ms |
2.9 MB |
41 | 46.0% | 7,700 | 🔴 Hard |
| 2894 | Maximum Elegance of a K-Length Subsequence | source | 10 ms |
9.6 MB |
65 | 28.0% | 7,700 | 🔴 Hard |
| 3443 | Maximum Total Reward Using Operations II | source | 1124 ms |
2.6 MB |
115 | 20.7% | 7,800 | 🔴 Hard |
| 3153 | Apply Operations on Array to Maximize Sum of Squares | source | 47 ms |
3.7 MB |
39 | 43.3% | 7,800 | 🔴 Hard |
| 3079 | Minimum Edge Weight Equilibrium Queries in a Tree | source | 85 ms |
9.7 MB |
164 | 43.3% | 7,900 | 🔴 Hard |
| 3552 | Find the Largest Palindrome Divisible by K | source | 263 ms |
5.9 MB |
60 | 15.4% | 7,900 | 🔴 Hard |
| 2652 | Count Number of Possible Root Nodes | source | 51 ms |
43 MB |
92 | 46.6% | 7,900 | 🔴 Hard |
| 2013 | Minimum Skips to Arrive at Meeting On Time | source | 444 ms |
18 MB |
128 | 38.2% | 8,000 | 🔴 Hard |
| 1789 | Delivering Boxes from Storage to Ports | source | 14 ms |
12.9 MB |
94 | 39.5% | 8,000 | 🔴 Hard |
| 1513 | Find All Good Strings | source | 7 ms |
2.6 MB |
215 | 43.8% | 8,100 | 🔴 Hard |
| 1836 | Count Ways to Make Array With Product | source | 27 ms |
4 MB |
179 | 53.2% | 8,100 | 🔴 Hard |
| 3184 | Maximum Balanced Subsequence Sum | source | 51 ms |
4.7 MB |
67 | 25.1% | 8,100 | 🔴 Hard |
| 3196 | Apply Operations to Maximize Frequency Score | source | 12 ms |
4.2 MB |
48 | 36.5% | 8,200 | 🔴 Hard |
| 3460 | Count the Number of Inversions | source | 15 ms |
2.1 MB |
170 | 28.0% | 8,200 | 🔴 Hard |
| 2380 | Booking Concert Tickets in Groups | source | 58 ms |
32.5 MB |
145 | 17.7% | 8,300 | 🔴 Hard |
| 2905 | Count Paths That Can Form a Palindrome in a Tree | source | 143 ms |
10.5 MB |
66 | 45.5% | 8,300 | 🔴 Hard |
| 3112 | Count Valid Paths in a Tree | source | 98 ms |
42.1 MB |
178 | 34.5% | 8,300 | 🔴 Hard |
| 3452 | Find the Maximum Length of a Good Subsequence II | source | 12 ms |
2.5 MB |
50 | 24.0% | 8,300 | 🔴 Hard |
| 2147 | The Score of Students Solving Math Expression | source | 1135 ms |
3.3 MB |
155 | 33.3% | 8,400 | 🔴 Hard |
| 1727 | Cat and Mouse II | source | 1843 ms |
2.4 MB |
147 | 39.7% | 8,400 | 🔴 Hard |
| 1891 | Count Pairs Of Nodes | source | 55 ms |
15.1 MB |
67 | 40.9% | 8,400 | 🔴 Hard |
| 2023 | Design Movie Rental System | source | 76 ms |
66.2 MB |
71 | 35.7% | 8,500 | 🔴 Hard |
| 2400 | Minimum Score After Removals on a Tree | source | 50 ms |
2.4 MB |
123 | 52.1% | 8,500 | 🔴 Hard |
| 1968 | Maximum Building Height | source | 19 ms |
9.7 MB |
64 | 37.6% | 8,600 | 🔴 Hard |
| 3774 | Check If Digits Are Equal in String After Operations II | source | 444 ms |
2.5 MB |
90 | 10.7% | 8,600 | 🔴 Hard |
| 2330 | Maximum Total Beauty of the Gardens | source | 428 ms |
4.7 MB |
65 | 30.0% | 8,600 | 🔴 Hard |
| 3544 | Count Almost Equal Pairs II | source | 1717 ms |
3.2 MB |
61 | 26.6% | 8,600 | 🔴 Hard |
| 3550 | Maximum Value Sum by Placing Three Rooks I | source | 9 ms |
2.4 MB |
75 | 15.3% | 8,700 | 🔴 Hard |
| 1936 | Maximize Number of Nice Divisors | source | 1 ms |
2.2 MB |
177 | 33.1% | 8,700 | 🔴 Hard |
| 3047 | Maximum Element-Sum of a Complete Subset of Indices | source | 0 ms |
2.6 MB |
34 | 41.7% | 8,700 | 🔴 Hard |
| 3345 | Find the Sum of the Power of All Subsequences | source | 7 ms |
2.2 MB |
152 | 36.8% | 8,800 | 🔴 Hard |
| 2200 | Stamping the Grid | source | 87 ms |
29.4 MB |
111 | 33.6% | 8,900 | 🔴 Hard |
| 1012 | Equal Rational Numbers | source | 0 ms |
2.1 MB |
155 | 44.7% | 8,900 | 🔴 Hard |
| 2618 | Maximize the Minimum Powered City | source | 34 ms |
4.1 MB |
56 | 33.2% | 8,900 | 🔴 Hard |
| 1861 | Building Boxes | source | 0 ms |
2.2 MB |
41 | 51.9% | 8,900 | 🔴 Hard |
| 3217 | Number of Possible Sets of Closing Branches | source | 45 ms |
2.2 MB |
72 | 48.6% | 9,000 | 🔴 Hard |
| 2051 | Longest Common Subpath | source | 157 ms |
13 MB |
90 | 28.3% | 9,000 | 🔴 Hard |
| 2849 | Sum of Imbalance Numbers of All Subarrays | source | 3 ms |
2.3 MB |
37 | 42.3% | 9,000 | 🔴 Hard |
| 3640 | Maximum Frequency of an Element After Performing Operations II | source | 60 ms |
4.1 MB |
41 | 37.2% | 9,000 | 🔴 Hard |
| 2531 | Create Components With Same Value | source | 74 ms |
7.7 MB |
79 | 52.0% | 9,100 | 🔴 Hard |
| 2701 | Subsequence With the Minimum Score | source | 0 ms |
4.1 MB |
66 | 32.5% | 9,300 | 🔴 Hard |
| 1313 | Count Ways to Build Rooms in an Ant Colony | source | 186 ms |
25.3 MB |
166 | 48.7% | 9,300 | 🔴 Hard |
| 2921 | Count Stepping Numbers in Range | source | 58 ms |
2.4 MB |
195 | 26.1% | 9,400 | 🔴 Hard |
| 2627 | Difference Between Maximum and Minimum Price Sum | source | 37 ms |
17.3 MB |
80 | 31.9% | 9,400 | 🔴 Hard |
| 3179 | Maximum Points After Collecting Coins From All Nodes | source | 93 ms |
54.3 MB |
180 | 35.9% | 9,500 | 🔴 Hard |
| 2635 | Check if Point Is Reachable | source | 0 ms |
2.1 MB |
31 | 43.6% | 9,600 | 🔴 Hard |
| 3223 | Count Complete Substrings | source | 39 ms |
2.4 MB |
69 | 28.8% | 9,600 | 🔴 Hard |
| 3588 | Count The Number of Winning Sequences | source | 243 ms |
2.5 MB |
183 | 31.3% | 9,700 | 🔴 Hard |
| 3344 | Minimize Manhattan Distances | source | 11 ms |
9.9 MB |
52 | 31.6% | 9,700 | 🔴 Hard |
| 3556 | Final Array State After K Multiplication Operations II | source | 47 ms |
2.8 MB |
73 | 11.9% | 9,700 | 🔴 Hard |
| 3435 | Block Placement Queries | source | 1813 ms |
14.7 MB |
116 | 16.9% | 9,900 | 🔴 Hard |
| 1799 | Minimum Incompatibility | source | 263 ms |
3 MB |
73 | 39.8% | 9,900 | 🔴 Hard |
| 2105 | The Number of Good Subsets | source | 10 ms |
3.2 MB |
180 | 36.0% | 9,900 | 🔴 Hard |
| 2131 | Smallest Missing Genetic Value in Each Subtree | source | 152 ms |
37.3 MB |
71 | 46.6% | 9,900 | 🔴 Hard |
| 2687 | Lexicographically Smallest Beautiful String | source | 0 ms |
2.5 MB |
66 | 37.0% | 10,000 | 🔴 Hard |
| 3298 | Maximize Consecutive Elements in an Array After Modification | source | 41 ms |
8 MB |
47 | 32.6% | 10,000 | 🔴 Hard |
| 3218 | Find Number of Coins to Place in Tree Nodes | source | 56 ms |
9.8 MB |
100 | 36.5% | 10,100 | 🔴 Hard |
| 3248 | Count the Number of Incremovable Subarrays II | source | 4 ms |
3.6 MB |
43 | 39.1% | 10,100 | 🔴 Hard |
| 2157 | Smallest K-Length Subsequence With Occurrences of a Letter | source | 65 ms |
13.4 MB |
76 | 39.0% | 10,200 | 🔴 Hard |
| 2079 | Delete Duplicate Folders in System | source | 122 ms |
16.1 MB |
118 | 53.8% | 10,200 | 🔴 Hard |
| 1707 | Check If String Is Transformable With Substring Sort Operations | source | 7 ms |
3.8 MB |
51 | 48.6% | 10,300 | 🔴 Hard |
| 1577 | Probability of a Two Boxes Having The Same Number of Distinct Balls | source | 0 ms |
2.1 MB |
70 | 60.1% | 10,300 | 🔴 Hard |
| 3438 | Peaks in Array | source | 19 ms |
10.7 MB |
103 | 25.9% | 10,400 | 🔴 Hard |
| 3375 | Kth Smallest Amount With Single Denomination Combination | source | 3 ms |
2.3 MB |
59 | 18.6% | 10,400 | 🔴 Hard |
| 2697 | Minimum Number of Visited Cells in a Grid | source | 97 ms |
13.7 MB |
72 | 22.8% | 10,500 | 🔴 Hard |
| 2326 | Sum of Scores of Built Strings | source | 5 ms |
3.5 MB |
52 | 42.4% | 10,700 | 🔴 Hard |
| 2717 | Collect Coins in a Tree | source | 48 ms |
7.8 MB |
90 | 36.9% | 10,700 | 🔴 Hard |
| 1717 | Minimum Cost to Connect Two Groups of Points | source | 39 ms |
2.2 MB |
60 | 48.4% | 10,800 | 🔴 Hard |
| 2276 | Groups of Strings | source | 339 ms |
5.6 MB |
114 | 26.7% | 10,800 | 🔴 Hard |
| 3646 | Sum of Good Subsequences | source | 71 ms |
4.4 MB |
143 | 29.8% | 10,900 | 🔴 Hard |
| 1947 | Number of Different Subsequences GCDs | source | 149 ms |
3.6 MB |
44 | 42.2% | 10,900 | 🔴 Hard |
| 1326 | Sum of Floored Pairs | source | 51 ms |
4.2 MB |
39 | 29.7% | 10,900 | 🔴 Hard |
| 3563 | Select Cells in Grid With Maximum Score | source | 0 ms |
2.1 MB |
52 | 14.5% | 11,000 | 🔴 Hard |
| 2466 | Maximum Segment Sum After Removals | source | 6 ms |
6.7 MB |
73 | 48.5% | 11,100 | 🔴 Hard |
| 1907 | Count Pairs With XOR in a Range | source | 292 ms |
2.9 MB |
38 | 45.8% | 11,100 | 🔴 Hard |
| 2682 | Count Increasing Quadruplets | source | 314 ms |
127.4 MB |
52 | 33.9% | 11,200 | 🔴 Hard |
| 1957 | Closest Room | source | 35 ms |
13.4 MB |
82 | 39.7% | 11,200 | 🔴 Hard |
| 2784 | Power of Heroes | source | 47 ms |
3.6 MB |
139 | 29.8% | 11,200 | 🔴 Hard |
| 3105 | Minimum Edge Reversals So Every Node Is Reachable | source | 131 ms |
48 MB |
143 | 55.3% | 11,300 | 🔴 Hard |
| 1322 | Minimum Moves to Reach Target with Rotations | source | 11 ms |
2.8 MB |
95 | 50.7% | 11,300 | 🔴 Hard |
| 3017 | Number of Beautiful Integers in the Range | source | 21 ms |
2.9 MB |
72 | 19.7% | 11,500 | 🔴 Hard |
| 3277 | Find the Number of Ways to Place People II | source | 66 ms |
2.4 MB |
39 | 45.8% | 11,500 | 🔴 Hard |
| 2125 | GCD Sort of an Array | source | 60 ms |
6.3 MB |
111 | 46.6% | 11,500 | 🔴 Hard |
| 2002 | Stone Game VIII | source | 5 ms |
3.5 MB |
31 | 52.9% | 11,500 | 🔴 Hard |
| 2462 | Find the K-Sum of an Array | source | 18 ms |
4.7 MB |
49 | 39.8% | 11,600 | 🔴 Hard |
| 2601 | Number of Great Partitions | source | 1 ms |
2.2 MB |
154 | 32.3% | 11,600 | 🔴 Hard |
| 1004 | Least Operators to Express Number | source | 0 ms |
2.2 MB |
69 | 48.4% | 11,600 | 🔴 Hard |
| 1629 | Minimum Possible Integer After at Most K Adjacent Swaps On Digits | source | 44 ms |
2.6 MB |
63 | 40.0% | 11,800 | 🔴 Hard |
| 2193 | Count Fertile Pyramids in a Land | source | 50 ms |
3.4 MB |
55 | 65.5% | 11,800 | 🔴 Hard |
| 2739 | Minimize the Total Price of the Trips | source | 4 ms |
2.5 MB |
190 | 46.2% | 11,900 | 🔴 Hard |
| 1875 | Tree of Coprimes | source | 42 ms |
21.6 MB |
72 | 42.4% | 12,100 | 🔴 Hard |
| 2689 | Rearranging Fruits | source | 16 ms |
7.6 MB |
57 | 35.3% | 12,200 | 🔴 Hard |
| 2569 | Number of Beautiful Partitions | source | 7 ms |
2.2 MB |
125 | 32.1% | 12,200 | 🔴 Hard |
| 3376 | Longest Common Suffix Queries | source | 442 ms |
136.9 MB |
101 | 36.5% | 12,400 | 🔴 Hard |
| 3296 | Minimum Time to Revert Word to Initial State II | source | 19 ms |
12.9 MB |
62 | 34.4% | 12,400 | 🔴 Hard |
| 3482 | Construct String with Minimum Cost | source | 588 ms |
39.4 MB |
165 | 19.2% | 12,500 | 🔴 Hard |
| 1645 | Find a Value of a Mysterious Function Closest to Target | source | 181 ms |
3.5 MB |
40 | 45.8% | 12,500 | 🔴 Hard |
| 3140 | Count Visited Nodes in a Directed Graph | source | 32 ms |
15.5 MB |
57 | 29.1% | 12,500 | 🔴 Hard |
| 2919 | Maximum Number of Groups With Increasing Length | source | 1418 ms |
6.2 MB |
128 | 22.2% | 12,500 | 🔴 Hard |
| 2657 | Minimum Time to Complete All Tasks | source | 75 ms |
2.5 MB |
57 | 37.9% | 12,500 | 🔴 Hard |
| 2499 | Minimum Money Required Before Transactions | source | 7 ms |
11 MB |
41 | 41.4% | 12,500 | 🔴 Hard |
| 2060 | Merge BSTs to Create Single BST | source | 99 ms |
9.6 MB |
199 | 36.0% | 12,600 | 🔴 Hard |
| 2135 | Maximum Number of Ways to Partition an Array | source | 123 ms |
10 MB |
54 | 34.7% | 12,600 | 🔴 Hard |
| 2241 | Recover the Original Array | source | 19 ms |
2.2 MB |
53 | 40.2% | 12,600 | 🔴 Hard |
| 3466 | Number of Subarrays With AND Value of K | source | 277 ms |
3.1 MB |
42 | 34.0% | 12,700 | 🔴 Hard |
| 1805 | Minimum Adjacent Swaps for K Consecutive Ones | source | 3 ms |
4.7 MB |
52 | 42.0% | 12,800 | 🔴 Hard |
| 3350 | Distribute Elements Into Two Arrays II | source | 32 ms |
7.4 MB |
105 | 29.4% | 12,800 | 🔴 Hard |
| 2404 | Number of Distinct Roll Sequences | source | 65 ms |
7.2 MB |
128 | 57.4% | 12,800 | 🔴 Hard |
| 3290 | Number of Subarrays That Match a Pattern II | source | 20 ms |
28.4 MB |
53 | 32.3% | 12,800 | 🔴 Hard |
| 3382 | Find the Number of Subarrays Where Boundary Elements Are Maximum | source | 3 ms |
5.5 MB |
34 | 31.1% | 12,900 | 🔴 Hard |
| 2765 | Make Array Empty | source | 31 ms |
4.7 MB |
83 | 25.5% | 12,900 | 🔴 Hard |
| 3531 | Minimum Amount of Damage Dealt to Bob | source | 31 ms |
5.5 MB |
41 | 38.3% | 13,000 | 🔴 Hard |
| 1897 | Maximize Palindrome Length From Subsequences | source | 412 ms |
18.7 MB |
85 | 37.3% | 13,100 | 🔴 Hard |
| 2229 | Maximum Fruits Harvested After at Most K Steps | source | 4 ms |
9.9 MB |
70 | 36.6% | 13,100 | 🔴 Hard |
| 1740 | Count Subtrees With Max Distance Between Cities | source | 7 ms |
2.3 MB |
73 | 66.7% | 13,300 | 🔴 Hard |
| 3025 | Minimum Operations to Form Subsequence With Target Sum | source | 0 ms |
2.3 MB |
60 | 31.6% | 13,300 | 🔴 Hard |
| 3212 | Count the Number of Good Partitions | source | 20 ms |
9.3 MB |
53 | 47.2% | 13,300 | 🔴 Hard |
| 1376 | Selling Pieces of Wood | source | 25 ms |
3.8 MB |
46 | 51.6% | 13,600 | 🔴 Hard |
| 1728 | Fancy Sequence | source | 61 ms |
44.2 MB |
146 | 17.4% | 13,800 | 🔴 Hard |
| 3414 | Find Number of Ways to Reach the K-th Stair | source | 2 ms |
2.1 MB |
35 | 36.3% | 13,800 | 🔴 Hard |
| 3107 | Maximum Spending After Buying Items | source | 0 ms |
3.9 MB |
27 | 60.1% | 13,800 | 🔴 Hard |
| 2295 | Minimum Time to Finish the Race | source | 23 ms |
12.4 MB |
72 | 42.3% | 13,800 | 🔴 Hard |
| 781 | Basic Calculator IV | source | 3 ms |
2.4 MB |
263 | 48.7% | 13,900 | 🔴 Hard |
| 3436 | Find Subarray With Bitwise OR Closest to K | source | 323 ms |
3.9 MB |
39 | 29.7% | 13,900 | 🔴 Hard |
| 3057 | Count K-Subsequences of a String With Maximum Beauty | source | 0 ms |
2.7 MB |
169 | 29.7% | 14,000 | 🔴 Hard |
| 2086 | Count Number of Special Subsequences | source | 16 ms |
2.7 MB |
103 | 51.9% | 14,000 | 🔴 Hard |
| 3305 | Count Prefix and Suffix Pairs II | source | 368 ms |
143.1 MB |
99 | 27.3% | 14,200 | 🔴 Hard |
| 2267 | Minimum Difference in Sums After Removal of Elements | source | 91 ms |
13.1 MB |
48 | 49.7% | 14,200 | 🔴 Hard |
| 3514 | Shortest Distance After Road Addition Queries II | source | 180 ms |
9.3 MB |
44 | 25.6% | 14,200 | 🔴 Hard |
| 2286 | Minimum Time to Remove All Cars Containing Illegal Goods | source | 16 ms |
3.6 MB |
49 | 41.3% | 14,200 | 🔴 Hard |
| 1696 | Strange Printer II | source | 0 ms |
2.4 MB |
89 | 60.0% | 14,200 | 🔴 Hard |
| 2633 | Minimum Cost to Split an Array | source | 19 ms |
2.3 MB |
38 | 42.5% | 14,700 | 🔴 Hard |
| 1832 | Minimum Operations to Make a Subsequence | source | 17 ms |
7.3 MB |
39 | 48.9% | 14,700 | 🔴 Hard |
| 2234 | Minimum Operations to Make the Array K-Increasing | source | 42 ms |
3.7 MB |
43 | 39.3% | 14,700 | 🔴 Hard |
| 3303 | Find Beautiful Indices in the Given Array II | source | 31 ms |
14.3 MB |
91 | 26.5% | 14,800 | 🔴 Hard |
| 2457 | Count Special Integers | source | 0 ms |
2.1 MB |
65 | 40.1% | 14,800 | 🔴 Hard |
| 2311 | Minimum White Tiles After Covering With Carpets | source | 15 ms |
2.2 MB |
47 | 37.3% | 14,800 | 🔴 Hard |
| 2549 | Next Greater Element IV | source | 68 ms |
5.9 MB |
47 | 40.2% | 14,900 | 🔴 Hard |
| 2353 | Maximum Score of a Node Sequence | source | 30 ms |
8.5 MB |
49 | 39.1% | 15,100 | 🔴 Hard |
| 2115 | Number of Unique Good Subsequences | source | 7 ms |
3.8 MB |
117 | 52.2% | 15,200 | 🔴 Hard |
| 2275 | Find Substring With Given Hash Value | source | 7 ms |
2.3 MB |
75 | 25.0% | 15,200 | 🔴 Hard |
| 828 | Chalkboard XOR Game | source | 0 ms |
2.2 MB |
24 | 63.1% | 15,300 | 🔴 Hard |
| 2539 | Minimum Number of Operations to Make Arrays Similar | source | 10 ms |
4.4 MB |
42 | 60.6% | 15,300 | 🔴 Hard |
| 2818 | Maximum Strictly Increasing Cells in a Matrix | source | 52 ms |
11 MB |
53 | 30.7% | 15,400 | 🔴 Hard |
| 1433 | Encrypt and Decrypt Strings | source | 11 ms |
6.3 MB |
84 | 37.0% | 15,400 | 🔴 Hard |
| 2018 | Minimum Space Wasted From Packaging | source | 16 ms |
6.2 MB |
46 | 32.7% | 15,500 | 🔴 Hard |
| 3572 | Count Substrings That Can Be Rearranged to Contain a String II | source | 72 ms |
16.2 MB |
69 | 55.3% | 15,500 | 🔴 Hard |
| 2344 | Escape the Spreading Fire | source | 11 ms |
2.7 MB |
111 | 36.4% | 15,500 | 🔴 Hard |
| 750 | Contain Virus | source | 6 ms |
2.6 MB |
179 | 52.7% | 15,600 | 🔴 Hard |
| 2272 | Maximum Good People Based on Statements | source | 69 ms |
2.3 MB |
44 | 51.1% | 15,600 | 🔴 Hard |
| 3386 | Find Edges in Shortest Paths | source | 87 ms |
13.4 MB |
147 | 45.6% | 15,800 | 🔴 Hard |
| 2510 | Maximum Deletions on a String | source | 182 ms |
2.5 MB |
62 | 34.6% | 15,900 | 🔴 Hard |
| 2577 | Count Palindromic Subsequences | source | 1403 ms |
2.6 MB |
134 | 39.4% | 16,000 | 🔴 Hard |
| 2574 | Count Subarrays With Median K | source | 14 ms |
4.5 MB |
43 | 45.7% | 16,000 | 🔴 Hard |
| 2419 | Subarray With Elements Greater Than Varying Threshold | source | 12 ms |
4.6 MB |
47 | 44.6% | 16,100 | 🔴 Hard |
| 2605 | Count Anagrams | source | 93 ms |
5.6 MB |
165 | 35.3% | 16,100 | 🔴 Hard |
| 1429 | Verbal Arithmetic Puzzle | source | 683 ms |
2.2 MB |
132 | 34.8% | 16,200 | 🔴 Hard |
| 2291 | Maximum AND Sum of Array | source | 496 ms |
3.3 MB |
39 | 49.9% | 16,200 | 🔴 Hard |
| 814 | Smallest Rotation with Highest Score | source | 0 ms |
3.2 MB |
41 | 52.2% | 16,200 | 🔴 Hard |
| 2597 | Cycle Length Queries in a Tree | source | 8 ms |
9.3 MB |
34 | 58.5% | 16,500 | 🔴 Hard |
| 489 | Kth Smallest Instructions | source | 0 ms |
2.3 MB |
42 | 43.8% | 16,600 | 🔴 Hard |
| 2393 | Match Substring After Replacement | source | 35 ms |
2.5 MB |
72 | 42.2% | 16,600 | 🔴 Hard |
| 1234 | Number of Paths with Max Score | source | 1 ms |
2.2 MB |
177 | 41.1% | 16,600 | 🔴 Hard |
| 2513 | Number of Pairs Satisfying Inequality | source | 18 ms |
4.4 MB |
71 | 45.5% | 16,700 | 🔴 Hard |
| 2757 | Count of Integers | source | 61 ms |
2.8 MB |
168 | 37.1% | 16,800 | 🔴 Hard |
| 2307 | Replace Non-Coprime Numbers in Array | source | 11 ms |
3.7 MB |
47 | 40.5% | 16,900 | 🔴 Hard |
| 2321 | Minimum Weighted Subgraph With the Required Paths | source | 99 ms |
28.7 MB |
164 | 38.8% | 17,000 | 🔴 Hard |
| 2430 | Number of Excellent Pairs | source | 10 ms |
4 MB |
36 | 48.1% | 17,100 | 🔴 Hard |
| 1000 | Delete Columns to Make Sorted III | source | 2 ms |
2.3 MB |
62 | 58.8% | 17,100 | 🔴 Hard |
| 2596 | Add Edges to Make Degrees of All Nodes Even | source | 23 ms |
13.4 MB |
72 | 33.6% | 17,200 | 🔴 Hard |
| 1638 | Best Position for a Service Centre | source | 175 ms |
2.2 MB |
138 | 34.9% | 17,300 | 🔴 Hard |
| 1996 | Number of Ways to Rearrange Sticks With K Sticks Visible | source | 23 ms |
6 MB |
137 | 57.9% | 17,400 | 🔴 Hard |
| 1344 | Maximum Equal Frequency | source | 0 ms |
3.4 MB |
66 | 37.5% | 17,400 | 🔴 Hard |
| 1989 | Minimum XOR Sum of Two Arrays | source | 5 ms |
2.2 MB |
30 | 49.2% | 17,600 | 🔴 Hard |
| 2563 | Split Message Based on Limit | source | 37 ms |
3.2 MB |
71 | 42.5% | 17,600 | 🔴 Hard |
| 2435 | Shortest Impossible Sequence of Rolls | source | 4 ms |
6.4 MB |
67 | 68.8% | 17,700 | 🔴 Hard |
| 2647 | Split the Array to Make Coprime Products | source | 1654 ms |
25.4 MB |
50 | 28.1% | 17,700 | 🔴 Hard |
| 1668 | Find Longest Awesome Substring | source | 2 ms |
2.5 MB |
51 | 45.3% | 17,900 | 🔴 Hard |
| 591 | Tag Validator | source | 2 ms |
2.2 MB |
162 | 39.1% | 18,100 | 🔴 Hard |
| 1531 | Number of Ways to Wear Different Hats to Each Other | source | 11 ms |
2.1 MB |
148 | 44.5% | 18,100 | 🔴 Hard |
| 3454 | Minimum Operations to Make Array Equal to Target | source | 3 ms |
4.4 MB |
43 | 38.8% | 18,300 | 🔴 Hard |
| 2349 | Check if There Is a Valid Parentheses String Path | source | 41 ms |
3.8 MB |
58 | 39.5% | 18,400 | 🔴 Hard |
| 2207 | Sequentially Ordinal Rank Tracker | source | 77 ms |
27.8 MB |
112 | 61.7% | 18,400 | 🔴 Hard |
| 939 | Valid Permutations for DI Sequence | source | 18 ms |
2.4 MB |
160 | 56.8% | 18,600 | 🔴 Hard |
| 3535 | Find the Count of Monotonic Pairs I | source | 21 ms |
2.3 MB |
150 | 46.6% | 18,900 | 🔴 Hard |
| 1758 | Distribute Repeating Integers | source | 169 ms |
3 MB |
51 | 39.8% | 18,900 | 🔴 Hard |
| 2184 | Check if an Original String Exists Given Two Encoded Strings | source | 435 ms |
4.3 MB |
218 | 43.2% | 19,000 | 🔴 Hard |
| 1262 | Online Majority Element In Subarray | source | 102 ms |
11.2 MB |
41 | 39.2% | 19,300 | 🔴 Hard |
| 798 | Transform to Chessboard | source | 0 ms |
2.3 MB |
80 | 50.6% | 19,800 | 🔴 Hard |
| 2559 | Maximum Number of Non-overlapping Palindrome Substrings | source | 40 ms |
2.1 MB |
107 | 41.6% | 20,000 | 🔴 Hard |
| 1244 | Distinct Echo Substrings | source | 91 ms |
33.5 MB |
60 | 52.1% | 20,100 | 🔴 Hard |
| 1471 | Maximum Students Taking Exam | source | 0 ms |
2.3 MB |
82 | 52.3% | 20,200 | 🔴 Hard |
| 1784 | Minimum Initial Energy to Finish Tasks | source | 387 ms |
12.4 MB |
52 | 59.4% | 20,600 | 🔴 Hard |
| 2198 | Process Restricted Friend Requests | source | 111 ms |
2.4 MB |
82 | 57.1% | 20,600 | 🔴 Hard |
| 2301 | Count Array Pairs Divisible by K | source | 48 ms |
12.7 MB |
52 | 30.2% | 20,800 | 🔴 Hard |
| 2526 | Longest Increasing Subsequence II | source | 26 ms |
4.9 MB |
76 | 25.5% | 20,800 | 🔴 Hard |
| 1057 | Numbers With Repeated Digits | source | 73 ms |
3.9 MB |
65 | 43.6% | 20,900 | 🔴 Hard |
| 2648 | Number of Ways to Earn Points | source | 15 ms |
2.1 MB |
139 | 58.7% | 20,900 | 🔴 Hard |
| 1223 | Graph Connectivity With Threshold | source | 5 ms |
8.9 MB |
71 | 48.2% | 21,000 | 🔴 Hard |
| 1270 | Dinner Plate Stacks | source | 106 ms |
78.8 MB |
58 | 32.8% | 21,200 | 🔴 Hard |
| 1644 | Maximum Number of Non-Overlapping Substrings | source | 6 ms |
2.7 MB |
108 | 40.1% | 21,300 | 🔴 Hard |
| 1545 | Form Largest Integer With Digits That Add up to Target | source | 0 ms |
2.2 MB |
68 | 48.8% | 21,300 | 🔴 Hard |
| 809 | Preimage Size of Factorial Zeroes Function | source | 0 ms |
2.2 MB |
46 | 45.9% | 21,800 | 🔴 Hard |
| 1348 | Maximum Score Of Spliced Array | source | 0 ms |
3.9 MB |
37 | 57.6% | 21,900 | 🔴 Hard |
| 1024 | Triples with Bitwise AND Equal To Zero | source | 266 ms |
2.7 MB |
45 | 59.4% | 22,100 | 🔴 Hard |
| 1710 | Find Servers That Handled Most Number of Requests | source | 53 ms |
6.4 MB |
65 | 44.1% | 22,500 | 🔴 Hard |
| 3500 | Minimum Cost for Cutting Cake II | source | 644 ms |
4.1 MB |
121 | 54.7% | 22,600 | 🔴 Hard |
| 1587 | Parallel Courses II | source | 382 ms |
2.5 MB |
55 | 29.5% | 22,600 | 🔴 Hard |
| 466 | Count The Repetitions | source | 24 ms |
7.4 MB |
85 | 32.0% | 23,200 | 🔴 Hard |
| 949 | Cat and Mouse | source | 41 ms |
5.3 MB |
105 | 34.0% | 23,300 | 🔴 Hard |
| 2368 | Sum of Total Strength of Wizards | source | 11 ms |
5.4 MB |
142 | 28.4% | 23,500 | 🔴 Hard |
| 1881 | Closest Subsequence Sum | source | 65 ms |
14.5 MB |
52 | 41.8% | 23,600 | 🔴 Hard |
| 763 | Special Binary String | source | 0 ms |
2.3 MB |
61 | 63.6% | 23,700 | 🔴 Hard |
| 1963 | Find XOR Sum of All Pairs Bitwise AND | source | 3 ms |
3.9 MB |
37 | 61.7% | 23,700 | 🔴 Hard |
| 1685 | Stone Game V | source | 238 ms |
3.1 MB |
42 | 41.2% | 23,800 | 🔴 Hard |
| 1277 | Largest Multiple of Three | source | 4 ms |
2.9 MB |
61 | 32.8% | 24,100 | 🔴 Hard |
| 2357 | Count Integers in Intervals | source | 58 ms |
37.5 MB |
60 | 34.2% | 24,100 | 🔴 Hard |
| 927 | Sum of Subsequence Widths | source | 9 ms |
3.3 MB |
134 | 39.1% | 24,400 | 🔴 Hard |
| 1043 | Grid Illumination | source | 41 ms |
7.8 MB |
92 | 38.1% | 24,700 | 🔴 Hard |
| 2671 | Shortest Cycle in a Graph | source | 457 ms |
2.5 MB |
60 | 37.6% | 24,700 | 🔴 Hard |
| 1257 | Rank Transform of a Matrix | source | 55 ms |
13.1 MB |
130 | 41.5% | 25,200 | 🔴 Hard |
| 736 | Parse Lisp Expression | source | 0 ms |
2.1 MB |
132 | 52.8% | 25,400 | 🔴 Hard |
| 1106 | Escape a Large Maze | source | 43 ms |
2.6 MB |
91 | 35.4% | 25,400 | 🔴 Hard |
| 1361 | Tiling a Rectangle with the Fewest Squares | source | 25 ms |
4.2 MB |
122 | 54.4% | 26,000 | 🔴 Hard |
| 1953 | Finding MK Average | source | 86 ms |
35.9 MB |
107 | 38.2% | 26,200 | 🔴 Hard |
| 488 | Zuma Game | source | 1397 ms |
44 MB |
147 | 31.4% | 26,600 | 🔴 Hard |
| 942 | Super Palindromes | source | 98 ms |
2.2 MB |
52 | 39.3% | 26,600 | 🔴 Hard |
| 964 | Minimize Malware Spread II | source | 22 ms |
3.1 MB |
84 | 44.7% | 27,000 | 🔴 Hard |
| 483 | Smallest Good Base | source | 16 ms |
2.1 MB |
57 | 43.6% | 27,000 | 🔴 Hard |
| 1887 | Minimum Degree of a Connected Trio in a Graph | source | 24 ms |
7.1 MB |
43 | 43.5% | 27,000 | 🔴 Hard |
| 2189 | Maximum Path Quality of a Graph | source | 15 ms |
2.6 MB |
78 | 59.8% | 27,000 | 🔴 Hard |
| 759 | Set Intersection Size At Least Two | source | 15 ms |
2.5 MB |
56 | 45.3% | 27,100 | 🔴 Hard |
| 1188 | Brace Expansion II | source | 0 ms |
2.3 MB |
101 | 63.2% | 27,300 | 🔴 Hard |
| 2040 | Minimum Cost to Reach Destination in Time | source | 66 ms |
6.1 MB |
70 | 40.0% | 27,800 | 🔴 Hard |
| 2521 | Paths in Matrix Whose Sum Is Divisible by K | source | 67 ms |
13.3 MB |
119 | 44.2% | 28,300 | 🔴 Hard |
| 479 | Largest Palindrome Product | source | 61 ms |
2.1 MB |
67 | 35.2% | 28,300 | 🔴 Hard |
| 1251 | Longest Chunked Palindrome Decomposition | source | 28 ms |
9.9 MB |
62 | 58.8% | 28,500 | 🔴 Hard |
| 1337 | Design Skiplist | source | 11 ms |
10.9 MB |
135 | 58.2% | 28,900 | 🔴 Hard |
| 2449 | Maximum Number of Robots Within Budget | source | 47 ms |
3.2 MB |
58 | 37.0% | 29,300 | 🔴 Hard |
| 1772 | Create Sorted Array through Instructions | source | 41 ms |
4.5 MB |
67 | 40.1% | 29,300 | 🔴 Hard |
| 1871 | Palindrome Partitioning IV | source | 15 ms |
2.2 MB |
100 | 44.8% | 29,600 | 🔴 Hard |
| 1902 | Car Fleet II | source | 71 ms |
14.3 MB |
125 | 56.5% | 30,000 | 🔴 Hard |
| 1389 | Minimum Moves to Move a Box to Their Target Location | source | 4 ms |
3.6 MB |
104 | 49.0% | 30,100 | 🔴 Hard |
| 1356 | Minimum Number of Moves to Make Palindrome | source | 0 ms |
2.2 MB |
62 | 52.1% | 30,300 | 🔴 Hard |
| 1571 | Allocate Mailboxes | source | 1 ms |
2.3 MB |
52 | 55.7% | 30,300 | 🔴 Hard |
| 1372 | Check If It Is a Good Array | source | 3 ms |
3.5 MB |
29 | 61.4% | 30,700 | 🔴 Hard |
| 699 | Falling Squares | source | 23 ms |
2.3 MB |
55 | 46.3% | 31,900 | 🔴 Hard |
| 1659 | Get the Maximum Score | source | 13 ms |
8.7 MB |
77 | 40.1% | 32,000 | 🔴 Hard |
| 980 | Find the Shortest Superstring | source | 1018 ms |
30.3 MB |
134 | 44.3% | 32,500 | 🔴 Hard |
| 918 | Reachable Nodes In Subdivided Graph | source | 15 ms |
4.2 MB |
157 | 50.8% | 33,000 | 🔴 Hard |
| 1489 | Pizza With 3n Slices | source | 201 ms |
10.4 MB |
72 | 53.1% | 33,000 | 🔴 Hard |
| 2389 | Design a Text Editor | source | 71 ms |
47.7 MB |
101 | 47.3% | 33,000 | 🔴 Hard |
| 1282 | Number of Valid Words for Each Puzzle | source | 33 ms |
22 MB |
66 | 47.2% | 33,200 | 🔴 Hard |
| 963 | Three Equal Parts | source | 2 ms |
2.4 MB |
49 | 40.7% | 33,200 | 🔴 Hard |
| 1403 | Palindrome Partitioning III | source | 1 ms |
2.3 MB |
62 | 61.6% | 33,700 | 🔴 Hard |
| 821 | Bricks Falling When Hit | source | 9 ms |
4.9 MB |
109 | 35.8% | 34,200 | 🔴 Hard |
| 1343 | Dice Roll Simulation | source | 21 ms |
6 MB |
156 | 50.1% | 34,500 | 🔴 Hard |
| 517 | Super Washing Machines | source | 0 ms |
2.2 MB |
82 | 42.6% | 34,800 | 🔴 Hard |
| 1825 | Find Minimum Time to Finish All Jobs | source | 73 ms |
2.2 MB |
43 | 43.7% | 35,300 | 🔴 Hard |
| 1443 | Minimum Distance to Type a Word Using Two Fingers | source | 1 ms |
2.2 MB |
56 | 59.1% | 35,400 | 🔴 Hard |
| 1493 | Frog Position After T Seconds | source | 0 ms |
2.3 MB |
155 | 35.9% | 36,000 | 🔴 Hard |
| 2884 | Length of the Longest Valid Substring | source | 707 ms |
10 MB |
63 | 37.8% | 36,100 | 🔴 Hard |
| 1826 | Maximum XOR With an Element From Array | source | 585 ms |
121.4 MB |
66 | 55.4% | 36,500 | 🔴 Hard |
| 2423 | Minimum Deletions to Make Array Divisible | source | 1 ms |
4.3 MB |
35 | 57.7% | 36,900 | 🔴 Hard |
| 1409 | Minimum Number of Flips to Convert Binary Matrix to Zero Matrix | source | 0 ms |
2.1 MB |
61 | 72.1% | 37,100 | 🔴 Hard |
| 1466 | Jump Game V | source | 3 ms |
2.2 MB |
40 | 64.1% | 38,200 | 🔴 Hard |
| 1367 | Maximum Height by Stacking Cuboids | source | 269 ms |
2.2 MB |
93 | 60.3% | 38,700 | 🔴 Hard |
| 880 | Rectangle Area II | source | 2 ms |
2.1 MB |
164 | 54.6% | 38,900 | 🔴 Hard |
| 1133 | Last Substring in Lexicographical Order | source | 845 ms |
16.2 MB |
74 | 34.6% | 39,600 | 🔴 Hard |
| 1550 | Find the Kth Smallest Sum of a Matrix With Sorted Rows | source | 5 ms |
2.3 MB |
70 | 62.0% | 40,000 | 🔴 Hard |
| 1527 | Number of Ways to Paint N × 3 Grid | source | 1 ms |
2.3 MB |
166 | 65.1% | 40,200 | 🔴 Hard |
| 335 | Self Crossing | source | 0 ms |
3.1 MB |
35 | 32.2% | 40,800 | 🔴 Hard |
| 1676 | Minimum Number of Days to Eat N Oranges | source | 445 ms |
2.1 MB |
52 | 35.7% | 41,100 | 🔴 Hard |
| 730 | Count Different Palindromic Subsequences | source | 43 ms |
6 MB |
184 | 46.5% | 41,800 | 🔴 Hard |
| 823 | Split Array With Same Average | source | 725 ms |
6.9 MB |
46 | 26.1% | 41,900 | 🔴 Hard |
| 2340 | Total Appeal of A String | source | 206 ms |
2.3 MB |
46 | 55.9% | 42,500 | 🔴 Hard |
| 2162 | Partition Array Into Two Arrays to Minimize Sum Difference | source | 219 ms |
2.9 MB |
58 | 21.9% | 43,900 | 🔴 Hard |
| 600 | Non-negative Integers without Consecutive Ones | source | 2 ms |
2.3 MB |
51 | 40.4% | 45,000 | 🔴 Hard |
| 1296 | Kth Ancestor of a Tree Node | source | 32 ms |
36.1 MB |
39 | 36.0% | 45,000 | 🔴 Hard |
| 1038 | Number of Squareful Arrays | source | 0 ms |
2.4 MB |
78 | 50.5% | 45,300 | 🔴 Hard |
| 910 | Nth Magical Number | source | 0 ms |
2.1 MB |
43 | 35.9% | 45,300 | 🔴 Hard |
| 1042 | Minimum Cost to Merge Stones | source | 2 ms |
2.5 MB |
56 | 44.4% | 46,100 | 🔴 Hard |
| 977 | Distinct Subsequences II | source | 7 ms |
2.8 MB |
166 | 43.6% | 46,400 | 🔴 Hard |
| 1733 | Maximum Number of Visible Points | source | 36 ms |
12.6 MB |
130 | 37.7% | 47,600 | 🔴 Hard |
| 420 | Strong Password Checker | source | 155 ms |
6.5 MB |
168 | 14.7% | 49,300 | 🔴 Hard |
| 938 | Numbers At Most N Given Digit Set | source | 0 ms |
2.3 MB |
53 | 43.4% | 49,500 | 🔴 Hard |
| 884 | K-Similar Strings | source | 1025 ms |
20.1 MB |
97 | 40.1% | 50,600 | 🔴 Hard |
| 1622 | Max Value of Equation | source | 10 ms |
10 MB |
39 | 44.6% | 51,100 | 🔴 Hard |
| 391 | Perfect Rectangle | source | 6 ms |
3.4 MB |
103 | 35.3% | 51,600 | 🔴 Hard |
| 546 | Remove Boxes | source | 264 ms |
6.5 MB |
66 | 48.3% | 53,800 | 🔴 Hard |
| 1977 | Minimum Interval to Include Each Query | source | 65 ms |
18.3 MB |
94 | 52.4% | 54,600 | 🔴 Hard |
| 1815 | Checking Existence of Edge Length Limited Paths | source | 19 ms |
14.3 MB |
96 | 62.8% | 56,100 | 🔴 Hard |
| 3761 | Maximum Difference Between Even and Odd Frequency II | source | 1911 ms |
120.8 MB |
95 | 49.2% | 56,900 | 🔴 Hard |
| 3637 | Count Number of Balanced Permutations | source | 1076 ms |
4.9 MB |
192 | 49.4% | 57,800 | 🔴 Hard |
| 989 | Largest Component Size by Common Factor | source | 80 ms |
3.1 MB |
75 | 41.2% | 59,600 | 🔴 Hard |
| 2257 | Earliest Possible Day of Full Bloom | source | 19 ms |
5.6 MB |
57 | 71.2% | 59,900 | 🔴 Hard |
| 1692 | Number of Ways to Reorder Array to Get Same BST | source | 40 ms |
8.9 MB |
151 | 53.6% | 60,100 | 🔴 Hard |
| 1309 | Sort Items by Groups Respecting Dependencies | source | 33 ms |
7.1 MB |
102 | 65.6% | 60,700 | 🔴 Hard |
| 1723 | Maximum Number of Achievable Transfer Requests | source | 124 ms |
2.2 MB |
37 | 64.5% | 60,800 | 🔴 Hard |
| 2505 | Number of Good Paths | source | 32 ms |
6.9 MB |
93 | 56.0% | 61,000 | 🔴 Hard |
| 973 | Stamping The Sequence | source | 1 ms |
3.2 MB |
81 | 61.9% | 61,800 | 🔴 Hard |
| 3630 | Total Characters in String After Transformations II | source | 57 ms |
2.3 MB |
182 | 58.2% | 62,000 | 🔴 Hard |
| 587 | Erect the Fence | source | 0 ms |
2.4 MB |
98 | 52.3% | 62,600 | 🔴 Hard |
| 1680 | Count All Possible Routes | source | 15 ms |
2.2 MB |
152 | 64.9% | 62,600 | 🔴 Hard |
| 1290 | Make Array Strictly Increasing | source | 9 ms |
2.4 MB |
53 | 57.8% | 63,100 | 🔴 Hard |
| 1633 | Minimum Number of Increments on Subarrays to Form a Target Array | source | 0 ms |
3.3 MB |
28 | 72.5% | 63,300 | 🔴 Hard |
| 1732 | Minimum One Bit Operations to Make Integers Zero | source | 0 ms |
2.2 MB |
97 | 73.3% | 63,300 | 🔴 Hard |
| 1613 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | source | 0 ms |
2.4 MB |
156 | 66.3% | 63,700 | 🔴 Hard |
| 2101 | Last Day Where You Can Still Cross | source | 59 ms |
4.4 MB |
73 | 62.3% | 63,800 | 🔴 Hard |
| 2390 | Naming a Company | source | 539 ms |
8.8 MB |
71 | 46.4% | 63,800 | 🔴 Hard |
| 1517 | Restore The Array | source | 3 ms |
2.7 MB |
156 | 46.9% | 64,099 | 🔴 Hard |
| 2096 | Find the Longest Valid Obstacle Course at Each Position | source | 43 ms |
4.5 MB |
64 | 62.5% | 64,599 | 🔴 Hard |
| 993 | Tallest Billboard | source | 1042 ms |
8 MB |
49 | 51.9% | 65,000 | 🔴 Hard |
| 2263 | Maximum Running Time of N Computers | source | 12 ms |
3.6 MB |
36 | 49.8% | 65,400 | 🔴 Hard |
| 960 | Minimize Malware Spread | source | 4 ms |
3.1 MB |
81 | 42.5% | 65,600 | 🔴 Hard |
| 3618 | Find the Original Typed String II | source | 40 ms |
7.3 MB |
177 | 46.6% | 65,900 | 🔴 Hard |
| 754 | Cracking the Safe | source | 0 ms |
2.2 MB |
58 | 57.8% | 66,100 | 🔴 Hard |
| 3682 | Count the Number of Arrays with K Matching Adjacent Elements | source | 47 ms |
2.7 MB |
137 | 58.5% | 66,100 | 🔴 Hard |
| 2803 | Modify Graph Edge Weights | source | 1011 ms |
3.2 MB |
148 | 56.0% | 66,300 | 🔴 Hard |
| 1906 | Maximize Score After N Operations | source | 65 ms |
2.2 MB |
55 | 57.9% | 66,400 | 🔴 Hard |
| 2415 | Count the Number of Ideal Arrays | source | 47 ms |
4.1 MB |
142 | 57.1% | 67,100 | 🔴 Hard |
| 3645 | Maximize the Number of Target Nodes After Connecting Trees II | source | 76 ms |
22.1 MB |
61 | 73.2% | 67,500 | 🔴 Hard |
| 1583 | Paint House III | source | 9 ms |
2.3 MB |
67 | 61.0% | 68,000 | 🔴 Hard |
| 1220 | Smallest Sufficient Team | source | 22 ms |
2.8 MB |
56 | 55.3% | 68,600 | 🔴 Hard |
| 1535 | Build Array Where You Can Find The Maximum Exactly K Comparisons | source | 72 ms |
3.4 MB |
149 | 66.7% | 69,000 | 🔴 Hard |
| 1479 | Construct Target Array With Multiple Sums | source | 3 ms |
3 MB |
57 | 36.3% | 69,700 | 🔴 Hard |
| 2061 | Painting a Grid With Three Different Colors | source | 94 ms |
2.1 MB |
127 | 78.4% | 69,800 | 🔴 Hard |
| 2140 | Longest Subsequence Repeated k Times | source | 45 ms |
2.2 MB |
61 | 71.6% | 70,100 | 🔴 Hard |
| 1508 | Longest Happy Prefix | source | 1 ms |
3.4 MB |
48 | 49.3% | 70,400 | 🔴 Hard |
| 3181 | Find Building Where Alice and Bob Can Meet | source | 55 ms |
9.3 MB |
61 | 52.2% | 70,600 | 🔴 Hard |
| 2450 | Minimum Replacements to Sort the Array | source | 2 ms |
4.2 MB |
31 | 53.2% | 71,100 | 🔴 Hard |
| 911 | Profitable Schemes | source | 30 ms |
6.4 MB |
158 | 48.0% | 71,200 | 🔴 Hard |
| 3548 | Find the Count of Good Integers | source | 97 ms |
2.2 MB |
72 | 69.7% | 71,300 | 🔴 Hard |
| 2251 | Number of Ways to Divide a Long Corridor | source | 21 ms |
3.4 MB |
117 | 48.8% | 71,700 | 🔴 Hard |
| 2538 | Minimum Cost to Make Array Equal | source | 0 ms |
5.2 MB |
35 | 46.4% | 72,700 | 🔴 Hard |
| 1555 | Number of Ways of Cutting a Pizza | source | 2 ms |
2.5 MB |
192 | 61.6% | 73,000 | 🔴 Hard |
| 2808 | Painting the Walls | source | 1682 ms |
3.1 MB |
42 | 48.6% | 73,000 | 🔴 Hard |
| 321 | Create Maximum Number | source | 1612 ms |
3.2 MB |
76 | 32.6% | 73,100 | 🔴 Hard |
| 2280 | Count Good Triplets in an Array | source | 16 ms |
8.3 MB |
78 | 66.0% | 73,300 | 🔴 Hard |
| 2678 | Design Graph With Shortest Path Calculator | source | 66 ms |
3.6 MB |
137 | 64.1% | 73,300 | 🔴 Hard |
| 2360 | Substring With Largest Variance | source | 302 ms |
3.1 MB |
73 | 45.9% | 73,500 | 🔴 Hard |
| 2827 | Greatest Common Divisor Traversal | source | 32 ms |
4 MB |
78 | 41.8% | 73,600 | 🔴 Hard |
| 770 | Couples Holding Hands | source | 0 ms |
2.2 MB |
42 | 58.5% | 73,900 | 🔴 Hard |
| 2554 | Minimum Total Distance Traveled | source | 5 ms |
2.4 MB |
41 | 59.0% | 74,100 | 🔴 Hard |
| 3001 | Apply Operations to Maximize Score | source | 217 ms |
10.8 MB |
187 | 54.0% | 74,400 | 🔴 Hard |
| 2202 | Sum of k-Mirror Numbers | source | 192 ms |
2.2 MB |
66 | 63.9% | 74,600 | 🔴 Hard |
| 956 | Number of Music Playlists | source | 0 ms |
2.2 MB |
159 | 60.0% | 75,100 | 🔴 Hard |
| 3243 | Count the Number of Powerful Integers | source | 1 ms |
2.2 MB |
75 | 46.5% | 75,400 | 🔴 Hard |
| 3439 | Find Minimum Diameter After Merging Two Trees | source | 71 ms |
28.6 MB |
60 | 57.3% | 75,400 | 🔴 Hard |
| 796 | Reaching Points | source | 0 ms |
2.2 MB |
43 | 33.7% | 75,600 | 🔴 Hard |
| 1393 | Maximum Value of K Coins From Piles | source | 94 ms |
25.7 MB |
45 | 60.3% | 75,700 | 🔴 Hard |
| 668 | Kth Smallest Number in Multiplication Table | source | 11 ms |
2.1 MB |
38 | 52.9% | 75,700 | 🔴 Hard |
| 2409 | Number of Increasing Paths in a Grid | source | 85 ms |
6.4 MB |
120 | 57.7% | 76,400 | 🔴 Hard |
| 2201 | Valid Arrangement of Pairs | source | 67 ms |
25.6 MB |
115 | 66.3% | 76,400 | 🔴 Hard |
| 1122 | Longest Duplicate Substring | source | 159 ms |
3.5 MB |
161 | 30.8% | 77,200 | 🔴 Hard |
| 935 | Orderly Queue | source | 0 ms |
2.2 MB |
45 | 66.3% | 77,500 | 🔴 Hard |
| 675 | Cut Off Trees for Golf Event | source | 235 ms |
2.6 MB |
174 | 35.4% | 78,200 | 🔴 Hard |
| 2150 | Kth Smallest Product of Two Sorted Arrays | source | 78 ms |
3.2 MB |
94 | 49.1% | 78,600 | 🔴 Hard |
| 779 | Max Chunks To Make Sorted II | source | 0 ms |
2.2 MB |
43 | 54.2% | 78,900 | 🔴 Hard |
| 855 | Count Unique Characters of All Substrings of a Given String | source | 908 ms |
26.4 MB |
69 | 52.9% | 79,200 | 🔴 Hard |
| 1617 | Stone Game IV | source | 132 ms |
2.5 MB |
34 | 59.5% | 79,500 | 🔴 Hard |
| 1851 | Maximum Number of Events That Can Be Attended II | source | 10 ms |
10.9 MB |
58 | 60.8% | 81,300 | 🔴 Hard |
| 3601 | Find the K-th Character in String Game II | source | 0 ms |
2.2 MB |
38 | 48.8% | 81,900 | 🔴 Hard |
| 2180 | Maximum Number of Tasks You Can Assign | source | 31 ms |
4.6 MB |
114 | 50.6% | 82,000 | 🔴 Hard |
| 2119 | Minimum Number of Operations to Make Array Continuous | source | 10 ms |
4.1 MB |
32 | 52.2% | 82,300 | 🔴 Hard |
| 685 | Redundant Connection II | source | 0 ms |
2.5 MB |
83 | 35.2% | 82,300 | 🔴 Hard |
| 639 | Decode Ways II | source | 34 ms |
2.9 MB |
182 | 31.2% | 82,700 | 🔴 Hard |
| 1569 | Max Dot Product of Two Subsequences | source | 3 ms |
2.8 MB |
49 | 62.4% | 82,900 | 🔴 Hard |
| 3058 | Maximum Number of K-Divisible Components | source | 34 ms |
9.2 MB |
52 | 69.7% | 83,100 | 🔴 Hard |
| 2583 | Divide Nodes Into the Maximum Number of Groups | source | 1152 ms |
3.7 MB |
81 | 67.3% | 83,200 | 🔴 Hard |
| 1918 | Maximum Score of a Good Subarray | source | 23 ms |
4.6 MB |
51 | 64.3% | 83,400 | 🔴 Hard |
| 2711 | Minimum Time to Visit a Cell In a Grid | source | 148 ms |
5 MB |
60 | 56.8% | 84,000 | 🔴 Hard |
| 2364 | Longest Path With Different Adjacent Characters | source | 44 ms |
19.1 MB |
57 | 53.9% | 84,500 | 🔴 Hard |
| 2246 | Maximum Employees to Be Invited to a Meeting | source | 47 ms |
25 MB |
82 | 62.1% | 85,400 | 🔴 Hard |
| 715 | Range Module | source | 19 ms |
6.5 MB |
79 | 44.2% | 85,500 | 🔴 Hard |
| 1286 | Constrained Subsequence Sum | source | 11 ms |
3.6 MB |
37 | 56.4% | 85,900 | 🔴 Hard |
| 895 | Shortest Path to Get All Keys | source | 6 ms |
2.9 MB |
92 | 53.8% | 86,100 | 🔴 Hard |
| 923 | Super Egg Drop | source | 16 ms |
8.7 MB |
33 | 28.8% | 86,800 | 🔴 Hard |
| 1305 | Number of Visible People in a Queue | source | 2 ms |
4.3 MB |
35 | 71.4% | 87,200 | 🔴 Hard |
| 2171 | Second Minimum Time to Reach Destination | source | 91 ms |
6.6 MB |
108 | 62.5% | 87,400 | 🔴 Hard |
| 679 | 24 Game | source | 5 ms |
2.2 MB |
118 | 50.0% | 88,400 | 🔴 Hard |
| 691 | Stickers to Spell Word | source | 118 ms |
2.6 MB |
94 | 50.1% | 89,800 | 🔴 Hard |
| 819 | Minimum Swaps To Make Sequences Increasing | source | 40 ms |
8.5 MB |
50 | 40.8% | 90,600 | 🔴 Hard |
| 327 | Count of Range Sum | source | 52 ms |
5.4 MB |
72 | 37.1% | 91,000 | 🔴 Hard |
| 2439 | Longest Cycle in a Graph | source | 16 ms |
6.9 MB |
50 | 49.9% | 91,800 | 🔴 Hard |
| 2588 | Maximum Number of Points From Grid Queries | source | 58 ms |
6.5 MB |
92 | 59.5% | 93,600 | 🔴 Hard |
| 856 | Consecutive Numbers Sum | source | 42 ms |
2.2 MB |
42 | 42.1% | 94,900 | 🔴 Hard |
| 1691 | Minimum Number of Days to Disconnect Island | source | 15 ms |
2.2 MB |
70 | 59.0% | 95,300 | 🔴 Hard |
| 741 | Cherry Pickup | source | 7 ms |
3.2 MB |
72 | 37.9% | 96,100 | 🔴 Hard |
| 2334 | Number of Flowers in Full Bloom | source | 19 ms |
13.2 MB |
63 | 57.2% | 96,600 | 🔴 Hard |
| 2176 | Parallel Courses III | source | 17 ms |
8.9 MB |
52 | 66.8% | 97,200 | 🔴 Hard |
| 1017 | Odd Even Jump | source | 29 ms |
3.8 MB |
57 | 40.8% | 97,800 | 🔴 Hard |
| 1097 | Stream of Characters | source | 22 ms |
35.7 MB |
98 | 51.3% | 98,100 | 🔴 Hard |
| 836 | Race Car | source | 277 ms |
69.5 MB |
51 | 44.2% | 98,200 | 🔴 Hard |
| 1794 | Minimize Deviation in Array | source | 285 ms |
13.1 MB |
54 | 53.9% | 98,300 | 🔴 Hard |
| 1398 | Number of Ways to Stay in the Same Place After Some Steps | source | 0 ms |
2.2 MB |
142 | 50.0% | 98,400 | 🔴 Hard |
| 1424 | Maximum Candies You Can Get from Boxes | source | 27 ms |
4 MB |
71 | 68.7% | 98,600 | 🔴 Hard |
| 2472 | Build a Matrix With Conditions | source | 8 ms |
4.1 MB |
65 | 79.3% | 99,000 | 🔴 Hard |
| 2545 | Height of Binary Tree After Subtree Removal Queries | source | 51 ms |
19.4 MB |
108 | 54.9% | 101,800 | 🔴 Hard |
| 1522 | Stone Game III | source | 6 ms |
2.4 MB |
34 | 63.2% | 102,000 | 🔴 Hard |
| 3348 | Minimum Cost Walk in Weighted Graph | source | 12 ms |
14.7 MB |
82 | 68.5% | 102,100 | 🔴 Hard |
| 1475 | Maximum Sum BST in Binary Tree | source | 9 ms |
9.8 MB |
77 | 44.5% | 102,200 | 🔴 Hard |
| 732 | My Calendar III | source | 30 ms |
2.4 MB |
39 | 70.7% | 102,400 | 🔴 Hard |
| 1637 | String Compression II | source | 715 ms |
6.5 MB |
95 | 52.0% | 102,700 | 🔴 Hard |
| 1499 | Maximum Performance of a Team | source | 20 ms |
6.1 MB |
43 | 47.5% | 103,100 | 🔴 Hard |
| 2213 | Find All People With Secret | source | 20 ms |
15 MB |
127 | 45.3% | 104,200 | 🔴 Hard |
| 746 | Prefix and Suffix Search | source | 197 ms |
21.3 MB |
62 | 40.4% | 104,600 | 🔴 Hard |
| 2375 | Minimum Obstacle Removal to Reach Corner | source | 87 ms |
12.9 MB |
46 | 70.1% | 112,200 | 🔴 Hard |
| 2846 | Robot Collisions | source | 1508 ms |
14.1 MB |
158 | 56.1% | 113,900 | 🔴 Hard |
| 1766 | Minimum Number of Removals to Make Mountain Array | source | 27 ms |
2.3 MB |
43 | 54.9% | 116,100 | 🔴 Hard |
| 233 | Number of Digit One | source | 0 ms |
2.1 MB |
56 | 36.0% | 116,800 | 🔴 Hard |
| 2494 | Sum of Prefix Scores of Strings | source | 424 ms |
269.6 MB |
78 | 60.7% | 117,000 | 🔴 Hard |
| 514 | Freedom Trail | source | 15 ms |
2.3 MB |
57 | 58.9% | 117,200 | 🔴 Hard |
| 352 | Data Stream as Disjoint Intervals | source | 0 ms |
2.4 MB |
64 | 59.5% | 120,000 | 🔴 Hard |
| 630 | Course Schedule III | source | 815 ms |
3.3 MB |
43 | 40.7% | 125,700 | 🔴 Hard |
| 458 | Poor Pigs | source | 43 ms |
2.3 MB |
65 | 59.2% | 126,100 | 🔴 Hard |
| 1896 | Maximum Score from Performing Multiplication Operations | source | 6 ms |
3.2 MB |
47 | 42.3% | 127,100 | 🔴 Hard |
| 1381 | Maximum Score Words Formed by Letters | source | 6 ms |
2.3 MB |
69 | 81.6% | 127,100 | 🔴 Hard |
| 564 | Find the Closest Palindrome | source | 0 ms |
2.1 MB |
79 | 31.7% | 128,500 | 🔴 Hard |
| 1744 | Number of Ways to Form a Target String Given a Dictionary | source | 23 ms |
5.3 MB |
155 | 57.0% | 129,300 | 🔴 Hard |
| 1461 | Count All Valid Pickup and Delivery Options | source | 0 ms |
2.1 MB |
131 | 64.9% | 130,500 | 🔴 Hard |
| 2394 | Count Subarrays With Score Less Than K | source | 0 ms |
3.9 MB |
36 | 62.4% | 131,400 | 🔴 Hard |
| 869 | Similar String Groups | source | 1 ms |
2.4 MB |
82 | 55.4% | 132,700 | 🔴 Hard |
| 363 | Max Sum of Rectangle No Larger Than K | source | 116 ms |
2.2 MB |
38 | 44.7% | 134,600 | 🔴 Hard |
| 1037 | Minimum Number of K Consecutive Bit Flips | source | 0 ms |
3.2 MB |
47 | 62.2% | 134,800 | 🔴 Hard |
| 1197 | Parsing A Boolean Expression | source | 0 ms |
2.2 MB |
67 | 69.8% | 135,400 | 🔴 Hard |
| 3307 | Find the Maximum Sum of Node Values | source | 25 ms |
4.9 MB |
66 | 69.8% | 135,500 | 🔴 Hard |
| 629 | K Inverse Pairs Array | source | 4 ms |
2.1 MB |
141 | 49.0% | 135,800 | 🔴 Hard |
| 877 | Shortest Path Visiting All Nodes | source | 5 ms |
2.9 MB |
40 | 65.5% | 136,900 | 🔴 Hard |
| 1701 | Remove Max Number of Edges to Keep Graph Fully Traversable | source | 10 ms |
11.8 MB |
94 | 70.4% | 138,100 | 🔴 Hard |
| 1986 | Largest Color Value in a Directed Graph | source | 72 ms |
23.3 MB |
77 | 57.6% | 140,300 | 🔴 Hard |
| 2479 | Meeting Rooms III | source | 28 ms |
11 MB |
53 | 43.9% | 144,100 | 🔴 Hard |
| 1451 | Minimum Number of Taps to Open to Water a Garden | source | 0 ms |
2.4 MB |
33 | 50.7% | 147,000 | 🔴 Hard |
| 2681 | Put Marbles in Bags | source | 9 ms |
3.6 MB |
34 | 72.4% | 147,900 | 🔴 Hard |
| 689 | Maximum Sum of 3 Non-Overlapping Subarrays | source | 5 ms |
3.5 MB |
46 | 59.5% | 149,800 | 🔴 Hard |
| 552 | Student Attendance Record II | source | 264 ms |
16.8 MB |
117 | 55.9% | 149,800 | 🔴 Hard |
| 887 | Minimum Cost to Hire K Workers | source | 6 ms |
2.8 MB |
50 | 63.5% | 151,100 | 🔴 Hard |
| 1485 | Minimum Cost to Make at Least One Valid Path in a Grid | source | 7 ms |
2.4 MB |
46 | 70.7% | 152,700 | 🔴 Hard |
| 902 | Minimum Number of Refueling Stops | source | 23 ms |
4.2 MB |
67 | 40.6% | 152,900 | 🔴 Hard |
| 664 | Strange Printer | source | 221 ms |
3.5 MB |
72 | 60.8% | 153,600 | 🔴 Hard |
| 1224 | Minimum Falling Path Sum II | source | 55 ms |
2.6 MB |
31 | 63.8% | 154,500 | 🔴 Hard |
| 726 | Number of Atoms | source | 0 ms |
2.2 MB |
107 | 65.0% | 155,400 | 🔴 Hard |
| 1447 | Jump Game IV | source | 28 ms |
7 MB |
54 | 46.1% | 155,500 | 🔴 Hard |
| 1093 | Recover a Tree From Preorder Traversal | source | 0 ms |
2.3 MB |
72 | 83.3% | 157,900 | 🔴 Hard |
| 446 | Arithmetic Slices II - Subsequence | source | 86 ms |
15.7 MB |
36 | 54.6% | 159,400 | 🔴 Hard |
| 873 | Guess the Word | source | 2 ms |
2.3 MB |
85 | 37.6% | 160,100 | 🔴 Hard |
| 440 | K-th Smallest in Lexicographical Order | source | 0 ms |
2.2 MB |
76 | 45.9% | 161,300 | 🔴 Hard |
| 1145 | Number of Submatrices That Sum to Target | source | 99 ms |
2.4 MB |
38 | 74.5% | 164,400 | 🔴 Hard |
| 1008 | Binary Tree Cameras | source | 0 ms |
2.2 MB |
65 | 47.2% | 166,000 | 🔴 Hard |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | source | 40 ms |
33.8 MB |
77 | 35.8% | 166,300 | 🔴 Hard |
| 1503 | Reducing Dishes | source | 0 ms |
2.1 MB |
32 | 76.4% | 169,700 | 🔴 Hard |
| 330 | Patching Array | source | 0 ms |
2.1 MB |
37 | 53.5% | 170,200 | 🔴 Hard |
| 863 | Sum of Distances in Tree | source | 47 ms |
14.9 MB |
138 | 65.4% | 170,700 | 🔴 Hard |
| 1185 | Find in Mountain Array | source | 1 ms |
2.3 MB |
59 | 40.5% | 171,200 | 🔴 Hard |
| 1332 | Count Vowels Permutation | source | 2 ms |
2.1 MB |
160 | 61.5% | 177,600 | 🔴 Hard |
| 787 | Sliding Puzzle | source | 1 ms |
2.1 MB |
75 | 73.2% | 180,000 | 🔴 Hard |
| 1669 | Minimum Cost to Cut a Stick | source | 5 ms |
2.2 MB |
45 | 62.1% | 180,400 | 🔴 Hard |
| 432 | All O`one Data Structure | source | 23 ms |
21.4 MB |
156 | 44.1% | 181,300 | 🔴 Hard |
| 407 | Trapping Rain Water II | source | 11 ms |
2.7 MB |
57 | 58.9% | 181,900 | 🔴 Hard |
| 480 | Sliding Window Median | source | 17 ms |
4.4 MB |
108 | 38.7% | 189,000 | 🔴 Hard |
| 892 | Shortest Subarray with Sum at Least K | source | 982 ms |
6.8 MB |
53 | 32.3% | 191,300 | 🔴 Hard |
| 719 | Find K-th Smallest Pair Distance | source | 0 ms |
2.4 MB |
47 | 45.8% | 198,800 | 🔴 Hard |
| 1559 | Cherry Pickup II | source | 6 ms |
2.2 MB |
53 | 72.0% | 201,400 | 🔴 Hard |
| 931 | Maximum Frequency Stack | source | 29 ms |
10.8 MB |
37 | 66.3% | 202,000 | 🔴 Hard |
| 1457 | Minimum Difficulty of a Job Schedule | source | 2 ms |
2.2 MB |
41 | 59.7% | 214,100 | 🔴 Hard |
| 632 | Smallest Range Covering Elements from K Lists | source | 41 ms |
5.3 MB |
43 | 69.8% | 219,300 | 🔴 Hard |
| 2527 | Count Subarrays With Fixed Bounds | source | 3 ms |
4.3 MB |
72 | 69.4% | 224,900 | 🔴 Hard |
| 336 | Palindrome Pairs | source | 906 ms |
240.4 MB |
165 | 36.3% | 226,000 | 🔴 Hard |
| 794 | Swim in Rising Water | source | 3 ms |
2.4 MB |
80 | 63.0% | 230,300 | 🔴 Hard |
| 1022 | Unique Paths III | source | 527 ms |
32.6 MB |
93 | 82.4% | 232,400 | 🔴 Hard |
| 1414 | Shortest Path in a Grid with Obstacles Elimination | source | 72 ms |
6.8 MB |
56 | 45.7% | 244,800 | 🔴 Hard |
| 1437 | Minimum Insertion Steps to Make a String Palindrome | source | 11 ms |
3.9 MB |
59 | 72.6% | 247,200 | 🔴 Hard |
| 833 | Bus Routes | source | 18 ms |
16.2 MB |
82 | 47.0% | 249,000 | 🔴 Hard |
| 472 | Concatenated Words | source | 80 ms |
14.2 MB |
88 | 49.5% | 251,700 | 🔴 Hard |
| 1170 | Shortest Common Supersequence | source | 57 ms |
33.2 MB |
76 | 61.4% | 258,500 | 🔴 Hard |
| 354 | Russian Doll Envelopes | source | 30 ms |
11.5 MB |
78 | 37.3% | 259,600 | 🔴 Hard |
| 174 | Dungeon Game | source | 0 ms |
2.4 MB |
49 | 39.6% | 262,200 | 🔴 Hard |
| 87 | Scramble String | source | 3 ms |
2.2 MB |
40 | 42.3% | 271,200 | 🔴 Hard |
| 502 | IPO | source | 58 ms |
7.9 MB |
43 | 53.0% | 275,400 | 🔴 Hard |
| 493 | Reverse Pairs | source | 31 ms |
3.6 MB |
63 | 32.3% | 276,300 | 🔴 Hard |
| 1300 | Critical Connections in a Network | source | 30 ms |
23.4 MB |
58 | 58.0% | 281,400 | 🔴 Hard |
| 282 | Expression Add Operators | source | 345 ms |
2.4 MB |
163 | 41.8% | 282,000 | 🔴 Hard |
| 220 | Contains Duplicate III | source | 132 ms |
6.1 MB |
52 | 23.7% | 284,900 | 🔴 Hard |
| 403 | Frog Jump | source | 31 ms |
6 MB |
42 | 46.6% | 304,200 | 🔴 Hard |
| 1034 | Subarrays with K Different Integers | source | 0 ms |
2.8 MB |
60 | 66.1% | 305,800 | 🔴 Hard |
| 214 | Shortest Palindrome | source | 2 ms |
2.9 MB |
91 | 40.7% | 312,600 | 🔴 Hard |
| 460 | LFU Cache | source | 54 ms |
104.2 MB |
89 | 46.8% | 313,300 | 🔴 Hard |
| 218 | The Skyline Problem | source | 0 ms |
4.5 MB |
70 | 44.0% | 323,200 | 🔴 Hard |
| 132 | Palindrome Partitioning II | source | 3 ms |
2.2 MB |
97 | 35.4% | 347,700 | 🔴 Hard |
| 854 | Making A Large Island | source | 37 ms |
4.8 MB |
103 | 55.1% | 356,000 | 🔴 Hard |
| 315 | Count of Smaller Numbers After Self | source | 30 ms |
3.9 MB |
61 | 42.9% | 358,200 | 🔴 Hard |
| 312 | Burst Balloons | source | 30 ms |
2.4 MB |
37 | 61.5% | 369,600 | 🔴 Hard |
| 1352 | Maximum Profit in Job Scheduling | source | 10 ms |
4 MB |
50 | 54.4% | 370,900 | 🔴 Hard |
| 126 | Word Ladder II | source | 11 ms |
2.6 MB |
210 | 27.2% | 416,300 | 🔴 Hard |
| 65 | Valid Number | source | 0 ms |
2.2 MB |
105 | 21.6% | 457,900 | 🔴 Hard |
| 149 | Max Points on a Line | source | 1 ms |
2.1 MB |
58 | 29.1% | 469,500 | 🔴 Hard |
| 301 | Remove Invalid Parentheses | source | 5 ms |
2.3 MB |
83 | 49.3% | 478,800 | 🔴 Hard |
| 60 | Permutation Sequence | source | 0 ms |
2.2 MB |
42 | 50.1% | 487,000 | 🔴 Hard |
| 410 | Split Array Largest Sum | source | 0 ms |
2.2 MB |
45 | 58.3% | 494,400 | 🔴 Hard |
| 332 | Reconstruct Itinerary | source | 5 ms |
2.4 MB |
90 | 43.6% | 498,300 | 🔴 Hard |
| 52 | N-Queens II | source | 0 ms |
2.1 MB |
60 | 76.8% | 503,000 | 🔴 Hard |
| 154 | Find Minimum in Rotated Sorted Array II | source | 0 ms |
2.2 MB |
18 | 44.1% | 538,000 | 🔴 Hard |
| 273 | Integer to English Words | source | 0 ms |
2.1 MB |
99 | 34.4% | 547,400 | 🔴 Hard |
| 68 | Text Justification | source | 0 ms |
2.4 MB |
68 | 48.3% | 551,900 | 🔴 Hard |
| 115 | Distinct Subsequences | source | 12 ms |
6.1 MB |
34 | 50.2% | 562,000 | 🔴 Hard |
| 30 | Substring with Concatenation of All Words | source | 7 ms |
2.6 MB |
64 | 33.0% | 591,900 | 🔴 Hard |
| 188 | Best Time to Buy and Sell Stock IV | source | 102 ms |
2.2 MB |
34 | 47.3% | 604,900 | 🔴 Hard |
| 1029 | Vertical Order Traversal of a Binary Tree | source | 0 ms |
2.4 MB |
45 | 51.5% | 605,800 | 🔴 Hard |
| 85 | Maximal Rectangle | source | 19 ms |
5 MB |
49 | 53.9% | 607,900 | 🔴 Hard |
| 224 | Basic Calculator | source | 0 ms |
3.5 MB |
156 | 45.7% | 608,800 | 🔴 Hard |
| 329 | Longest Increasing Path in a Matrix | source | 8 ms |
2.7 MB |
49 | 55.4% | 637,900 | 🔴 Hard |
| 44 | Wildcard Matching | source | 6 ms |
3 MB |
42 | 30.0% | 733,500 | 🔴 Hard |
| 140 | Word Break II | source | 0 ms |
2.3 MB |
89 | 53.7% | 753,700 | 🔴 Hard |
| 37 | Sudoku Solver | source | 10 ms |
10 MB |
371 | 64.0% | 790,000 | 🔴 Hard |
| 212 | Word Search II | source | 520 ms |
24.8 MB |
87 | 37.4% | 802,300 | 🔴 Hard |
| 123 | Best Time to Buy and Sell Stock III | source | 0 ms |
3.6 MB |
44 | 51.3% | 803,900 | 🔴 Hard |
| 135 | Candy | source | 0 ms |
2.5 MB |
31 | 46.8% | 866,200 | 🔴 Hard |
| 32 | Longest Valid Parentheses | source | 0 ms |
2.6 MB |
47 | 36.4% | 923,100 | 🔴 Hard |
| 51 | N-Queens | source | 0 ms |
2.6 MB |
73 | 73.0% | 1,000,000 | 🔴 Hard |
| 295 | Find Median from Data Stream | source | 53 ms |
23.8 MB |
57 | 53.4% | 1,000,000 | 🔴 Hard |
| 297 | Serialize and Deserialize Binary Tree | source | 0 ms |
3 MB |
43 | 59.1% | 1,100,000 | 🔴 Hard |
| 84 | Largest Rectangle in Histogram | source | 10 ms |
4.2 MB |
51 | 47.6% | 1,200,000 | 🔴 Hard |
| 10 | Regular Expression Matching | source | 0 ms |
2.2 MB |
45 | 29.3% | 1,200,000 | 🔴 Hard |
| 25 | Reverse Nodes in k-Group | source | 0 ms |
2.4 MB |
59 | 63.2% | 1,300,000 | 🔴 Hard |
| 239 | Sliding Window Maximum | source | 8 ms |
3.6 MB |
43 | 47.7% | 1,400,000 | 🔴 Hard |
| 127 | Word Ladder | source | 162 ms |
5.6 MB |
178 | 43.0% | 1,400,000 | 🔴 Hard |
| 41 | First Missing Positive | source | 594 ms |
3 MB |
60 | 41.2% | 1,500,000 | 🔴 Hard |
| 124 | Binary Tree Maximum Path Sum | source | 0 ms |
4.4 MB |
64 | 41.3% | 1,600,000 | 🔴 Hard |
| 76 | Minimum Window Substring | source | 0 ms |
2.3 MB |
71 | 45.5% | 1,800,000 | 🔴 Hard |
| 23 | Merge k Sorted Lists | source | 9 ms |
3.3 MB |
72 | 56.9% | 2,500,000 | 🔴 Hard |
| 42 | Trapping Rain Water | source | 0 ms |
2.5 MB |
36 | 65.3% | 2,900,000 | 🔴 Hard |
| 4 | Median of Two Sorted Arrays | source | 0 ms |
2.1 MB |
56 | 44.0% | 3,500,000 | 🔴 Hard |