Show topics
Week 1
2 / 58
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
14
Easy·20 mins
15
Easy·15 mins
16
Easy·20 mins
17
Easy·20 mins
18
Easy·20 mins
19
Easy·20 mins
20
Easy·15 mins
21
Easy·30 mins
22
Easy·20 mins
23
Easy·15 mins
24
Easy·15 mins
25
Easy·20 mins
26
Easy·20 mins
27
Easy·15 mins
28
Easy·15 mins
29
Easy·20 mins
30
Easy·15 mins
31
Easy·20 mins
32
Easy·15 mins
33
Easy·20 mins
34
Easy·20 mins
35
Easy·20 mins
36
Easy·15 mins
37
Easy·15 mins
38
Convert Sorted Array to Binary Search Tree
Easy·20 mins
39
Easy·15 mins
40
Easy·20 mins
41
Easy·20 mins
42
Medium·20 mins
43
Medium·25 mins
44
Medium·30 mins
45
Medium·30 mins
46
Longest Substring Without Repeating Characters
Medium·30 mins
47
Medium·30 mins
48
Binary Tree Level Order Traversal
Medium·20 mins
49
Medium·25 mins
50
Evaluate Reverse Polish Notation
Medium·30 mins
51
Medium·30 mins
52
Medium·35 mins
53
Medium·25 mins
54
Medium·30 mins
55
Medium·20 mins
56
Medium·20 mins
57
Medium·25 mins
58
Medium·30 mins
Week 2
0 / 42
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
9
Medium·30 mins
10
Medium·30 mins
11
Medium·25 mins
12
Medium·25 mins
13
Medium·30 mins
14
Medium·20 mins
15
Medium·25 mins
16
Medium·20 mins
17
Construct Binary Tree from Preorder and Inorder Traversal
Medium·25 mins
18
Medium·35 mins
19
Letter Combinations of a Phone Number
Medium·30 mins
20
Medium·30 mins
21
Medium·30 mins
22
Medium·30 mins
23
Medium·35 mins
24
Medium·30 mins
25
Medium·25 mins
26
Medium·30 mins
27
Medium·25 mins
28
Medium·30 mins
29
Medium·30 mins
30
Medium·35 mins
31
Medium·25 mins
32
Medium·30 mins
33
Design Add and Search Words Data Structure
Medium·35 mins
34
Medium·30 mins
35
Remove Nth Node From End of List
Medium·20 mins
36
Medium·30 mins
37
Medium·20 mins
38
Medium·30 mins
39
Longest Increasing Subsequence
Medium·30 mins
40
Medium·30 mins
41
Medium·35 mins
42
Medium·25 mins
Week 3
0 / 44
1
Medium·25 mins
2
Medium·30 mins
3
Medium·25 mins
4
Medium·25 mins
5
Medium·30 mins
6
Medium·30 mins
7
Medium·20 mins
8
Medium·30 mins
9
Longest Repeating Character Replacement
Medium·30 mins
10
Medium·30 mins
11
Medium·20 mins
12
Medium·25 mins
13
Medium·25 mins
14
Medium·25 mins
15
Number of Connected Components in an Undirected Graph
Medium·30 mins
16
Medium·35 mins
17
Medium·35 mins
18
Medium·30 mins
19
Medium·25 mins
20
Kth Largest Element in an Array
Medium·30 mins
21
Medium·30 mins
22
Medium·25 mins
23
Binary Tree Zigzag Level Order Traversal
Medium·25 mins
24
Medium·30 mins
25
Medium·35 mins
26
Medium·20 mins
27
Medium·30 mins
28
Medium·20 mins
29
Medium·25 mins
30
Medium·30 mins
31
Medium·25 mins
32
Medium·25 mins
33
Medium·25 mins
34
Medium·25 mins
35
Cheapest Flights Within K Stops
Medium·45 mins
36
All Nodes Distance K in Binary Tree
Medium·25 mins
37
Medium·30 mins
38
Medium·25 mins
39
Find Minimum in Rotated Sorted Array
Medium·30 mins
40
Medium·30 mins
41
Medium·35 mins
42
Medium·20 mins
43
Medium·20 mins
44
Hard·30 mins
Week 4
0 / 25
1
Serialize and Deserialize Binary Tree
Hard·40 mins
2
Hard·35 mins
3
Hard·30 mins
4
Hard·45 mins
5
Hard·40 mins
6
Maximum Profit in Job Scheduling
Hard·45 mins
7
Hard·30 mins
8
Largest Rectangle in Histogram
Hard·35 mins
9
Hard·35 mins
10
Hard·40 mins
11
Hard·40 mins
12
Longest Increasing Path in a Matrix
Hard·40 mins
13
Hard·35 mins
14
Hard·40 mins
15
Hard·35 mins
16
Hard·40 mins
17
Hard·45 mins
18
Hard·45 mins
19
Hard·35 mins
20
Hard·40 mins
21
Hard·35 mins
22
Hard·40 mins
23
Hard·35 mins
24
Hard·40 mins
25
Smallest Range Covering Elements from K Lists
Hard·40 mins