1 |
Two Sum |
E
|
10.00 |
Vid
/
Code
|
|
2 |
LRU Cache |
M
|
6.49 |
Vid
/
Code
|
|
3 |
Merge Intervals |
M
|
5.78 |
Vid
/
Code
|
|
4 |
Number of Islands |
M
|
5.12 |
Vid
/
Code
|
|
5 |
Longest Substring Without Repeating Characters |
M
|
4.99 |
Vid
/
Code
|
|
6 |
Kth Largest Element in an Array |
M
|
4.63 |
Vid
/
Code
|
|
7 |
Trapping Rain Water |
H
|
4.52 |
Vid
/
Code
|
|
8 |
Group Anagrams |
M
|
3.46 |
Vid
/
Code
|
|
9 |
Valid Parentheses |
E
|
3.38 |
Vid
/
Code
|
|
10 |
Best Time to Buy and Sell Stock |
E
|
3.22 |
Vid
/
Code
|
|
11 |
Longest Palindromic Substring |
M
|
3.13 |
Vid
/
Code
|
|
12 |
3Sum |
M
|
3.11 |
Vid
/
Code
|
|
13 |
Top K Frequent Elements |
M
|
2.92 |
Vid
/
Code
|
|
14 |
Median of Two Sorted Arrays |
H
|
2.67 |
Vid
/
Code
|
|
15 |
Pow(x, n) |
M
|
2.56 |
Vid
/
Code
|
|
16 |
Merge k Sorted Lists |
H
|
2.34 |
Vid
/
Code
|
|
17 |
Add Two Numbers |
M
|
2.32 |
Vid
/
Code
|
|
18 |
Search in Rotated Sorted Array |
M
|
2.29 |
Vid
/
Code
|
|
19 |
Koko Eating Bananas |
M
|
2.23 |
Vid
/
Code
|
|
20 |
Product of Array Except Self |
M
|
2.23 |
Vid
/
Code
|
|
21 |
Maximum Subarray |
M
|
2.18 |
Vid
/
Code
|
|
22 |
Course Schedule II |
M
|
2.13 |
Vid
/
Code
|
|
23 |
Valid Palindrome |
E
|
2.13 |
Vid
/
Code
|
|
24 |
Copy List with Random Pointer |
M
|
2.13 |
Vid
/
Code
|
|
25 |
Binary Tree Right Side View |
M
|
2.04 |
Vid
/
Code
|
|
26 |
Container With Most Water |
M
|
1.99 |
Vid
/
Code
|
|
27 |
Diameter of Binary Tree |
E
|
1.96 |
Vid
/
Code
|
|
28 |
Letter Combinations of a Phone Number |
M
|
1.88 |
Vid
/
Code
|
|
29 |
Meeting Rooms II |
M
|
1.88 |
Vid
/
Code
|
|
30 |
Word Ladder |
H
|
1.88 |
Vid
/
Code
|
|
31 |
Longest Consecutive Sequence |
M
|
1.85 |
Vid
/
Code
|
|
32 |
K Closest Points to Origin |
M
|
1.83 |
Vid
/
Code
|
|
33 |
House Robber |
M
|
1.74 |
Vid
/
Code
|
|
34 |
Climbing Stairs |
E
|
1.69 |
Vid
/
Code
|
|
35 |
Spiral Matrix |
M
|
1.69 |
Vid
/
Code
|
|
36 |
Binary Tree Maximum Path Sum |
H
|
1.69 |
Vid
/
Code
|
|
37 |
Course Schedule |
M
|
1.69 |
Vid
/
Code
|
|
38 |
Find Median from Data Stream |
H
|
1.63 |
Vid
/
Code
|
|
39 |
Reverse Integer |
M
|
1.55 |
Vid
/
Code
|
|
40 |
Rotting Oranges |
M
|
1.53 |
Vid
/
Code
|
|
41 |
Sliding Window Maximum |
H
|
1.50 |
Vid
/
Code
|
|
42 |
Jump Game |
M
|
1.50 |
Vid
/
Code
|
|
43 |
Rotate Image |
M
|
1.50 |
Vid
/
Code
|
|
44 |
Generate Parentheses |
M
|
1.47 |
Vid
/
Code
|
|
45 |
Merge Two Sorted Lists |
E
|
1.44 |
Vid
/
Code
|
|
46 |
Word Search |
M
|
1.42 |
Vid
/
Code
|
|
47 |
Happy Number |
E
|
1.39 |
Vid
/
Code
|
|
48 |
Time Based Key-Value Store |
M
|
1.36 |
Vid
/
Code
|
|
49 |
Word Search II |
H
|
1.25 |
Vid
/
Code
|
|
50 |
Minimum Window Substring |
H
|
1.23 |
Vid
/
Code
|
|
51 |
Subsets |
M
|
1.17 |
Vid
/
Code
|
|
52 |
Reverse Linked List |
E
|
1.14 |
Vid
/
Code
|
|
53 |
Regular Expression Matching |
H
|
1.14 |
Vid
/
Code
|
|
54 |
Combination Sum |
M
|
1.12 |
Vid
/
Code
|
|
55 |
Valid Anagram |
E
|
1.06 |
Vid
/
Code
|
|
56 |
Remove Nth Node From End of List |
M
|
1.04 |
Vid
/
Code
|
|
57 |
Unique Paths |
M
|
1.04 |
Vid
/
Code
|
|
58 |
Maximum Product Subarray |
M
|
1.01 |
Vid
/
Code
|
|
59 |
Coin Change |
M
|
0.98 |
Vid
/
Code
|
|
60 |
Longest Increasing Subsequence |
M
|
0.98 |
Vid
/
Code
|
|
61 |
Word Break |
M
|
0.98 |
Vid
/
Code
|
|
62 |
Largest Rectangle in Histogram |
H
|
0.95 |
Vid
/
Code
|
|
63 |
Walls and Gates |
M
|
0.95 |
Vid
/
Code
|
|
64 |
Reverse Nodes in k-Group |
H
|
0.93 |
Vid
/
Code
|
|
65 |
Jump Game II |
M
|
0.93 |
Vid
/
Code
|
|
66 |
Longest Repeating Character Replacement |
M
|
0.87 |
Vid
/
Code
|
|
67 |
Clone Graph |
M
|
0.87 |
Vid
/
Code
|
|
68 |
Set Matrix Zeroes |
M
|
0.87 |
Vid
/
Code
|
|
69 |
Edit Distance |
M
|
0.84 |
Vid
/
Code
|
|
70 |
Insert Interval |
M
|
0.84 |
Vid
/
Code
|
|
71 |
Valid Sudoku |
M
|
0.82 |
Vid
/
Code
|
|
72 |
Serialize and Deserialize Binary Tree |
H
|
0.79 |
Vid
/
Code
|
|
73 |
Task Scheduler |
M
|
0.79 |
Vid
/
Code
|
|
74 |
Daily Temperatures |
M
|
0.79 |
Vid
/
Code
|
|
75 |
Plus One |
E
|
0.79 |
Vid
/
Code
|
|
76 |
Contains Duplicate |
E
|
0.76 |
Vid
/
Code
|
|
77 |
Palindromic Substrings |
M
|
0.74 |
Vid
/
Code
|
|
78 |
Gas Station |
M
|
0.74 |
Vid
/
Code
|
|
79 |
Find the Duplicate Number |
M
|
0.71 |
Vid
/
Code
|
|
80 |
Permutations |
M
|
0.68 |
Vid
/
Code
|
|
81 |
Single Number |
E
|
0.68 |
Vid
/
Code
|
|
82 |
Min Stack |
M
|
0.68 |
Vid
/
Code
|
|
83 |
Combination Sum II |
M
|
0.65 |
Vid
/
Code
|
|
84 |
Palindrome Partitioning |
M
|
0.65 |
Vid
/
Code
|
|
85 |
Decode Ways |
M
|
0.63 |
Vid
/
Code
|
|
86 |
Maximum Depth of Binary Tree |
E
|
0.63 |
Vid
/
Code
|
|
87 |
Search a 2D Matrix |
M
|
0.60 |
Vid
/
Code
|
|
88 |
Implement Trie (Prefix Tree) |
M
|
0.60 |
Vid
/
Code
|
|
89 |
Permutation in String |
M
|
0.60 |
Vid
/
Code
|
|
90 |
Missing Number |
E
|
0.57 |
Vid
/
Code
|
|
91 |
Find Minimum in Rotated Sorted Array |
M
|
0.57 |
Vid
/
Code
|
|
92 |
Max Area of Island |
M
|
0.57 |
Vid
/
Code
|
|
93 |
Evaluate Reverse Polish Notation |
M
|
0.57 |
Vid
/
Code
|
|
94 |
Reorder List |
M
|
0.57 |
Vid
/
Code
|
|
95 |
House Robber II |
M
|
0.54 |
Vid
/
Code
|
|
96 |
Longest Increasing Path in a Matrix |
H
|
0.49 |
Vid
/
Code
|
|
97 |
Alien Dictionary |
H
|
0.49 |
Vid
/
Code
|
|
98 |
Lowest Common Ancestor of a Binary Search Tree |
M
|
0.49 |
Vid
/
Code
|
|
99 |
Non-overlapping Intervals |
M
|
0.46 |
Vid
/
Code
|
|
100 |
Number of 1 Bits |
E
|
0.46 |
Vid
/
Code
|
|
101 |
Balanced Binary Tree |
E
|
0.41 |
Vid
/
Code
|
|
102 |
Partition Equal Subset Sum |
M
|
0.41 |
Vid
/
Code
|
|
103 |
Detect Squares |
M
|
0.41 |
Vid
/
Code
|
|
104 |
Construct Binary Tree from Preorder and Inorder Traversal |
M
|
0.41 |
Vid
/
Code
|
|
105 |
Validate Binary Search Tree |
M
|
0.38 |
Vid
/
Code
|
|
106 |
Multiply Strings |
M
|
0.38 |
Vid
/
Code
|
|
107 |
Subsets II |
M
|
0.38 |
Vid
/
Code
|
|
108 |
Linked List Cycle |
E
|
0.35 |
Vid
/
Code
|
|
109 |
Pacific Atlantic Water Flow |
M
|
0.35 |
Vid
/
Code
|
|
110 |
N-Queens |
H
|
0.33 |
Vid
/
Code
|
|
111 |
Last Stone Weight |
E
|
0.33 |
Vid
/
Code
|
|
112 |
Binary Tree Level Order Traversal |
M
|
0.33 |
Vid
/
Code
|
|
113 |
Same Tree |
E
|
0.33 |
Vid
/
Code
|
|
114 |
Target Sum |
M
|
0.33 |
Vid
/
Code
|
|
115 |
Longest Common Subsequence |
M
|
0.30 |
Vid
/
Code
|
|
116 |
Coin Change II |
M
|
0.27 |
Vid
/
Code
|
|
117 |
Cheapest Flights Within K Stops |
M
|
0.27 |
Vid
/
Code
|
|
118 |
Design Add and Search Words Data Structure |
M
|
0.27 |
Vid
/
Code
|
|
119 |
Distinct Subsequences |
H
|
0.25 |
Vid
/
Code
|
|
120 |
Kth Smallest Element in a BST |
M
|
0.25 |
Vid
/
Code
|
|
121 |
Binary Search |
E
|
0.25 |
Vid
/
Code
|
|
122 |
Graph Valid Tree |
M
|
0.22 |
Vid
/
Code
|
|
123 |
Reconstruct Itinerary |
H
|
0.22 |
Vid
/
Code
|
|
124 |
Encode and Decode Strings |
M
|
0.22 |
Vid
/
Code
|
|
125 |
Car Fleet |
M
|
0.19 |
Vid
/
Code
|
|
126 |
Reverse Bits |
E
|
0.19 |
Vid
/
Code
|
|
127 |
Swim in Rising Water |
H
|
0.19 |
Vid
/
Code
|
|
128 |
Number of Connected Components in an Undirected Graph |
M
|
0.19 |
Vid
/
Code
|
|
129 |
Surrounded Regions |
M
|
0.16 |
Vid
/
Code
|
|
130 |
Interleaving String |
M
|
0.16 |
Vid
/
Code
|
|
131 |
Two Sum II - Input Array Is Sorted |
M
|
0.16 |
Vid
/
Code
|
|
132 |
Invert Binary Tree |
E
|
0.14 |
Vid
/
Code
|
|
133 |
Meeting Rooms |
E
|
0.11 |
Vid
/
Code
|
|
134 |
Sum of Two Integers |
M
|
0.11 |
Vid
/
Code
|
|
135 |
Valid Parenthesis String |
M
|
0.11 |
Vid
/
Code
|
|
136 |
Kth Largest Element in a Stream |
E
|
0.11 |
Vid
/
Code
|
|
137 |
Design Twitter |
M
|
0.08 |
Vid
/
Code
|
|
138 |
Counting Bits |
E
|
0.08 |
Vid
/
Code
|
|
139 |
Min Cost Climbing Stairs |
E
|
0.08 |
Vid
/
Code
|
|
140 |
Network Delay Time |
M
|
0.08 |
Vid
/
Code
|
|
141 |
Hand of Straights |
M
|
0.05 |
Vid
/
Code
|
|
142 |
Minimum Interval to Include Each Query |
H
|
0.05 |
Vid
/
Code
|
|
143 |
Burst Balloons |
H
|
0.05 |
Vid
/
Code
|
|
144 |
Partition Labels |
M
|
0.05 |
Vid
/
Code
|
|