Companies/Microsoft

165 problems tagged

Microsoft

Problems frequently asked in Microsoft technical interviews, sorted by frequency.

159Total problems

0Solved

61Very High freq.

0%Completion

Implement Pow(x, n)· Recursion

Recursion · Maths · Bit Manipulation

Very High frequency

Medium

20m

Generate Brackets· Recursion

Recursion · Backtracking · Strings

Very High frequency

Medium

25m

Power Set· Recursion

Recursion · Backtracking · Bit Manipulation

Very High frequency

Medium

20m

Two Sum· Hashing

Arrays · Hashing

Very High frequency

Easy

15m

Longest Consecutive Sequence· Hashing

Arrays · Hashing

Very High frequency

Medium

25m

Finding the Single Element in an Array· Arrays

Arrays · Bit Manipulation

Very High frequency

Easy

15m

Largest Subarray Sum· Arrays

Arrays · Dynamic Programming · Divide and Conquer

Very High frequency

Medium

20m

Arrange Colors in Order· Arrays

Arrays · Two Pointers · Sorting

Very High frequency

Medium

20m

Majority Element· Arrays

Arrays · Hashing · Greedy

Very High frequency

Easy

15m

Maximize Share Profit· Arrays

Arrays · Greedy · Dynamic Programming

Very High frequency

Easy

15m

Merge Two Sorted Array· Arrays

Arrays · Two Pointers · Sorting

Very High frequency

Medium

20m

Spiral Matrix· Arrays

Arrays · Matrix · Simulation

Very High frequency

Medium

25m

Three Sum· Arrays

Arrays · Two Pointers · Sorting

Very High frequency

Medium

25m

Merge Intervals· Arrays

Arrays · Sorting · Greedy

Very High frequency

Medium

25m

First and Last Occurrence· Binary Search

Binary Search · Arrays

Very High frequency

Medium

20m

Search Element in Rotated Sorted Array· Binary Search

Binary Search · Arrays

Very High frequency

Medium

25m

Find Minimum in Rotated Sorted Array· Binary Search

Binary Search · Arrays

Very High frequency

Medium

20m

Median of Two Sorted Arrays· Binary Search

Binary Search · Arrays

Very High frequency

Hard

45m

Single Element· Bit Manipulation

Bit Manipulation · Arrays

Very High frequency

Easy

15m

Insert Interval· Greedy Algorithms

Arrays · Greedy · Sorting

Very High frequency

Medium

25m

Jump Game· Greedy Algorithms

Arrays · Greedy · Dynamic Programming

Very High frequency

Medium

25m

LRU Cache· Greedy Algorithms

Linked List · Hashing · Greedy

Very High frequency

Medium

35m

Longest Substring Without Repeating Characters· Sliding Window & Two Pointers

Strings · Sliding Window · Hashing

Very High frequency

Medium

25m

Minimum Window Substring· Sliding Window & Two Pointers

Strings · Sliding Window · Hashing

Very High frequency

Hard

45m

Balanced Parenthesis· Stacks & Queues

Stack · Strings

Very High frequency

Easy

15m

Implement Min Stack· Stacks & Queues

Stack · Design

Very High frequency

Medium

25m

Next Greater Element· Stacks & Queues

Stack · Monotonic Stack · Arrays

Very High frequency

Easy

20m

Trapping Rainwater· Stacks & Queues

Arrays · Stack · Two Pointers

Very High frequency

Hard

40m

Largest Rectangle in Histogram· Stacks & Queues

Arrays · Stack · Monotonic Stack

Very High frequency

Hard

40m

Middle of the Linked List· Linked List

Linked List · Two Pointers

Very High frequency

Easy

15m

Reverse a Linked List· Linked List

Linked List · Recursion

Very High frequency

Easy

15m

Cycle Detection· Linked List

Linked List · Two Pointers

Very High frequency

Easy

15m

Delete Kth Node From End· Linked List

Linked List · Two Pointers

Very High frequency

Medium

25m

Intersection of Two Linked Lists· Linked List

Linked List · Two Pointers · Hashing

Very High frequency

Easy

20m

Add Two Numbers· Linked List

Linked List · Maths · Recursion

Very High frequency

Medium

25m

Reverse Nodes in K-Group· Linked List

Linked List · Recursion

Very High frequency

Hard

40m

Level Order Traversal· Binary Trees

Trees · BFS · Queue

Very High frequency

Medium

20m

Diameter of Binary Tree· Binary Trees

Trees · Recursion · DFS

Very High frequency

Easy

