|
366 |
Find Leaves of Binary Tree |
67.1% |
Medium |
|
205 |
Isomorphic Strings |
38.1% |
Easy |
|
149 |
Max Points on a Line |
16.1% |
Hard |
|
744 |
Find Smallest Letter Greater Than Target |
44.4% |
Easy |
|
339 |
Nested List Weight Sum |
69.5% |
Easy |
|
65 |
Valid Number |
14.3% |
Hard |
|
716 |
Max Stack |
40.9% |
Easy |
|
272 |
Closest Binary Search Tree Value II |
46.4% |
Hard |
|
34 |
Find First and Last Position of Element in Sorted Array |
34.1% |
Medium |
|
200 |
Number of Islands |
42.7% |
Medium |
|
373 |
Find K Pairs with Smallest Sums |
34.4% |
Medium |
|
380 |
Insert Delete GetRandom O(1) |
43.6% |
Medium |
|
1 |
Two Sum |
44.5% |
Easy |
|
150 |
Evaluate Reverse Polish Notation |
33.3% |
Medium |
|
53 |
Maximum Subarray |
44.4% |
Easy |
|
152 |
Maximum Product Subarray |
29.9% |
Medium |
|
68 |
Text Justification |
24.2% |
Hard |
|
170 |
Two Sum III - Data structure design |
31.3% |
Easy |
|
244 |
Shortest Word Distance II |
48.8% |
Medium |
|
254 |
Factor Combinations |
44.9% |
Medium |
|
104 |
Maximum Depth of Binary Tree |
61.9% |
Easy |
|
50 |
Pow(x, n) |
28.5% |
Medium |
|
69 |
Sqrt(x) |
32.0% |
Easy |
|
297 |
Serialize and Deserialize Binary Tree |
42.4% |
Hard |
|
698 |
Partition to K Equal Sum Subsets |
43.4% |
Medium |
|
256 |
Paint House |
49.8% |
Easy |
|
76 |
Minimum Window Substring |
31.8% |
Hard |
|
243 |
Shortest Word Distance |
58.3% |
Easy |
|
364 |
Nested List Weight Sum II |
58.9% |
Medium |
|
46 |
Permutations |
57.2% |
Medium |
|
47 |
Permutations II |
42.0% |
Medium |
|
460 |
LFU Cache |
29.8% |
Hard |
|
20 |
Valid Parentheses |
37.2% |
Easy |
|
56 |
Merge Intervals |
36.5% |
Medium |
|
156 |
Binary Tree Upside Down |
52.1% |
Medium |
|
464 |
Can I Win |
27.8% |
Medium |
|
636 |
Exclusive Time of Functions |
49.3% |
Medium |
|
146 |
LRU Cache |
27.1% |
Medium |
|
611 |
Valid Triangle Number |
46.1% |
Medium |
|
235 |
Lowest Common Ancestor of a Binary Search Tree |
46.0% |
Easy |
|
341 |
Flatten Nested List Iterator |
49.1% |
Medium |
|
605 |
Can Place Flowers |
31.3% |
Easy |
|
516 |
Longest Palindromic Subsequence |
48.2% |
Medium |
|
236 |
Lowest Common Ancestor of a Binary Tree |
39.3% |
Medium |
|
671 |
Second Minimum Node In a Binary Tree |
43.1% |
Easy |
|
412 |
Fizz Buzz |
60.1% |
Easy |
|
72 |
Edit Distance |
39.2% |
Hard |
|
8 |
String to Integer (atoi) |
14.8% |
Medium |
|
273 |
Integer to English Words |
24.8% |
Hard |
|
349 |
Intersection of Two Arrays |
56.5% |
Easy |
|
126 |
Word Ladder II |
18.7% |
Hard |
|
88 |
Merge Sorted Array |
36.7% |
Easy |
|
730 |
Count Different Palindromic Subsequences |
39.7% |
Hard |
|
127 |
Word Ladder |
25.3% |
Medium |
|
57 |
Insert Interval |
31.7% |
Hard |
|
215 |
Kth Largest Element in an Array |
49.5% |
Medium |
|
432 |
All O`one Data Structure |
30.3% |
Hard |
|
103 |
Binary Tree Zigzag Level Order Traversal |
43.1% |
Medium |
|
362 |
Design Hit Counter |
60.0% |
Medium |
|
61 |
Rotate List |
27.9% |
Medium |
|
125 |
Valid Palindrome |
32.2% |
Easy |
|
706 |
Design HashMap |
57.0% |
Easy |
|
785 |
Is Graph Bipartite? |
44.4% |
Medium |
|
1028 |
Recover a Tree From Preorder Traversal |
69.3% |
Hard |