# |
Title |
Acceptance |
Difficulty |
1 |
Two Sum |
38.80% |
Easy |
2 |
Add Two Numbers |
29.10% |
Medium |
3 |
Longest Substring Without Repeating Characters |
25.00% |
Medium |
4 |
Median of Two Sorted Arrays |
23.70% |
Hard |
5 |
Longest Palindromic Substring |
25.60% |
Medium |
10 |
Regular Expression Matching |
24.40% |
Hard |
11 |
Container With Most Water |
38.30% |
Medium |
15 |
3Sum |
22.00% |
Medium |
17 |
Letter Combinations of a Phone Number |
37.80% |
Medium |
19 |
Remove Nth Node From End of List |
33.70% |
Medium |
20 |
Valid Parentheses |
34.50% |
Easy |
21 |
Merge Two Sorted Lists |
42.90% |
Easy |
22 |
Generate Parentheses |
49.90% |
Medium |
23 |
Merge k Sorted Lists |
29.90% |
Hard |
32 |
Longest Valid Parentheses |
23.70% |
Hard |
33 |
Search in Rotated Sorted Array |
32.00% |
Medium |
34 |
Find First and Last Position of Element in Sorted Array |
32.00% |
Medium |
35 |
Search Insert Position |
40.00% |
Easy |
39 |
Combination Sum |
43.30% |
Medium |
42 |
Trapping Rain Water |
38.90% |
Hard |
46 |
Permutations |
49.50% |
Medium |
48 |
Rotate Image |
43.70% |
Medium |
49 |
Group Anagrams |
40.80% |
Medium |
53 |
Maximum Subarray |
41.10% |
Easy |
55 |
Jump Game |
30.10% |
Medium |
56 |
Merge Intervals |
32.90% |
Medium |
62 |
Unique Paths |
44.10% |
Medium |
64 |
Minimum Path Sum |
42.60% |
Medium |
70 |
Climbing Stairs |
42.00% |
Easy |
72 |
Edit Distance |
33.90% |
Hard |
75 |
Sort Colors |
39.80% |
Medium |
76 |
Minimum Window Substring |
27.90% |
Hard |
78 |
Subsets |
47.20% |
Medium |
79 |
Word Search |
28.80% |
Medium |
84 |
Largest Rectangle in Histogram |
28.50% |
Hard |
85 |
Maximal Rectangle |
30.60% |
Hard |
94 |
Binary Tree Inorder Traversal |
51.80% |
Medium |
96 |
Unique Binary Search Trees |
43.10% |
Medium |
98 |
Validate Binary Search Tree |
24.40% |
Medium |
100 |
Same Tree |
48.40% |
Easy |
101 |
Symmetric Tree |
41.30% |
Easy |
102 |
Binary Tree Level Order Traversal |
44.30% |
Medium |
104 |
Maximum Depth of Binary Tree |
56.60% |
Easy |
105 |
Construct Binary Tree from Preorder and Inorder Traversal |
36.20% |
Medium |
114 |
Flatten Binary Tree to Linked List |
38.20% |
Medium |
121 |
Best Time to Buy and Sell Stock |
44.10% |
Easy |
124 |
Binary Tree Maximum Path Sum |
27.80% |
Hard |
128 |
Longest Consecutive Sequence |
39.20% |
Hard |
136 |
Single Number |
56.80% |
Easy |
139 |
Word Break |
32.40% |
Me |
41 |
Linked List Cycle |
34.80% |
Easy |
142 |
Linked List Cycle II |
30.00% |
Medium |
146 |
LRU Cache |
21.10% |
Hard |
148 |
Sort List |
31.50% |
Medium |
152 |
Maximum Product Subarray |
27.30% |
Medium |
155 |
Min Stack |
32.90% |
Easy |
160 |
Intersection of Two Linked Lists |
30.80% |
Easy |
169 |
Majority Element |
49.30% |
Easy |
198 |
House Robber |
40.40% |
Easy |
200 |
Number of Islands |
37.80% |
Medium |
206 |
Reverse Linked List |
48.90% |
Easy |
207 |
Course Schedule |
34.70% |
Medium |
208 |
Implement Trie (Prefix Tree) |
33.10% |
Medium |
215 |
Kth Largest Element in an Array |
42.40% |
Medium |
218 |
The Skyline Problem |
29.80% |
Hard |
221 |
Maximal Square |
31.00% |
Medium |
226 |
Invert Binary Tree |
54.80% |
Easy |
234 |
Palindrome Linked List |
34.10% |
Easy |
236 |
Lowest Common Ancestor of a Binary Tree |
31.40% |
Medium |
238 |
Product of Array Except Self |
51.40% |
Medium |
239 |
Sliding Window Maximum |
35.10% |
Hard |
240 |
Search a 2D Matrix II |
39.30% |
Medium |
279 |
Perfect Squares |
38.60% |
Medium |
283 |
Move Zeroes |
52.20% |
Easy |
287 |
Find the Duplicate Number |
45.70% |
Medium |
297 |
Serialize and Deserialize Binary Tree |
36.30% |
Hard |
300 |
Longest Increasing Subsequence |
39.20% |
Medium |
309 |
Best Time to Buy and Sell Stock with Cooldown |
42.60% |
Medium |
312 |
Burst Balloons |
44.30% |
Hard |
322 |
Coin Change |
27.20% |
Medium |
337 |
House Robber III |
45.70% |
Medium |
338 |
Counting Bits |
62.80% |
Medium |
347 |
Top K Frequent Elements |
50.70% |
Medium |
394 |
Decode String |
42.20% |
Medium |
406 |
Queue Reconstruction by Height |
56.80% |
Medium |
416 |
Partition Equal Subset Sum |
38.70% |
Medium |
437 |
Path Sum III |
40.40% |
Easy |
438 |
Find All Anagrams in a String |
34.20% |
Easy |
448 |
Find All Numbers Disappeared in an Array |
51.40% |
Easy |
461 |
Hamming Distance |
69.50% |
Easy |
494 |
Target Sum |
44.00% |
Medium |
538 |
Convert BST to Greater Tree |
48.80% |
Easy |
543 |
Diameter of Binary Tree |
45.10% |
Easy |
560 |
Subarray Sum Equals K |
39.90% |
Medium |
572 |
Subtree of Another Tree |
40.40% |
Easy |
581 |
Shortest Unsorted Continuous Subarray |
29.30% |
Easy |
617 |
Merge Two Binary Trees |
68.30% |
Easy |
621 |
Task Scheduler |
42.70% |
Medium |
647 |
Palindromic Substrings |
54.40% |
Medium |
695 |
Max Area of Island |
52.90% |
Easy |