20m

Right View of Binary Tree· Binary Trees

Trees · DFS · BFS

Very High frequency

Medium

20m

Lowest Common Ancestor of a Binary Tree· Binary Trees

Trees · DFS · Recursion

Very High frequency

Medium

25m

Kth Smallest Element in BST· Binary Search Tree

Binary Search Tree · Recursion · Stack

Very High frequency

Medium

20m

Validate a Binary Search Tree· Binary Search Tree

Binary Search Tree · Recursion · DFS

Very High frequency

Medium

20m

Kth Largest Element· Heaps

Heap · Sorting · Arrays

Very High frequency

Medium

20m

Merge K Sorted Linked Lists· Heaps

Heap · Linked List · Sorting

Very High frequency

Hard

35m

Top K Frequent Elements· Heaps

Heap · Hashing · Sorting

Very High frequency

Medium

25m

Number Of Islands· Graphs

Graph · BFS · DFS

Very High frequency

Medium

25m

Word Transformation Sequence· Graphs

Graph · BFS · Hashing

Very High frequency

Hard

40m

Dijkstra's Algorithm· Graphs

Graph · Heap · BFS

Very High frequency

Medium

30m

Climbing Stairs· Dynamic Programming

Dynamic Programming · Recursion

Very High frequency

Easy

15m

House Robber I· Dynamic Programming

Dynamic Programming · Arrays

Very High frequency

Medium

20m

Unique Paths I· Dynamic Programming

Dynamic Programming · Arrays

Very High frequency

Medium

20m

Minimum Path Sum· Dynamic Programming

Dynamic Programming · Arrays

Very High frequency

Medium

25m

Partition Equal Subset Sum· Dynamic Programming

Dynamic Programming · Arrays

Very High frequency

Medium

25m

Longest Common Subsequence· Dynamic Programming

Dynamic Programming · Strings

Very High frequency

Medium

25m

Edit Distance· Dynamic Programming

Dynamic Programming · Strings

Very High frequency

Hard

35m

Building a Growing Sequence of Heights· Dynamic Programming

Dynamic Programming · Arrays · Binary Search

Very High frequency

Medium

25m

Combination Sum II· Recursion

Recursion · Backtracking · Arrays

High frequency

Medium

25m

Password Decoder· Recursion

Recursion · Backtracking · Dynamic Programming

High frequency

Medium

30m

All Palindromic Splits of a String· Recursion

Recursion · Backtracking · Strings

High frequency

Hard

40m

Word Search in Matrix· Recursion

Recursion · Backtracking · Arrays

High frequency

Medium

35m

Largest Subarray With Zero Sum· Hashing

Arrays · Hashing · Prefix Sum

High frequency

Medium

20m

Merge Sort Implementation· Sorting

Sorting · Arrays · Recursion

High frequency

Medium

25m

Quick Sort Implementation· Sorting

Sorting · Arrays · Recursion

High frequency

Medium

25m

Remove Duplicates from Sorted Array· Arrays

Arrays · Two Pointers

High frequency

Easy

15m

Left Rotate an Array by K Places· Arrays

Arrays · Two Pointers

High frequency

Medium

20m

Move Zeros to the End of an Array· Arrays

Arrays · Two Pointers

High frequency

Easy

15m

Finding the Missing Number in an Array· Arrays

Arrays · Hashing · Bit Manipulation

High frequency

Easy

15m

Maximum Subarray Product· Arrays

Arrays · Dynamic Programming

High frequency

Medium

25m

Find the Next Permutation· Arrays

Arrays · Two Pointers · Backtracking

High frequency

Medium

25m

Zero Fill Matrix· Arrays

Arrays · Matrix

High frequency

Medium

25m

Grid Rotation· Arrays

Arrays · Matrix

High frequency

Medium

25m

Pascal's Triangle· Arrays

Arrays · Maths · Dynamic Programming

High frequency

Easy

20m

Missing and Repeating Elements· Arrays

Arrays · Hashing · Maths

High frequency

Medium

25m

Lower Bound· Binary Search

Binary Search · Arrays

High frequency

Easy

15m

Upper Bound· Binary Search

Binary Search · Arrays

High frequency

Easy

15m

Search Insert Position· Binary Search

Binary Search · Arrays

High frequency

Easy

15m

Search Element in Rotated Sorted Array II· Binary Search

Binary Search · Arrays

High frequency

Medium

25m

Find Single Element· Binary Search

Binary Search · Arrays · Bit Manipulation

High frequency

Medium

20m

