Train hard for the Microsoft Interview with a handy guide of microsoft interview questions and common interview questions that can help you nail different rounds at Microsoft.

Problem Title

Difficulty

Avg Time to solve

Attempted

Rearrange The Array

14

Moderate

15 mins

104

Distinct Subsequences

12

Moderate

10 mins

313

Add two number as linked lists

63

Moderate

10 mins

387

Anagram Difference

6

Moderate

10 mins

163

Top View Of The Tree

8

Moderate

25 mins

389

Identical Trees

2

Moderate

20 mins

230

Count Ways To Reach The N-th Stairs

14

Moderate

30 mins

877

N-th Term Of GP

16

Easy

15 mins

619

Deepest Leaves Sum

7

Easy

15 mins

135

Level Order Traversal

9

Easy

15 mins

309

Maximum Path Sum Between Two Leaves

24

Hard

50 mins

412

Replace Node With Depth

1

Easy

20 mins

99

Isomorphic Trees

3

Easy

32 mins

67

LCA of three Nodes

796

Easy

20 mins

1131

Largest Common Ancestor

11

Moderate

35 mins

261

Boundary Traversal

28

Hard

20 mins

422

Diagonal Sum

14

Easy

23 mins

223

Distinct Subsets Count

2

Moderate

40 mins

58

Reverse Level Order Traversal

15

Moderate

30 mins

266

Maximum Width In Binary Tree

6

Moderate

38 mins

239

Count Inversions - ll

15

Moderate

50 mins

155

Reverse Blocks

96

Hard

56 mins

395

Delete middle node

6

Easy

15 mins

132

Pair Swap

6

Moderate

40 mins

169

Return Subsets Sum to K

8

Moderate

40 mins

127

Rearrange The Array

Moderate

14 upvotes

Distinct Subsequences

Moderate

12 upvotes

Add two number as linked lists

Moderate

63 upvotes

Anagram Difference

Moderate

6 upvotes

Top View Of The Tree

Moderate

8 upvotes

Identical Trees

Moderate

2 upvotes

Count Ways To Reach The N-th Stairs

Moderate

14 upvotes

N-th Term Of GP

Easy

16 upvotes

Deepest Leaves Sum

Easy

7 upvotes

Level Order Traversal

Easy

9 upvotes

Maximum Path Sum Between Two Leaves

Hard

24 upvotes

Replace Node With Depth

Easy

1 upvote

Isomorphic Trees

Easy

3 upvotes

LCA of three Nodes

Easy

796 upvotes

Largest Common Ancestor

Moderate

11 upvotes

Boundary Traversal

Hard

28 upvotes

Diagonal Sum

Easy

14 upvotes

Distinct Subsets Count

Moderate

2 upvotes

Reverse Level Order Traversal

Moderate

15 upvotes

Maximum Width In Binary Tree

Moderate

6 upvotes

Count Inversions - ll

Moderate

15 upvotes

Reverse Blocks

Hard

96 upvotes

Delete middle node

Easy

6 upvotes

Pair Swap

Moderate

6 upvotes

Return Subsets Sum to K

Moderate

8 upvotes

Page of 4