1 |
Two Sum |
✅ |
Go . Doc |
Easy |
47% |
2 |
Add Two Numbers |
✅ |
Go . Doc |
Medium |
36% |
3 |
Longest Substring Without Repeating Characters |
|
Go . Doc |
Medium |
31% |
4 |
Median of Two Sorted Arrays |
|
Go . Doc |
Hard |
32% |
5 |
Longest Palindromic Substring |
|
Go . Doc |
Medium |
30% |
6 |
ZigZag Conversion |
|
Go . Doc |
Medium |
39% |
7 |
Reverse Integer |
|
Go . Doc |
Easy |
26% |
8 |
String to Integer (atoi) |
|
Go . Doc |
Medium |
15% |
9 |
Palindrome Number |
|
Go . Doc |
Easy |
50% |
10 |
Regular Expression Matching |
|
Go . Doc |
Hard |
27% |
11 |
Container With Most Water |
|
Go . Doc |
Medium |
53% |
12 |
Integer to Roman |
|
Go . Doc |
Medium |
57% |
13 |
Roman to Integer |
|
Go . Doc |
Easy |
57% |
14 |
Longest Common Prefix |
|
Go . Doc |
Easy |
37% |
15 |
3Sum |
|
Go . Doc |
Medium |
28% |
16 |
3Sum Closest |
|
Go . Doc |
Medium |
46% |
17 |
Letter Combinations of a Phone Number |
|
Go . Doc |
Medium |
50% |
18 |
4Sum |
|
Go . Doc |
Medium |
35% |
19 |
Remove Nth Node From End of List |
|
Go . Doc |
Medium |
36% |
20 |
Valid Parentheses |
|
Go . Doc |
Easy |
40% |
21 |
Merge Two Sorted Lists |
|
Go . Doc |
Easy |
57% |
22 |
Generate Parentheses |
|
Go . Doc |
Medium |
67% |
23 |
Merge k Sorted Lists |
|
Go . Doc |
Hard |
43% |
24 |
Swap Nodes in Pairs |
|
Go . Doc |
Medium |
54% |
25 |
Reverse Nodes in k-Group |
|
Go . Doc |
Hard |
46% |
26 |
Remove Duplicates from Sorted Array |
|
Go . Doc |
Easy |
47% |
27 |
Remove Element |
|
Go . Doc |
Easy |
49% |
28 |
Implement strStr() |
|
Go . Doc |
Easy |
35% |
29 |
Divide Two Integers |
|
Go . Doc |
Medium |
16% |
30 |
Substring with Concatenation of All Words |
|
Go . Doc |
Hard |
26% |
31 |
Next Permutation |
|
Go . Doc |
Medium |
34% |
32 |
Longest Valid Parentheses |
|
Go . Doc |
Hard |
30% |
33 |
Search in Rotated Sorted Array |
|
Go . Doc |
Medium |
36% |
34 |
Find First and Last Position of Element in Sorted Array |
|
Go . Doc |
Medium |
38% |
35 |
Search Insert Position |
|
Go . Doc |
Easy |
42% |
36 |
Valid Sudoku |
|
Go . Doc |
Medium |
51% |
37 |
Sudoku Solver |
|
Go . Doc |
Hard |
48% |
38 |
Count and Say |
|
Go . Doc |
Medium |
46% |
39 |
Combination Sum |
|
Go . Doc |
Medium |
60% |
40 |
Combination Sum II |
|
Go . Doc |
Medium |
51% |
41 |
First Missing Positive |
|
Go . Doc |
Hard |
34% |
42 |
Trapping Rain Water |
|
Go . Doc |
Hard |
52% |
43 |
Multiply Strings |
|
Go . Doc |
Medium |
35% |
44 |
Wildcard Matching |
|
Go . Doc |
Hard |
25% |
45 |
Jump Game II |
|
Go . Doc |
Medium |
33% |
46 |
Permutations |
|
Go . Doc |
Medium |
68% |
47 |
Permutations II |
|
Go . Doc |
Medium |
50% |
48 |
Rotate Image |
|
Go . Doc |
Medium |
62% |
49 |
Group Anagrams |
|
Go . Doc |
Medium |
60% |
50 |
Pow(x, n) |
|
Go . Doc |
Medium |
31% |
51 |
N-Queens |
|
Go . Doc |
Hard |
52% |
52 |
N-Queens II |
|
Go . Doc |
Hard |
63% |
53 |
Maximum Subarray |
|
Go . Doc |
Easy |
48% |
54 |
Spiral Matrix |
|
Go . Doc |
Medium |
37% |
55 |
Jump Game |
|
Go . Doc |
Medium |
35% |
56 |
Merge Intervals |
|
Go . Doc |
Medium |
42% |
57 |
Insert Interval |
|
Go . Doc |
Medium |
35% |
58 |
Length of Last Word |
|
Go . Doc |
Easy |
33% |
59 |
Spiral Matrix II |
|
Go . Doc |
Medium |
59% |
60 |
Permutation Sequence |
|
Go . Doc |
Hard |
40% |
61 |
Rotate List |
|
Go . Doc |
Medium |
32% |
62 |
Unique Paths |
|
Go . Doc |
Medium |
57% |
63 |
Unique Paths II |
|
Go . Doc |
Medium |
36% |
64 |
Minimum Path Sum |
|
Go . Doc |
Medium |
57% |
65 |
Valid Number |
|
Go . Doc |
Hard |
16% |
66 |
Plus One |
|
Go . Doc |
Easy |
42% |
67 |
Add Binary |
|
Go . Doc |
Easy |
48% |
68 |
Text Justification |
|
Go . Doc |
Hard |
31% |
69 |
Sqrt(x) |
|
Go . Doc |
Easy |
35% |
70 |
Climbing Stairs |
|
Go . Doc |
Easy |
49% |
71 |
Simplify Path |
|
Go . Doc |
Medium |
35% |
72 |
Edit Distance |
|
Go . Doc |
Hard |
48% |
73 |
Set Matrix Zeroes |
|
Go . Doc |
Medium |
45% |
74 |
Search a 2D Matrix |
|
Go . Doc |
Medium |
39% |
75 |
Sort Colors |
|
Go . Doc |
Medium |
50% |
76 |
Minimum Window Substring |
|
Go . Doc |
Hard |
36% |
77 |
Combinations |
|
Go . Doc |
Medium |
59% |
78 |
Subsets |
|
Go . Doc |
Medium |
66% |
79 |
Word Search |
|
Go . Doc |
Medium |
37% |
80 |
Remove Duplicates from Sorted Array II |
|
Go . Doc |
Medium |
47% |
81 |
Search in Rotated Sorted Array II |
|
Go . Doc |
Medium |
33% |
82 |
Remove Duplicates from Sorted List II |
|
Go . Doc |
Medium |
40% |
83 |
Remove Duplicates from Sorted List |
|
Go . Doc |
Easy |
47% |
84 |
Largest Rectangle in Histogram |
|
Go . Doc |
Hard |
38% |
85 |
Maximal Rectangle |
|
Go . Doc |
Hard |
40% |
86 |
Partition List |
|
Go . Doc |
Medium |
45% |
87 |
Scramble String |
|
Go . Doc |
Hard |
34% |
88 |
Merge Sorted Array |
|
Go . Doc |
Easy |
41% |
89 |
Gray Code |
|
Go . Doc |
Medium |
53% |
90 |
Subsets II |
|
Go . Doc |
Medium |
49% |
91 |
Decode Ways |
|
Go . Doc |
Medium |
27% |
92 |
Reverse Linked List II |
|
Go . Doc |
Medium |
41% |
93 |
Restore IP Addresses |
|
Go . Doc |
Medium |
38% |
94 |
Binary Tree Inorder Traversal |
|
Go . Doc |
Easy |
67% |
95 |
Unique Binary Search Trees II |
|
Go . Doc |
Medium |
44% |
96 |
Unique Binary Search Trees |
|
Go . Doc |
Medium |
55% |
97 |
Interleaving String |
|
Go . Doc |
Medium |
33% |
98 |
Validate Binary Search Tree |
|
Go . Doc |
Medium |
29% |
99 |
Recover Binary Search Tree |
|
Go . Doc |
Medium |
43% |
100 |
Same Tree |
|
Go . Doc |
Easy |
54% |
101 |
Symmetric Tree |
|
Go . Doc |
Easy |
49% |
102 |
Binary Tree Level Order Traversal |
|
Go . Doc |
Medium |
58% |
103 |
Binary Tree Zigzag Level Order Traversal |
|
Go . Doc |
Medium |
51% |
104 |
Maximum Depth of Binary Tree |
|
Go . Doc |
Easy |
69% |
105 |
Construct Binary Tree from Preorder and Inorder Traversal |
|
Go . Doc |
Medium |
54% |
106 |
Construct Binary Tree from Inorder and Postorder Traversal |
|
Go . Doc |
Medium |
51% |
107 |
Binary Tree Level Order Traversal II |
|
Go . Doc |
Medium |
56% |
108 |
Convert Sorted Array to Binary Search Tree |
|
Go . Doc |
Easy |
62% |
109 |
Convert Sorted List to Binary Search Tree |
|
Go . Doc |
Medium |
52% |
110 |
Balanced Binary Tree |
|
Go . Doc |
Easy |
45% |
111 |
Minimum Depth of Binary Tree |
|
Go . Doc |
Easy |
40% |
112 |
Path Sum |
|
Go . Doc |
Easy |
43% |
113 |
Path Sum II |
|
Go . Doc |
Medium |
50% |
114 |
Flatten Binary Tree to Linked List |
|
Go . Doc |
Medium |
54% |
115 |
Distinct Subsequences |
|
Go . Doc |
Hard |
40% |
116 |
Populating Next Right Pointers in Each Node |
|
Go . Doc |
Medium |
50% |
117 |
Populating Next Right Pointers in Each Node II |
|
Go . Doc |
Medium |
43% |
118 |
Pascal's Triangle |
|
Go . Doc |
Easy |
57% |
119 |
Pascal's Triangle II |
|
Go . Doc |
Easy |
53% |
120 |
Triangle |
|
Go . Doc |
Medium |
47% |
121 |
Best Time to Buy and Sell Stock |
|
Go . Doc |
Easy |
52% |
122 |
Best Time to Buy and Sell Stock II |
|
Go . Doc |
Easy |
59% |
123 |
Best Time to Buy and Sell Stock III |
|
Go . Doc |
Hard |
40% |
124 |
Binary Tree Maximum Path Sum |
|
Go . Doc |
Hard |
36% |
125 |
Valid Palindrome |
|
Go . Doc |
Easy |
39% |
126 |
Word Ladder II |
|
Go . Doc |
Hard |
24% |
127 |
Word Ladder |
|
Go . Doc |
Hard |
32% |
128 |
Longest Consecutive Sequence |
|
Go . Doc |
Medium |
47% |
129 |
Sum Root to Leaf Numbers |
|
Go . Doc |
Medium |
52% |
130 |
Surrounded Regions |
|
Go . Doc |
Medium |
30% |
131 |
Palindrome Partitioning |
|
Go . Doc |
Medium |
54% |
132 |
Palindrome Partitioning II |
|
Go . Doc |
Hard |
31% |
133 |
Clone Graph |
|
Go . Doc |
Medium |
41% |
134 |
Gas Station |
|
Go . Doc |
Medium |
42% |
135 |
Candy |
|
Go . Doc |
Hard |
35% |
136 |
Single Number |
|
Go . Doc |
Easy |
67% |
137 |
Single Number II |
|
Go . Doc |
Medium |
54% |
138 |
Copy List with Random Pointer |
|
Go . Doc |
Medium |
42% |
139 |
Word Break |
|
Go . Doc |
Medium |
42% |
140 |
Word Break II |
|
Go . Doc |
Hard |
37% |
141 |
Linked List Cycle |
|
Go . Doc |
Easy |
43% |
142 |
Linked List Cycle II |
|
Go . Doc |
Medium |
40% |
143 |
Reorder List |
|
Go . Doc |
Medium |
42% |
144 |
Binary Tree Preorder Traversal |
|
Go . Doc |
Easy |
58% |
145 |
Binary Tree Postorder Traversal |
|
Go . Doc |
Easy |
59% |
146 |
LRU Cache |
|
Go . Doc |
Medium |
37% |
147 |
Insertion Sort List |
|
Go . Doc |
Medium |
45% |
148 |
Sort List |
|
Go . Doc |
Medium |
47% |
149 |
Max Points on a Line |
|
Go . Doc |
Hard |
18% |
150 |
Evaluate Reverse Polish Notation |
|
Go . Doc |
Medium |
39% |
151 |
Reverse Words in a String |
|
Go . Doc |
Medium |
25% |
152 |
Maximum Product Subarray |
|
Go . Doc |
Medium |
33% |
153 |
Find Minimum in Rotated Sorted Array |
|
Go . Doc |
Medium |
46% |
154 |
Find Minimum in Rotated Sorted Array II |
|
Go . Doc |
Hard |
42% |
155 |
Min Stack |
|
Go . Doc |
Easy |
47% |
156 |
Binary Tree Upside Down |
|
Go . Doc |
Medium |
57% |
157 |
Read N Characters Given Read4 |
|
Go . Doc |
Easy |
38% |
158 |
Read N Characters Given Read4 II - Call multiple times |
|
Go . Doc |
Hard |
38% |
159 |
Longest Substring with At Most Two Distinct Characters |
|
Go . Doc |
Medium |
51% |
160 |
Intersection of Two Linked Lists |
|
Go . Doc |
Easy |
45% |
161 |
One Edit Distance |
|
Go . Doc |
Medium |
33% |
162 |
Find Peak Element |
|
Go . Doc |
Medium |
44% |
163 |
Missing Ranges |
|
Go . Doc |
Easy |
28% |
164 |
Maximum Gap |
|
Go . Doc |
Hard |
39% |
165 |
Compare Version Numbers |
|
Go . Doc |
Medium |
31% |
166 |
Fraction to Recurring Decimal |
|
Go . Doc |
Medium |
22% |
167 |
Two Sum II - Input array is sorted |
|
Go . Doc |
Easy |
56% |
168 |
Excel Sheet Column Title |
|
Go . Doc |
Easy |
32% |
169 |
Majority Element |
|
Go . Doc |
Easy |
60% |
170 |
Two Sum III - Data structure design |
|
Go . Doc |
Easy |
35% |
171 |
Excel Sheet Column Number |
|
Go . Doc |
Easy |
57% |
172 |
Factorial Trailing Zeroes |
|
Go . Doc |
Easy |
39% |
173 |
Binary Search Tree Iterator |
|
Go . Doc |
Medium |
61% |
174 |
Dungeon Game |
|
Go . Doc |
Hard |
33% |
179 |
Largest Number |
|
Go . Doc |
Medium |
31% |
186 |
Reverse Words in a String II |
|
Go . Doc |
Medium |
47% |
187 |
Repeated DNA Sequences |
|
Go . Doc |
Medium |
42% |
188 |
Best Time to Buy and Sell Stock IV |
|
Go . Doc |
Hard |
30% |
189 |
Rotate Array |
|
Go . Doc |
Medium |
36% |
190 |
Reverse Bits |
|
Go . Doc |
Easy |
43% |
191 |
Number of 1 Bits |
|
Go . Doc |
Easy |
55% |
198 |
House Robber |
|
Go . Doc |
Medium |
43% |
199 |
Binary Tree Right Side View |
|
Go . Doc |
Medium |
57% |
200 |
Number of Islands |
|
Go . Doc |
Medium |
50% |
201 |
Bitwise AND of Numbers Range |
|
Go . Doc |
Medium |
39% |
202 |
Happy Number |
|
Go . Doc |
Easy |
51% |
203 |
Remove Linked List Elements |
|
Go . Doc |
Easy |
40% |
204 |
Count Primes |
|
Go . Doc |
Easy |
32% |
205 |
Isomorphic Strings |
|
Go . Doc |
Easy |
41% |
206 |
Reverse Linked List |
|
Go . Doc |
Easy |
66% |
207 |
Course Schedule |
|
Go . Doc |
Medium |
44% |
208 |
Implement Trie (Prefix Tree) |
|
Go . Doc |
Medium |
53% |
209 |
Minimum Size Subarray Sum |
|
Go . Doc |
Medium |
40% |
210 |
Course Schedule II |
|
Go . Doc |
Medium |
43% |
211 |
Design Add and Search Words Data Structure |
|
Go . Doc |
Medium |
41% |
212 |
Word Search II |
|
Go . Doc |
Hard |
37% |
213 |
House Robber II |
|
Go . Doc |
Medium |
38% |
214 |
Shortest Palindrome |
|
Go . Doc |
Hard |
31% |
215 |
Kth Largest Element in an Array |
|
Go . Doc |
Medium |
60% |
216 |
Combination Sum III |
|
Go . Doc |
Medium |
61% |
217 |
Contains Duplicate |
|
Go . Doc |
Easy |
57% |
218 |
The Skyline Problem |
|
Go . Doc |
Hard |
37% |
219 |
Contains Duplicate II |
|
Go . Doc |
Easy |
39% |
220 |
Contains Duplicate III |
|
Go . Doc |
Medium |
21% |
221 |
Maximal Square |
|
Go . Doc |
Medium |
40% |
222 |
Count Complete Tree Nodes |
|
Go . Doc |
Medium |
50% |
223 |
Rectangle Area |
|
Go . Doc |
Medium |
38% |
224 |
Basic Calculator |
|
Go . Doc |
Hard |
38% |
225 |
Implement Stack using Queues |
|
Go . Doc |
Easy |
48% |
226 |
Invert Binary Tree |
|
Go . Doc |
Easy |
68% |
227 |
Basic Calculator II |
|
Go . Doc |
Medium |
39% |
228 |
Summary Ranges |
|
Go . Doc |
Easy |
43% |
229 |
Majority Element II |
|
Go . Doc |
Medium |
39% |
230 |
Kth Smallest Element in a BST |
|
Go . Doc |
Medium |
63% |
231 |
Power of Two |
|
Go . Doc |
Easy |
43% |
232 |
Implement Queue using Stacks |
|
Go . Doc |
Easy |
53% |
233 |
Number of Digit One |
|
Go . Doc |
Hard |
32% |
234 |
Palindrome Linked List |
|
Go . Doc |
Easy |
43% |
235 |
Lowest Common Ancestor of a Binary Search Tree |
|
Go . Doc |
Easy |
53% |
236 |
Lowest Common Ancestor of a Binary Tree |
|
Go . Doc |
Medium |
51% |
237 |
Delete Node in a Linked List |
|
Go . Doc |
Easy |
68% |
238 |
Product of Array Except Self |
|
Go . Doc |
Medium |
61% |
239 |
Sliding Window Maximum |
|
Go . Doc |
Hard |
45% |
240 |
Search a 2D Matrix II |
|
Go . Doc |
Medium |
46% |
241 |
Different Ways to Add Parentheses |
|
Go . Doc |
Medium |
58% |
242 |
Valid Anagram |
|
Go . Doc |
Easy |
59% |
243 |
Shortest Word Distance |
|
Go . Doc |
Easy |
62% |
244 |
Shortest Word Distance II |
|
Go . Doc |
Medium |
55% |
245 |
Shortest Word Distance III |
|
Go . Doc |
Medium |
56% |
246 |
Strobogrammatic Number |
|
Go . Doc |
Easy |
46% |
247 |
Strobogrammatic Number II |
|
Go . Doc |
Medium |
49% |
248 |
Strobogrammatic Number III |
|
Go . Doc |
Hard |
40% |
249 |
Group Shifted Strings |
|
Go . Doc |
Medium |
59% |
250 |
Count Univalue Subtrees |
|
Go . Doc |
Medium |
53% |
251 |
Flatten 2D Vector |
|
Go . Doc |
Medium |
46% |
252 |
Meeting Rooms |
|
Go . Doc |
Easy |
55% |
253 |
Meeting Rooms II |
|
Go . Doc |
Medium |
47% |
254 |
Factor Combinations |
|
Go . Doc |
Medium |
47% |
255 |
Verify Preorder Sequence in Binary Search Tree |
|
Go . Doc |
Medium |
46% |
256 |
Paint House |
|
Go . Doc |
Medium |
55% |
257 |
Binary Tree Paths |
|
Go . Doc |
Easy |
55% |
258 |
Add Digits |
|
Go . Doc |
Easy |
59% |
259 |
3Sum Smaller |
|
Go . Doc |
Medium |
49% |
260 |
Single Number III |
|
Go . Doc |
Medium |
65% |
261 |
Graph Valid Tree |
|
Go . Doc |
Medium |
43% |
263 |
Ugly Number |
|
Go . Doc |
Easy |
41% |
264 |
Ugly Number II |
|
Go . Doc |
Medium |
43% |
265 |
Paint House II |
|
Go . Doc |
Hard |
46% |
266 |
Palindrome Permutation |
|
Go . Doc |
Easy |
63% |
267 |
Palindrome Permutation II |
|
Go . Doc |
Medium |
38% |
268 |
Missing Number |
|
Go . Doc |
Easy |
56% |
269 |
Alien Dictionary |
|
Go . Doc |
Hard |
34% |
270 |
Closest Binary Search Tree Value |
|
Go . Doc |
Easy |
51% |
271 |
Encode and Decode Strings |
|
Go . Doc |
Medium |
34% |
272 |
Closest Binary Search Tree Value II |
|
Go . Doc |
Hard |
53% |
273 |
Integer to English Words |
|
Go . Doc |
Hard |
28% |
274 |
H-Index |
|
Go . Doc |
Medium |
36% |
275 |
H-Index II |
|
Go . Doc |
Medium |
36% |
276 |
Paint Fence |
|
Go . Doc |
Medium |
39% |
277 |
Find the Celebrity |
|
Go . Doc |
Medium |
44% |
278 |
First Bad Version |
|
Go . Doc |
Easy |
38% |
279 |
Perfect Squares |
|
Go . Doc |
Medium |
49% |
280 |
Wiggle Sort |
|
Go . Doc |
Medium |
65% |
281 |
Zigzag Iterator |
|
Go . Doc |
Medium |
60% |
282 |
Expression Add Operators |
|
Go . Doc |
Hard |
37% |
283 |
Move Zeroes |
|
Go . Doc |
Easy |
58% |
284 |
Peeking Iterator |
|
Go . Doc |
Medium |
51% |
285 |
Inorder Successor in BST |
|
Go . Doc |
Medium |
44% |
286 |
Walls and Gates |
|
Go . Doc |
Medium |
57% |
287 |
Find the Duplicate Number |
|
Go . Doc |
Medium |
58% |
288 |
Unique Word Abbreviation |
|
Go . Doc |
Medium |
23% |
289 |
Game of Life |
|
Go . Doc |
Medium |
59% |
290 |
Word Pattern |
|
Go . Doc |
Easy |
38% |
291 |
Word Pattern II |
|
Go . Doc |
Medium |
44% |
292 |
Nim Game |
|
Go . Doc |
Easy |
55% |
293 |
Flip Game |
|
Go . Doc |
Easy |
61% |
294 |
Flip Game II |
|
Go . Doc |
Medium |
50% |
295 |
Find Median from Data Stream |
|
Go . Doc |
Hard |
48% |
296 |
Best Meeting Point |
|
Go . Doc |
Hard |
58% |
297 |
Serialize and Deserialize Binary Tree |
|
Go . Doc |
Hard |
51% |
298 |
Binary Tree Longest Consecutive Sequence |
|
Go . Doc |
Medium |
48% |
299 |
Bulls and Cows |
|
Go . Doc |
Medium |
45% |
300 |
Longest Increasing Subsequence |
|
Go . Doc |
Medium |
46% |
301 |
Remove Invalid Parentheses |
|
Go . Doc |
Hard |
45% |
302 |
Smallest Rectangle Enclosing Black Pixels |
|
Go . Doc |
Hard |
53% |
303 |
Range Sum Query - Immutable |
|
Go . Doc |
Easy |
49% |
304 |
Range Sum Query 2D - Immutable |
|
Go . Doc |
Medium |
44% |
305 |
Number of Islands II |
|
Go . Doc |
Hard |
39% |
306 |
Additive Number |
|
Go . Doc |
Medium |
29% |
307 |
Range Sum Query - Mutable |
|
Go . Doc |
Medium |
37% |
308 |
Range Sum Query 2D - Mutable |
|
Go . Doc |
Hard |
39% |
309 |
Best Time to Buy and Sell Stock with Cooldown |
|
Go . Doc |
Medium |
48% |
310 |
Minimum Height Trees |
|
Go . Doc |
Medium |
35% |
311 |
Sparse Matrix Multiplication |
|
Go . Doc |
Medium |
64% |
312 |
Burst Balloons |
|
Go . Doc |
Hard |
54% |
313 |
Super Ugly Number |
|
Go . Doc |
Medium |
46% |
314 |
Binary Tree Vertical Order Traversal |
|
Go . Doc |
Medium |
47% |
315 |
Count of Smaller Numbers After Self |
|
Go . Doc |
Hard |
42% |
316 |
Remove Duplicate Letters |
|
Go . Doc |
Medium |
39% |
317 |
Shortest Distance from All Buildings |
|
Go . Doc |
Hard |
43% |
318 |
Maximum Product of Word Lengths |
|
Go . Doc |
Medium |
55% |
319 |
Bulb Switcher |
|
Go . Doc |
Medium |
45% |
320 |
Generalized Abbreviation |
|
Go . Doc |
Medium |
54% |
321 |
Create Maximum Number |
|
Go . Doc |
Hard |
27% |
322 |
Coin Change |
|
Go . Doc |
Medium |
38% |
323 |
Number of Connected Components in an Undirected Graph |
|
Go . Doc |
Medium |
58% |
324 |
Wiggle Sort II |
|
Go . Doc |
Medium |
31% |
325 |
Maximum Size Subarray Sum Equals k |
|
Go . Doc |
Medium |
47% |
326 |
Power of Three |
|
Go . Doc |
Easy |
42% |
327 |
Count of Range Sum |
|
Go . Doc |
Hard |
36% |
328 |
Odd Even Linked List |
|
Go . Doc |
Medium |
57% |
329 |
Longest Increasing Path in a Matrix |
|
Go . Doc |
Hard |
47% |
330 |
Patching Array |
|
Go . Doc |
Hard |
35% |
331 |
Verify Preorder Serialization of a Binary Tree |
|
Go . Doc |
Medium |
41% |
332 |
Reconstruct Itinerary |
|
Go . Doc |
Medium |
38% |
333 |
Largest BST Subtree |
|
Go . Doc |
Medium |
39% |
334 |
Increasing Triplet Subsequence |
|
Go . Doc |
Medium |
41% |
335 |
Self Crossing |
|
Go . Doc |
Hard |
28% |
336 |
Palindrome Pairs |
|
Go . Doc |
Hard |
36% |
337 |
House Robber III |
|
Go . Doc |
Medium |
52% |
338 |
Counting Bits |
|
Go . Doc |
Easy |
71% |
339 |
Nested List Weight Sum |
|
Go . Doc |
Medium |
77% |
340 |
Longest Substring with At Most K Distinct Characters |
|
Go . Doc |
Medium |
46% |
341 |
Flatten Nested List Iterator |
|
Go . Doc |
Medium |
56% |
342 |
Power of Four |
|
Go . Doc |
Easy |
42% |
343 |
Integer Break |
|
Go . Doc |
Medium |
51% |
344 |
Reverse String |
|
Go . Doc |
Easy |
71% |
345 |
Reverse Vowels of a String |
|
Go . Doc |
Easy |
45% |
346 |
Moving Average from Data Stream |
|
Go . Doc |
Easy |
74% |
347 |
Top K Frequent Elements |
|
Go . Doc |
Medium |
63% |
348 |
Design Tic-Tac-Toe |
|
Go . Doc |
Medium |
56% |
349 |
Intersection of Two Arrays |
|
Go . Doc |
Easy |
66% |
350 |
Intersection of Two Arrays II |
|
Go . Doc |
Easy |
52% |
351 |
Android Unlock Patterns |
|
Go . Doc |
Medium |
50% |
352 |
Data Stream as Disjoint Intervals |
|
Go . Doc |
Hard |
49% |
353 |
Design Snake Game |
|
Go . Doc |
Medium |
36% |
354 |
Russian Doll Envelopes |
|
Go . Doc |
Hard |
38% |
355 |
Design Twitter |
|
Go . Doc |
Medium |
32% |
356 |
Line Reflection |
|
Go . Doc |
Medium |
33% |
357 |
Count Numbers with Unique Digits |
|
Go . Doc |
Medium |
49% |
358 |
Rearrange String k Distance Apart |
|
Go . Doc |
Hard |
36% |
359 |
Logger Rate Limiter |
|
Go . Doc |
Easy |
73% |
360 |
Sort Transformed Array |
|
Go . Doc |
Medium |
50% |
361 |
Bomb Enemy |
|
Go . Doc |
Medium |
47% |
362 |
Design Hit Counter |
|
Go . Doc |
Medium |
66% |
363 |
Max Sum of Rectangle No Larger Than K |
|
Go . Doc |
Hard |
39% |
364 |
Nested List Weight Sum II |
|
Go . Doc |
Medium |
64% |
365 |
Water and Jug Problem |
|
Go . Doc |
Medium |
32% |
366 |
Find Leaves of Binary Tree |
|
Go . Doc |
Medium |
73% |
367 |
Valid Perfect Square |
|
Go . Doc |
Easy |
42% |
368 |
Largest Divisible Subset |
|
Go . Doc |
Medium |
38% |
369 |
Plus One Linked List |
|
Go . Doc |
Medium |
59% |
370 |
Range Addition |
|
Go . Doc |
Medium |
64% |
371 |
Sum of Two Integers |
|
Go . Doc |
Medium |
50% |
372 |
Super Pow |
|
Go . Doc |
Medium |
37% |
373 |
Find K Pairs with Smallest Sums |
|
Go . Doc |
Medium |
38% |
374 |
Guess Number Higher or Lower |
|
Go . Doc |
Easy |
45% |
375 |
Guess Number Higher or Lower II |
|
Go . Doc |
Medium |
43% |
376 |
Wiggle Subsequence |
|
Go . Doc |
Medium |
42% |
377 |
Combination Sum IV |
|
Go . Doc |
Medium |
47% |
378 |
Kth Smallest Element in a Sorted Matrix |
|
Go . Doc |
Medium |
57% |
379 |
Design Phone Directory |
|
Go . Doc |
Medium |
49% |
380 |
Insert Delete GetRandom O(1) |
|
Go . Doc |
Medium |
49% |
381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
|
Go . Doc |
Hard |
35% |
382 |
Linked List Random Node |
|
Go . Doc |
Medium |
54% |
383 |
Ransom Note |
|
Go . Doc |
Easy |
53% |
384 |
Shuffle an Array |
|
Go . Doc |
Medium |
54% |
385 |
Mini Parser |
|
Go . Doc |
Medium |
34% |
386 |
Lexicographical Numbers |
|
Go . Doc |
Medium |
55% |
387 |
First Unique Character in a String |
|
Go . Doc |
Easy |
54% |
388 |
Longest Absolute File Path |
|
Go . Doc |
Medium |
43% |
389 |
Find the Difference |
|
Go . Doc |
Easy |
58% |
390 |
Elimination Game |
|
Go . Doc |
Medium |
45% |
391 |
Perfect Rectangle |
|
Go . Doc |
Hard |
31% |
392 |
Is Subsequence |
|
Go . Doc |
Easy |
49% |
393 |
UTF-8 Validation |
|
Go . Doc |
Medium |
38% |
394 |
Decode String |
|
Go . Doc |
Medium |
53% |
395 |
Longest Substring with At Least K Repeating Characters |
|
Go . Doc |
Medium |
43% |
396 |
Rotate Function |
|
Go . Doc |
Medium |
37% |
397 |
Integer Replacement |
|
Go . Doc |
Medium |
33% |
398 |
Random Pick Index |
|
Go . Doc |
Medium |
59% |
399 |
Evaluate Division |
|
Go . Doc |
Medium |
55% |
400 |
Nth Digit |
|
Go . Doc |
Medium |
32% |
401 |
Binary Watch |
|
Go . Doc |
Easy |
49% |
402 |
Remove K Digits |
|
Go . Doc |
Medium |
28% |
403 |
Frog Jump |
|
Go . Doc |
Hard |
42% |
404 |
Sum of Left Leaves |
|
Go . Doc |
Easy |
52% |
405 |
Convert a Number to Hexadecimal |
|
Go . Doc |
Easy |
44% |
406 |
Queue Reconstruction by Height |
|
Go . Doc |
Medium |
69% |
407 |
Trapping Rain Water II |
|
Go . Doc |
Hard |
45% |
408 |
Valid Word Abbreviation |
|
Go . Doc |
Easy |
31% |
409 |
Longest Palindrome |
|
Go . Doc |
Easy |
52% |
410 |
Split Array Largest Sum |
|
Go . Doc |
Hard |
47% |
411 |
Minimum Unique Word Abbreviation |
|
Go . Doc |
Hard |
37% |
412 |
Fizz Buzz |
|
Go . Doc |
Easy |
64% |
413 |
Arithmetic Slices |
|
Go . Doc |
Medium |
60% |
414 |
Third Maximum Number |
|
Go . Doc |
Easy |
30% |
415 |
Add Strings |
|
Go . Doc |
Easy |
49% |
416 |
Partition Equal Subset Sum |
|
Go . Doc |
Medium |
45% |
417 |
Pacific Atlantic Water Flow |
|
Go . Doc |
Medium |
45% |
418 |
Sentence Screen Fitting |
|
Go . Doc |
Medium |
34% |
419 |
Battleships in a Board |
|
Go . Doc |
Medium |
71% |
420 |
Strong Password Checker |
|
Go . Doc |
Hard |
13% |
421 |
Maximum XOR of Two Numbers in an Array |
|
Go . Doc |
Medium |
54% |
422 |
Valid Word Square |
|
Go . Doc |
Easy |
38% |
423 |
Reconstruct Original Digits from English |
|
Go . Doc |
Medium |
51% |
424 |
Longest Repeating Character Replacement |
|
Go . Doc |
Medium |
49% |
425 |
Word Squares |
|
Go . Doc |
Hard |
50% |
426 |
Convert Binary Search Tree to Sorted Doubly Linked List |
|
Go . Doc |
Medium |
62% |
427 |
Construct Quad Tree |
|
Go . Doc |
Medium |
63% |
428 |
Serialize and Deserialize N-ary Tree |
|
Go . Doc |
Hard |
62% |
429 |
N-ary Tree Level Order Traversal |
|
Go . Doc |
Medium |
67% |
430 |
Flatten a Multilevel Doubly Linked List |
|
Go . Doc |
Medium |
57% |
431 |
Encode N-ary Tree to Binary Tree |
|
Go . Doc |
Hard |
75% |
432 |
All O`one Data Structure |
|
Go . Doc |
Hard |
33% |
433 |
Minimum Genetic Mutation |
|
Go . Doc |
Medium |
44% |
434 |
Number of Segments in a String |
|
Go . Doc |
Easy |
37% |
435 |
Non-overlapping Intervals |
|
Go . Doc |
Medium |
44% |
436 |
Find Right Interval |
|
Go . Doc |
Medium |
48% |
437 |
Path Sum III |
|
Go . Doc |
Medium |
48% |
438 |
Find All Anagrams in a String |
|
Go . Doc |
Medium |
45% |
439 |
Ternary Expression Parser |
|
Go . Doc |
Medium |
57% |
440 |
K-th Smallest in Lexicographical Order |
|
Go . Doc |
Hard |
29% |
441 |
Arranging Coins |
|
Go . Doc |
Easy |
42% |
442 |
Find All Duplicates in an Array |
|
Go . Doc |
Medium |
69% |
443 |
String Compression |
|
Go . Doc |
Medium |
45% |
444 |
Sequence Reconstruction |
|
Go . Doc |
Medium |
23% |
445 |
Add Two Numbers II |
|
Go . Doc |
Medium |
57% |
446 |
Arithmetic Slices II - Subsequence |
|
Go . Doc |
Hard |
34% |
447 |
Number of Boomerangs |
|
Go . Doc |
Medium |
52% |
448 |
Find All Numbers Disappeared in an Array |
|
Go . Doc |
Easy |
56% |
449 |
Serialize and Deserialize BST |
|
Go . Doc |
Medium |
54% |
450 |
Delete Node in a BST |
|
Go . Doc |
Medium |
46% |
451 |
Sort Characters By Frequency |
|
Go . Doc |
Medium |
65% |
452 |
Minimum Number of Arrows to Burst Balloons |
|
Go . Doc |
Medium |
50% |
453 |
Minimum Moves to Equal Array Elements |
|
Go . Doc |
Easy |
51% |
454 |
4Sum II |
|
Go . Doc |
Medium |
55% |
455 |
Assign Cookies |
|
Go . Doc |
Easy |
50% |
456 |
132 Pattern |
|
Go . Doc |
Medium |
30% |
457 |
Circular Array Loop |
|
Go . Doc |
Medium |
30% |
458 |
Poor Pigs |
|
Go . Doc |
Hard |
54% |
459 |
Repeated Substring Pattern |
|
Go . Doc |
Easy |
43% |
460 |
LFU Cache |
|
Go . Doc |
Hard |
37% |
461 |
Hamming Distance |
|
Go . Doc |
Easy |
73% |
462 |
Minimum Moves to Equal Array Elements II |
|
Go . Doc |
Medium |
55% |
463 |
Island Perimeter |
|
Go . Doc |
Easy |
67% |
464 |
Can I Win |
|
Go . Doc |
Medium |
29% |
465 |
Optimal Account Balancing |
|
Go . Doc |
Hard |
48% |
466 |
Count The Repetitions |
|
Go . Doc |
Hard |
28% |
467 |
Unique Substrings in Wraparound String |
|
Go . Doc |
Medium |
36% |
468 |
Validate IP Address |
|
Go . Doc |
Medium |
25% |
469 |
Convex Polygon |
|
Go . Doc |
Medium |
37% |
470 |
Implement Rand10() Using Rand7() |
|
Go . Doc |
Medium |
46% |
471 |
Encode String with Shortest Length |
|
Go . Doc |
Hard |
50% |
472 |
Concatenated Words |
|
Go . Doc |
Hard |
44% |
473 |
Matchsticks to Square |
|
Go . Doc |
Medium |
39% |
474 |
Ones and Zeroes |
|
Go . Doc |
Medium |
43% |
475 |
Heaters |
|
Go . Doc |
Medium |
34% |
476 |
Number Complement |
|
Go . Doc |
Easy |
65% |
477 |
Total Hamming Distance |
|
Go . Doc |
Medium |
50% |
478 |
Generate Random Point in a Circle |
|
Go . Doc |
Medium |
39% |
479 |
Largest Palindrome Product |
|
Go . Doc |
Hard |
29% |
480 |
Sliding Window Median |
|
Go . Doc |
Hard |
39% |
481 |
Magical String |
|
Go . Doc |
Medium |
48% |
482 |
License Key Formatting |
|
Go . Doc |
Easy |
43% |
483 |
Smallest Good Base |
|
Go . Doc |
Hard |
36% |
484 |
Find Permutation |
|
Go . Doc |
Medium |
64% |
485 |
Max Consecutive Ones |
|
Go . Doc |
Easy |
53% |
486 |
Predict the Winner |
|
Go . Doc |
Medium |
49% |
487 |
Max Consecutive Ones II |
|
Go . Doc |
Medium |
48% |
488 |
Zuma Game |
|
Go . Doc |
Hard |
38% |
489 |
Robot Room Cleaner |
|
Go . Doc |
Hard |
73% |
490 |
The Maze |
|
Go . Doc |
Medium |
53% |
491 |
Increasing Subsequences |
|
Go . Doc |
Medium |
48% |
492 |
Construct the Rectangle |
|
Go . Doc |
Easy |
51% |
493 |
Reverse Pairs |
|
Go . Doc |
Hard |
27% |
494 |
Target Sum |
|
Go . Doc |
Medium |
45% |
495 |
Teemo Attacking |
|
Go . Doc |
Easy |
56% |
496 |
Next Greater Element I |
|
Go . Doc |
Easy |
66% |
497 |
Random Point in Non-overlapping Rectangles |
|
Go . Doc |
Medium |
39% |
498 |
Diagonal Traverse |
|
Go . Doc |
Medium |
51% |
499 |
The Maze III |
|
Go . Doc |
Hard |
43% |
500 |
Keyboard Row |
|
Go . Doc |
Easy |
66% |
501 |
Find Mode in Binary Search Tree |
|
Go . Doc |
Easy |
44% |
502 |
IPO |
|
Go . Doc |
Hard |
42% |
503 |
Next Greater Element II |
|
Go . Doc |
Medium |
59% |
504 |
Base 7 |
|
Go . Doc |
Easy |
46% |
505 |
The Maze II |
|
Go . Doc |
Medium |
49% |
506 |
Relative Ranks |
|
Go . Doc |
Easy |
52% |
507 |
Perfect Number |
|
Go . Doc |
Easy |
36% |
508 |
Most Frequent Subtree Sum |
|
Go . Doc |
Medium |
60% |
509 |
Fibonacci Number |
|
Go . Doc |
Easy |
67% |
510 |
Inorder Successor in BST II |
|
Go . Doc |
Medium |
60% |
513 |
Find Bottom Left Tree Value |
|
Go . Doc |
Medium |
63% |
514 |
Freedom Trail |
|
Go . Doc |
Hard |
45% |
515 |
Find Largest Value in Each Tree Row |
|
Go . Doc |
Medium |
62% |
516 |
Longest Palindromic Subsequence |
|
Go . Doc |
Medium |
56% |
517 |
Super Washing Machines |
|
Go . Doc |
Hard |
38% |
518 |
Coin Change 2 |
|
Go . Doc |
Medium |
53% |
519 |
Random Flip Matrix |
|
Go . Doc |
Medium |
38% |
520 |
Detect Capital |
|
Go . Doc |
Easy |
54% |
521 |
Longest Uncommon Subsequence I |
|
Go . Doc |
Easy |
59% |
522 |
Longest Uncommon Subsequence II |
|
Go . Doc |
Medium |
34% |
523 |
Continuous Subarray Sum |
|
Go . Doc |
Medium |
25% |
524 |
Longest Word in Dictionary through Deleting |
|
Go . Doc |
Medium |
50% |
525 |
Contiguous Array |
|
Go . Doc |
Medium |
44% |
526 |
Beautiful Arrangement |
|
Go . Doc |
Medium |
62% |
527 |
Word Abbreviation |
|
Go . Doc |
Hard |
56% |
528 |
Random Pick with Weight |
|
Go . Doc |
Medium |
45% |
529 |
Minesweeper |
|
Go . Doc |
Medium |
62% |
530 |
Minimum Absolute Difference in BST |
|
Go . Doc |
Easy |
55% |
531 |
Lonely Pixel I |
|
Go . Doc |
Medium |
60% |
532 |
K-diff Pairs in an Array |
|
Go . Doc |
Medium |
36% |
533 |
Lonely Pixel II |
|
Go . Doc |
Medium |
48% |
535 |
Encode and Decode TinyURL |
|
Go . Doc |
Medium |
82% |
536 |
Construct Binary Tree from String |
|
Go . Doc |
Medium |
53% |
537 |
Complex Number Multiplication |
|
Go . Doc |
Medium |
68% |
538 |
Convert BST to Greater Tree |
|
Go . Doc |
Medium |
60% |
539 |
Minimum Time Difference |
|
Go . Doc |
Medium |
52% |
540 |
Single Element in a Sorted Array |
|
Go . Doc |
Medium |
58% |
541 |
Reverse String II |
|
Go . Doc |
Easy |
49% |
542 |
01 Matrix |
|
Go . Doc |
Medium |
41% |
543 |
Diameter of Binary Tree |
|
Go . Doc |
Easy |
50% |
544 |
Output Contest Matches |
|
Go . Doc |
Medium |
76% |
545 |
Boundary of Binary Tree |
|
Go . Doc |
Medium |
41% |
546 |
Remove Boxes |
|
Go . Doc |
Hard |
44% |
547 |
Number of Provinces |
|
Go . Doc |
Medium |
61% |
548 |
Split Array with Equal Sum |
|
Go . Doc |
Medium |
49% |
549 |
Binary Tree Longest Consecutive Sequence II |
|
Go . Doc |
Medium |
47% |
551 |
Student Attendance Record I |
|
Go . Doc |
Easy |
46% |
552 |
Student Attendance Record II |
|
Go . Doc |
Hard |
38% |
553 |
Optimal Division |
|
Go . Doc |
Medium |
57% |
554 |
Brick Wall |
|
Go . Doc |
Medium |
51% |
555 |
Split Concatenated Strings |
|
Go . Doc |
Medium |
43% |
556 |
Next Greater Element III |
|
Go . Doc |
Medium |
33% |
557 |
Reverse Words in a String III |
|
Go . Doc |
Easy |
73% |
558 |
Logical OR of Two Binary Grids Represented as Quad-Trees |
|
Go . Doc |
Medium |
46% |
559 |
Maximum Depth of N-ary Tree |
|
Go . Doc |
Easy |
69% |
560 |
Subarray Sum Equals K |
|
Go . Doc |
Medium |
43% |
561 |
Array Partition I |
|
Go . Doc |
Easy |
74% |
562 |
Longest Line of Consecutive One in Matrix |
|
Go . Doc |
Medium |
47% |
563 |
Binary Tree Tilt |
|
Go . Doc |
Easy |
54% |
564 |
Find the Closest Palindrome |
|
Go . Doc |
Hard |
20% |
565 |
Array Nesting |
|
Go . Doc |
Medium |
56% |
566 |
Reshape the Matrix |
|
Go . Doc |
Easy |
61% |
567 |
Permutation in String |
|
Go . Doc |
Medium |
44% |
568 |
Maximum Vacation Days |
|
Go . Doc |
Hard |
42% |
572 |
Subtree of Another Tree |
|
Go . Doc |
Easy |
44% |
573 |
Squirrel Simulation |
|
Go . Doc |
Medium |
54% |
575 |
Distribute Candies |
|
Go . Doc |
Easy |
64% |
576 |
Out of Boundary Paths |
|
Go . Doc |
Medium |
39% |
581 |
Shortest Unsorted Continuous Subarray |
|
Go . Doc |
Medium |
33% |
582 |
Kill Process |
|
Go . Doc |
Medium |
64% |
583 |
Delete Operation for Two Strings |
|
Go . Doc |
Medium |
52% |
587 |
Erect the Fence |
|
Go . Doc |
Hard |
36% |
588 |
Design In-Memory File System |
|
Go . Doc |
Hard |
46% |
589 |
N-ary Tree Preorder Traversal |
|
Go . Doc |
Easy |
74% |
590 |
N-ary Tree Postorder Traversal |
|
Go . Doc |
Easy |
74% |
591 |
Tag Validator |
|
Go . Doc |
Hard |
35% |
592 |
Fraction Addition and Subtraction |
|
Go . Doc |
Medium |
50% |
593 |
Valid Square |
|
Go . Doc |
Medium |
43% |
594 |
Longest Harmonious Subsequence |
|
Go . Doc |
Easy |
51% |
598 |
Range Addition II |
|
Go . Doc |
Easy |
50% |
599 |
Minimum Index Sum of Two Lists |
|
Go . Doc |
Easy |
52% |
600 |
Non-negative Integers without Consecutive Ones |
|
Go . Doc |
Hard |
34% |
604 |
Design Compressed String Iterator |
|
Go . Doc |
Easy |
38% |
605 |
Can Place Flowers |
|
Go . Doc |
Easy |
31% |
606 |
Construct String from Binary Tree |
|
Go . Doc |
Easy |
56% |
609 |
Find Duplicate File in System |
|
Go . Doc |
Medium |
63% |
611 |
Valid Triangle Number |
|
Go . Doc |
Medium |
49% |
616 |
Add Bold Tag in String |
|
Go . Doc |
Medium |
45% |
617 |
Merge Two Binary Trees |
|
Go . Doc |
Easy |
76% |
621 |
Task Scheduler |
|
Go . Doc |
Medium |
52% |
622 |
Design Circular Queue |
|
Go . Doc |
Medium |
47% |
623 |
Add One Row to Tree |
|
Go . Doc |
Medium |
53% |
624 |
Maximum Distance in Arrays |
|
Go . Doc |
Medium |
39% |
625 |
Minimum Factorization |
|
Go . Doc |
Medium |
33% |
628 |
Maximum Product of Three Numbers |
|
Go . Doc |
Easy |
46% |
629 |
K Inverse Pairs Array |
|
Go . Doc |
Hard |
37% |
630 |
Course Schedule III |
|
Go . Doc |
Hard |
34% |
631 |
Design Excel Sum Formula |
|
Go . Doc |
Hard |
33% |
632 |
Smallest Range Covering Elements from K Lists |
|
Go . Doc |
Hard |
55% |
633 |
Sum of Square Numbers |
|
Go . Doc |
Medium |
32% |
634 |
Find the Derangement of An Array |
|
Go . Doc |
Medium |
40% |
635 |
Design Log Storage System |
|
Go . Doc |
Medium |
60% |
636 |
Exclusive Time of Functions |
|
Go . Doc |
Medium |
56% |
637 |
Average of Levels in Binary Tree |
|
Go . Doc |
Easy |
66% |
638 |
Shopping Offers |
|
Go . Doc |
Medium |
53% |
639 |
Decode Ways II |
|
Go . Doc |
Hard |
30% |
640 |
Solve the Equation |
|
Go . Doc |
Medium |
42% |
641 |
Design Circular Deque |
|
Go . Doc |
Medium |
56% |
642 |
Design Search Autocomplete System |
|
Go . Doc |
Hard |
47% |
643 |
Maximum Average Subarray I |
|
Go . Doc |
Easy |
42% |
644 |
Maximum Average Subarray II |
|
Go . Doc |
Hard |
34% |
645 |
Set Mismatch |
|
Go . Doc |
Easy |
40% |
646 |
Maximum Length of Pair Chain |
|
Go . Doc |
Medium |
53% |
647 |
Palindromic Substrings |
|
Go . Doc |
Medium |
63% |
648 |
Replace Words |
|
Go . Doc |
Medium |
59% |
649 |
Dota2 Senate |
|
Go . Doc |
Medium |
39% |
650 |
2 Keys Keyboard |
|
Go . Doc |
Medium |
50% |
651 |
4 Keys Keyboard |
|
Go . Doc |
Medium |
53% |
652 |
Find Duplicate Subtrees |
|
Go . Doc |
Medium |
53% |
653 |
Two Sum IV - Input is a BST |
|
Go . Doc |
Easy |
56% |
654 |
Maximum Binary Tree |
|
Go . Doc |
Medium |
82% |
655 |
Print Binary Tree |
|
Go . Doc |
Medium |
57% |
656 |
Coin Path |
|
Go . Doc |
Hard |
30% |
657 |
Robot Return to Origin |
|
Go . Doc |
Easy |
74% |
658 |
Find K Closest Elements |
|
Go . Doc |
Medium |
43% |
659 |
Split Array into Consecutive Subsequences |
|
Go . Doc |
Medium |
44% |
660 |
Remove 9 |
|
Go . Doc |
Hard |
54% |
661 |
Image Smoother |
|
Go . Doc |
Easy |
52% |
662 |
Maximum Width of Binary Tree |
|
Go . Doc |
Medium |
39% |
663 |
Equal Tree Partition |
|
Go . Doc |
Medium |
39% |
664 |
Strange Printer |
|
Go . Doc |
Hard |
42% |
665 |
Non-decreasing Array |
|
Go . Doc |
Medium |
20% |
666 |
Path Sum IV |
|
Go . Doc |
Medium |
57% |
667 |
Beautiful Arrangement II |
|
Go . Doc |
Medium |
58% |
668 |
Kth Smallest Number in Multiplication Table |
|
Go . Doc |
Hard |
48% |
669 |
Trim a Binary Search Tree |
|
Go . Doc |
Medium |
64% |
670 |
Maximum Swap |
|
Go . Doc |
Medium |
45% |
671 |
Second Minimum Node In a Binary Tree |
|
Go . Doc |
Easy |
42% |
672 |
Bulb Switcher II |
|
Go . Doc |
Medium |
51% |
673 |
Number of Longest Increasing Subsequence |
|
Go . Doc |
Medium |
38% |
674 |
Longest Continuous Increasing Subsequence |
|
Go . Doc |
Easy |
46% |
675 |
Cut Off Trees for Golf Event |
|
Go . Doc |
Hard |
35% |
676 |
Implement Magic Dictionary |
|
Go . Doc |
Medium |
55% |
677 |
Map Sum Pairs |
|
Go . Doc |
Medium |
54% |
678 |
Valid Parenthesis String |
|
Go . Doc |
Medium |
32% |
679 |
24 Game |
|
Go . Doc |
Hard |
47% |
680 |
Valid Palindrome II |
|
Go . Doc |
Easy |
37% |
681 |
Next Closest Time |
|
Go . Doc |
Medium |
46% |
682 |
Baseball Game |
|
Go . Doc |
Easy |
68% |
683 |
K Empty Slots |
|
Go . Doc |
Hard |
36% |
684 |
Redundant Connection |
|
Go . Doc |
Medium |
59% |
685 |
Redundant Connection II |
|
Go . Doc |
Hard |
33% |
686 |
Repeated String Match |
|
Go . Doc |
Medium |
33% |
687 |
Longest Univalue Path |
|
Go . Doc |
Medium |
38% |
688 |
Knight Probability in Chessboard |
|
Go . Doc |
Medium |
50% |
689 |
Maximum Sum of 3 Non-Overlapping Subarrays |
|
Go . Doc |
Hard |
47% |
690 |
Employee Importance |
|
Go . Doc |
Easy |
60% |
691 |
Stickers to Spell Word |
|
Go . Doc |
Hard |
45% |
692 |
Top K Frequent Words |
|
Go . Doc |
Medium |
53% |
693 |
Binary Number with Alternating Bits |
|
Go . Doc |
Easy |
60% |
694 |
Number of Distinct Islands |
|
Go . Doc |
Medium |
58% |
695 |
Max Area of Island |
|
Go . Doc |
Medium |
66% |
696 |
Count Binary Substrings |
|
Go . Doc |
Easy |
61% |
697 |
Degree of an Array |
|
Go . Doc |
Easy |
54% |
698 |
Partition to K Equal Sum Subsets |
|
Go . Doc |
Medium |
45% |
699 |
Falling Squares |
|
Go . Doc |
Hard |
43% |
700 |
Search in a Binary Search Tree |
|
Go . Doc |
Easy |
73% |
701 |
Insert into a Binary Search Tree |
|
Go . Doc |
Medium |
75% |
702 |
Search in a Sorted Array of Unknown Size |
|
Go . Doc |
Medium |
69% |
703 |
Kth Largest Element in a Stream |
|
Go . Doc |
Easy |
51% |
704 |
Binary Search |
|
Go . Doc |
Easy |
54% |
705 |
Design HashSet |
|
Go . Doc |
Easy |
63% |
706 |
Design HashMap |
|
Go . Doc |
Easy |
63% |
707 |
Design Linked List |
|
Go . Doc |
Medium |
26% |
708 |
Insert into a Sorted Circular Linked List |
|
Go . Doc |
Medium |
32% |
709 |
To Lower Case |
|
Go . Doc |
Easy |
80% |
710 |
Random Pick with Blacklist |
|
Go . Doc |
Hard |
33% |
711 |
Number of Distinct Islands II |
|
Go . Doc |
Hard |
50% |
712 |
Minimum ASCII Delete Sum for Two Strings |
|
Go . Doc |
Medium |
60% |
713 |
Subarray Product Less Than K |
|
Go . Doc |
Medium |
40% |
714 |
Best Time to Buy and Sell Stock with Transaction Fee |
|
Go . Doc |
Medium |
58% |
715 |
Range Module |
|
Go . Doc |
Hard |
41% |
716 |
Max Stack |
|
Go . Doc |
Easy |
43% |
717 |
1-bit and 2-bit Characters |
|
Go . Doc |
Easy |
46% |
718 |
Maximum Length of Repeated Subarray |
|
Go . Doc |
Medium |
51% |
719 |
Find K-th Smallest Pair Distance |
|
Go . Doc |
Hard |
33% |
720 |
Longest Word in Dictionary |
|
Go . Doc |
Medium |
49% |
721 |
Accounts Merge |
|
Go . Doc |
Medium |
53% |
722 |
Remove Comments |
|
Go . Doc |
Medium |
36% |
723 |
Candy Crush |
|
Go . Doc |
Medium |
73% |
724 |
Find Pivot Index |
|
Go . Doc |
Easy |
47% |
725 |
Split Linked List in Parts |
|
Go . Doc |
Medium |
53% |
726 |
Number of Atoms |
|
Go . Doc |
Hard |
51% |
727 |
Minimum Window Subsequence |
|
Go . Doc |
Hard |
42% |
728 |
Self Dividing Numbers |
|
Go . Doc |
Easy |
76% |
729 |
My Calendar I |
|
Go . Doc |
Medium |
54% |
730 |
Count Different Palindromic Subsequences |
|
Go . Doc |
Hard |
43% |
731 |
My Calendar II |
|
Go . Doc |
Medium |
51% |
732 |
My Calendar III |
|
Go . Doc |
Hard |
63% |
733 |
Flood Fill |
|
Go . Doc |
Easy |
56% |
734 |
Sentence Similarity |
|
Go . Doc |
Easy |
42% |
735 |
Asteroid Collision |
|
Go . Doc |
Medium |
43% |
736 |
Parse Lisp Expression |
|
Go . Doc |
Hard |
50% |
737 |
Sentence Similarity II |
|
Go . Doc |
Medium |
46% |
738 |
Monotone Increasing Digits |
|
Go . Doc |
Medium |
45% |
739 |
Daily Temperatures |
|
Go . Doc |
Medium |
65% |
740 |
Delete and Earn |
|
Go . Doc |
Medium |
51% |
741 |
Cherry Pickup |
|
Go . Doc |
Hard |
35% |
742 |
Closest Leaf in a Binary Tree |
|
Go . Doc |
Medium |
44% |
743 |
Network Delay Time |
|
Go . Doc |
Medium |
46% |
744 |
Find Smallest Letter Greater Than Target |
|
Go . Doc |
Easy |
45% |
745 |
Prefix and Suffix Search |
|
Go . Doc |
Hard |
35% |
746 |
Min Cost Climbing Stairs |
|
Go . Doc |
Easy |
53% |
747 |
Largest Number At Least Twice of Others |
|
Go . Doc |
Easy |
43% |
748 |
Shortest Completing Word |
|
Go . Doc |
Easy |
57% |
749 |
Contain Virus |
|
Go . Doc |
Hard |
49% |
750 |
Number Of Corner Rectangles |
|
Go . Doc |
Medium |
67% |
751 |
IP to CIDR |
|
Go . Doc |
Medium |
57% |
752 |
Open the Lock |
|
Go . Doc |
Medium |
54% |
753 |
Cracking the Safe |
|
Go . Doc |
Hard |
52% |
754 |
Reach a Number |
|
Go . Doc |
Medium |
40% |
755 |
Pour Water |
|
Go . Doc |
Medium |
44% |
756 |
Pyramid Transition Matrix |
|
Go . Doc |
Medium |
55% |
757 |
Set Intersection Size At Least Two |
|
Go . Doc |
Hard |
42% |
758 |
Bold Words in String |
|
Go . Doc |
Medium |
48% |
759 |
Employee Free Time |
|
Go . Doc |
Hard |
69% |
760 |
Find Anagram Mappings |
|
Go . Doc |
Easy |
82% |
761 |
Special Binary String |
|
Go . Doc |
Hard |
59% |
762 |
Prime Number of Set Bits in Binary Representation |
|
Go . Doc |
Easy |
65% |
763 |
Partition Labels |
|
Go . Doc |
Medium |
78% |
764 |
Largest Plus Sign |
|
Go . Doc |
Medium |
47% |
765 |
Couples Holding Hands |
|
Go . Doc |
Hard |
55% |
766 |
Toeplitz Matrix |
|
Go . Doc |
Easy |
66% |
767 |
Reorganize String |
|
Go . Doc |
Medium |
50% |
768 |
Max Chunks To Make Sorted II |
|
Go . Doc |
Hard |
50% |
769 |
Max Chunks To Make Sorted |
|
Go . Doc |
Medium |
56% |
770 |
Basic Calculator IV |
|
Go . Doc |
Hard |
54% |
771 |
Jewels and Stones |
|
Go . Doc |
Easy |
87% |
772 |
Basic Calculator III |
|
Go . Doc |
Hard |
45% |
773 |
Sliding Puzzle |
|
Go . Doc |
Hard |
61% |
774 |
Minimize Max Distance to Gas Station |
|
Go . Doc |
Hard |
49% |
775 |
Global and Local Inversions |
|
Go . Doc |
Medium |
45% |
776 |
Split BST |
|
Go . Doc |
Medium |
57% |
777 |
Swap Adjacent in LR String |
|
Go . Doc |
Medium |
35% |
778 |
Swim in Rising Water |
|
Go . Doc |
Hard |
57% |
779 |
K-th Symbol in Grammar |
|
Go . Doc |
Medium |
39% |
780 |
Reaching Points |
|
Go . Doc |
Hard |
30% |
781 |
Rabbits in Forest |
|
Go . Doc |
Medium |
56% |
782 |
Transform to Chessboard |
|
Go . Doc |
Hard |
47% |
783 |
Minimum Distance Between BST Nodes |
|
Go . Doc |
Easy |
54% |
784 |
Letter Case Permutation |
|
Go . Doc |
Medium |
69% |
785 |
Is Graph Bipartite? |
|
Go . Doc |
Medium |
49% |
786 |
K-th Smallest Prime Fraction |
|
Go . Doc |
Hard |
45% |
787 |
Cheapest Flights Within K Stops |
|
Go . Doc |
Medium |
38% |
788 |
Rotated Digits |
|
Go . Doc |
Easy |
57% |
789 |
Escape The Ghosts |
|
Go . Doc |
Medium |
58% |
790 |
Domino and Tromino Tiling |
|
Go . Doc |
Medium |
40% |
791 |
Custom Sort String |
|
Go . Doc |
Medium |
66% |
792 |
Number of Matching Subsequences |
|
Go . Doc |
Medium |
48% |
793 |
Preimage Size of Factorial Zeroes Function |
|
Go . Doc |
Hard |
40% |
794 |
Valid Tic-Tac-Toe State |
|
Go . Doc |
Medium |
34% |
795 |
Number of Subarrays with Bounded Maximum |
|
Go . Doc |
Medium |
51% |
796 |
Rotate String |
|
Go . Doc |
Easy |
48% |
797 |
All Paths From Source to Target |
|
Go . Doc |
Medium |
78% |
798 |
Smallest Rotation with Highest Score |
|
Go . Doc |
Hard |
46% |
799 |
Champagne Tower |
|
Go . Doc |
Medium |
44% |
800 |
Similar RGB Color |
|
Go . Doc |
Easy |
62% |
801 |
Minimum Swaps To Make Sequences Increasing |
|
Go . Doc |
Hard |
38% |
802 |
Find Eventual Safe States |
|
Go . Doc |
Medium |
50% |
803 |
Bricks Falling When Hit |
|
Go . Doc |
Hard |
32% |
804 |
Unique Morse Code Words |
|
Go . Doc |
Easy |
79% |
805 |
Split Array With Same Average |
|
Go . Doc |
Hard |
26% |
806 |
Number of Lines To Write String |
|
Go . Doc |
Easy |
65% |
807 |
Max Increase to Keep City Skyline |
|
Go . Doc |
Medium |
84% |
808 |
Soup Servings |
|
Go . Doc |
Medium |
41% |
809 |
Expressive Words |
|
Go . Doc |
Medium |
46% |
810 |
Chalkboard XOR Game |
|
Go . Doc |
Hard |
51% |
811 |
Subdomain Visit Count |
|
Go . Doc |
Easy |
72% |
812 |
Largest Triangle Area |
|
Go . Doc |
Easy |
59% |
813 |
Largest Sum of Averages |
|
Go . Doc |
Medium |
51% |
814 |
Binary Tree Pruning |
|
Go . Doc |
Medium |
71% |
815 |
Bus Routes |
|
Go . Doc |
Hard |
44% |
816 |
Ambiguous Coordinates |
|
Go . Doc |
Medium |
55% |
817 |
Linked List Components |
|
Go . Doc |
Medium |
57% |
818 |
Race Car |
|
Go . Doc |
Hard |
40% |
819 |
Most Common Word |
|
Go . Doc |
Easy |
45% |
820 |
Short Encoding of Words |
|
Go . Doc |
Medium |
54% |
821 |
Shortest Distance to a Character |
|
Go . Doc |
Easy |
70% |
822 |
Card Flipping Game |
|
Go . Doc |
Medium |
43% |
823 |
Binary Trees With Factors |
|
Go . Doc |
Medium |
43% |
824 |
Goat Latin |
|
Go . Doc |
Easy |
67% |
825 |
Friends Of Appropriate Ages |
|
Go . Doc |
Medium |
44% |
826 |
Most Profit Assigning Work |
|
Go . Doc |
Medium |
39% |
827 |
Making A Large Island |
|
Go . Doc |
Hard |
46% |
828 |
Count Unique Characters of All Substrings of a Given String |
|
Go . Doc |
Hard |
46% |
829 |
Consecutive Numbers Sum |
|
Go . Doc |
Hard |
39% |
830 |
Positions of Large Groups |
|
Go . Doc |
Easy |
50% |
831 |
Masking Personal Information |
|
Go . Doc |
Medium |
44% |
832 |
Flipping an Image |
|
Go . Doc |
Easy |
78% |
833 |
Find And Replace in String |
|
Go . Doc |
Medium |
51% |
834 |
Sum of Distances in Tree |
|
Go . Doc |
Hard |
47% |
835 |
Image Overlap |
|
Go . Doc |
Medium |
61% |
836 |
Rectangle Overlap |
|
Go . Doc |
Easy |
42% |
837 |
New 21 Game |
|
Go . Doc |
Medium |
35% |
838 |
Push Dominoes |
|
Go . Doc |
Medium |
50% |
839 |
Similar String Groups |
|
Go . Doc |
Hard |
42% |
840 |
Magic Squares In Grid |
|
Go . Doc |
Medium |
38% |
841 |
Keys and Rooms |
|
Go . Doc |
Medium |
67% |
842 |
Split Array into Fibonacci Sequence |
|
Go . Doc |
Medium |
37% |
843 |
Guess the Word |
|
Go . Doc |
Hard |
45% |
844 |
Backspace String Compare |
|
Go . Doc |
Easy |
47% |
845 |
Longest Mountain in Array |
|
Go . Doc |
Medium |
38% |
846 |
Hand of Straights |
|
Go . Doc |
Medium |
55% |
847 |
Shortest Path Visiting All Nodes |
|
Go . Doc |
Hard |
54% |
848 |
Shifting Letters |
|
Go . Doc |
Medium |
45% |
849 |
Maximize Distance to Closest Person |
|
Go . Doc |
Medium |
44% |
850 |
Rectangle Area II |
|
Go . Doc |
Hard |
48% |
851 |
Loud and Rich |
|
Go . Doc |
Medium |
53% |
852 |
Peak Index in a Mountain Array |
|
Go . Doc |
Easy |
71% |
853 |
Car Fleet |
|
Go . Doc |
Medium |
44% |
854 |
K-Similar Strings |
|
Go . Doc |
Hard |
38% |
855 |
Exam Room |
|
Go . Doc |
Medium |
43% |
856 |
Score of Parentheses |
|
Go . Doc |
Medium |
65% |
857 |
Minimum Cost to Hire K Workers |
|
Go . Doc |
Hard |
50% |
858 |
Mirror Reflection |
|
Go . Doc |
Medium |
59% |
859 |
Buddy Strings |
|
Go . Doc |
Easy |
28% |
860 |
Lemonade Change |
|
Go . Doc |
Easy |
51% |
861 |
Score After Flipping Matrix |
|
Go . Doc |
Medium |
74% |
862 |
Shortest Subarray with Sum at Least K |
|
Go . Doc |
Hard |
25% |
863 |
All Nodes Distance K in Binary Tree |
|
Go . Doc |
Medium |
58% |
864 |
Shortest Path to Get All Keys |
|
Go . Doc |
Hard |
43% |
865 |
Smallest Subtree with all the Deepest Nodes |
|
Go . Doc |
Medium |
65% |
866 |
Prime Palindrome |
|
Go . Doc |
Medium |
25% |
867 |
Transpose Matrix |
|
Go . Doc |
Easy |
61% |
868 |
Binary Gap |
|
Go . Doc |
Easy |
61% |
869 |
Reordered Power of 2 |
|
Go . Doc |
Medium |
61% |
870 |
Advantage Shuffle |
|
Go . Doc |
Medium |
50% |
871 |
Minimum Number of Refueling Stops |
|
Go . Doc |
Hard |
34% |
872 |
Leaf-Similar Trees |
|
Go . Doc |
Easy |
64% |
873 |
Length of Longest Fibonacci Subsequence |
|
Go . Doc |
Medium |
48% |
874 |
Walking Robot Simulation |
|
Go . Doc |
Easy |
36% |
875 |
Koko Eating Bananas |
|
Go . Doc |
Medium |
53% |
876 |
Middle of the Linked List |
|
Go . Doc |
Easy |
69% |
877 |
Stone Game |
|
Go . Doc |
Medium |
67% |
878 |
Nth Magical Number |
|
Go . Doc |
Hard |
29% |
879 |
Profitable Schemes |
|
Go . Doc |
Hard |
40% |
880 |
Decoded String at Index |
|
Go . Doc |
Medium |
28% |
881 |
Boats to Save People |
|
Go . Doc |
Medium |
49% |
882 |
Reachable Nodes In Subdivided Graph |
|
Go . Doc |
Hard |
43% |
883 |
Projection Area of 3D Shapes |
|
Go . Doc |
Easy |
68% |
884 |
Uncommon Words from Two Sentences |
|
Go . Doc |
Easy |
64% |
885 |
Spiral Matrix III |
|
Go . Doc |
Medium |
71% |
886 |
Possible Bipartition |
|
Go . Doc |
Medium |
45% |
887 |
Super Egg Drop |
|
Go . Doc |
Hard |
26% |
888 |
Fair Candy Swap |
|
Go . Doc |
Easy |
59% |
889 |
Construct Binary Tree from Preorder and Postorder Traversal |
|
Go . Doc |
Medium |
68% |
890 |
Find and Replace Pattern |
|
Go . Doc |
Medium |
75% |
891 |
Sum of Subsequence Widths |
|
Go . Doc |
Hard |
33% |
892 |
Surface Area of 3D Shapes |
|
Go . Doc |
Easy |
60% |
893 |
Groups of Special-Equivalent Strings |
|
Go . Doc |
Easy |
69% |
894 |
All Possible Full Binary Trees |
|
Go . Doc |
Medium |
78% |
895 |
Maximum Frequency Stack |
|
Go . Doc |
Hard |
63% |
896 |
Monotonic Array |
|
Go . Doc |
Easy |
57% |
897 |
Increasing Order Search Tree |
|
Go . Doc |
Easy |
75% |
898 |
Bitwise ORs of Subarrays |
|
Go . Doc |
Medium |
35% |
899 |
Orderly Queue |
|
Go . Doc |
Hard |
53% |
900 |
RLE Iterator |
|
Go . Doc |
Medium |
56% |
901 |
Online Stock Span |
|
Go . Doc |
Medium |
61% |
902 |
Numbers At Most N Given Digit Set |
|
Go . Doc |
Hard |
36% |
903 |
Valid Permutations for DI Sequence |
|
Go . Doc |
Hard |
55% |
904 |
Fruit Into Baskets |
|
Go . Doc |
Medium |
43% |
905 |
Sort Array By Parity |
|
Go . Doc |
Easy |
75% |
906 |
Super Palindromes |
|
Go . Doc |
Hard |
38% |
907 |
Sum of Subarray Minimums |
|
Go . Doc |
Medium |
32% |
908 |
Smallest Range I |
|
Go . Doc |
Easy |
66% |
909 |
Snakes and Ladders |
|
Go . Doc |
Medium |
39% |
910 |
Smallest Range II |
|
Go . Doc |
Medium |
31% |
911 |
Online Election |
|
Go . Doc |
Medium |
51% |
912 |
Sort an Array |
|
Go . Doc |
Medium |
63% |
913 |
Cat and Mouse |
|
Go . Doc |
Hard |
35% |
914 |
X of a Kind in a Deck of Cards |
|
Go . Doc |
Easy |
33% |
915 |
Partition Array into Disjoint Intervals |
|
Go . Doc |
Medium |
47% |
916 |
Word Subsets |
|
Go . Doc |
Medium |
52% |
917 |
Reverse Only Letters |
|
Go . Doc |
Easy |
59% |
918 |
Maximum Sum Circular Subarray |
|
Go . Doc |
Medium |
34% |
919 |
Complete Binary Tree Inserter |
|
Go . Doc |
Medium |
59% |
920 |
Number of Music Playlists |
|
Go . Doc |
Hard |
48% |
921 |
Minimum Add to Make Parentheses Valid |
|
Go . Doc |
Medium |
75% |
922 |
Sort Array By Parity II |
|
Go . Doc |
Easy |
70% |
923 |
3Sum With Multiplicity |
|
Go . Doc |
Medium |
40% |
924 |
Minimize Malware Spread |
|
Go . Doc |
Hard |
41% |
925 |
Long Pressed Name |
|
Go . Doc |
Easy |
36% |
926 |
Flip String to Monotone Increasing |
|
Go . Doc |
Medium |
53% |
927 |
Three Equal Parts |
|
Go . Doc |
Hard |
34% |
928 |
Minimize Malware Spread II |
|
Go . Doc |
Hard |
41% |
929 |
Unique Email Addresses |
|
Go . Doc |
Easy |
67% |
930 |
Binary Subarrays With Sum |
|
Go . Doc |
Medium |
45% |
931 |
Minimum Falling Path Sum |
|
Go . Doc |
Medium |
64% |
932 |
Beautiful Array |
|
Go . Doc |
Medium |
61% |
933 |
Number of Recent Calls |
|
Go . Doc |
Easy |
72% |
934 |
Shortest Bridge |
|
Go . Doc |
Medium |
50% |
935 |
Knight Dialer |
|
Go . Doc |
Medium |
47% |
936 |
Stamping The Sequence |
|
Go . Doc |
Hard |
53% |
937 |
Reorder Data in Log Files |
|
Go . Doc |
Easy |
55% |
938 |
Range Sum of BST |
|
Go . Doc |
Easy |
83% |
939 |
Minimum Area Rectangle |
|
Go . Doc |
Medium |
52% |
940 |
Distinct Subsequences II |
|
Go . Doc |
Hard |
41% |
941 |
Valid Mountain Array |
|
Go . Doc |
Easy |
32% |
942 |
DI String Match |
|
Go . Doc |
Easy |
74% |
943 |
Find the Shortest Superstring |
|
Go . Doc |
Hard |
45% |
944 |
Delete Columns to Make Sorted |
|
Go . Doc |
Easy |
70% |
945 |
Minimum Increment to Make Array Unique |
|
Go . Doc |
Medium |
47% |
946 |
Validate Stack Sequences |
|
Go . Doc |
Medium |
64% |
947 |
Most Stones Removed with Same Row or Column |
|
Go . Doc |
Medium |
56% |
948 |
Bag of Tokens |
|
Go . Doc |
Medium |
46% |
949 |
Largest Time for Given Digits |
|
Go . Doc |
Medium |
35% |
950 |
Reveal Cards In Increasing Order |
|
Go . Doc |
Medium |
75% |
951 |
Flip Equivalent Binary Trees |
|
Go . Doc |
Medium |
66% |
952 |
Largest Component Size by Common Factor |
|
Go . Doc |
Hard |
36% |
953 |
Verifying an Alien Dictionary |
|
Go . Doc |
Easy |
52% |
954 |
Array of Doubled Pairs |
|
Go . Doc |
Medium |
34% |
955 |
Delete Columns to Make Sorted II |
|
Go . Doc |
Medium |
34% |
956 |
Tallest Billboard |
|
Go . Doc |
Hard |
39% |
957 |
Prison Cells After N Days |
|
Go . Doc |
Medium |
40% |
958 |
Check Completeness of a Binary Tree |
|
Go . Doc |
Medium |
52% |
959 |
Regions Cut By Slashes |
|
Go . Doc |
Medium |
67% |
960 |
Delete Columns to Make Sorted III |
|
Go . Doc |
Hard |
55% |
961 |
N-Repeated Element in Size 2N Array |
|
Go . Doc |
Easy |
74% |
962 |
Maximum Width Ramp |
|
Go . Doc |
Medium |
46% |
963 |
Minimum Area Rectangle II |
|
Go . Doc |
Medium |
53% |
964 |
Least Operators to Express Number |
|
Go . Doc |
Hard |
45% |
965 |
Univalued Binary Tree |
|
Go . Doc |
Easy |
68% |
966 |
Vowel Spellchecker |
|
Go . Doc |
Medium |
51% |
967 |
Numbers With Same Consecutive Differences |
|
Go . Doc |
Medium |
45% |
968 |
Binary Tree Cameras |
|
Go . Doc |
Hard |
40% |
969 |
Pancake Sorting |
|
Go . Doc |
Medium |
69% |
970 |
Powerful Integers |
|
Go . Doc |
Medium |
43% |
971 |
Flip Binary Tree To Match Preorder Traversal |
|
Go . Doc |
Medium |
49% |
972 |
Equal Rational Numbers |
|
Go . Doc |
Hard |
42% |
973 |
K Closest Points to Origin |
|
Go . Doc |
Medium |
65% |
974 |
Subarray Sums Divisible by K |
|
Go . Doc |
Medium |
51% |
975 |
Odd Even Jump |
|
Go . Doc |
Hard |
41% |
976 |
Largest Perimeter Triangle |
|
Go . Doc |
Easy |
59% |
977 |
Squares of a Sorted Array |
|
Go . Doc |
Easy |
71% |
978 |
Longest Turbulent Subarray |
|
Go . Doc |
Medium |
46% |
979 |
Distribute Coins in Binary Tree |
|
Go . Doc |
Medium |
70% |
980 |
Unique Paths III |
|
Go . Doc |
Hard |
77% |
981 |
Time Based Key-Value Store |
|
Go . Doc |
Medium |
54% |
982 |
Triples with Bitwise AND Equal To Zero |
|
Go . Doc |
Hard |
56% |
983 |
Minimum Cost For Tickets |
|
Go . Doc |
Medium |
63% |
984 |
String Without AAA or BBB |
|
Go . Doc |
Medium |
39% |
985 |
Sum of Even Numbers After Queries |
|
Go . Doc |
Easy |
60% |
986 |
Interval List Intersections |
|
Go . Doc |
Medium |
68% |
987 |
Vertical Order Traversal of a Binary Tree |
|
Go . Doc |
Hard |
39% |
988 |
Smallest String Starting From Leaf |
|
Go . Doc |
Medium |
47% |
989 |
Add to Array-Form of Integer |
|
Go . Doc |
Easy |
45% |
990 |
Satisfiability of Equality Equations |
|
Go . Doc |
Medium |
47% |
991 |
Broken Calculator |
|
Go . Doc |
Medium |
49% |
992 |
Subarrays with K Different Integers |
|
Go . Doc |
Hard |
51% |
993 |
Cousins in Binary Tree |
|
Go . Doc |
Easy |
52% |
994 |
Rotting Oranges |
|
Go . Doc |
Medium |
49% |
995 |
Minimum Number of K Consecutive Bit Flips |
|
Go . Doc |
Hard |
50% |
996 |
Number of Squareful Arrays |
|
Go . Doc |
Hard |
48% |
997 |
Find the Town Judge |
|
Go . Doc |
Easy |
49% |
998 |
Maximum Binary Tree II |
|
Go . Doc |
Medium |
64% |
999 |
Available Captures for Rook |
|
Go . Doc |
Easy |
67% |
1000 |
Minimum Cost to Merge Stones |
|
Go . Doc |
Hard |
41% |
1001 |
Grid Illumination |
|
Go . Doc |
Hard |
35% |
1002 |
Find Common Characters |
|
Go . Doc |
Easy |
68% |
1003 |
Check If Word Is Valid After Substitutions |
|
Go . Doc |
Medium |
57% |
1004 |
Max Consecutive Ones III |
|
Go . Doc |
Medium |
60% |
1005 |
Maximize Sum Of Array After K Negations |
|
Go . Doc |
Easy |
52% |
1006 |
Clumsy Factorial |
|
Go . Doc |
Medium |
54% |
1007 |
Minimum Domino Rotations For Equal Row |
|
Go . Doc |
Medium |
50% |
1008 |
Construct Binary Search Tree from Preorder Traversal |
|
Go . Doc |
Medium |
78% |
1009 |
Complement of Base 10 Integer |
|
Go . Doc |
Easy |
61% |
1010 |
Pairs of Songs With Total Durations Divisible by 60 |
|
Go . Doc |
Medium |
51% |
1011 |
Capacity To Ship Packages Within D Days |
|
Go . Doc |
Medium |
60% |
1012 |
Numbers With Repeated Digits |
|
Go . Doc |
Hard |
37% |
1013 |
Partition Array Into Three Parts With Equal Sum |
|
Go . Doc |
Easy |
46% |
1014 |
Best Sightseeing Pair |
|
Go . Doc |
Medium |
53% |
1015 |
Smallest Integer Divisible by K |
|
Go . Doc |
Medium |
42% |
1016 |
Binary String With Substrings Representing 1 To N |
|
Go . Doc |
Medium |
58% |
1017 |
Convert to Base -2 |
|
Go . Doc |
Medium |
59% |
1018 |
Binary Prefix Divisible By 5 |
|
Go . Doc |
Easy |
47% |
1019 |
Next Greater Node In Linked List |
|
Go . Doc |
Medium |
58% |
1020 |
Number of Enclaves |
|
Go . Doc |
Medium |
59% |
1021 |
Remove Outermost Parentheses |
|
Go . Doc |
Easy |
79% |
1022 |
Sum of Root To Leaf Binary Numbers |
|
Go . Doc |
Easy |
71% |
1023 |
Camelcase Matching |
|
Go . Doc |
Medium |
57% |
1024 |
Video Stitching |
|
Go . Doc |
Medium |
49% |
1025 |
Divisor Game |
|
Go . Doc |
Easy |
66% |
1026 |
Maximum Difference Between Node and Ancestor |
|
Go . Doc |
Medium |
70% |
1027 |
Longest Arithmetic Subsequence |
|
Go . Doc |
Medium |
49% |
1028 |
Recover a Tree From Preorder Traversal |
|
Go . Doc |
Hard |
71% |
1029 |
Two City Scheduling |
|
Go . Doc |
Medium |
58% |
1030 |
Matrix Cells in Distance Order |
|
Go . Doc |
Easy |
68% |
1031 |
Maximum Sum of Two Non-Overlapping Subarrays |
|
Go . Doc |
Medium |
59% |
1032 |
Stream of Characters |
|
Go . Doc |
Hard |
48% |
1033 |
Moving Stones Until Consecutive |
|
Go . Doc |
Easy |
43% |
1034 |
Coloring A Border |
|
Go . Doc |
Medium |
46% |
1035 |
Uncrossed Lines |
|
Go . Doc |
Medium |
56% |
1036 |
Escape a Large Maze |
|
Go . Doc |
Hard |
34% |
1037 |
Valid Boomerang |
|
Go . Doc |
Easy |
37% |
1038 |
Binary Search Tree to Greater Sum Tree |
|
Go . Doc |
Medium |
83% |
1039 |
Minimum Score Triangulation of Polygon |
|
Go . Doc |
Medium |
51% |
1040 |
Moving Stones Until Consecutive II |
|
Go . Doc |
Medium |
54% |
1041 |
Robot Bounded In Circle |
|
Go . Doc |
Medium |
54% |
1042 |
Flower Planting With No Adjacent |
|
Go . Doc |
Medium |
49% |
1043 |
Partition Array for Maximum Sum |
|
Go . Doc |
Medium |
68% |
1044 |
Longest Duplicate Substring |
|
Go . Doc |
Hard |
30% |
1046 |
Last Stone Weight |
|
Go . Doc |
Easy |
62% |
1047 |
Remove All Adjacent Duplicates In String |
|
Go . Doc |
Easy |
71% |
1048 |
Longest String Chain |
|
Go . Doc |
Medium |
56% |
1049 |
Last Stone Weight II |
|
Go . Doc |
Medium |
47% |
1051 |
Height Checker |
|
Go . Doc |
Easy |
73% |
1052 |
Grumpy Bookstore Owner |
|
Go . Doc |
Medium |
56% |
1053 |
Previous Permutation With One Swap |
|
Go . Doc |
Medium |
51% |
1054 |
Distant Barcodes |
|
Go . Doc |
Medium |
44% |
1055 |
Shortest Way to Form String |
|
Go . Doc |
Medium |
57% |
1056 |
Confusing Number |
|
Go . Doc |
Easy |
46% |
1057 |
Campus Bikes |
|
Go . Doc |
Medium |
58% |
1058 |
Minimize Rounding Error to Meet Target |
|
Go . Doc |
Medium |
43% |
1059 |
All Paths from Source Lead to Destination |
|
Go . Doc |
Medium |
43% |
1060 |
Missing Element in Sorted Array |
|
Go . Doc |
Medium |
55% |
1061 |
Lexicographically Smallest Equivalent String |
|
Go . Doc |
Medium |
66% |
1062 |
Longest Repeating Substring |
|
Go . Doc |
Medium |
58% |
1063 |
Number of Valid Subarrays |
|
Go . Doc |
Hard |
72% |
1064 |
Fixed Point |
|
Go . Doc |
Easy |
64% |
1065 |
Index Pairs of a String |
|
Go . Doc |
Easy |
61% |
1066 |
Campus Bikes II |
|
Go . Doc |
Medium |
54% |
1067 |
Digit Count in Range |
|
Go . Doc |
Hard |
41% |
1071 |
Greatest Common Divisor of Strings |
|
Go . Doc |
Easy |
51% |
1072 |
Flip Columns For Maximum Number of Equal Rows |
|
Go . Doc |
Medium |
62% |
1073 |
Adding Two Negabinary Numbers |
|
Go . Doc |
Medium |
34% |
1074 |
Number of Submatrices That Sum to Target |
|
Go . Doc |
Hard |
65% |
1078 |
Occurrences After Bigram |
|
Go . Doc |
Easy |
64% |
1079 |
Letter Tile Possibilities |
|
Go . Doc |
Medium |
76% |
1080 |
Insufficient Nodes in Root to Leaf Paths |
|
Go . Doc |
Medium |
50% |
1081 |
Smallest Subsequence of Distinct Characters |
|
Go . Doc |
Medium |
53% |
1085 |
Sum of Digits in the Minimum Number |
|
Go . Doc |
Easy |
75% |
1086 |
High Five |
|
Go . Doc |
Easy |
76% |
1087 |
Brace Expansion |
|
Go . Doc |
Medium |
63% |
1088 |
Confusing Number II |
|
Go . Doc |
Hard |
46% |
1089 |
Duplicate Zeros |
|
Go . Doc |
Easy |
51% |
1090 |
Largest Values From Labels |
|
Go . Doc |
Medium |
60% |
1091 |
Shortest Path in Binary Matrix |
|
Go . Doc |
Medium |
40% |
1092 |
Shortest Common Supersequence |
|
Go . Doc |
Hard |
54% |
1093 |
Statistics from a Large Sample |
|
Go . Doc |
Medium |
47% |
1094 |
Car Pooling |
|
Go . Doc |
Medium |
59% |
1095 |
Find in Mountain Array |
|
Go . Doc |
Hard |
36% |
1096 |
Brace Expansion II |
|
Go . Doc |
Hard |
63% |
1099 |
Two Sum Less Than K |
|
Go . Doc |
Easy |
60% |
1100 |
Find K-Length Substrings With No Repeated Characters |
|
Go . Doc |
Medium |
73% |
1101 |
The Earliest Moment When Everyone Become Friends |
|
Go . Doc |
Medium |
67% |
1102 |
Path With Maximum Minimum Value |
|
Go . Doc |
Medium |
51% |
1103 |
Distribute Candies to People |
|
Go . Doc |
Easy |
63% |
1104 |
Path In Zigzag Labelled Binary Tree |
|
Go . Doc |
Medium |
73% |
1105 |
Filling Bookcase Shelves |
|
Go . Doc |
Medium |
57% |
1106 |
Parsing A Boolean Expression |
|
Go . Doc |
Hard |
59% |
1108 |
Defanging an IP Address |
|
Go . Doc |
Easy |
88% |
1109 |
Corporate Flight Bookings |
|
Go . Doc |
Medium |
54% |
1110 |
Delete Nodes And Return Forest |
|
Go . Doc |
Medium |
68% |
1111 |
Maximum Nesting Depth of Two Valid Parentheses Strings |
|
Go . Doc |
Medium |
72% |
1118 |
Number of Days in a Month |
|
Go . Doc |
Easy |
57% |
1119 |
Remove Vowels from a String |
|
Go . Doc |
Easy |
90% |
1120 |
Maximum Average Subtree |
|
Go . Doc |
Medium |
64% |
1121 |
Divide Array Into Increasing Sequences |
|
Go . Doc |
Hard |
58% |
1122 |
Relative Sort Array |
|
Go . Doc |
Easy |
67% |
1123 |
Lowest Common Ancestor of Deepest Leaves |
|
Go . Doc |
Medium |
68% |
1124 |
Longest Well-Performing Interval |
|
Go . Doc |
Medium |
33% |
1125 |
Smallest Sufficient Team |
|
Go . Doc |
Hard |
47% |
1128 |
Number of Equivalent Domino Pairs |
|
Go . Doc |
Easy |
45% |
1129 |
Shortest Path with Alternating Colors |
|
Go . Doc |
Medium |
40% |
1130 |
Minimum Cost Tree From Leaf Values |
|
Go . Doc |
Medium |
67% |
1131 |
Maximum of Absolute Value Expression |
|
Go . Doc |
Medium |
51% |
1133 |
Largest Unique Number |
|
Go . Doc |
Easy |
67% |
1134 |
Armstrong Number |
|
Go . Doc |
Easy |
78% |
1135 |
Connecting Cities With Minimum Cost |
|
Go . Doc |
Medium |
60% |
1136 |
Parallel Courses |
|
Go . Doc |
Medium |
60% |
1137 |
N-th Tribonacci Number |
|
Go . Doc |
Easy |
55% |
1138 |
Alphabet Board Path |
|
Go . Doc |
Medium |
51% |
1139 |
Largest 1-Bordered Square |
|
Go . Doc |
Medium |
48% |
1140 |
Stone Game II |
|
Go . Doc |
Medium |
64% |
1143 |
Longest Common Subsequence |
|
Go . Doc |
Medium |
58% |
1144 |
Decrease Elements To Make Array Zigzag |
|
Go . Doc |
Medium |
46% |
1145 |
Binary Tree Coloring Game |
|
Go . Doc |
Medium |
51% |
1146 |
Snapshot Array |
|
Go . Doc |
Medium |
37% |
1147 |
Longest Chunked Palindrome Decomposition |
|
Go . Doc |
Hard |
59% |
1150 |
Check If a Number Is Majority Element in a Sorted Array |
|
Go . Doc |
Easy |
57% |
1151 |
Minimum Swaps to Group All 1's Together |
|
Go . Doc |
Medium |
59% |
1152 |
Analyze User Website Visit Pattern |
|
Go . Doc |
Medium |
43% |
1153 |
String Transforms Into Another String |
|
Go . Doc |
Hard |
35% |
1154 |
Day of the Year |
|
Go . Doc |
Easy |
49% |
1155 |
Number of Dice Rolls With Target Sum |
|
Go . Doc |
Medium |
47% |
1156 |
Swap For Longest Repeated Character Substring |
|
Go . Doc |
Medium |
47% |
1157 |
Online Majority Element In Subarray |
|
Go . Doc |
Hard |
41% |
1160 |
Find Words That Can Be Formed by Characters |
|
Go . Doc |
Easy |
67% |
1161 |
Maximum Level Sum of a Binary Tree |
|
Go . Doc |
Medium |
67% |
1162 |
As Far from Land as Possible |
|
Go . Doc |
Medium |
46% |
1163 |
Last Substring in Lexicographical Order |
|
Go . Doc |
Hard |
36% |
1165 |
Single-Row Keyboard |
|
Go . Doc |
Easy |
85% |
1166 |
Design File System |
|
Go . Doc |
Medium |
58% |
1167 |
Minimum Cost to Connect Sticks |
|
Go . Doc |
Medium |
65% |
1168 |
Optimize Water Distribution in a Village |
|
Go . Doc |
Hard |
61% |
1169 |
Invalid Transactions |
|
Go . Doc |
Medium |
30% |
1170 |
Compare Strings by Frequency of the Smallest Character |
|
Go . Doc |
Medium |
60% |
1171 |
Remove Zero Sum Consecutive Nodes from Linked List |
|
Go . Doc |
Medium |
41% |
1172 |
Dinner Plate Stacks |
|
Go . Doc |
Hard |
36% |
1175 |
Prime Arrangements |
|
Go . Doc |
Easy |
51% |
1176 |
Diet Plan Performance |
|
Go . Doc |
Easy |
53% |
1177 |
Can Make Palindrome from Substring |
|
Go . Doc |
Medium |
36% |
1178 |
Number of Valid Words for Each Puzzle |
|
Go . Doc |
Hard |
40% |
1180 |
Count Substrings with Only One Distinct Letter |
|
Go . Doc |
Easy |
78% |
1181 |
Before and After Puzzle |
|
Go . Doc |
Medium |
44% |
1182 |
Shortest Distance to Target Color |
|
Go . Doc |
Medium |
54% |
1183 |
Maximum Number of Ones |
|
Go . Doc |
Hard |
58% |
1184 |
Distance Between Bus Stops |
|
Go . Doc |
Easy |
53% |
1185 |
Day of the Week |
|
Go . Doc |
Easy |
60% |
1186 |
Maximum Subarray Sum with One Deletion |
|
Go . Doc |
Medium |
39% |
1187 |
Make Array Strictly Increasing |
|
Go . Doc |
Hard |
43% |
1189 |
Maximum Number of Balloons |
|
Go . Doc |
Easy |
62% |
1190 |
Reverse Substrings Between Each Pair of Parentheses |
|
Go . Doc |
Medium |
64% |
1191 |
K-Concatenation Maximum Sum |
|
Go . Doc |
Medium |
24% |
1192 |
Critical Connections in a Network |
|
Go . Doc |
Hard |
51% |
1196 |
How Many Apples Can You Put into the Basket |
|
Go . Doc |
Easy |
68% |
1197 |
Minimum Knight Moves |
|
Go . Doc |
Medium |
38% |
1198 |
Find Smallest Common Element in All Rows |
|
Go . Doc |
Medium |
76% |
1199 |
Minimum Time to Build Blocks |
|
Go . Doc |
Hard |
39% |
1200 |
Minimum Absolute Difference |
|
Go . Doc |
Easy |
67% |
1201 |
Ugly Number III |
|
Go . Doc |
Medium |
26% |
1202 |
Smallest String With Swaps |
|
Go . Doc |
Medium |
49% |
1203 |
Sort Items by Groups Respecting Dependencies |
|
Go . Doc |
Hard |
48% |
1206 |
Design Skiplist |
|
Go . Doc |
Hard |
59% |
1207 |
Unique Number of Occurrences |
|
Go . Doc |
Easy |
72% |
1208 |
Get Equal Substrings Within Budget |
|
Go . Doc |
Medium |
44% |
1209 |
Remove All Adjacent Duplicates in String II |
|
Go . Doc |
Medium |
56% |
1210 |
Minimum Moves to Reach Target with Rotations |
|
Go . Doc |
Hard |
47% |
1213 |
Intersection of Three Sorted Arrays |
|
Go . Doc |
Easy |
79% |
1214 |
Two Sum BSTs |
|
Go . Doc |
Medium |
67% |
1215 |
Stepping Numbers |
|
Go . Doc |
Medium |
44% |
1216 |
Valid Palindrome III |
|
Go . Doc |
Hard |
50% |
1217 |
Minimum Cost to Move Chips to The Same Position |
|
Go . Doc |
Easy |
70% |
1218 |
Longest Arithmetic Subsequence of Given Difference |
|
Go . Doc |
Medium |
47% |
1219 |
Path with Maximum Gold |
|
Go . Doc |
Medium |
66% |
1220 |
Count Vowels Permutation |
|
Go . Doc |
Hard |
57% |
1221 |
Split a String in Balanced Strings |
|
Go . Doc |
Easy |
84% |
1222 |
Queens That Can Attack the King |
|
Go . Doc |
Medium |
69% |
1223 |
Dice Roll Simulation |
|
Go . Doc |
Hard |
47% |
1224 |
Maximum Equal Frequency |
|
Go . Doc |
Hard |
35% |
1227 |
Airplane Seat Assignment Probability |
|
Go . Doc |
Medium |
62% |
1228 |
Missing Number In Arithmetic Progression |
|
Go . Doc |
Easy |
51% |
1229 |
Meeting Scheduler |
|
Go . Doc |
Medium |
54% |
1230 |
Toss Strange Coins |
|
Go . Doc |
Medium |
50% |
1231 |
Divide Chocolate |
|
Go . Doc |
Hard |
53% |
1232 |
Check If It Is a Straight Line |
|
Go . Doc |
Easy |
42% |
1233 |
Remove Sub-Folders from the Filesystem |
|
Go . Doc |
Medium |
63% |
1234 |
Replace the Substring for Balanced String |
|
Go . Doc |
Medium |
34% |
1235 |
Maximum Profit in Job Scheduling |
|
Go . Doc |
Hard |
48% |
1236 |
Web Crawler |
|
Go . Doc |
Medium |
64% |
1237 |
Find Positive Integer Solution for a Given Equation |
|
Go . Doc |
Medium |
70% |
1238 |
Circular Permutation in Binary Representation |
|
Go . Doc |
Medium |
67% |
1239 |
Maximum Length of a Concatenated String with Unique Characters |
|
Go . Doc |
Medium |
50% |
1240 |
Tiling a Rectangle with the Fewest Squares |
|
Go . Doc |
Hard |
52% |
1243 |
Array Transformation |
|
Go . Doc |
Easy |
49% |
1244 |
Design A Leaderboard |
|
Go . Doc |
Medium |
66% |
1245 |
Tree Diameter |
|
Go . Doc |
Medium |
61% |
1246 |
Palindrome Removal |
|
Go . Doc |
Hard |
45% |
1247 |
Minimum Swaps to Make Strings Equal |
|
Go . Doc |
Medium |
63% |
1248 |
Count Number of Nice Subarrays |
|
Go . Doc |
Medium |
56% |
1249 |
Minimum Remove to Make Valid Parentheses |
|
Go . Doc |
Medium |
64% |
1250 |
Check If It Is a Good Array |
|
Go . Doc |
Hard |
57% |
1252 |
Cells with Odd Values in a Matrix |
|
Go . Doc |
Easy |
78% |
1253 |
Reconstruct a 2-Row Binary Matrix |
|
Go . Doc |
Medium |
42% |
1254 |
Number of Closed Islands |
|
Go . Doc |
Medium |
62% |
1255 |
Maximum Score Words Formed by Letters |
|
Go . Doc |
Hard |
70% |
1256 |
Encode Number |
|
Go . Doc |
Medium |
68% |
1257 |
Smallest Common Region |
|
Go . Doc |
Medium |
61% |
1258 |
Synonymous Sentences |
|
Go . Doc |
Medium |
59% |
1259 |
Handshakes That Don't Cross |
|
Go . Doc |
Hard |
54% |
1260 |
Shift 2D Grid |
|
Go . Doc |
Easy |
61% |
1261 |
Find Elements in a Contaminated Binary Tree |
|
Go . Doc |
Medium |
75% |
1262 |
Greatest Sum Divisible by Three |
|
Go . Doc |
Medium |
50% |
1263 |
Minimum Moves to Move a Box to Their Target Location |
|
Go . Doc |
Hard |
46% |
1265 |
Print Immutable Linked List in Reverse |
|
Go . Doc |
Medium |
94% |
1266 |
Minimum Time Visiting All Points |
|
Go . Doc |
Easy |
79% |
1267 |
Count Servers that Communicate |
|
Go . Doc |
Medium |
57% |
1268 |
Search Suggestions System |
|
Go . Doc |
Medium |
65% |
1269 |
Number of Ways to Stay in the Same Place After Some Steps |
|
Go . Doc |
Hard |
43% |
1271 |
Hexspeak |
|
Go . Doc |
Easy |
55% |
1272 |
Remove Interval |
|
Go . Doc |
Medium |
58% |
1273 |
Delete Tree Nodes |
|
Go . Doc |
Medium |
61% |
1274 |
Number of Ships in a Rectangle |
|
Go . Doc |
Hard |
65% |
1275 |
Find Winner on a Tic Tac Toe Game |
|
Go . Doc |
Easy |
52% |
1276 |
Number of Burgers with No Waste of Ingredients |
|
Go . Doc |
Medium |
50% |
1277 |
Count Square Submatrices with All Ones |
|
Go . Doc |
Medium |
73% |
1278 |
Palindrome Partitioning III |
|
Go . Doc |
Hard |
61% |
1281 |
Subtract the Product and Sum of Digits of an Integer |
|
Go . Doc |
Easy |
85% |
1282 |
Group the People Given the Group Size They Belong To |
|
Go . Doc |
Medium |
84% |
1283 |
Find the Smallest Divisor Given a Threshold |
|
Go . Doc |
Medium |
50% |
1284 |
Minimum Number of Flips to Convert Binary Matrix to Zero Matrix |
|
Go . Doc |
Hard |
70% |
1286 |
Iterator for Combination |
|
Go . Doc |
Medium |
71% |
1287 |
Element Appearing More Than 25% In Sorted Array |
|
Go . Doc |
Easy |
59% |
1288 |
Remove Covered Intervals |
|
Go . Doc |
Medium |
57% |
1289 |
Minimum Falling Path Sum II |
|
Go . Doc |
Hard |
62% |
1290 |
Convert Binary Number in a Linked List to Integer |
|
Go . Doc |
Easy |
81% |
1291 |
Sequential Digits |
|
Go . Doc |
Medium |
57% |
1292 |
Maximum Side Length of a Square with Sum Less than or Equal to Threshold |
|
Go . Doc |
Medium |
51% |
1293 |
Shortest Path in a Grid with Obstacles Elimination |
|
Go . Doc |
Hard |
43% |
1295 |
Find Numbers with Even Number of Digits |
|
Go . Doc |
Easy |
78% |
1296 |
Divide Array in Sets of K Consecutive Numbers |
|
Go . Doc |
Medium |
55% |
1297 |
Maximum Number of Occurrences of a Substring |
|
Go . Doc |
Medium |
51% |
1298 |
Maximum Candies You Can Get from Boxes |
|
Go . Doc |
Hard |
60% |
1299 |
Replace Elements with Greatest Element on Right Side |
|
Go . Doc |
Easy |
74% |
1300 |
Sum of Mutated Array Closest to Target |
|
Go . Doc |
Medium |
42% |
1301 |
Number of Paths with Max Score |
|
Go . Doc |
Hard |
38% |
1302 |
Deepest Leaves Sum |
|
Go . Doc |
Medium |
85% |
1304 |
Find N Unique Integers Sum up to Zero |
|
Go . Doc |
Easy |
76% |
1305 |
All Elements in Two Binary Search Trees |
|
Go . Doc |
Medium |
78% |
1306 |
Jump Game III |
|
Go . Doc |
Medium |
61% |
1307 |
Verbal Arithmetic Puzzle |
|
Go . Doc |
Hard |
35% |
1309 |
Decrypt String from Alphabet to Integer Mapping |
|
Go . Doc |
Easy |
77% |
1310 |
XOR Queries of a Subarray |
|
Go . Doc |
Medium |
69% |
1311 |
Get Watched Videos by Your Friends |
|
Go . Doc |
Medium |
44% |
1312 |
Minimum Insertion Steps to Make a String Palindrome |
|
Go . Doc |
Hard |
61% |
1313 |
Decompress Run-Length Encoded List |
|
Go . Doc |
Easy |
85% |
1314 |
Matrix Block Sum |
|
Go . Doc |
Medium |
73% |
1315 |
Sum of Nodes with Even-Valued Grandparent |
|
Go . Doc |
Medium |
84% |
1316 |
Distinct Echo Substrings |
|
Go . Doc |
Hard |
49% |
1317 |
Convert Integer to the Sum of Two No-Zero Integers |
|
Go . Doc |
Easy |
57% |
1318 |
Minimum Flips to Make a OR b Equal to c |
|
Go . Doc |
Medium |
64% |
1319 |
Number of Operations to Make Network Connected |
|
Go . Doc |
Medium |
55% |
1320 |
Minimum Distance to Type a Word Using Two Fingers |
|
Go . Doc |
Hard |
61% |
1323 |
Maximum 69 Number |
|
Go . Doc |
Easy |
78% |
1324 |
Print Words Vertically |
|
Go . Doc |
Medium |
58% |
1325 |
Delete Leaves With a Given Value |
|
Go . Doc |
Medium |
74% |
1326 |
Minimum Number of Taps to Open to Water a Garden |
|
Go . Doc |
Hard |
47% |
1328 |
Break a Palindrome |
|
Go . Doc |
Medium |
49% |
1329 |
Sort the Matrix Diagonally |
|
Go . Doc |
Medium |
81% |
1330 |
Reverse Subarray To Maximize Array Value |
|
Go . Doc |
Hard |
37% |
1331 |
Rank Transform of an Array |
|
Go . Doc |
Easy |
57% |
1332 |
Remove Palindromic Subsequences |
|
Go . Doc |
Easy |
68% |
1333 |
Filter Restaurants by Vegan-Friendly, Price and Distance |
|
Go . Doc |
Medium |
57% |
1334 |
Find the City With the Smallest Number of Neighbors at a Threshold Distance |
|
Go . Doc |
Medium |
48% |
1335 |
Minimum Difficulty of a Job Schedule |
|
Go . Doc |
Hard |
56% |
1337 |
The K Weakest Rows in a Matrix |
|
Go . Doc |
Easy |
71% |
1338 |
Reduce Array Size to The Half |
|
Go . Doc |
Medium |
67% |
1339 |
Maximum Product of Splitted Binary Tree |
|
Go . Doc |
Medium |
38% |
1340 |
Jump Game V |
|
Go . Doc |
Hard |
60% |
1342 |
Number of Steps to Reduce a Number to Zero |
|
Go . Doc |
Easy |
85% |
1343 |
Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold |
|
Go . Doc |
Medium |
65% |
1344 |
Angle Between Hands of a Clock |
|
Go . Doc |
Medium |
61% |
1345 |
Jump Game IV |
|
Go . Doc |
Hard |
42% |
1346 |
Check If N and Its Double Exist |
|
Go . Doc |
Easy |
35% |
1347 |
Minimum Number of Steps to Make Two Strings Anagram |
|
Go . Doc |
Medium |
75% |
1348 |
Tweet Counts Per Frequency |
|
Go . Doc |
Medium |
39% |
1349 |
Maximum Students Taking Exam |
|
Go . Doc |
Hard |
45% |
1351 |
Count Negative Numbers in a Sorted Matrix |
|
Go . Doc |
Easy |
75% |
1352 |
Product of the Last K Numbers |
|
Go . Doc |
Medium |
45% |
1353 |
Maximum Number of Events That Can Be Attended |
|
Go . Doc |
Medium |
30% |
1354 |
Construct Target Array With Multiple Sums |
|
Go . Doc |
Hard |
31% |
1356 |
Sort Integers by The Number of 1 Bits |
|
Go . Doc |
Easy |
70% |
1357 |
Apply Discount Every n Orders |
|
Go . Doc |
Medium |
67% |
1358 |
Number of Substrings Containing All Three Characters |
|
Go . Doc |
Medium |
61% |
1359 |
Count All Valid Pickup and Delivery Options |
|
Go . Doc |
Hard |
55% |
1360 |
Number of Days Between Two Dates |
|
Go . Doc |
Easy |
46% |
1361 |
Validate Binary Tree Nodes |
|
Go . Doc |
Medium |
42% |
1362 |
Closest Divisors |
|
Go . Doc |
Medium |
58% |
1363 |
Largest Multiple of Three |
|
Go . Doc |
Hard |
34% |
1365 |
How Many Numbers Are Smaller Than the Current Number |
|
Go . Doc |
Easy |
85% |
1366 |
Rank Teams by Votes |
|
Go . Doc |
Medium |
56% |
1367 |
Linked List in Binary Tree |
|
Go . Doc |
Medium |
41% |
1368 |
Minimum Cost to Make at Least One Valid Path in a Grid |
|
Go . Doc |
Hard |
58% |
1370 |
Increasing Decreasing String |
|
Go . Doc |
Easy |
77% |
1371 |
Find the Longest Substring Containing Vowels in Even Counts |
|
Go . Doc |
Medium |
61% |
1372 |
Longest ZigZag Path in a Binary Tree |
|
Go . Doc |
Medium |
55% |
1373 |
Maximum Sum BST in Binary Tree |
|
Go . Doc |
Hard |
37% |
1374 |
Generate a String With Characters That Have Odd Counts |
|
Go . Doc |
Easy |
76% |
1375 |
Bulb Switcher III |
|
Go . Doc |
Medium |
64% |
1376 |
Time Needed to Inform All Employees |
|
Go . Doc |
Medium |
57% |
1377 |
Frog Position After T Seconds |
|
Go . Doc |
Hard |
35% |
1379 |
Find a Corresponding Node of a Binary Tree in a Clone of That Tree |
|
Go . Doc |
Medium |
84% |
1380 |
Lucky Numbers in a Matrix |
|
Go . Doc |
Easy |
70% |
1381 |
Design a Stack With Increment Operation |
|
Go . Doc |
Medium |
76% |
1382 |
Balance a Binary Search Tree |
|
Go . Doc |
Medium |
77% |
1383 |
Maximum Performance of a Team |
|
Go . Doc |
Hard |
41% |
1385 |
Find the Distance Value Between Two Arrays |
|
Go . Doc |
Easy |
66% |
1386 |
Cinema Seat Allocation |
|
Go . Doc |
Medium |
37% |
1387 |
Sort Integers by The Power Value |
|
Go . Doc |
Medium |
70% |
1388 |
Pizza With 3n Slices |
|
Go . Doc |
Hard |
46% |
1389 |
Create Target Array in the Given Order |
|
Go . Doc |
Easy |
85% |
1390 |
Four Divisors |
|
Go . Doc |
Medium |
39% |
1391 |
Check if There is a Valid Path in a Grid |
|
Go . Doc |
Medium |
45% |
1392 |
Longest Happy Prefix |
|
Go . Doc |
Hard |
42% |
1394 |
Find Lucky Integer in an Array |
|
Go . Doc |
Easy |
63% |
1395 |
Count Number of Teams |
|
Go . Doc |
Medium |
72% |
1396 |
Design Underground System |
|
Go . Doc |
Medium |
71% |
1397 |
Find All Good Strings |
|
Go . Doc |
Hard |
39% |
1399 |
Count Largest Group |
|
Go . Doc |
Easy |
65% |
1400 |
Construct K Palindrome Strings |
|
Go . Doc |
Medium |
63% |
1401 |
Circle and Rectangle Overlapping |
|
Go . Doc |
Medium |
42% |
1402 |
Reducing Dishes |
|
Go . Doc |
Hard |
72% |
1403 |
Minimum Subsequence in Non-Increasing Order |
|
Go . Doc |
Easy |
71% |
1404 |
Number of Steps to Reduce a Number in Binary Representation to One |
|
Go . Doc |
Medium |
50% |
1405 |
Longest Happy String |
|
Go . Doc |
Medium |
53% |
1406 |
Stone Game III |
|
Go . Doc |
Hard |
59% |
1408 |
String Matching in an Array |
|
Go . Doc |
Easy |
63% |
1409 |
Queries on a Permutation With Key |
|
Go . Doc |
Medium |
82% |
1410 |
HTML Entity Parser |
|
Go . Doc |
Medium |
53% |
1411 |
Number of Ways to Paint N × 3 Grid |
|
Go . Doc |
Hard |
61% |
1413 |
Minimum Value to Get Positive Step by Step Sum |
|
Go . Doc |
Easy |
65% |
1414 |
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K |
|
Go . Doc |
Medium |
63% |
1415 |
The k-th Lexicographical String of All Happy Strings of Length n |
|
Go . Doc |
Medium |
70% |
1416 |
Restore The Array |
|
Go . Doc |
Hard |
36% |
1417 |
Reformat The String |
|
Go . Doc |
Easy |
56% |
1418 |
Display Table of Food Orders in a Restaurant |
|
Go . Doc |
Medium |
70% |
1419 |
Minimum Number of Frogs Croaking |
|
Go . Doc |
Medium |
48% |
1420 |
Build Array Where You Can Find The Maximum Exactly K Comparisons |
|
Go . Doc |
Hard |
64% |
1422 |
Maximum Score After Splitting a String |
|
Go . Doc |
Easy |
57% |
1423 |
Maximum Points You Can Obtain from Cards |
|
Go . Doc |
Medium |
48% |
1424 |
Diagonal Traverse II |
|
Go . Doc |
Medium |
47% |
1425 |
Constrained Subsequence Sum |
|
Go . Doc |
Hard |
45% |
1426 |
Counting Elements |
|
Go . Doc |
Easy |
59% |
1427 |
Perform String Shifts |
|
Go . Doc |
Easy |
53% |
1428 |
Leftmost Column with at Least a One |
|
Go . Doc |
Medium |
50% |
1429 |
First Unique Number |
|
Go . Doc |
Medium |
50% |
1430 |
Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree |
|
Go . Doc |
Medium |
45% |
1431 |
Kids With the Greatest Number of Candies |
|
Go . Doc |
Easy |
88% |
1432 |
Max Difference You Can Get From Changing an Integer |
|
Go . Doc |
Medium |
43% |
1433 |
Check If a String Can Break Another String |
|
Go . Doc |
Medium |
67% |
1434 |
Number of Ways to Wear Different Hats to Each Other |
|
Go . Doc |
Hard |
40% |
1436 |
Destination City |
|
Go . Doc |
Easy |
77% |
1437 |
Check If All 1's Are at Least Length K Places Away |
|
Go . Doc |
Easy |
60% |
1438 |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit |
|
Go . Doc |
Medium |
44% |
1439 |
Find the Kth Smallest Sum of a Matrix With Sorted Rows |
|
Go . Doc |
Hard |
61% |
1441 |
Build an Array With Stack Operations |
|
Go . Doc |
Easy |
70% |
1442 |
Count Triplets That Can Form Two Arrays of Equal XOR |
|
Go . Doc |
Medium |
72% |
1443 |
Minimum Time to Collect All Apples in a Tree |
|
Go . Doc |
Medium |
54% |
1444 |
Number of Ways of Cutting a Pizza |
|
Go . Doc |
Hard |
54% |
1446 |
Consecutive Characters |
|
Go . Doc |
Easy |
61% |
1447 |
Simplified Fractions |
|
Go . Doc |
Medium |
62% |
1448 |
Count Good Nodes in Binary Tree |
|
Go . Doc |
Medium |
72% |
1449 |
Form Largest Integer With Digits That Add up to Target |
|
Go . Doc |
Hard |
45% |
1450 |
Number of Students Doing Homework at a Given Time |
|
Go . Doc |
Easy |
76% |
1451 |
Rearrange Words in a Sentence |
|
Go . Doc |
Medium |
60% |
1452 |
People Whose List of Favorite Companies Is Not a Subset of Another List |
|
Go . Doc |
Medium |
55% |
1453 |
Maximum Number of Darts Inside of a Circular Dartboard |
|
Go . Doc |
Hard |
36% |
1455 |
Check If a Word Occurs As a Prefix of Any Word in a Sentence |
|
Go . Doc |
Easy |
64% |
1456 |
Maximum Number of Vowels in a Substring of Given Length |
|
Go . Doc |
Medium |
55% |
1457 |
Pseudo-Palindromic Paths in a Binary Tree |
|
Go . Doc |
Medium |
68% |
1458 |
Max Dot Product of Two Subsequences |
|
Go . Doc |
Hard |
43% |
1460 |
Make Two Arrays Equal by Reversing Sub-arrays |
|
Go . Doc |
Easy |
72% |
1461 |
Check If a String Contains All Binary Codes of Size K |
|
Go . Doc |
Medium |
54% |
1462 |
Course Schedule IV |
|
Go . Doc |
Medium |
46% |
1463 |
Cherry Pickup II |
|
Go . Doc |
Hard |
68% |
1464 |
Maximum Product of Two Elements in an Array |
|
Go . Doc |
Easy |
77% |
1465 |
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts |
|
Go . Doc |
Medium |
36% |
1466 |
Reorder Routes to Make All Paths Lead to the City Zero |
|
Go . Doc |
Medium |
61% |
1467 |
Probability of a Two Boxes Having The Same Number of Distinct Balls |
|
Go . Doc |
Hard |
60% |
1469 |
Find All The Lonely Nodes |
|
Go . Doc |
Easy |
80% |
1470 |
Shuffle the Array |
|
Go . Doc |
Easy |
88% |
1471 |
The k Strongest Values in an Array |
|
Go . Doc |
Medium |
58% |
1472 |
Design Browser History |
|
Go . Doc |
Medium |
72% |
1473 |
Paint House III |
|
Go . Doc |
Hard |
49% |
1474 |
Delete N Nodes After M Nodes of a Linked List |
|
Go . Doc |
Easy |
73% |
1475 |
Final Prices With a Special Discount in a Shop |
|
Go . Doc |
Easy |
74% |
1476 |
Subrectangle Queries |
|
Go . Doc |
Medium |
87% |
1477 |
Find Two Non-overlapping Sub-arrays Each With Target Sum |
|
Go . Doc |
Medium |
35% |
1478 |
Allocate Mailboxes |
|
Go . Doc |
Hard |
54% |
1480 |
Running Sum of 1d Array |
|
Go . Doc |
Easy |
88% |
1481 |
Least Number of Unique Integers after K Removals |
|
Go . Doc |
Medium |
56% |
1482 |
Minimum Number of Days to Make m Bouquets |
|
Go . Doc |
Medium |
52% |
1483 |
Kth Ancestor of a Tree Node |
|
Go . Doc |
Hard |
33% |
1485 |
Clone Binary Tree With Random Pointer |
|
Go . Doc |
Medium |
79% |
1486 |
XOR Operation in an Array |
|
Go . Doc |
Easy |
83% |
1487 |
Making File Names Unique |
|
Go . Doc |
Medium |
31% |
1488 |
Avoid Flood in The City |
|
Go . Doc |
Medium |
24% |
1489 |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree |
|
Go . Doc |
Hard |
51% |
1490 |
Clone N-ary Tree |
|
Go . Doc |
Medium |
82% |
1491 |
Average Salary Excluding the Minimum and Maximum Salary |
|
Go . Doc |
Easy |
67% |
1492 |
The kth Factor of n |
|
Go . Doc |
Medium |
62% |
1493 |
Longest Subarray of 1's After Deleting One Element |
|
Go . Doc |
Medium |
57% |
1494 |
Parallel Courses II |
|
Go . Doc |
Hard |
30% |
1496 |
Path Crossing |
|
Go . Doc |
Easy |
55% |
1497 |
Check If Array Pairs Are Divisible by k |
|
Go . Doc |
Medium |
40% |
1498 |
Number of Subsequences That Satisfy the Given Sum Condition |
|
Go . Doc |
Medium |
39% |
1499 |
Max Value of Equation |
|
Go . Doc |
Hard |
45% |
1500 |
Design a File Sharing System |
|
Go . Doc |
Medium |
46% |
1502 |
Can Make Arithmetic Progression From Sequence |
|
Go . Doc |
Easy |
70% |
1503 |
Last Moment Before All Ants Fall Out of a Plank |
|
Go . Doc |
Medium |
53% |
1504 |
Count Submatrices With All Ones |
|
Go . Doc |
Medium |
60% |
1505 |
Minimum Possible Integer After at Most K Adjacent Swaps On Digits |
|
Go . Doc |
Hard |
36% |
1506 |
Find Root of N-Ary Tree |
|
Go . Doc |
Medium |
79% |
1507 |
Reformat Date |
|
Go . Doc |
Easy |
60% |
1508 |
Range Sum of Sorted Subarray Sums |
|
Go . Doc |
Medium |
59% |
1509 |
Minimum Difference Between Largest and Smallest Value in Three Moves |
|
Go . Doc |
Medium |
56% |
1510 |
Stone Game IV |
|
Go . Doc |
Hard |
59% |
1512 |
Number of Good Pairs |
|
Go . Doc |
Easy |
87% |
1513 |
Number of Substrings With Only 1s |
|
Go . Doc |
Medium |
42% |
1514 |
Path with Maximum Probability |
|
Go . Doc |
Medium |
42% |
1515 |
Best Position for a Service Centre |
|
Go . Doc |
Hard |
39% |
1516 |
Move Sub-Tree of N-Ary Tree |
|
Go . Doc |
Hard |
64% |
1518 |
Water Bottles |
|
Go . Doc |
Easy |
60% |
1519 |
Number of Nodes in the Sub-Tree With the Same Label |
|
Go . Doc |
Medium |
38% |
1520 |
Maximum Number of Non-Overlapping Substrings |
|
Go . Doc |
Hard |
36% |
1521 |
Find a Value of a Mysterious Function Closest to Target |
|
Go . Doc |
Hard |
43% |
1522 |
Diameter of N-Ary Tree |
|
Go . Doc |
Medium |
70% |
1523 |
Count Odd Numbers in an Interval Range |
|
Go . Doc |
Easy |
53% |
1524 |
Number of Sub-arrays With Odd Sum |
|
Go . Doc |
Medium |
41% |
1525 |
Number of Good Ways to Split a String |
|
Go . Doc |
Medium |
69% |
1526 |
Minimum Number of Increments on Subarrays to Form a Target Array |
|
Go . Doc |
Hard |
64% |
1528 |
Shuffle String |
|
Go . Doc |
Easy |
85% |
1529 |
Bulb Switcher IV |
|
Go . Doc |
Medium |
71% |
1530 |
Number of Good Leaf Nodes Pairs |
|
Go . Doc |
Medium |
57% |
1531 |
String Compression II |
|
Go . Doc |
Hard |
34% |
1533 |
Find the Index of the Large Integer |
|
Go . Doc |
Medium |
54% |
1534 |
Count Good Triplets |
|
Go . Doc |
Easy |
80% |
1535 |
Find the Winner of an Array Game |
|
Go . Doc |
Medium |
48% |
1536 |
Minimum Swaps to Arrange a Binary Grid |
|
Go . Doc |
Medium |
44% |
1537 |
Get the Maximum Score |
|
Go . Doc |
Hard |
37% |
1538 |
Guess the Majority in a Hidden Array |
|
Go . Doc |
Medium |
61% |
1539 |
Kth Missing Positive Number |
|
Go . Doc |
Easy |
54% |
1540 |
Can Convert String in K Moves |
|
Go . Doc |
Medium |
31% |
1541 |
Minimum Insertions to Balance a Parentheses String |
|
Go . Doc |
Medium |
44% |
1542 |
Find Longest Awesome Substring |
|
Go . Doc |
Hard |
38% |
1544 |
Make The String Great |
|
Go . Doc |
Easy |
55% |
1545 |
Find Kth Bit in Nth Binary String |
|
Go . Doc |
Medium |
57% |
1546 |
Maximum Number of Non-Overlapping Subarrays With Sum Equals Target |
|
Go . Doc |
Medium |
44% |
1547 |
Minimum Cost to Cut a Stick |
|
Go . Doc |
Hard |
53% |
1548 |
The Most Similar Path in a Graph |
|
Go . Doc |
Hard |
55% |
1550 |
Three Consecutive Odds |
|
Go . Doc |
Easy |
64% |
1551 |
Minimum Operations to Make Array Equal |
|
Go . Doc |
Medium |
80% |
1552 |
Magnetic Force Between Two Balls |
|
Go . Doc |
Medium |
50% |
1553 |
Minimum Number of Days to Eat N Oranges |
|
Go . Doc |
Hard |
31% |
1554 |
Strings Differ by One Character |
|
Go . Doc |
Medium |
64% |
1556 |
Thousand Separator |
|
Go . Doc |
Easy |
56% |
1557 |
Minimum Number of Vertices to Reach All Nodes |
|
Go . Doc |
Medium |
76% |
1558 |
Minimum Numbers of Function Calls to Make Target Array |
|
Go . Doc |
Medium |
63% |
1559 |
Detect Cycles in 2D Grid |
|
Go . Doc |
Hard |
45% |
1560 |
Most Visited Sector in a Circular Track |
|
Go . Doc |
Easy |
57% |
1561 |
Maximum Number of Coins You Can Get |
|
Go . Doc |
Medium |
77% |
1562 |
Find Latest Group of Size M |
|
Go . Doc |
Medium |
40% |
1563 |
Stone Game V |
|
Go . Doc |
Hard |
40% |
1564 |
Put Boxes Into the Warehouse I |
|
Go . Doc |
Medium |
64% |
1566 |
Detect Pattern of Length M Repeated K or More Times |
|
Go . Doc |
Easy |
43% |
1567 |
Maximum Length of Subarray With Positive Product |
|
Go . Doc |
Medium |
37% |
1568 |
Minimum Number of Days to Disconnect Island |
|
Go . Doc |
Hard |
50% |
1569 |
Number of Ways to Reorder Array to Get Same BST |
|
Go . Doc |
Hard |
49% |
1570 |
Dot Product of Two Sparse Vectors |
|
Go . Doc |
Medium |
90% |
1572 |
Matrix Diagonal Sum |
|
Go . Doc |
Easy |
78% |
1573 |
Number of Ways to Split a String |
|
Go . Doc |
Medium |
31% |
1574 |
Shortest Subarray to be Removed to Make Array Sorted |
|
Go . Doc |
Medium |
34% |
1575 |
Count All Possible Routes |
|
Go . Doc |
Hard |
57% |
1576 |
Replace All ?'s to Avoid Consecutive Repeating Characters |
|
Go . Doc |
Easy |
50% |
1577 |
Number of Ways Where Square of Number Is Equal to Product of Two Numbers |
|
Go . Doc |
Medium |
38% |
1578 |
Minimum Deletion Cost to Avoid Repeating Letters |
|
Go . Doc |
Medium |
61% |
1579 |
Remove Max Number of Edges to Keep Graph Fully Traversable |
|
Go . Doc |
Hard |
46% |
1580 |
Put Boxes Into the Warehouse II |
|
Go . Doc |
Medium |
63% |
1582 |
Special Positions in a Binary Matrix |
|
Go . Doc |
Easy |
64% |
1583 |
Count Unhappy Friends |
|
Go . Doc |
Medium |
55% |
1584 |
Min Cost to Connect All Points |
|
Go . Doc |
Medium |
55% |
1585 |
Check If String Is Transformable With Substring Sort Operations |
|
Go . Doc |
Hard |
48% |
1586 |
Binary Search Tree Iterator II |
|
Go . Doc |
Medium |
66% |
1588 |
Sum of All Odd Length Subarrays |
|
Go . Doc |
Easy |
81% |
1589 |
Maximum Sum Obtained of Any Permutation |
|
Go . Doc |
Medium |
35% |
1590 |
Make Sum Divisible by P |
|
Go . Doc |
Medium |
27% |
1591 |
Strange Printer II |
|
Go . Doc |
Hard |
55% |
1592 |
Rearrange Spaces Between Words |
|
Go . Doc |
Easy |
43% |
1593 |
Split a String Into the Max Number of Unique Substrings |
|
Go . Doc |
Medium |
50% |
1594 |
Maximum Non Negative Product in a Matrix |
|
Go . Doc |
Medium |
32% |
1595 |
Minimum Cost to Connect Two Groups of Points |
|
Go . Doc |
Hard |
44% |
1597 |
Build Binary Expression Tree From Infix Expression |
|
Go . Doc |
Hard |
59% |
1598 |
Crawler Log Folder |
|
Go . Doc |
Easy |
63% |
1599 |
Maximum Profit of Operating a Centennial Wheel |
|
Go . Doc |
Medium |
43% |
1600 |
Throne Inheritance |
|
Go . Doc |
Medium |
61% |
1601 |
Maximum Number of Achievable Transfer Requests |
|
Go . Doc |
Hard |
48% |
1602 |
Find Nearest Right Node in Binary Tree |
|
Go . Doc |
Medium |
73% |
1603 |
Design Parking System |
|
Go . Doc |
Easy |
86% |
1604 |
Alert Using Same Key-Card Three or More Times in a One Hour Period |
|
Go . Doc |
Medium |
43% |
1605 |
Find Valid Matrix Given Row and Column Sums |
|
Go . Doc |
Medium |
77% |
1606 |
Find Servers That Handled Most Number of Requests |
|
Go . Doc |
Hard |
38% |
1608 |
Special Array With X Elements Greater Than or Equal X |
|
Go . Doc |
Easy |
61% |
1609 |
Even Odd Tree |
|
Go . Doc |
Medium |
52% |
1610 |
Maximum Number of Visible Points |
|
Go . Doc |
Hard |
32% |
1611 |
Minimum One Bit Operations to Make Integers Zero |
|
Go . Doc |
Hard |
59% |
1612 |
Check If Two Expression Trees are Equivalent |
|
Go . Doc |
Medium |
70% |
1614 |
Maximum Nesting Depth of the Parentheses |
|
Go . Doc |
Easy |
82% |
1615 |
Maximal Network Rank |
|
Go . Doc |
Medium |
54% |
1616 |
Split Two Strings to Make Palindrome |
|
Go . Doc |
Medium |
30% |
1617 |
Count Subtrees With Max Distance Between Cities |
|
Go . Doc |
Hard |
63% |
1618 |
Maximum Font to Fit a Sentence in a Screen |
|
Go . Doc |
Medium |
57% |
1619 |
Mean of Array After Removing Some Elements |
|
Go . Doc |
Easy |
64% |
1620 |
Coordinate With Maximum Network Quality |
|
Go . Doc |
Medium |
37% |
1621 |
Number of Sets of K Non-Overlapping Line Segments |
|
Go . Doc |
Medium |
41% |
1622 |
Fancy Sequence |
|
Go . Doc |
Hard |
14% |
1624 |
Largest Substring Between Two Equal Characters |
|
Go . Doc |
Easy |
58% |
1625 |
Lexicographically Smallest String After Applying Operations |
|
Go . Doc |
Medium |
65% |
1626 |
Best Team With No Conflicts |
|
Go . Doc |
Medium |
39% |
1627 |
Graph Connectivity With Threshold |
|
Go . Doc |
Hard |
41% |
1628 |
Design an Expression Tree With Evaluate Function |
|
Go . Doc |
Medium |
81% |
1629 |
Slowest Key |
|
Go . Doc |
Easy |
58% |
1630 |
Arithmetic Subarrays |
|
Go . Doc |
Medium |
77% |
1631 |
Path With Minimum Effort |
|
Go . Doc |
Medium |
50% |
1632 |
Rank Transform of a Matrix |
|
Go . Doc |
Hard |
32% |
1634 |
Add Two Polynomials Represented as Linked Lists |
|
Go . Doc |
Medium |
52% |
1636 |
Sort Array by Increasing Frequency |
|
Go . Doc |
Easy |
67% |
1637 |
Widest Vertical Area Between Two Points Containing No Points |
|
Go . Doc |
Medium |
83% |
1638 |
Count Substrings That Differ by One Character |
|
Go . Doc |
Medium |
71% |
1639 |
Number of Ways to Form a Target String Given a Dictionary |
|
Go . Doc |
Hard |
40% |
1640 |
Check Array Formation Through Concatenation |
|
Go . Doc |
Easy |
55% |
1641 |
Count Sorted Vowel Strings |
|
Go . Doc |
Medium |
74% |
1642 |
Furthest Building You Can Reach |
|
Go . Doc |
Medium |
43% |
1643 |
Kth Smallest Instructions |
|
Go . Doc |
Hard |
45% |
1644 |
Lowest Common Ancestor of a Binary Tree II |
|
Go . Doc |
Medium |
57% |
1646 |
Get Maximum in Generated Array |
|
Go . Doc |
Easy |
52% |
1647 |
Minimum Deletions to Make Character Frequencies Unique |
|
Go . Doc |
Medium |
55% |
1648 |
Sell Diminishing-Valued Colored Balls |
|
Go . Doc |
Medium |
31% |
1649 |
Create Sorted Array through Instructions |
|
Go . Doc |
Hard |
36% |
1650 |
Lowest Common Ancestor of a Binary Tree III |
|
Go . Doc |
Medium |
77% |
1652 |
Defuse the Bomb |
|
Go . Doc |
Easy |
60% |
1653 |
Minimum Deletions to Make String Balanced |
|
Go . Doc |
Medium |
52% |
1654 |
Minimum Jumps to Reach Home |
|
Go . Doc |
Medium |
24% |
1655 |
Distribute Repeating Integers |
|
Go . Doc |
Hard |
40% |
1656 |
Design an Ordered Stream |
|
Go . Doc |
Easy |
82% |
1657 |
Determine if Two Strings Are Close |
|
Go . Doc |
Medium |
54% |
1658 |
Minimum Operations to Reduce X to Zero |
|
Go . Doc |
Medium |
33% |
1659 |
Maximize Grid Happiness |
|
Go . Doc |
Hard |
35% |
1660 |
Correct a Binary Tree |
|
Go . Doc |
Medium |
75% |
1662 |
Check If Two String Arrays are Equivalent |
|
Go . Doc |
Easy |
82% |
1663 |
Smallest String With A Given Numeric Value |
|
Go . Doc |
Medium |
64% |
1664 |
Ways to Make a Fair Array |
|
Go . Doc |
Medium |
62% |
1665 |
Minimum Initial Energy to Finish Tasks |
|
Go . Doc |
Hard |
54% |
1666 |
Change the Root of a Binary Tree |
|
Go . Doc |
Medium |
69% |
1668 |
Maximum Repeating Substring |
|
Go . Doc |
Easy |
38% |
1669 |
Merge In Between Linked Lists |
|
Go . Doc |
Medium |
75% |
1670 |
Design Front Middle Back Queue |
|
Go . Doc |
Medium |
54% |
1671 |
Minimum Number of Removals to Make Mountain Array |
|
Go . Doc |
Hard |
44% |
1672 |
Richest Customer Wealth |
|
Go . Doc |
Easy |
88% |
1673 |
Find the Most Competitive Subsequence |
|
Go . Doc |
Medium |
45% |
1674 |
Minimum Moves to Make Array Complementary |
|
Go . Doc |
Medium |
36% |
1675 |
Minimize Deviation in Array |
|
Go . Doc |
Hard |
48% |
1676 |
Lowest Common Ancestor of a Binary Tree IV |
|
Go . Doc |
Medium |
78% |
1678 |
Goal Parser Interpretation |
|
Go . Doc |
Easy |
84% |
1679 |
Max Number of K-Sum Pairs |
|
Go . Doc |
Medium |
53% |
1680 |
Concatenation of Consecutive Binary Numbers |
|
Go . Doc |
Medium |
52% |
1681 |
Minimum Incompatibility |
|
Go . Doc |
Hard |
35% |
1682 |
Longest Palindromic Subsequence II |
|
Go . Doc |
Medium |
50% |
1684 |
Count the Number of Consistent Strings |
|
Go . Doc |
Easy |
81% |
1685 |
Sum of Absolute Differences in a Sorted Array |
|
Go . Doc |
Medium |
63% |
1686 |
Stone Game VI |
|
Go . Doc |
Medium |
51% |
1687 |
Delivering Boxes from Storage to Ports |
|
Go . Doc |
Hard |
35% |
1688 |
Count of Matches in Tournament |
|
Go . Doc |
Easy |
81% |
1689 |
Partitioning Into Minimum Number Of Deci-Binary Numbers |
|
Go . Doc |
Medium |
88% |
1690 |
Stone Game VII |
|
Go . Doc |
Medium |
58% |
1691 |
Maximum Height by Stacking Cuboids |
|
Go . Doc |
Hard |
51% |
1692 |
Count Ways to Distribute Candies |
|
Go . Doc |
Hard |
60% |
1694 |
Reformat Phone Number |
|
Go . Doc |
Easy |
64% |
1695 |
Maximum Erasure Value |
|
Go . Doc |
Medium |
52% |
1696 |
Jump Game VI |
|
Go . Doc |
Medium |
41% |
1697 |
Checking Existence of Edge Length Limited Paths |
|
Go . Doc |
Hard |
47% |
1698 |
Number of Distinct Substrings in a String |
|
Go . Doc |
Medium |
61% |
1700 |
Number of Students Unable to Eat Lunch |
|
Go . Doc |
Easy |
67% |
1701 |
Average Waiting Time |
|
Go . Doc |
Medium |
60% |
1702 |
Maximum Binary String After Change |
|
Go . Doc |
Medium |
43% |
1703 |
Minimum Adjacent Swaps for K Consecutive Ones |
|
Go . Doc |
Hard |
37% |
1704 |
Determine if String Halves Are Alike |
|
Go . Doc |
Easy |
78% |
1705 |
Maximum Number of Eaten Apples |
|
Go . Doc |
Medium |
34% |
1706 |
Where Will the Ball Fall |
|
Go . Doc |
Medium |
63% |
1707 |
Maximum XOR With an Element From Array |
|
Go . Doc |
Hard |
42% |
1708 |
Largest Subarray Length K |
|
Go . Doc |
Easy |
64% |
1710 |
Maximum Units on a Truck |
|
Go . Doc |
Easy |
72% |
1711 |
Count Good Meals |
|
Go . Doc |
Medium |
27% |
1712 |
Ways to Split Array Into Three Subarrays |
|
Go . Doc |
Medium |
29% |
1713 |
Minimum Operations to Make a Subsequence |
|
Go . Doc |
Hard |
46% |
1714 |
Sum Of Special Evenly-Spaced Elements In Array |
|
Go . Doc |
Hard |
50% |
1716 |
Calculate Money in Leetcode Bank |
|
Go . Doc |
Easy |
64% |
1717 |
Maximum Score From Removing Substrings |
|
Go . Doc |
Medium |
42% |
1718 |
Construct the Lexicographically Largest Valid Sequence |
|
Go . Doc |
Medium |
48% |
1719 |
Number Of Ways To Reconstruct A Tree |
|
Go . Doc |
Hard |
39% |
1720 |
Decode XORed Array |
|
Go . Doc |
Easy |
85% |
1721 |
Swapping Nodes in a Linked List |
|
Go . Doc |
Medium |
66% |
1722 |
Minimize Hamming Distance After Swap Operations |
|
Go . Doc |
Medium |
46% |
1723 |
Find Minimum Time to Finish All Jobs |
|
Go . Doc |
Hard |
40% |
1724 |
Checking Existence of Edge Length Limited Paths II |
|
Go . Doc |
Hard |
56% |
1725 |
Number Of Rectangles That Can Form The Largest Square |
|
Go . Doc |
Easy |
78% |
1726 |
Tuple with Same Product |
|
Go . Doc |
Medium |
58% |
1727 |
Largest Submatrix With Rearrangements |
|
Go . Doc |
Medium |
59% |
1728 |
Cat and Mouse II |
|
Go . Doc |
Hard |
41% |
1730 |
Shortest Path to Get Food |
|
Go . Doc |
Medium |
54% |
1732 |
Find the Highest Altitude |
|
Go . Doc |
Easy |
79% |
1733 |
Minimum Number of People to Teach |
|
Go . Doc |
Medium |
38% |
1734 |
Decode XORed Permutation |
|
Go . Doc |
Medium |
57% |
1735 |
Count Ways to Make Array With Product |
|
Go . Doc |
Hard |
48% |
1736 |
Latest Time by Replacing Hidden Digits |
|
Go . Doc |
Easy |
41% |
1737 |
Change Minimum Characters to Satisfy One of Three Conditions |
|
Go . Doc |
Medium |
30% |
1738 |
Find Kth Largest XOR Coordinate Value |
|
Go . Doc |
Medium |
62% |
1739 |
Building Boxes |
|
Go . Doc |
Hard |
50% |
1740 |
Find Distance in a Binary Tree |
|
Go . Doc |
Medium |
69% |
1742 |
Maximum Number of Balls in a Box |
|
Go . Doc |
Easy |
73% |
1743 |
Restore the Array From Adjacent Pairs |
|
Go . Doc |
Medium |
65% |
1744 |
Can You Eat Your Favorite Candy on Your Favorite Day? |
|
Go . Doc |
Medium |
31% |
1745 |
Palindrome Partitioning IV |
|
Go . Doc |
Hard |
49% |
1746 |
Maximum Subarray Sum After One Operation |
|
Go . Doc |
Medium |
61% |
1748 |
Sum of Unique Elements |
|
Go . Doc |
Easy |
74% |
1749 |
Maximum Absolute Sum of Any Subarray |
|
Go . Doc |
Medium |
54% |
1750 |
Minimum Length of String After Deleting Similar Ends |
|
Go . Doc |
Medium |
42% |
1751 |
Maximum Number of Events That Can Be Attended II |
|
Go . Doc |
Hard |
49% |
1752 |
Check if Array Is Sorted and Rotated |
|
Go . Doc |
Easy |
44% |
1753 |
Maximum Score From Removing Stones |
|
Go . Doc |
Medium |
63% |
1754 |
Largest Merge Of Two Strings |
|
Go . Doc |
Medium |
41% |
1755 |
Closest Subsequence Sum |
|
Go . Doc |
Hard |
34% |
1756 |
Design Most Recently Used Queue |
|
Go . Doc |
Medium |
78% |
1758 |
Minimum Changes To Make Alternating Binary String |
|
Go . Doc |
Easy |
58% |
1759 |
Count Number of Homogenous Substrings |
|
Go . Doc |
Medium |
43% |
1760 |
Minimum Limit of Balls in a Bag |
|
Go . Doc |
Medium |
54% |
1761 |
Minimum Degree of a Connected Trio in a Graph |
|
Go . Doc |
Hard |
39% |
1762 |
Buildings With an Ocean View |
|
Go . Doc |
Medium |
81% |
1763 |
Longest Nice Substring |
|
Go . Doc |
Easy |
61% |
1764 |
Form Array by Concatenating Subarrays of Another Array |
|
Go . Doc |
Medium |
53% |
1765 |
Map of Highest Peak |
|
Go . Doc |
Medium |
57% |
1766 |
Tree of Coprimes |
|
Go . Doc |
Hard |
36% |
1768 |
Merge Strings Alternately |
|
Go . Doc |
Easy |
74% |
1769 |
Minimum Number of Operations to Move All Balls to Each Box |
|
Go . Doc |
Medium |
85% |
1770 |
Maximum Score from Performing Multiplication Operations |
|
Go . Doc |
Medium |
30% |
1771 |
Maximize Palindrome Length From Subsequences |
|
Go . Doc |
Hard |
34% |
1772 |
Sort Features by Popularity |
|
Go . Doc |
Medium |
65% |
1773 |
Count Items Matching a Rule |
|
Go . Doc |
Easy |
84% |
1774 |
Closest Dessert Cost |
|
Go . Doc |
Medium |
45% |
1775 |
Equal Sum Arrays With Minimum Number of Operations |
|
Go . Doc |
Medium |
50% |
1776 |
Car Fleet II |
|
Go . Doc |
Hard |
49% |
1778 |
Shortest Path in a Hidden Grid |
|
Go . Doc |
Medium |
45% |
1779 |
Find Nearest Point That Has the Same X or Y Coordinate |
|
Go . Doc |
Easy |
66% |
1780 |
Check if Number is a Sum of Powers of Three |
|
Go . Doc |
Medium |
63% |
1781 |
Sum of Beauty of All Substrings |
|
Go . Doc |
Medium |
58% |
1782 |
Count Pairs Of Nodes |
|
Go . Doc |
Hard |
35% |
1784 |
Check if Binary String Has at Most One Segment of Ones |
|
Go . Doc |
Easy |
41% |
1785 |
Minimum Elements to Add to Form a Given Sum |
|
Go . Doc |
Medium |
40% |
1786 |
Number of Restricted Paths From First to Last Node |
|
Go . Doc |
Medium |
36% |
1787 |
Make the XOR of All Segments Equal to Zero |
|
Go . Doc |
Hard |
37% |
1788 |
Maximize the Beauty of the Garden |
|
Go . Doc |
Hard |
67% |
1790 |
Check if One String Swap Can Make Strings Equal |
|
Go . Doc |
Easy |
44% |
1791 |
Find Center of Star Graph |
|
Go . Doc |
Easy |
84% |
1792 |
Maximum Average Pass Ratio |
|
Go . Doc |
Medium |
47% |
1793 |
Maximum Score of a Good Subarray |
|
Go . Doc |
Hard |
48% |
1794 |
Count Pairs of Equal Substrings With Minimum Difference |
|
Go . Doc |
Medium |
68% |
1796 |
Second Largest Digit in a String |
|
Go . Doc |
Easy |
48% |
1797 |
Design Authentication Manager |
|
Go . Doc |
Medium |
50% |
1798 |
Maximum Number of Consecutive Values You Can Make |
|
Go . Doc |
Medium |
47% |
1799 |
Maximize Score After N Operations |
|
Go . Doc |
Hard |
45% |
1800 |
Maximum Ascending Subarray Sum |
|
Go . Doc |
Easy |
64% |
1801 |
Number of Orders in the Backlog |
|
Go . Doc |
Medium |
44% |
1802 |
Maximum Value at a Given Index in a Bounded Array |
|
Go . Doc |
Medium |
28% |
1803 |
Count Pairs With XOR in a Range |
|
Go . Doc |
Hard |
44% |
1804 |
Implement Trie II (Prefix Tree) |
|
Go . Doc |
Medium |
57% |
1805 |
Number of Different Integers in a String |
|
Go . Doc |
Easy |
34% |
1806 |
Minimum Number of Operations to Reinitialize a Permutation |
|
Go . Doc |
Medium |
70% |
1807 |
Evaluate the Bracket Pairs of a String |
|
Go . Doc |
Medium |
66% |
1808 |
Maximize Number of Nice Divisors |
|
Go . Doc |
Hard |
28% |
1810 |
Minimum Path Cost in a Hidden Grid |
|
Go . Doc |
Medium |
53% |
1812 |
Determine Color of a Chessboard Square |
|
Go . Doc |
Easy |
77% |
1813 |
Sentence Similarity III |
|
Go . Doc |
Medium |
31% |
1814 |
Count Nice Pairs in an Array |
|
Go . Doc |
Medium |
39% |
1815 |
Maximum Number of Groups Getting Fresh Donuts |
|
Go . Doc |
Hard |
39% |
1816 |
Truncate Sentence |
|
Go . Doc |
Easy |
80% |
1817 |
Finding the Users Active Minutes |
|
Go . Doc |
Medium |
78% |
1818 |
Minimum Absolute Sum Difference |
|
Go . Doc |
Medium |
28% |
1819 |
Number of Different Subsequences GCDs |
|
Go . Doc |
Hard |
34% |
1820 |
Maximum Number of Accepted Invitations |
|
Go . Doc |
Medium |
47% |
1822 |
Sign of the Product of an Array |
|
Go . Doc |
Easy |
64% |
1823 |
Find the Winner of the Circular Game |
|
Go . Doc |
Medium |
72% |
1824 |
Minimum Sideway Jumps |
|
Go . Doc |
Medium |
47% |
1825 |
Finding MK Average |
|
Go . Doc |
Hard |
28% |
1826 |
Faulty Sensor |
|
Go . Doc |
Easy |
53% |
1827 |
Minimum Operations to Make the Array Increasing |
|
Go . Doc |
Easy |
77% |
1828 |
Queries on Number of Points Inside a Circle |
|
Go . Doc |
Medium |
86% |
1829 |
Maximum XOR for Each Query |
|
Go . Doc |
Medium |
74% |
1830 |
Minimum Number of Operations to Make String Sorted |
|
Go . Doc |
Hard |
46% |
1832 |
Check if the Sentence Is Pangram |
|
Go . Doc |
Easy |
82% |
1833 |
Maximum Ice Cream Bars |
|
Go . Doc |
Medium |
63% |
1834 |
Single-Threaded CPU |
|
Go . Doc |
Medium |
34% |
1835 |
Find XOR Sum of All Pairs Bitwise AND |
|
Go . Doc |
Hard |
56% |
1836 |
Remove Duplicates From an Unsorted Linked List |
|
Go . Doc |
Medium |
70% |
1837 |
Sum of Digits in Base K |
|
Go . Doc |
Easy |
74% |
1838 |
Frequency of the Most Frequent Element |
|
Go . Doc |
Medium |
33% |
1839 |
Longest Substring Of All Vowels in Order |
|
Go . Doc |
Medium |
47% |
1840 |
Maximum Building Height |
|
Go . Doc |
Hard |
34% |
1842 |
Next Palindrome Using Same Digits |
|
Go . Doc |
Hard |
63% |
1844 |
Replace All Digits with Characters |
|
Go . Doc |
Easy |
80% |
1845 |
Seat Reservation Manager |
|
Go . Doc |
Medium |
55% |
1846 |
Maximum Element After Decreasing and Rearranging |
|
Go . Doc |
Medium |
54% |
1847 |
Closest Room |
|
Go . Doc |
Hard |
31% |
1848 |
Minimum Distance to the Target Element |
|
Go . Doc |
Easy |
59% |
1849 |
Splitting a String Into Descending Consecutive Values |
|
Go . Doc |
Medium |
27% |
1850 |
Minimum Adjacent Swaps to Reach the Kth Smallest Number |
|
Go . Doc |
Medium |
64% |
1851 |
Minimum Interval to Include Each Query |
|
Go . Doc |
Hard |
43% |
1852 |
Distinct Numbers in Each Subarray |
|
Go . Doc |
Medium |
75% |
1854 |
Maximum Population Year |
|
Go . Doc |
Easy |
57% |
1855 |
Maximum Distance Between a Pair of Values |
|
Go . Doc |
Medium |
46% |
1856 |
Maximum Subarray Min-Product |
|
Go . Doc |
Medium |
33% |
1857 |
Largest Color Value in a Directed Graph |
|
Go . Doc |
Hard |
37% |
1858 |
Longest Word With All Prefixes |
|
Go . Doc |
Medium |
67% |
1859 |
Sorting the Sentence |
|
Go . Doc |
Easy |
82% |
1860 |
Incremental Memory Leak |
|
Go . Doc |
Medium |
69% |
1861 |
Rotating the Box |
|
Go . Doc |
Medium |
62% |
1862 |
Sum of Floored Pairs |
|
Go . Doc |
Hard |
27% |
1863 |
Sum of All Subset XOR Totals |
|
Go . Doc |
Easy |
77% |
1864 |
Minimum Number of Swaps to Make the Binary String Alternating |
|
Go . Doc |
Medium |
36% |
1865 |
Finding Pairs With a Certain Sum |
|
Go . Doc |
Medium |
46% |
1866 |
Number of Ways to Rearrange Sticks With K Sticks Visible |
|
Go . Doc |
Hard |
54% |
1868 |
Product of Two Run-Length Encoded Arrays |
|
Go . Doc |
Medium |
58% |
1869 |
Longer Contiguous Segments of Ones than Zeros |
|
Go . Doc |
Easy |
59% |
1870 |
Minimum Speed to Arrive on Time |
|
Go . Doc |
Medium |
32% |
1871 |
Jump Game VII |
|
Go . Doc |
Medium |
24% |
1872 |
Stone Game VIII |
|
Go . Doc |
Hard |
51% |
1874 |
Minimize Product Sum of Two Arrays |
|
Go . Doc |
Medium |
90% |
1876 |
Substrings of Size Three with Distinct Characters |
|
Go . Doc |
Easy |
68% |
1877 |
Minimize Maximum Pair Sum in Array |
|
Go . Doc |
Medium |
78% |
1878 |
Get Biggest Three Rhombus Sums in a Grid |
|
Go . Doc |
Medium |
43% |
1879 |
Minimum XOR Sum of Two Arrays |
|
Go . Doc |
Hard |
36% |
1880 |
Check if Word Equals Summation of Two Words |
|
Go . Doc |
Easy |
71% |
1881 |
Maximum Value after Insertion |
|
Go . Doc |
Medium |
33% |
1882 |
Process Tasks Using Servers |
|
Go . Doc |
Medium |
30% |
1883 |
Minimum Skips to Arrive at Meeting On Time |
|
Go . Doc |
Hard |
38% |
1884 |
Egg Drop With 2 Eggs and N Floors |
|
Go . Doc |
Medium |
70% |
1885 |
Count Pairs in Two Arrays |
|
Go . Doc |
Medium |
55% |
1886 |
Determine Whether Matrix Can Be Obtained By Rotation |
|
Go . Doc |
Easy |
53% |
1887 |
Reduction Operations to Make the Array Elements Equal |
|
Go . Doc |
Medium |
59% |
1888 |
Minimum Number of Flips to Make the Binary String Alternating |
|
Go . Doc |
Medium |
34% |
1889 |
Minimum Space Wasted From Packaging |
|
Go . Doc |
Hard |
29% |
1891 |
Cutting Ribbons |
|
Go . Doc |
Medium |
52% |
1893 |
Check if All the Integers in a Range Are Covered |
|
Go . Doc |
Easy |
49% |
1894 |
Find the Student that Will Replace the Chalk |
|
Go . Doc |
Medium |
38% |
1895 |
Largest Magic Square |
|
Go . Doc |
Medium |
49% |
1896 |
Minimum Cost to Change the Final Value of Expression |
|
Go . Doc |
Hard |
51% |
1897 |
Redistribute Characters to Make All Strings Equal |
|
Go . Doc |
Easy |
59% |
1898 |
Maximum Number of Removable Characters |
|
Go . Doc |
Medium |
32% |
1899 |
Merge Triplets to Form Target Triplet |
|
Go . Doc |
Medium |
59% |
1900 |
The Earliest and Latest Rounds Where Players Compete |
|
Go . Doc |
Hard |
49% |
1901 |
Find a Peak Element II |
|
Go . Doc |
Medium |
63% |
1902 |
Depth of BST Given Insertion Order |
|
Go . Doc |
Medium |
51% |
1903 |
Largest Odd Number in String |
|
Go . Doc |
Easy |
57% |
1904 |
The Number of Full Rounds You Have Played |
|
Go . Doc |
Medium |
50% |
1905 |
Count Sub Islands |
|
Go . Doc |
Medium |
60% |
1906 |
Minimum Absolute Difference Queries |
|
Go . Doc |
Medium |
41% |
1908 |
Game of Nim |
|
Go . Doc |
Medium |
63% |
1909 |
Remove One Element to Make the Array Strictly Increasing |
|
Go . Doc |
Easy |
31% |
1910 |
Remove All Occurrences of a Substring |
|
Go . Doc |
Medium |
73% |
1911 |
Maximum Alternating Subsequence Sum |
|
Go . Doc |
Medium |
57% |
1912 |
Design Movie Rental System |
|
Go . Doc |
Hard |
41% |
1913 |
Maximum Product Difference Between Two Pairs |
|
Go . Doc |
Easy |
83% |
1914 |
Cyclically Rotating a Grid |
|
Go . Doc |
Medium |
43% |
1915 |
Number of Wonderful Substrings |
|
Go . Doc |
Medium |
37% |
1916 |
Count Ways to Build Rooms in an Ant Colony |
|
Go . Doc |
Hard |
50% |
1918 |
Kth Smallest Subarray Sum |
|
Go . Doc |
Medium |
58% |
1920 |
Build Array from Permutation |
|
Go . Doc |
Easy |
94% |
1921 |
Eliminate Maximum Number of Monsters |
|
Go . Doc |
Medium |
37% |
1922 |
Count Good Numbers |
|
Go . Doc |
Medium |
38% |
1923 |
Longest Common Subpath |
|
Go . Doc |
Hard |
26% |
1924 |
Erect the Fence II |
|
Go . Doc |
Hard |
62% |
1925 |
Count Square Sum Triples |
|
Go . Doc |
Easy |
61% |
1926 |
Nearest Exit from Entrance in Maze |
|
Go . Doc |
Medium |
34% |
1927 |
Sum Game |
|
Go . Doc |
Medium |
43% |
1928 |
Minimum Cost to Reach Destination in Time |
|
Go . Doc |
Hard |
29% |
1929 |
Concatenation of Array |
|
Go . Doc |
Easy |
95% |
1930 |
Unique Length-3 Palindromic Subsequences |
|
Go . Doc |
Medium |
47% |
1931 |
Painting a Grid With Three Different Colors |
|
Go . Doc |
Hard |
52% |
1932 |
Merge BSTs to Create Single BST |
|
Go . Doc |
Hard |
31% |