Minimum Capacity to Transport Parcels· Binary Search

Binary Search · Arrays · Greedy

High frequency

Medium

25m

Book Allocation· Binary Search

Binary Search · Arrays · Greedy

High frequency

Hard

35m

Painters Partition· Binary Search

Binary Search · Arrays · Greedy

High frequency

Hard

35m

Search in a 2D Sorted Matrix· Binary Search

Binary Search · Arrays · Matrix

High frequency

Medium

20m

Search in a 2D Sorted Matrix II· Binary Search

Binary Search · Arrays · Matrix

High frequency

Medium

25m

Count Set Bits in an Integer· Bit Manipulation

Bit Manipulation

High frequency

Easy

10m

Divide Two Integers· Bit Manipulation

Bit Manipulation · Maths

High frequency

Medium

25m

Fractional Knapsack· Greedy Algorithms

Greedy · Arrays · Sorting

High frequency

Medium

20m

Jump Game-II· Greedy Algorithms

Arrays · Greedy · Dynamic Programming

High frequency

Medium

25m

Next Greater Element II· Stacks & Queues

Stack · Monotonic Stack · Arrays

High frequency

Medium

25m

Nearest Smaller Element· Stacks & Queues

Stack · Monotonic Stack · Arrays

High frequency

Medium

20m

Remove K Digits· Stacks & Queues

Stack · Monotonic Stack · Greedy

High frequency

Medium

25m

Find Start Node of a Cycle· Linked List

Linked List · Two Pointers

High frequency

Medium

20m

Palindrome Linked List· Linked List

Linked List · Two Pointers · Recursion

High frequency

Easy

20m

Sort Linked List· Linked List

Linked List · Sorting · Merge Sort

High frequency

Medium

30m

Clone Smart Device Chain with Random Pointer· Linked List

Linked List · Hashing · Recursion

High frequency

Hard

40m

Preorder Traversal· Binary Trees

Trees · DFS · Recursion

High frequency

Easy

10m

Inorder Traversal· Binary Trees

Trees · DFS · Recursion

High frequency

Easy

10m

Height of a Binary Tree· Binary Trees

Trees · Recursion · DFS

High frequency

Easy

15m

Balanced Binary Tree· Binary Trees

Trees · Recursion · DFS

High frequency

Easy

20m

Maximum Path Sum of a Binary Tree· Binary Trees

Trees · Recursion · DFS

High frequency

Hard

35m

Symmetric Binary Tree· Binary Trees

Trees · Recursion · DFS

High frequency

Easy

15m

Zig-Zag Level Order Traversal· Binary Trees

Trees · BFS · Queue

High frequency

Medium

25m

Top View of a Binary Tree· Binary Trees

Trees · BFS · Hashing

High frequency

Medium

25m

Bottom View of a Binary Tree· Binary Trees

Trees · BFS · Hashing

High frequency

Medium

25m

Left View of Binary Tree· Binary Trees

Trees · DFS · BFS

High frequency

Medium

20m

Preorder Inorder Tree Build· Binary Trees

Trees · Recursion · DFS

High frequency

Hard

35m

Tree Serialization and Deserialization· Binary Trees

Trees · DFS · BFS

High frequency

Hard

40m

Search in BST· Binary Search Tree

Binary Search Tree · Recursion · Binary Search

High frequency

Easy

10m

Insertion in BST· Binary Search Tree

Binary Search Tree · Recursion

High frequency

Medium

20m

Deletion in BST· Binary Search Tree

Binary Search Tree · Recursion

High frequency

Medium

25m

Lowest Common Ancestor in BST· Binary Search Tree

Binary Search Tree · Recursion

High frequency

Medium

20m

Merge K Sorted Arrays· Heaps

Heap · Arrays · Sorting

High frequency

Hard

35m

Median Tracker In Data Stream· Heaps

Heap · Sorting

High frequency

Hard

35m

BFS Traversal· Graphs

Graph · BFS · Queue

High frequency

Easy

20m

DFS Traversal· Graphs

Graph · DFS · Recursion

High frequency

Easy

20m

Number of Provinces· Graphs

Graph · DFS · Union Find

High frequency

Medium

25m

Rotten Oranges· Graphs

Graph · BFS · Queue

High frequency

Medium

25m

'O' Within 'X' Boundary· Graphs

Graph · DFS · BFS

High frequency

Medium

30m

Detect Cycle In A Directed Graph· Graphs

Graph · DFS · Topological Sort

High frequency

Medium

25m

Topological Sort· Graphs

