Here is a collection of problems from Raj Vikramaditya (aka Striver) sheet using which people have cracked their dream jobs. These questions are commonly asked in product-based companies like Amazon, Microsoft, Google, etc

Problem Title

Difficulty

Avg Time to solve

Attempted

Tree Traversals

2

Easy

15 mins

156

Left View Of a Binary Tree NEW

3

Easy

10 mins

141

Bottom View Of Binary Tree NEW

9

Moderate

10 mins

248

Top View Of The Tree

8

Moderate

25 mins

376

Level Order Traversal

9

Easy

15 mins

302

Binary Tree Zigzag Traversal

3

Easy

15 mins

74

Height of the Binary Tree

15

Moderate

10 mins

132

Diameter Of Binary Tree NEW

2

Easy

10 mins

195

Is Height Balanced Binary Tree

9

Moderate

15 mins

159

LCA Of Binary Tree

4

Moderate

10 mins

175

Identical Trees

2

Moderate

20 mins

228

Maximum Path Sum Between Two Leaves

24

Hard

50 mins

404

Construct Binary Tree From Inorder and Preorder Traversal

8

Easy

10 mins

125

Construct Binary Tree from Inorder and Postorder Traversal

6

Moderate

25 mins

94

Tree Symmetricity

4

Easy

20 mins

279

Flatten Binary Tree to Linked List

2

Moderate

25 mins

183

Connect Nodes at Same Level

3

Moderate

30 mins

98

Search In BST

0

Easy

15 mins

155

Convert Sorted Array to BST

1

Easy

15 mins

71

Validate BST

4

Moderate

25 mins

568

LCA In A BST NEW

3

Moderate

15 mins

113

Predecessor And Successor In BST NEW

1

Easy

10 mins

90

Floor in BST NEW

3

Moderate

30 mins

282

Ceil from BST NEW

4

Easy

15 mins

326

K-th largest Number BST NEW

2

Easy

10 mins

45

Tree Traversals

Easy

2 upvotes

Left View Of a Binary Tree

Easy

3 upvotes

Bottom View Of Binary Tree

Moderate

9 upvotes

Top View Of The Tree

Moderate

8 upvotes

Level Order Traversal

Easy

9 upvotes

Binary Tree Zigzag Traversal

Easy

3 upvotes

Height of the Binary Tree

Moderate

15 upvotes

Diameter Of Binary Tree

Easy

2 upvotes

Is Height Balanced Binary Tree

Moderate

9 upvotes

LCA Of Binary Tree

Moderate

4 upvotes

Identical Trees

Moderate

2 upvotes

Maximum Path Sum Between Two Leaves

Hard

24 upvotes

Construct Binary Tree From Inorder and Preorder Traversal

Easy

8 upvotes

Construct Binary Tree from Inorder and Postorder Traversal

Moderate

6 upvotes

Tree Symmetricity

Easy

4 upvotes

Flatten Binary Tree to Linked List

Moderate

2 upvotes

Connect Nodes at Same Level

Moderate

3 upvotes

Search In BST

Easy

0 upvotes

Convert Sorted Array to BST

Easy

1 upvote

Validate BST

Moderate

4 upvotes

LCA In A BST

Moderate

3 upvotes

Predecessor And Successor In BST

Easy

1 upvote

Floor in BST

Moderate

3 upvotes

Ceil from BST

Easy

4 upvotes

K-th largest Number BST

Easy

2 upvotes

Page of 7