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

18

Moderate

15 mins

249

Distinct Subsequences

21

Moderate

10 mins

908

Add Two Numbers As Linked Lists ll

138

Moderate

10 mins

1455

Anagram Difference

12

Moderate

10 mins

1406

Top View Of Binary Tree

23

Moderate

25 mins

1899

Identical Trees

7

Moderate

20 mins

700

Count Ways To Reach The N-th Stairs

70

Moderate

30 mins

5246

N-th Term Of GP

31

Easy

15 mins

2829

Deepest Leaves Sum

8

Easy

15 mins

447

Level Order Traversal

18

Easy

15 mins

1242

Maximum Path Sum Between Two Leaves

44

Hard

50 mins

991

Replace Node With Depth

2

Easy

20 mins

350

Isomorphic Trees

4

Easy

32 mins

254

LCA of three Nodes

2699

Easy

20 mins

3594

Largest Common Ancestor

12

Moderate

35 mins

348

Boundary Traversal

63

Hard

20 mins

2704

Diagonal Sum

20

Easy

23 mins

347

Distinct Subsets Count

3

Moderate

40 mins

69

Reverse Level Order Traversal

21

Moderate

30 mins

1408

Maximum Width In Binary Tree

7

Moderate

38 mins

726

Count Inversions - ll

23

Moderate

50 mins

495

Reverse Blocks

162

Hard

56 mins

1384

Delete middle node

9

Easy

15 mins

522

Pair Swap

9

Moderate

40 mins

552

Return Subsets Sum to K

17

Moderate

40 mins

1527

Rearrange The Array

Moderate

18 upvotes

Distinct Subsequences

Moderate

21 upvotes

Add Two Numbers As Linked Lists ll

Moderate

138 upvotes

Anagram Difference

Moderate

12 upvotes

Top View Of Binary Tree

Moderate

23 upvotes

Identical Trees

Moderate

7 upvotes

Count Ways To Reach The N-th Stairs

Moderate

70 upvotes

N-th Term Of GP

Easy

31 upvotes

Deepest Leaves Sum

Easy

8 upvotes

Level Order Traversal

Easy

18 upvotes

Maximum Path Sum Between Two Leaves

Hard

44 upvotes

Replace Node With Depth

Easy

2 upvotes

Isomorphic Trees

Easy

4 upvotes

LCA of three Nodes

Easy

2699 upvotes

Largest Common Ancestor

Moderate

12 upvotes

Boundary Traversal

Hard

63 upvotes

Diagonal Sum

Easy

20 upvotes

Distinct Subsets Count

Moderate

3 upvotes

Reverse Level Order Traversal

Moderate

21 upvotes

Maximum Width In Binary Tree

Moderate

7 upvotes

Count Inversions - ll

Moderate

23 upvotes

Reverse Blocks

Hard

162 upvotes

Delete middle node

Easy

9 upvotes

Pair Swap

Moderate

9 upvotes

Return Subsets Sum to K

Moderate

17 upvotes

Page of 4