Graph · DFS · Topological Sort

High frequency

Medium

25m

Kahn's Algorithm· Graphs

Graph · BFS · Topological Sort

High frequency

Medium

25m

Floyd Warshall· Graphs

Graph · Dynamic Programming

High frequency

Medium

30m

Disjoint Sets Implementation· Graphs

Union Find · Graph

High frequency

Medium

30m

House Robber II· Dynamic Programming

Dynamic Programming · Arrays

High frequency

Medium

25m

Unique Paths II· Dynamic Programming

Dynamic Programming · Arrays

High frequency

Medium

25m

Triangle· Dynamic Programming

Dynamic Programming · Arrays

High frequency

Medium

25m

Subset Sum· Dynamic Programming

Dynamic Programming · Arrays · Recursion

High frequency

Medium

25m

Possible Coin Combinations· Dynamic Programming

Dynamic Programming · Arrays

High frequency

Medium

25m

Unbounded Knapsack· Dynamic Programming

Dynamic Programming · Arrays

High frequency

Medium

25m

Longest Common Substring· Dynamic Programming

Dynamic Programming · Strings

High frequency

Medium

25m

Longest Palindromic Subsequence· Dynamic Programming

Dynamic Programming · Strings

High frequency

Medium

25m

Stock Trading II· Dynamic Programming

Dynamic Programming · Greedy · Arrays

High frequency

Medium

20m

Implementation of Tries I· Tries

Trie · Strings

High frequency

Medium

25m

Maximum XOR of Two Numbers· Tries

Trie · Bit Manipulation

High frequency

Hard

30m

KMP Pattern Matching Algorithm· Strings — Advanced Algorithms

Strings · KMP

High frequency

Hard

35m

Number of Palindromic Substrings· Strings — Advanced Algorithms

Strings · Dynamic Programming · Two Pointers

High frequency

Medium

25m

Second Largest Element· Arrays

Arrays

Medium frequency

Easy

15m

K-th element of Two Arrays· Binary Search

Binary Search · Arrays

Medium frequency

Hard

40m

Check if a Number is a Power of 2· Bit Manipulation

Bit Manipulation · Maths

Medium frequency

Easy

10m

Single Number III· Bit Manipulation

Bit Manipulation · Arrays

Medium frequency

Medium

25m

Shortest Job First· Greedy Algorithms

Greedy · Heap · Sorting

Medium frequency

Medium

25m

Implement Stack Using Queue· Stacks & Queues

Stack · Queue

Medium frequency

Easy

15m

Implement Queue Using Stack· Stacks & Queues

Stack · Queue

Medium frequency

Easy

15m

Stock Span· Stacks & Queues

Stack · Monotonic Stack · Design

Medium frequency

Medium

25m

Reverse a Doubly Linked List· Linked List

Linked List

Medium frequency

Easy

15m

Even and Odd Linked List· Linked List

Linked List

Medium frequency

Medium

20m

Add 1 to Linked List· Linked List

Linked List · Recursion · Maths

Medium frequency

Medium

20m

Rotate the Linked List· Linked List

Linked List

Medium frequency

Medium

25m

Flatten a Linked List· Linked List

Linked List · Recursion · Sorting

Medium frequency

Hard

40m

Maximum Width of a Binary Tree· Binary Trees

Trees · BFS · Queue

Medium frequency

Medium

25m

Vertical Order Traversal of Binary Tree· Binary Trees

Trees · BFS · Hashing

Medium frequency

Hard

35m

Unique Tree from Traversals· Binary Trees

Trees · Recursion · DFS

Medium frequency

Hard

35m

Inorder Postorder Tree Build· Binary Trees

Trees · Recursion · DFS

Medium frequency

Hard

35m

Flattening a Binary Tree into a Right-Skewed List· Binary Trees

Trees · Recursion · DFS

Medium frequency

Medium

25m

Implement Min Heap· Heaps

Heap · Arrays

Medium frequency

Medium

30m

Flood Fill· Graphs

Graph · BFS · DFS

Medium frequency

Easy

15m

Prim's Algorithm Implementation· Graphs

Graph · Heap · Greedy

Medium frequency

Medium

30m

Kruskal's Algorithm Implementation· Graphs

Graph · Union Find · Greedy

Medium frequency

Medium

30m

Minimum Deletions to Make Strings Equal· Dynamic Programming

Dynamic Programming · Strings

Medium frequency

Medium

25m

Stock Trading III· Dynamic Programming

Dynamic Programming · Arrays

Medium frequency

Hard

30m