Preparing Microsoft interview topics helps candidates strengthen their understanding of computer science fundamentals, problem-solving, and coding concepts frequently asked in technical interviews. These topics are useful for both software engineering and technical roles.
- Includes interview-focused questions, coding patterns, and practical technical concepts.
- Helps build confidence for online assessments, technical discussions, and final interview rounds.
- Each topic is divided into Easy, Medium, and Hard sections, enabling structured learning and better interview preparation.
Arrays
Easy
- Majority Element
- Missing Number
- Move All Zeros to End
- Product Array Puzzle
- Equilibrium Point
- Alternate Positive and Negative
- Third Largest
- Buildings with Sunlight
Medium
- Majority Element II
- Merge Without Extra Space
- Maximum Subarray Sum
- Maximum Product Subarray
- Container with most water
- Merge Overlapping Intervals
- Spiral Matrix
- Kth of Spiral Matrix
- Next Permutation
- Set Matrix Zeros
- Sort 0s, 1s, and 2s
- Count Inversions
- Rotate by 90 Degree
- Minimum Swaps to Sort
- Two Stacks in an Array
- Pascal Triangle
- Boolean Matrix
- Row with max 1s in Row-Wise Sorted
- Duplicate Rows in Binary Matrix
- Anti Diagonal Traversal of a Matrix
- Is Sudoku Valid
- Ternary Search
- Longest Bitonic Subarray
- Sort 2D Vector Diagonally
Hard
- Trapping Rain Water
- First Missing Positive
- Maximum Rectangle of 1's in Binary Matrix
- Max Circular Subarray Sum
- Next Smallest Palindrome
- Count Reverse Pairs
Hashing
Easy
Medium
- Triple Sum
- 4 - Sum
- Longest Consecutive Subsequence
- Count Subarrays with Sum K
- Zero Sum Subarrays
- Largest Subarray with Sum 0
- Array Pair Sum Divisibility Problem
- Longest Subarray with Sum Divisible by K
Binary Search & Search Space Optimization
- Peak Element
- Bitonic Point
- Square Root
- First and Last Occurrences in Sorted
- Search in Sorted 2D Matrix
- Allocate Minimum Pages
- Painter's Partition Problem
- Koko Eating Banana's
- Minimum Days to make M Bouquets
- Distribute Candies Among K Peoples
- Median of Two Sorted Arrays
- Split Array Largest Sum
- Capacity to Ship Packages Within D Days
Sorting and Searching
- Merge Sort
- Quick Sort
- Search in Rotated Sorted Array
- Wave Array
- Form the Largest Number
- Search in Row-Column Sorted
- Sorted and Rotated Minimum
- Sort in Specific Order
- Triplets with Sum within a Given Range
- Earliest Common Slot
- Sort Last M Elements
- Common in 3 Sorted Arrays
Bit Manipulation
Easy
Medium
- Unique Number II
- Longest Consecutive Ones
- Maximum AND Value
- Division without using multiplication, division and mod operator
- Bit Counting
- Total Hamming Distance
Hard
Strings
Easy
- Check if Two Strings are anagram of each other
- Longest Common Prefix
- Run Length Encoding
- Isomorphic Strings
- Non Repeating Character
- Match Specific Pattern
Medium
- Group Anagrams Together
- Count Occurrences of Anagram
- Longest Repeating Character Replacement
- Validate an IP Address
- Add Binary Strings
- K - Anagrams
- Look and Say Pattern
- Rearrange Characters
- Next Palindromic with Same Digits
Hard
- Longest Prefix Suffix
- Palindromic Substrings Count
- Regular Expression Matching
- Wildcard Pattern Matching
- Text Justification
- Search Pattern
- Rabin Karp Algorithm
- Z - Algorithm
Linked List
Easy
- Middle of a linked list
- Reverse Linked List
- Delete nth node from end of linked list
- Remove Duplicates from Sorted Linked List
- Check Circular Linked List
- Pairwise Swap Elements of Linked List
Medium
- Detect Loop in a linked list
- Palindrome Linked List
- Merge two Sorted Linked Lists
- Add two numbers represented by linked lists
- Remove Loop in a Linked List
- Intersection in Y-shaped Linked Lists
- Delete Without Head Pointer
- Partition Linked List around a given value
- Reorder Linked List
Hard
- Clone Linked List with Next and Random Pointer
- LRU Cache
- LFU Cache
- Linked List Group Reverse
- Flattening a Linked List
Stacks and Queues
Easy
Medium
- Min Stack
- Sort a Stack
- Next Greater Element
- Next Greatest Element in Circular Array
- Sliding Window Maximum
- The Celebrity Problem
- Stock Span Problem
- Removing K Consecutive Identical Characters
- Min Add to make Parentheses Valid
Hard
Recursion and Backtracking
Medium
- Generate Parentheses
- Target Sum Combination
- Rat in a Maze
- Distinct Subsets
- Possible Words from Phone Digits
- Unique Permutations
Hard
Two Pointers and Sliding Window
Medium
- Closest Three Sum
- Pair Sum Closest to 0
- Longest Substring with Distinct Characters
- Count Distinct Elements in Every Window
- Length of the Longest Substring
- Subarray Product less than K
- Maximize number of 1's
- K - Sized Subarray Maximum
- Interval List Intersections
- Longest Substring Without Repeating Characters
- Minimum Window Substring
Hard
Heap & Greedy
Easy
Medium
- Top K frequent elements in an array
- K Largest Elements
- Merge K Sorted Linked Lists
- Task Scheduler
- Meeting Rooms - II
- K Closest Points to Origin
- Minimum Jumps
- Minimize the Heights II
- Fractional Knapsack
- Minimum Cost of Ropes
- Gas Stations
- Find Median in a Stream
- Kth Largest in a Stream
- Police and Thieves
- Minimum Workers to Cover All Hours
- Closest Similar Elements
Hard
Trees & BST
Easy
- Identical Trees
- Symmetric Tree
- Mirror Tree
- Balanced Binary Tree
- Left View of a Binary Tree
- Right View of a Binary Tree
- Root to Leaf Path Sum
- Inorder Successor in BST
- K Distance from Root
- Transform to Sum Tree
- BST Keys in a Range
- Sum of Leaf Nodes at Min Level
Medium
- Lowest Common Ancestor
- Check for BST
- Diameter of Binary Tree
- Binary Tree Maximum Path Sum
- Construct Tree from Inorder and Preorder
- Vertical Tree Traversal
- Zig-Zag Tree Traversal
- Diagonal Tree Traversal
- Boundary Traversal of Binary Tree
- Top View of a Binary Tree
- Largest BST
- Pair Sum in BST
- Closest in BST
- K Closest Values
- Sum Tree
- Path from Root with Specified Sum
- Unique BST's
- Count the Nodes at Distance K from the Leaf
- BST to Greater Sum Tree
- Cousins of a Node
- Minimum Spanning Tree
- Isomorphic Trees
Hard
- Serialize and Deserialize Binary Tree
- Recover Swapped BST
- Max Path Sum 2 Special Nodes
- Binary Tree to Doubly Linked List
- Burning Tree
- Nodes at Given Distance in Binary Tree
- Distribute Candies
Graphs
Medium
- Find the number of Islands
- Flood Fill
- Rotten Oranges
- Detect Cycle in Undirected graph
- Detect Cycle in directed graph
- Clone Graph
- Course Schedule
- Course Schedule - II
- Bipartite Graph
- Path with Minimum Effort
- Shortest Path with atmost K Nodes
- Number of Ways to Arrive at Destination
- Network Delay Time
- Minimum Spanning Tree - Kruskal's Algorithm
- Minimum Cost to Connect all houses in a City
- Word Search
- Number of Connected Components
- Steps by Knight
- Minimum Operations to Connect Hospitals
- Prerequisite Tasks
- Find the String in a Grid
- Bridge Edge in a Graph
- Largest Region of 1s in a Binary Matrix
- Snake and Ladder Problem
- Covid Spread
Hard
- Pacific Atlantic Water Flow
- Word Ladder
- Word Ladder II
- Alien Dictionary
- Word Search - II
- Reconstruct Itinerary
- Find all Critical Connections in the Graph
- Minimum Cost Path
Dynamic Programming(DP)
Easy
Medium
- Longest Increasing Subsequence
- Longest Common Subsequence
- 0 - 1 Knapsack
- Subset Sum
- Partition Equal Subset Sum
- Coin Change
- Coin Change (Count Ways)
- Word Break
- Total Decoding Messages
- Unique Paths in a Grid
- Longest Common Substring
- Longest Palindromic Subsequence
- Longest Palindromic Substring
- Rod Cutting
- Shortest Common Supersequence
- Interleaved Strings
- Longest Bitonic Subsequence
- Maximum Sum Increasing Sequence
- Longest Arithmetic Subsequence
- Number of Paths
- Maximum Path Sum in a Matrix
- All Palindrome Partitions
- Maximize the Cut Segments
Hard
- Matrix Chain Multiplication
- Edit Distance
- Max Skills
- Palindrome Partitioning
- Stock Buy and Sell - Multiple Transactions
- Stock Buy and Sell - Max K Transactions Allowed
- Word Wrap
- Minimum Points to Reach Destination
- Travelling Salesman Problem
- Box Stacking
Trie & Design Questions
- Implement Trie
- Word Search II
- Phone Directory
- Maximum XOR Subarray
- Shortest Unique Prefix of every Word
- Word Break(Trie)
- Minimum XOR Value Pair
- Design Twitter
- Search Query Auto Complete
- Design URL Shortener
