1
Easy·15 mins
2
Easy·20 mins
3
Easy·20 mins
4
Best Time to Buy and Sell Stock
Easy·20 mins
5
Easy·15 mins
6
Easy·15 mins
7
Easy·15 mins
8
Easy·15 mins
9
Easy·20 mins
10
Lowest Common Ancestor of a Binary Search Tree
Easy·20 mins
11
Easy·15 mins
12
Easy·20 mins
13
Easy·20 mins
Week 2
0 / 12
1
Easy·20 mins
2
Easy·15 mins
3
Easy·20 mins
4
Easy·20 mins
5
Easy·20 mins
6
Easy·20 mins
7
Easy·15 mins
8
Easy·30 mins
9
Easy·20 mins
10
Easy·15 mins
11
Easy·15 mins
12
Medium·20 mins
Week 3
0 / 8
1
Medium·25 mins
2
Medium·30 mins
3
Medium·30 mins
4
Longest Substring Without Repeating Characters
Medium·30 mins
5
Medium·30 mins
6
Binary Tree Level Order Traversal
Medium·20 mins
7
Medium·25 mins
8
Evaluate Reverse Polish Notation
Medium·30 mins
Week 4
0 / 8
1
Medium·30 mins
2
Medium·35 mins
3
Medium·25 mins
4
Medium·30 mins
5
Medium·20 mins
6
Medium·20 mins
7
Medium·25 mins
8
Medium·30 mins
Week 5
0 / 8
1
Search in Rotated Sorted Array
Medium·30 mins
2
Medium·30 mins
3
Medium·30 mins
4
Medium·30 mins
5
Lowest Common Ancestor of a Binary Tree
Medium·25 mins
6
Medium·35 mins
7
Medium·30 mins
8
Medium·25 mins
Week 6
0 / 9
1
Medium·30 mins
2
Medium·30 mins
3
Medium·25 mins
4
Medium·25 mins
5
Medium·30 mins
6
Medium·20 mins
7
Medium·25 mins
8
Medium·20 mins
9
Construct Binary Tree from Preorder and Inorder Traversal
Medium·25 mins
Week 7
0 / 7
1
Medium·35 mins
2
Letter Combinations of a Phone Number
Medium·30 mins
3
Medium·30 mins
4
Medium·30 mins
5
Medium·30 mins
6
Medium·35 mins
7
Medium·30 mins
Week 8
0 / 10
1
Medium·25 mins
2
Hard·30 mins
3
Serialize and Deserialize Binary Tree
Hard·40 mins
4
Hard·35 mins
5
Hard·30 mins
6
Hard·45 mins
7
Hard·40 mins
8
Maximum Profit in Job Scheduling
Hard·45 mins
9
Hard·30 mins
10
Largest Rectangle in Histogram
Hard·35 mins