| 1 |
Two Sum |
44.60% |
Easy |
| 2 |
Add Two Numbers |
31.90% |
Medium |
| 146 |
LRU Cache |
27.60% |
Medium |
| 4 |
Median of Two Sorted Arrays |
27.40% |
Hard |
| 200 |
Number of Islands |
43.10% |
Medium |
| 3 |
Longest Substring Without Repeating Characters |
28.90% |
Medium |
| 21 |
Merge Two Sorted Lists |
49.20% |
Easy |
| 20 |
Valid Parentheses |
37.30% |
Easy |
| 23 |
Merge k Sorted Lists |
36.30% |
Hard |
| 206 |
Reverse Linked List |
57.20% |
Easy |
| 297 |
Serialize and Deserialize Binary Tree |
42.90% |
Hard |
| 33 |
Search in Rotated Sorted Array |
33.20% |
Medium |
| 22 |
Generate Parentheses |
57.40% |
Medium |
| 202 |
Happy Number |
46.80% |
Easy |
| 49 |
Group Anagrams |
49.70% |
Medium |
| 380 |
Insert Delete GetRandom O(1) |
43.90% |
Medium |
| 54 |
Spiral Matrix |
31.60% |
Medium |
| 394 |
Decode String |
46.60% |
Medium |
| 336 |
Palindrome Pairs |
32.00% |
Hard |
| 17 |
Letter Combinations of a Phone Number |
43.20% |
Medium |
| 46 |
Permutations |
57.80% |
Medium |
| 41 |
First Missing Positive |
29.90% |
Hard |
| 138 |
Copy List with Random Pointer |
29.30% |
Medium |
| 344 |
Reverse String |
64.20% |
Easy |
| 155 |
Min Stack |
39.00% |
Easy |
| 212 |
Word Search II |
30.30% |
Hard |
| 218 |
The Skyline Problem |
32.50% |
Hard |
| 410 |
Split Array Largest Sum |
43.00% |
Hard |
| 642 |
Design Search Autocomplete System |
40.10% |
Hard |
| 771 |
Jewels and Stones |
83.70% |
Easy |
| 70 |
Climbing Stairs |
45.20% |
Easy |
| 236 |
Lowest Common Ancestor of a Binary Tree |
40.00% |
Medium |
| 24 |
Swap Nodes in Pairs |
46.60% |
Medium |
| 98 |
Validate Binary Search Tree |
26.40% |
Medium |
| 347 |
Top K Frequent Elements |
56.90% |
Medium |
| 283 |
Move Zeroes |
55.30% |
Easy |
| 67 |
Add Binary |
40.80% |
Easy |
| 14 |
Longest Common Prefix |
34.20% |
Easy |
| 240 |
Search a 2D Matrix II |
41.60% |
Medium |
| 37 |
Sudoku Solver |
39.00% |
Hard |
| 387 |
First Unique Character in a String |
50.70% |
Easy |
| 133 |
Clone Graph |
28.80% |
Medium |
| 150 |
Evaluate Reverse Polish Notation |
33.60% |
Medium |
| 706 |
Design HashMap |
57.40% |
Easy |
| 50 |
Pow(x, n) |
28.60% |
Medium |
| 234 |
Palindrome Linked List |
37.10% |
Easy |
| 167 |
Two Sum II - Input array is sorted |
51.50% |
Easy |
| 34 |
Find First and Last Position of Element in Sorted Array |
34.30% |
Medium |
| 426 |
Convert Binary Search Tree to Sorted Doubly Linked List |
54.50% |
Medium |
| 428 |
Serialize and Deserialize N-ary Tree |
55.60% |
Hard |
| 102 |
Binary Tree Level Order Traversal |
50.40% |
Medium |
| 430 |
Flatten a Multilevel Doubly Linked List |
44.10% |
Medium |
| 36 |
Valid Sudoku |
45.00% |
Medium |
| 105 |
Construct Binary Tree from Preorder and Inorder Traversal |
43.50% |
Medium |
| 173 |
Binary Search Tree Iterator |
50.90% |
Medium |
| 151 |
Reverse Words in a String |
18.00% |
Medium |
| 101 |
Symmetric Tree |
44.60% |
Easy |
| 69 |
Sqrt(x) |
32.20% |
Easy |
| 153 |
Find Minimum in Rotated Sorted Array |
43.70% |
Medium |
| 204 |
Count Primes |
29.90% |
Easy |
| 739 |
Daily Temperatures |
60.80% |
Medium |
| 346 |
Moving Average from Data Stream |
67.60% |
Easy |
| 498 |
Diagonal Traverse |
46.00% |
Medium |
| 349 |
Intersection of Two Arrays |
57.00% |
Easy |
| 509 |
Fibonacci Number |
66.70% |
Easy |
| 208 |
Implement Trie (Prefix Tree) |
41.00% |
Medium |
| 209 |
Minimum Size Subarray Sum |
35.70% |
Medium |
| 489 |
Robot Room Cleaner |
66.30% |
Hard |
| 232 |
Implement Queue using Stacks |
45.10% |
Easy |
| 287 |
Find the Duplicate Number |
51.20% |
Medium |
| 19 |
Remove Nth Node From End of List |
34.60% |
Medium |
| 84 |
Largest Rectangle in Histogram |
32.40% |
Hard |
| 350 |
Intersection of Two Arrays II |
49.20% |
Easy |
| 136 |
Single Number |
61.60% |
Easy |
| 26 |
Remove Duplicates from Sorted Array |
42.10% |
Easy |
| 141 |
Linked List Cycle |
38.30% |
Easy |
| 116 |
Populating Next Right Pointers in Each Node |
39.60% |
Medium |
| 912 |
Sort an Array |
62.90% |
Medium |
| 162 |
Find Peak Element |
41.90% |
Medium |
| 28 |
Implement strStr() |
33.00% |
Easy |
| 94 |
Binary Tree Inorder Traversal |
58.80% |
Medium |
| 250 |
Count Univalue Subtrees |
50.20% |
Medium |
| 203 |
Remove Linked List Elements |
36.50% |
Easy |
| 328 |
Odd Even Linked List |
50.60% |
Medium |
| 698 |
Partition to K Equal Sum Subsets |
43.80% |
Medium |
| 733 |
Flood Fill |
51.90% |
Easy |
| 189 |
Rotate Array |
31.70% |
Easy |
| 160 |
Intersection of Two Linked Lists |
35.90% |
Easy |
| 104 |
Maximum Depth of Binary Tree |
62.30% |
Easy |
| 557 |
Reverse Words in a String III |
65.60% |
Easy |
| 278 |
First Bad Version |
31.50% |
Easy |
| 708 |
Insert into a Cyclic Sorted List |
30.50% |
Medium |
| 77 |
Combinations |
50.10% |
Medium |
| 359 |
Logger Rate Limiter |
66.80% |
Easy |
| 108 |
Convert Sorted Array to Binary Search Tree |
53.00% |
Easy |
| 118 |
Pascal's Triangle |
48.20% |
Easy |
| 211 |
Add and Search Word - Data structure ds.design |
32.10% |
Medium |
| 703 |
Kth Largest Element in a Stream |
47.00% |
Easy |
| 117 |
Populating Next Right Pointers in Each Node II |
35.70% |
Medium |
| 542 |
01 Matrix |
37.00% |
Medium |
| 205 |
Isomorphic Strings |
38.30% |
Easy |
| 61 |
Rotate List |
28.10% |
Medium |
| 95 |
Unique Binary Search Trees II |
37.20% |
Medium |
| 66 |
Plus One |
41.70% |
Easy |
| 286 |
Walls and Gates |
50.80% |
Medium |
| 247 |
Strobogrammatic Number II |
45.50% |
Medium |
| 421 |
Maximum XOR of Two Numbers in an Array |
51.90% |
Medium |
| 225 |
Implement Stack using Queues |
41.00% |
Easy |
| 112 |
Path Sum |
38.80% |
Easy |
| 701 |
Insert into a Binary Search Tree |
77.20% |
Medium |
| 264 |
Ugly Number II |
37.60% |
Medium |
| 622 |
Design Circular Queue |
41.10% |
Medium |
| 707 |
Design Linked List |
20.90% |
Easy |
| 235 |
Lowest Common Ancestor of a Binary Search Tree |
46.50% |
Easy |
| 110 |
Balanced Binary Tree |
41.80% |
Easy |
| 270 |
Closest Binary Search Tree Value |
44.90% |
Easy |
| 658 |
Find K Closest Elements |
38.80% |
Medium |
| 220 |
Contains Duplicate III |
20.20% |
Medium |
| 144 |
Binary Tree Preorder Traversal |
52.80% |
Medium |
| 450 |
Delete Node in a BST |
40.80% |
Medium |
| 724 |
Find Pivot Index |
42.10% |
Easy |
| 705 |
Design HashSet |
56.00% |
Easy |
| 106 |
Construct Binary Tree from Inorder and Postorder Traversal |
41.30% |
Medium |
| 285 |
Inorder Successor in BST |
36.40% |
Medium |
| 217 |
Contains Duplicate |
53.50% |
Easy |
| 100 |
Same Tree |
50.90% |
Easy |
| 142 |
Linked List Cycle II |
33.70% |
Medium |
| 170 |
Two Sum III - Data structure ds.design |
31.70% |
Easy |
| 145 |
Binary Tree Postorder Traversal |
50.50% |
Hard |
| 652 |
Find Duplicate Subtrees |
47.10% |
Medium |
| 561 |
Array Partition I |
70.10% |
Easy |
| 431 |
Encode N-ary Tree to Binary Tree |
65.50% |
Hard |
| 841 |
Keys and Rooms |
61.40% |
Medium |
| 425 |
Word Squares |
45.50% |
Hard |
| 52 |
N-Queens II |
54.00% |
Hard |
| 494 |
Target Sum |
45.80% |
Medium |
| 367 |
Valid Perfect Square |
40.40% |
Easy |
| 219 |
Contains Duplicate II |
36.10% |
Easy |
| 454 |
4Sum II |
51.60% |
Medium |
| 704 |
Binary Search |
49.60% |
Easy |
| 27 |
Remove Element |
45.70% |
Easy |
| 429 |
N-ary Tree Level Order Traversal |
60.80% |
Easy |
| 119 |
Pascal's Triangle II |
45.40% |
Easy |
| 719 |
Find K-th Smallest Pair Distance |
30.00% |
Hard |
| 249 |
Group Shifted Strings |
50.10% |
Medium |
| 702 |
Search in a Sorted Array of Unknown Size |
61.80% |
Medium |
| 590 |
N-ary Tree Postorder Traversal |
68.90% |
Easy |
| 779 |
K-th Symbol in Grammar |
37.60% |
Medium |
| 374 |
Guess Number Higher or Lower |
40.50% |
Easy |
| 485 |
Max Consecutive Ones |
55.60% |
Easy |
| 752 |
Open the Lock |
47.60% |
Medium |
| 154 |
Find Minimum in Rotated Sorted Array II |
39.80% |
Hard |
| 559 |
Maximum Depth of N-ary Tree |
66.20% |
Easy |
| 648 |
Replace Words |
53.40% |
Medium |
| 599 |
Minimum Index Sum of Two Lists |
48.80% |
Easy |
| 589 |
N-ary Tree Preorder Traversal |
68.90% |
Easy |
| 288 |
Unique Word Abbreviation |
20.60% |
Medium |
| 747 |
Largest Number At Least Twice of Others |
40.90% |
Easy |
| 263 |
Ugly Number |
41.00% |
Easy |
| 700 |
Search in a Binary Search Tree |
69.40% |
Easy |
| 744 |
Find Smallest Letter Greater Than Target |
44.60% |
Easy |
| 677 |
Map Sum Pairs |
52.40% |
Medium |