| 468 |
Validate IP Address |
Medium |
Code |
0 ms |
2.0 MB |
| 467 |
Unique Substrings in Wraparound String |
Medium |
Code |
0 ms |
2.7 MB |
| 466 |
Count The Repetitions |
Hard |
Code |
2152 ms |
1.9 MB |
| 464 |
Can I Win |
Medium |
Code |
8 ms |
12.8 MB |
| 463 |
Island Perimeter |
Easy |
Code |
56 ms |
6.5 MB |
| 462 |
Minimum Moves to Equal Array Elements II |
Medium |
Code |
8 ms |
4.5 MB |
| 461 |
Hamming Distance |
Hard |
Code |
0 ms |
2.0 MB |
| 460 |
LFU Cache |
Hard |
Code |
136 ms |
16.8 MB |
| 459 |
Repeated Substring Pattern |
Easy |
Code |
4 ms |
6.0 MB |
| 458 |
Poor Pigs |
Hard |
Code |
0 ms |
1.9 MB |
| 457 |
Circular Array Loop |
Medium |
Code |
0 ms |
2.0 MB |
| 456 |
132 Pattern |
Medium |
Code |
8 ms |
5.6 MB |
| 455 |
Assign Cookies |
Easy |
Code |
32 ms |
6.0 MB |
| 454 |
4Sum II |
Medium |
Code |
52 ms |
18.5 MB |
| 453 |
Minimum Moves to Equal Array Elements |
Easy |
Code |
32 ms |
6.4 MB |
| 452 |
Minimum Number of Arrows to Burst Balloons |
Medium |
Code |
72 ms |
6.9 MB |
| 451 |
Sort Characters By Frequency |
Medium |
Code |
4 ms |
4.8 MB |
| 450 |
Delete Node in a BST |
Medium |
Code |
348 ms |
121.3 MB |
| 449 |
Serialize and Deserialize BST |
Medium |
Code |
180 ms |
57.9 MB |
| 448 |
Find All Numbers Disappeared in an Array |
Easy |
Code |
52 ms |
6.9 MB |
| 447 |
Number of Boomerangs |
Medium |
Code |
180 ms |
6.6 MB |
| 445 |
Add Two Numbers II |
Medium |
Code |
8 ms |
6.1 MB |
| 443 |
String Compression |
Medium |
Code |
4 ms |
2.9 MB |
| 442 |
Find All Duplicates in an Array |
Medium |
Code |
52 ms |
6.9 MB |
| 441 |
Arranging Coins |
Easy |
Code |
4 ms |
2.3 MB |
| 438 |
Find All Anagrams in a String |
Medium |
Code |
0 ms |
5.1 MB |
| 437 |
Path Sum III |
Medium |
Code |
4 ms |
5.0 MB |
| 436 |
Find Right Interval |
Medium |
Code |
40 ms |
6.7 MB |
| 435 |
Non-overlapping Intervals |
Medium |
Code |
4 ms |
4.1 MB |
| 434 |
Number of Segments in a String |
Easy |
Code |
0 ms |
1.9 MB |
| 433 |
Minimum Genetic Mutation |
Medium |
Code |
0 ms |
1.9 MB |
| 432 |
All O`one Data Structure |
Hard |
Code |
44 ms |
14.0 MB |
| 430 |
Flatten a Multilevel Doubly Linked List |
Medium |
Code |
0 ms |
2.7 MB |
| 429 |
N-ary Tree Level Order Traversal |
Medium |
Code |
0 ms |
4.2 MB |
| 427 |
Construct Quad Tree |
Medium |
Code |
8 ms |
6.1 MB |
| 424 |
Longest Repeating Character Replacement |
Medium |
Code |
0 ms |
2.6 MB |
| 423 |
Reconstruct Original Digits from English |
Medium |
Code |
0 ms |
5.1 MB |
| 421 |
Maximum XOR of Two Numbers in an Array |
Medium |
Code |
88 ms |
6.8 MB |
| 419 |
Battleships in a Board |
Medium |
Code |
0 ms |
2.4 MB |
| 417 |
Pacific Atlantic Water Flow |
Medium |
Code |
32 ms |
6.3 MB |
| 416 |
Partition Equal Subset Sum |
Medium |
Code |
8 ms |
2.5 MB |
| 415 |
Add Strings |
Easy |
Code |
0 ms |
2.5 MB |
| 414 |
Third Maximum Number |
Easy |
Code |
0 ms |
3.0 MB |
| 413 |
Arithmetic Slices |
Medium |
Code |
0 ms |
2.2 MB |
| 412 |
Fizz Buzz |
Easy |
Code |
4 ms |
4.1 MB |
| 410 |
Split Array Largest Sum |
Hard |
Code |
0 ms |
2.1 MB |
| 409 |
Longest Palindrome |
Easy |
Code |
0 ms |
2.1 MB |
| 406 |
Queue Reconstruction by Height |
Medium |
Code |
16 ms |
5.9 MB |
| 405 |
Convert a Number to Hexadecimal |
Easy |
Code |
0 ms |
1.9 MB |
| 404 |
Sum of Left Leaves |
Easy |
Code |
0 ms |
2.7 MB |
| 403 |
Frog Jump |
Hard |
Code |
64 ms |
6.9 MB |
| 402 |
Remove K Digits |
Medium |
Code |
0 ms |
2.5 MB |
| 401 |
Binary Watch |
Easy |
Code |
0 ms |
2.0 MB |
| 400 |
Nth Digit |
Medium |
Code |
0 ms |
2.0 MB |
| 399 |
Evaluate Division |
Medium |
Code |
0 ms |
2.1 MB |
| 398 |
Random Pick Index |
Medium |
Code |
96 ms |
7.9 MB |
| 397 |
Integer Replacement |
Medium |
Code |
9 ms |
1.9 MB |
| 396 |
Rotate Function |
Medium |
Code |
4 ms |
3.9 MB |
| 395 |
Longest Substring with At Least K Repeating Characters |
Medium |
Code |
0 ms |
3.3 MB |
| 394 |
Decode String |
Medium |
Code |
0 ms |
2.0 MB |
| 393 |
UTF-8 Validation |
Medium |
Code |
8 ms |
5.4 MB |
| 392 |
Is Subsequence |
Easy |
Code |
0 ms |
2.0 MB |
| 390 |
Elimination Game |
Easy |
Code |
0 ms |
2.8 MB |
| 389 |
Find the Difference |
Easy |
Code |
0 ms |
2.2 MB |
| 388 |
Longest Absolute File Path |
Medium |
Code |
0 ms |
2.0 MB |
| 387 |
First Unique Character in a String |
Easy |
Code |
8 ms |
5.7 MB |
| 386 |
Lexicographical Numbers |
Medium |
Code |
8 ms |
6.3 MB |
| 385 |
Mini Parser |
Medium |
Code |
4 ms |
5.1 MB |
| 384 |
Shuffle an Array |
Medium |
Code |
52 ms |
8.8 MB |
| 383 |
Ransom Note |
Easy |
Code |
4 ms |
4.3 MB |
| 382 |
Linked List Random Node |
Medium |
Code |
12 ms |
7.1 MB |
| 381 |
Insert Delete GetRandom O(1) - Duplicates allowed |
Hard |
Code |
28 ms |
7.7 MB |
| 380 |
Insert Delete GetRandom O(1) |
Medium |
Code |
28 ms |
7.6 MB |
| 378 |
Kth Smallest Element in a Sorted Matrix |
Medium |
Code |
20 ms |
6.3 MB |
| 377 |
Combination Sum IV |
Medium |
Code |
0 ms |
2.1 MB |
| 376 |
Wiggle Subsequence |
Medium |
Code |
0 ms |
2.1 MB |
| 375 |
Guess Number Higher or Lower II |
Medium |
Code |
12 ms |
4.7 MB |
| 374 |
Guess Number Higher or Lower |
Easy |
Code |
0 ms |
1.9 MB |
| 373 |
Find K Pairs with Smallest Sums |
Medium |
Code |
4 ms |
4.0 MB |
| 372 |
Super Pow |
Medium |
Code |
12 ms |
3.9 MB |
| 371 |
Sum of Two Integers |
Medium |
Code |
0 ms |
2.0 MB |
| 368 |
Largest Divisible Subset |
Medium |
Code |
44 ms |
5.1 MB |
| 367 |
Valid Perfect Square |
Easy |
Code |
0 ms |
1.9 MB |
| 365 |
Water and Jug Problem |
Hard |
Code |
0 ms |
1.9 MB |
| 363 |
Max Sum of Rectangle No Larger Than K |
Hard |
Code |
28 ms |
4.5 MB |
| 357 |
Count Numbers with Unique Digits |
Medium |
Code |
0 ms |
1.9 MB |
| 355 |
Design Twitter |
Medium |
Code |
44 ms |
11.5 MB |
| 354 |
Russian Doll Envelopes |
Hard |
Code |
24 ms |
6.2 MB |
| 352 |
Data Stream as Disjoint Intervals |
Hard |
Code |
36 ms |
16.9 MB |
| 350 |
Intersection of Two Arrays I |
Easy |
Code |
0 ms |
2.9 MB |
| 349 |
Intersection of Two Arrays |
Easy |
Code |
4 ms |
3.0 MB |
| 347 |
Top K Frequent Elements |
Medium |
Code |
12 ms |
5.8 MB |
| 345 |
Reverse Vowels of a String |
Easy |
Code |
0 ms |
4.0 MB |
| 344 |
Reverse String |
Easy |
Code |
32 ms |
6.3 MB |
| 343 |
Integer Break |
Medium |
Code |
0 ms |
1.9 MB |
| 342 |
Power of Four |
Medium |
Code |
0 ms |
2.1 MB |
| 341 |
Flatten Nested List Iterator |
Medium |
Code |
4 ms |
5.2 MB |
| 338 |
Counting Bits |
Medium |
Code |
4 ms |
4.4 MB |
| 337 |
House Robber III |
Medium |
Code |
4 ms |
5.2 MB |
| 336 |
Palindrome Pairs |
Hard |
Code |
132 ms |
10.8 MB |
| 335 |
Self Crossing |
Hard |
Code |
0 ms |
2.0 MB |
| 334 |
Increasing Triplet Subsequence |
Medium |
Code |
4 ms |
3.0 MB |
| 332 |
Reconstruct Itinerary |
Medium |
Code |
8 ms |
6.0 MB |
| 331 |
Verify Preorder Serialization of a Binary Tree |
Medium |
Code |
0 ms |
2.7 MB |
| 330 |
Patching Array |
Hard |
Code |
4 ms |
3.4 MB |
| 329 |
Longest Increasing Path in a Matrix |
Hard |
Code |
32 ms |
6.3 MB |
| 328 |
Odd Even Linked List |
Medium |
Code |
4 ms |
3.3 MB |
| 327 |
Count of Range Sum |
Hard |
Code |
12 ms |
6.1 MB |
| 326 |
Power of Three |
Easy |
Code |
16 ms |
6.1 MB |
| 324 |
Wiggle Sort II |
Medium |
Code |
20 ms |
6.2 MB |
| 322 |
Coin Change |
Medium |
Code |
28 ms |
6.2 MB |
| 321 |
Create Maximum Number |
Hard |
Code |
8 ms |
6.5 MB |
| 319 |
Bulb Switcher |
Medium |
Code |
0 ms |
1.9 MB |
| 318 |
Maximum Product of Word Lengths |
Medium |
Code |
8 ms |
6.0 MB |
| 316 |
Remove Duplicate Letters |
Hard |
Code |
0 ms |
2.1 MB |
| 315 |
Count of Smaller Numbers After Self |
Hard |
Code |
8 ms |
6.4 MB |
| 313 |
Super Ugly Number |
Medium |
Code |
8 ms |
3.1 MB |
| 312 |
Burst Balloons |
Hard |
Code |
4 ms |
2.9 MB |
| 310 |
Minimum Height Trees |
Medium |
Code |
36 ms |
7.3 MB |
| 309 |
Best Time to Buy and Sell Stock with Cooldown |
Medium |
Code |
0 ms |
2.4 MB |
| 307 |
Range Sum Query - Mutable |
Medium |
Code |
60 ms |
8.8 MB |
| 306 |
Additive Number |
Medium |
Code |
0 ms |
1.9 MB |
| 304 |
Range Sum Query 2D - Immutable |
Medium |
Code |
36 ms |
8.2 MB |
| 303 |
Range Sum Query - Immutable |
Easy |
Code |
28 ms |
8.3 MB |
| 301 |
Remove Invalid Parentheses |
Hard |
Code |
0 ms |
2.4 MB |
| 300 |
Longest Increasing Subsequence |
Medium |
Code |
0 ms |
2.4 MB |
| 299 |
Bulls and Cows |
Easy |
Code |
0 ms |
2.2 MB |
| 297 |
Serialize and Deserialize Binary Tree |
Hard |
Code |
228 ms |
183.3 MB |
| 295 |
Find Median from Data Stream |
Hard |
Code |
104 ms |
16.3 MB |
| 292 |
Nim Game |
Easy |
Code |
0 ms |
2.0 MB |
| 290 |
Word Pattern |
Easy |
Code |
0 ms |
2.0 MB |
| 289 |
Game of Life |
Medium |
Code |
0 ms |
2.0 MB |
| 287 |
Find the Duplicate Number |
Medium |
Code |
4 ms |
3.8 MB |
| 284 |
Peeking Iterator |
Medium |
Code |
0 ms |
2.5 MB |
| 283 |
Move Zeroes |
Easy |
Code |
4 ms |
3.8 MB |
| 282 |
Expression Add Operators |
Hard |
Code |
12 ms |
3.5 MB |
| 279 |
Perfect Squares |
Medium |
Code |
36 ms |
5.8 MB |
| 278 |
First Bad Version |
Easy |
Code |
0 ms |
1.9 MB |
| 275 |
H-Index II |
Medium |
Code |
12 ms |
6.2 MB |
| 274 |
H-Index |
Medium |
Code |
0 ms |
2.3 MB |
| 273 |
Integer to English Words |
Hard |
Code |
0 ms |
6.1 MB |
| 268 |
Missing Number |
Easy |
Code |
16 ms |
6.0 MB |
| 264 |
Ugly Number II |
Medium |
Code |
0 ms |
4.1 MB |
| 263 |
Ugly Number |
Easy |
Code |
0 ms |
2.1 MB |
| 260 |
Single Number III |
Medium |
Code |
4 ms |
4.2 MB |
| 258 |
Add Digits |
Easy |
Code |
0 ms |
2.2 MB |
| 257 |
Binary Tree Paths |
Easy |
Code |
0 ms |
2.3 MB |
| 242 |
Valid Anagram |
Easy |
Code |
0 ms |
3.0 MB |
| 241 |
Different Ways to Add Parentheses |
Medium |
Code |
0 ms |
2.4 MB |
| 240 |
Search a 2D Matrix II |
Medium |
Code |
20 ms |
6.2 MB |
| 239 |
Sliding Window Maximum |
Hard |
Code |
40 ms |
7.2 MB |
| 238 |
Product of Array Except Self |
Medium |
Code |
0 ms |
2.9 MB |
| 237 |
Delete Node in a Linked List |
Easy |
Code |
0 ms |
2.9 MB |
| 236 |
Lowest Common Ancestor of a Binary Tree |
Medium |
Code |
20 ms |
7.8 MB |
| 235 |
Lowest Common Ancestor of a Binary Search Tree |
Easy |
Code |
20 ms |
6.8 MB |
| 234 |
Palindrome Linked List |
Easy |
Code |
12 ms |
6.1 MB |
| 233 |
Number of Digit One |
Hard |
Code |
0 ms |
2.1 MB |
| 232 |
Implement Queue using Stacks |
Easy |
Code |
0 ms |
2.0 MB |
| 231 |
Power of Two |
Easy |
Code |
0 ms |
2.2 MB |
| 230 |
Kth Smallest Element in a BST |
Medium |
Code |
6 ms |
6.0 MB |
| 229 |
Majority Element II |
Medium |
Code |
12 ms |
5.1 MB |
| 228 |
Summary Ranges |
Medium |
Code |
0 ms |
2.0 MB |
| 227 |
Basic Calculator II |
Medium |
Code |
0 ms |
3.0 MB |
| 226 |
Invert Binary Tree |
Easy |
Code |
0 ms |
2.2 MB |
| 225 |
Implement Stack using Queues |
Easy |
Code |
0 ms |
2.0 MB |
| 224 |
Basic Calculator |
Hard |
Code |
0 ms |
3.2 MB |
| 223 |
Rectangle Area |
Medium |
Code |
12 ms |
6.1 MB |
| 222 |
Count Complete Tree Nodes |
Medium |
Code |
16 ms |
6.4 MB |
| 221 |
Maximal Square |
Medium |
Code |
0 ms |
3.5 MB |
| 220 |
Contains Duplicate III |
Medium |
Code |
4 ms |
4.1 MB |
| 219 |
Contains Duplicate II |
Easy |
Code |
12 ms |
6.5 MB |
| 218 |
The Skyline Problem |
Hard |
Code |
24 ms |
6.5 MB |
| 217 |
Contains Duplicate |
Easy |
Code |
20 ms |
7.4 MB |
| 216 |
Combination Sum III |
Medium |
Code |
0 ms |
2.1 MB |
| 215 |
Kth Largest Element in an Array |
Medium |
Code |
8 ms |
3.6 MB |
| 214 |
Shortest Palindrome |
Hard |
Code |
0 ms |
3.3 MB |
| 213 |
House Robber II |
Medium |
Code |
0 ms |
2.1 MB |
| 212 |
Word Search II |
Hard |
Code |
28 ms |
14.8 MB |
| 211 |
Add and Search Word - Data structure design |
Medium |
Code |
88 ms |
14.6 MB |
| 210 |
Course Schedule II |
Medium |
Code |
16 ms |
6.3 MB |
| 209 |
Minimum Size Subarray Sum |
Medium |
Code |
8 ms |
3.9 MB |
| 208 |
Implement Trie (Prefix Tree) |
Medium |
Code |
48 ms |
15.9 MB |
| 207 |
Course Schedule |
Medium |
Code |
16 ms |
5.9 MB |
| 206 |
Reverse Linked List |
Easy |
Code |
0 ms |
2.6 MB |
| 205 |
Isomorphic Strings |
Easy |
Code |
0 ms |
2.7 MB |
| 204 |
Count Primes |
Easy |
Code |
4 ms |
4.9 MB |
| 203 |
Remove Linked List Elements |
Easy |
Code |
8 ms |
4.7 MB |
| 202 |
Happy Number |
Easy |
Code |
0 ms |
2.1 MB |
| 201 |
Bitwise AND of Numbers Range |
Medium |
Code |
8 ms |
6.1 MB |
| 200 |
Number of Islands |
Medium |
Code |
0 ms |
2.2 MB |
| 199 |
Binary Tree Right Side View |
Medium |
Code |
0 ms |
2.2 MB |
| 198 |
House Robber |
Easy |
Code |
0 ms |
2.0 MB |
| 191 |
Number of 1 Bits |
Easy |
Code |
0 ms |
2.0 MB |
| 190 |
Reverse Bits |
Easy |
Code |
0 ms |
2.5 MB |
| 189 |
Rotate Array |
Easy |
Code |
4 ms |
3.2 MB |
| 188 |
Best Time to Buy and Sell Stock IV |
Hard |
Code |
4 ms |
3.8 MB |
| 187 |
Repeated DNA Sequences |
Medium |
Code |
4 ms |
7.2 MB |
| 179 |
Largest Number |
Medium |
Code |
4 ms |
2.7 MB |
| 174 |
Dungeon Game |
Hard |
Code |
4 ms |
3.4 MB |
| 173 |
Binary Search Tree Iterator |
Medium |
Code |
40 ms |
12.6 MB |
| 172 |
Factorial Trailing Zeroes |
Easy |
Code |
0 ms |
2.0 MB |
| 171 |
Excel Sheet Column Number |
Easy |
Code |
0 ms |
2.2 MB |
| 169 |
Majority Element |
Easy |
Code |
16 ms |
6.0 MB |
| 168 |
Excel Sheet Column Title |
Easy |
Code |
0 ms |
2.0 MB |
| 167 |
Two Sum II - Input array is sorted |
Easy |
Code |
4 ms |
3.0 MB |
| 166 |
Fraction to Recurring Decimal |
Medium |
Code |
0 ms |
2.1 MB |
| 165 |
Compare Version Numbers |
Medium |
Code |
0 ms |
2.0 MB |
| 164 |
Maximum Gap |
Hard |
Code |
4 ms |
3.4 MB |
| 162 |
Find Peak Element |
Easy |
Code |
0 ms |
2.8 MB |
| 160 |
Intersection of Two Linked Lists |
Easy |
Code |
36 ms |
8.4 MB |
| 155 |
Min Stack |
Easy |
Code |
16 ms |
7.8 MB |
| 154 |
Find Minimum in Rotated Sorted Array II |
Hard |
Code |
4 ms |
3.1 MB |
| 153 |
Find Minimum in Rotated Sorted Array |
Medium |
Code |
0 ms |
2.5 MB |
| 152 |
Maximum Product Subarray |
Medium |
Code |
0 ms |
2.7 MB |
| 151 |
Reverse Words in a String |
Medium |
Code |
0 ms |
3.4 MB |
| 150 |
Evaluate Reverse Polish Notation |
Medium |
Code |
4 ms |
4.2 MB |
| 149 |
Max Points on a Line |
Hard |
Code |
56 ms |
6.8 MB |
| 148 |
Insertion Sort List |
Medium |
Code |
12 ms |
5.1 MB |
| 147 |
Insertion Sort List |
Medium |
Code |
4 ms |
3.3 MB |
| 146 |
LRU Cache |
Medium |
Code |
108 ms |
16.8 MB |
| 145 |
Binary Tree Postorder Traversal |
Hard |
Code |
0 ms |
2.0 MB |
| 144 |
Binary Tree Preorder Traversal |
Medium |
Code |
0 ms |
2.0 MB |
| 143 |
Reorder List |
Medium |
Code |
8 ms |
5.4 MB |
| 142 |
Linked List Cycle II |
Medium |
Code |
4 ms |
3.8 MB |
| 141 |
Linked List Cycle |
Easy |
Code |
4 ms |
3.8 MB |
| 140 |
Word Break II |
Hard |
Code |
4 ms |
2.6 MB |
| 139 |
Word Break |
Medium |
Code |
0 ms |
2.1 MB |
| 138 |
Copy List with Random Pointer |
Medium |
Code |
0 ms |
3.4 MB |
| 137 |
Single Number II |
Medium |
Code |
4 ms |
3.6 MB |
| 136 |
Single Number |
Easy |
Code |
8 ms |
4.7 MB |
| 135 |
Candy |
Hard |
Code |
16 ms |
6.0 MB |
| 134 |
Gas Station |
Medium |
Code |
4 ms |
3.0 MB |
| 133 |
Clone Graph |
Medium |
Code |
0 ms |
2.7 MB |
| 132 |
Palindrome Partitioning II |
Hard |
Code |
8 ms |
5.2 MB |
| 131 |
Palindrome Partitioning |
Medium |
Code |
12 ms |
6.5 MB |
| 130 |
Surrounded Regions |
Medium |
Code |
24 ms |
6.0 MB |
| 129 |
Sum Root to Leaf Numbers |
Medium |
Code |
0 ms |
2.4 MB |
| 128 |
Longest Consecutive Sequence |
Hard |
Code |
4 ms |
3.9 MB |
| 127 |
Word Ladder |
Medium |
Code |
52 ms |
7.6 MB |
| 126 |
Word Ladder II |
Hard |
Code |
48 ms |
6.4 MB |
| 125 |
Valid Palindrome |
Easy |
Code |
0 ms |
2.7 MB |
| 124 |
Binary Tree Maximum Path Sum |
Hard |
Code |
16 ms |
6.7 MB |
| 123 |
Best Time to Buy and Sell Stock III |
Hard |
Code |
4 ms |
3.1 MB |
| 122 |
Best Time to Buy and Sell Stock II |
Easy |
Code |
4 ms |
3.1 MB |
| 121 |
Best Time to Buy and Sell Stock |
Easy |
Code |
4 ms |
3.1 MB |
| 120 |
Triangle |
Medium |
Code |
4 ms |
3.1 MB |
| 119 |
Pascal's Triangle II |
Easy |
Code |
0 ms |
2.0 MB |
| 118 |
Pascal's Triangle |
Easy |
Code |
0 ms |
2.0 MB |
| 117 |
Populating Next Right Pointers in Each Node II |
Medium |
Code |
4 ms |
5.9 MB |
| 116 |
Populating Next Right Pointers in Each Node |
Medium |
Code |
4 ms |
6.1 MB |
| 115 |
Distinct Subsequences |
Hard |
Code |
0 ms |
2.0 MB |
| 114 |
Flatten Binary Tree to Linked List |
Medium |
Code |
4 ms |
6.9 MB |
| 113 |
Path Sum II |
Medium |
Code |
4 ms |
4.4 MB |
| 112 |
Path Sum |
Easy |
Code |
4 ms |
4.8 MB |
| 111 |
Minimum Depth of Binary Tree |
Easy |
Code |
4 ms |
5.3 MB |
| 110 |
Balanced Binary Tree |
Easy |
Code |
4 ms |
5.7 MB |
| 109 |
Convert Sorted List to Binary Search Tree |
Medium |
Code |
488 ms |
154.6 MB |
| 108 |
Convert Sorted Array to Binary Search Tree |
Easy |
Code |
92 ms |
185.1 MB |
| 107 |
Binary Tree Level Order Traversal II |
Easy |
Code |
0 ms |
2.8 MB |
| 106 |
Construct Binary Tree from Inorder and Postorder Traversal |
Medium |
Code |
20 ms |
9.7 MB |
| 105 |
Construct Binary Tree from Preorder and Inorder Traversal |
Medium |
Code |
16 ms |
9.8 MB |
| 104 |
Maximum Depth of Binary Tree |
Easy |
Code |
4 ms |
4.4 MB |
| 103 |
Binary Tree Zigzag Level Order Traversal |
Medium |
Code |
0 ms |
2.5 MB |
| 102 |
Binary Tree Level Order Traversal |
Medium |
Code |
0 ms |
2.8 MB |
| 101 |
Symmetric Tree |
Easy |
Code |
0 ms |
2.9 MB |
| 100 |
Same Tree |
Easy |
Code |
0 ms |
2.1 MB |
| 99 |
Recover Binary Search Tree |
Hard |
Code |
12 ms |
8.1 MB |
| 98 |
Validate Binary Search Tree |
Medium |
Code |
4 ms |
5.5 MB |
| 97 |
Interleaving String |
Hard |
Code |
0 ms |
2.4 MB |
| 96 |
Unique Binary Search Trees |
Medium |
Code |
0 ms |
1.9 MB |
| 95 |
Unique Binary Search Trees II |
Medium |
Code |
4 ms |
5.2 MB |
| 94 |
Binary Tree Inorder Traversal |
Medium |
Code |
0 ms |
2.0 MB |
| 93 |
Restore IP Addresses |
Medium |
Code |
0 ms |
2.6 MB |
| 92 |
Reverse Linked List II |
Medium |
Code |
0 ms |
2.1 MB |
| 91 |
Decode Ways |
Medium |
Code |
0 ms |
2.0 MB |
| 90 |
Subsets II |
Medium |
Code |
0 ms |
2.4 MB |
| 89 |
Merge Sorted Array |
Medium |
Code |
0 ms |
2.2 MB |
| 88 |
Merge Sorted Array |
Easy |
Code |
0 ms |
2.3 MB |
| 87 |
Scramble String |
Hard |
Code |
0 ms |
2.1 MB |
| 86 |
Partition List |
Medium |
Code |
0 ms |
2.4 MB |
| 85 |
Maximal Rectangle |
Hard |
Code |
0 ms |
3.4 MB |
| 84 |
Largest Rectangle in Histogram |
Hard |
Code |
8 ms |
4.4 MB |
| 83 |
Remove Duplicates from Sorted List |
Easy |
Code |
4 ms |
3.1 MB |
| 82 |
Remove Duplicates from Sorted List II |
Medium |
Code |
4 ms |
3.1 MB |
| 81 |
Search in Rotated Sorted Array II |
Medium |
Code |
4 ms |
3.2 MB |
| 80 |
Remove Duplicates from Sorted Array II |
Medium |
Code |
4 ms |
3.0 MB |
| 79 |
Word Search |
Medium |
Code |
4 ms |
3.5 MB |
| 78 |
Subsets |
Medium |
Code |
0 ms |
2.3 MB |
| 77 |
Combinations |
Medium |
Code |
4 ms |
6.9 MB |
| 76 |
Minimum Window Substring |
Hard |
Code |
0 ms |
3.0 MB |
| 75 |
Sort Colors |
Medium |
Code |
0 ms |
2.1 MB |
| 74 |
Search a 2D Matrix |
Medium |
Code |
4 ms |
3.8 MB |
| 73 |
Set Matrix Zeroes |
Medium |
Code |
12 ms |
6.0 MB |
| 72 |
Edit Distance |
Hard |
Code |
0 ms |
2.7 MB |
| 71 |
Simplify Path |
Medium |
Code |
0 ms |
3.0 MB |
| 70 |
Climb Stairs |
Easy |
Code |
0 ms |
2.0 MB |
| 69 |
Sqrt(x) |
Easy |
Code |
0 ms |
2.2 MB |
| 68 |
Text Justification |
Hard |
Code |
0 ms |
2.2 MB |
| 67 |
Add Binary |
Easy |
Code |
0 ms |
2.6 MB |
| 66 |
Plus One |
Easy |
Code |
0 ms |
2.0 MB |
| 65 |
Valid Number |
Hard |
Code |
0 ms |
2.3 MB |
| 64 |
Minimum Path Sum |
Medium |
Code |
8 ms |
3.9 MB |
| 63 |
Unique Paths II |
Medium |
Code |
0 ms |
2.7 MB |
| 62 |
Unique Paths |
Medium |
Code |
0 ms |
2.0 MB |
| 61 |
Rotate List |
Medium |
Code |
0 ms |
2.5 MB |
| 60 |
Permutation Sequence |
Medium |
Code |
0 ms |
2.0 MB |
| 59 |
Spiral Matrix II |
Medium |
Code |
0 ms |
2.1 MB |
| 58 |
Length of Last Word |
Easy |
Code |
0 ms |
2.1 MB |
| 57 |
Insert Interval |
Hard |
Code |
8 ms |
4.8 MB |
| 56 |
Merge Intervals |
Medium |
Code |
4 ms |
4.7 MB |
| 55 |
Jump Game |
Medium |
Code |
4 ms |
4.2 MB |
| 54 |
Spiral Matrix |
Medium |
Code |
0 ms |
2.0 MB |
| 53 |
Maximum Subarray |
Easy |
Code |
4 ms |
3.3 MB |
| 52 |
N-Queens II |
Hard |
Code |
0 ms |
1.9 MB |
| 51 |
N-Queens |
Hard |
Code |
0 ms |
3.2 MB |
| 50 |
Pow(x, n) |
Medium |
Code |
0 ms |
2.0 MB |
| 49 |
Group Anagrams |
Medium |
Code |
16 ms |
6.8 MB |
| 48 |
Rotate Image |
Medium |
Code |
0 ms |
2.2 MB |
| 47 |
Permutations II |
Medium |
Code |
0 ms |
3.7 MB |
| 46 |
Permutations |
Medium |
Code |
0 ms |
2.6 MB |
| 45 |
Jump Game II |
Hard |
Code |
4 ms |
4.3 MB |
| 44 |
Wildcard Matching |
Hard |
Code |
0 ms |
3.1 MB |
| 43 |
Multiply Strings |
Medium |
Code |
0 ms |
2.2 MB |
| 42 |
Trapping Rain Water |
Hard |
Code |
0 ms |
2.8 MB |
| 41 |
First Missing Positive |
Hard |
Code |
0 ms |
2.2 MB |
| 40 |
Combination Sum II |
Medium |
Code |
0 ms |
3.1 MB |
| 39 |
Combination Sum |
Medium |
Code |
0 ms |
3.1 MB |
| 38 |
Count and Say |
Easy |
Code |
0 ms |
2.1 MB |
| 37 |
Sudoku Solver |
Hard |
Code |
0 ms |
2.1 MB |
| 36 |
Valid Sudoku |
Medium |
Code |
0 ms |
2.8 MB |
| 35 |
Search Insert Position |
Easy |
Code |
0 ms |
3.1 MB |
| 34 |
Find First and Last Position of Element in Sorted Array |
Medium |
Code |
8 ms |
4.1 MB |
| 33 |
Search in Rotated Sorted Array |
Medium |
Code |
0 ms |
2.6 MB |
| 32 |
Longest Valid Parentheses |
Hard |
Code |
0 ms |
2.8 MB |
| 31 |
Next Permutation |
Medium |
Code |
0 ms |
3.4 MB |
| 30 |
Substring with Concatenation of All Words |
Hard |
Code |
4 ms |
3.2 MB |
| 29 |
Divide Two Integers |
Medium |
Code |
0 ms |
2.4 MB |
| 28 |
Implement strStr() |
Easy |
Code |
0 ms |
2.4 MB |
| 27 |
Remove Element |
Easy |
Code |
0 ms |
2.4 MB |
| 26 |
Remove Duplicates from Sorted Array |
Easy |
Code |
44 ms |
7.5 MB |
| 25 |
Reverse Nodes in k-Group |
Hard |
Code |
4 ms |
3.7 MB |
| 24 |
Swap Nodes in Pairs |
Medium |
Code |
0 ms |
2.1 MB |
| 23 |
Merge k Sorted Lists |
Hard |
Code |
4 ms |
5.3 MB |
| 22 |
Generate Parentheses |
Medium |
Code |
4 ms |
8.1 MB |
| 21 |
Merge Two Sorted Lists |
Easy |
Code |
0 ms |
2.5 MB |
| 20 |
Valid Parentheses |
Easy |
Code |
0 ms |
2.0 MB |
| 19 |
Remove Nth Node From End of List |
Medium |
Code |
0 ms |
2.2 MB |
| 18 |
4Sum |
Medium |
Code |
8 ms |
3.1 MB |
| 17 |
Letter Combinations of a Phone Number |
Medium |
Code |
0 ms |
2.5 MB |
| 16 |
3Sum Closest |
Medium |
Code |
4 ms |
2.7 MB |
| 15 |
3Sum |
Medium |
Code |
820 ms |
174.0 MB |
| 14 |
Longest Common Prefix |
Easy |
Code |
0 ms |
2.4 MB |
| 13 |
Roman to Integer |
Easy |
Code |
0 ms |
3.0 MB |
| 12 |
Integer to Roman |
Medium |
Code |
4 ms |
3.4 MB |
| 11 |
Container With Most Water |
Medium |
Code |
12 ms |
5.6 MB |
| 10 |
Regular Expression Matching |
Hard |
Code |
0 ms |
2.2 MB |
| 9 |
Palindrome Number |
Easy |
Code |
0 ms |
5.0 MB |
| 8 |
String to Integer (atoi) |
Medium |
Code |
0 ms |
2.3 MB |
| 7 |
Reverse Integer |
Easy |
Code |
0 ms |
2.2 MB |
| 6 |
ZigZag Conversion |
Medium |
Code |
0 ms |
4.2 MB |
| 5 |
Longest Palindromic Substring |
Medium |
Code |
0 ms |
2.2 MB |
| 4 |
Median of Two Sorted Arrays |
Hard |
Code |
8 ms |
5.5 MB |
| 3 |
Longest Substring Without Repeating Characters |
Medium |
Code |
0 ms |
2.6 MB |
| 2 |
Add Two Numbers |
Medium |
Code |
8 ms |
4.9 MB |
| 1 |
Two Sum |
Easy |
Code |
4 ms |
3.7 MB |