Microsoft Interview Guide

If you have a Microsoft interview, it's very likely that you will get this question

#1. Minimum Edge Reversals So Every Node Is Reachable

GraphsDynamic Programming

You're given a directed graph. Determine the minimum number of edges you need to reverse so that every node becomes reachable from node 0.

This question is very likely to be asked in your Microsoft interview

Two Sum

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

ArraysStringsTwo Pointers

If you have a Microsoft interview, it's very likely that you will get this question

#2. Two Sum

ArraysStringsTwo Pointers

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

This question is very likely to be asked in your Microsoft interview

Valid Word

Determine if a given word is considered valid based on a specific set of rules or constraints. The goal is to check if the input string adheres to the specified validation criteria.

If you have a Microsoft interview, it's very likely that you will get this question

#3. Valid Word

Determine if a given word is considered valid based on a specific set of rules or constraints. The goal is to check if the input string adheres to the specified validation criteria.

This question is very likely to be asked in your Microsoft interview

Valid Parentheses

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

StringsStacks

If you have a Microsoft interview, it's very likely that you will get this question

#4. Valid Parentheses

This question is very likely to be asked in your Microsoft interview

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

StringsStacks

Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicate elements in-place such that each unique element appears only once. Return the new length of the array.

If you have a Microsoft interview, it's very likely that you will get this question

#5. Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicate elements in-place such that each unique element appears only once. Return the new length of the array.

This question is very likely to be asked in your Microsoft interview

Spiral Matrix

Traverse a given matrix in a spiral pattern, returning all elements in the order you visit them. Essentially, walk around the matrix layer by layer, adding elements to a list.

If you have a Microsoft interview, it's very likely that you will get this question

#6. Spiral Matrix

Traverse a given matrix in a spiral pattern, returning all elements in the order you visit them. Essentially, walk around the matrix layer by layer, adding elements to a list.

This question is very likely to be asked in your Microsoft interview

Count Palindromic Subsequences

The problem asks you to find the total number of distinct palindromic subsequences within a given string. Remember that subsequences don't have to be contiguous.

StringsDynamic Programming

If you have a Microsoft interview, it's very likely that you will get this question

#7. Count Palindromic Subsequences

StringsDynamic Programming

The problem asks you to find the total number of distinct palindromic subsequences within a given string. Remember that subsequences don't have to be contiguous.

This question is very likely to be asked in your Microsoft interview

Generate Parentheses

Given a number 'n', generate all possible well-formed (balanced) parentheses strings of length 2*n. For instance, if n=3, you need to create all valid combinations like '((()))', '(()())', etc.

StringsRecursion

If you have a Microsoft interview, it's very likely that you will get this question

#8. Generate Parentheses

This question is very likely to be asked in your Microsoft interview

Given a number 'n', generate all possible well-formed (balanced) parentheses strings of length 2*n. For instance, if n=3, you need to create all valid combinations like '((()))', '(()())', etc.

StringsRecursion

Palindrome Number

Determine whether an integer is a palindrome. That is, it reads the same forwards and backward.

Two Pointers

If you have a Microsoft interview, it's very likely that you will get this question

#9. Palindrome Number

This question is very likely to be asked in your Microsoft interview

Determine whether an integer is a palindrome. That is, it reads the same forwards and backward.

Two Pointers

Merge Sorted Array

You are given two sorted integer arrays. Merge the second array into the first one, maintaining the sorted order.

If you have a Microsoft interview, it's very likely that you will get this question

#10. Merge Sorted Array

You are given two sorted integer arrays. Merge the second array into the first one, maintaining the sorted order.

This question is very likely to be asked in your Microsoft interview

Merge Intervals

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

ArraysGreedy Algorithms

If you have a Microsoft interview, it's very likely that you will get this question

#11. Merge Intervals

This question is very likely to be asked in your Microsoft interview

You are given a collection of intervals. Merge all overlapping intervals into a single interval and return the result.

ArraysGreedy Algorithms

Maximum Number of Alloys

You're given resources and machine blueprints. Determine the maximum number of identical alloys you can create by optimally distributing your resources across the machines.

Binary Search

If you have a Microsoft interview, it's very likely that you will get this question

#12. Maximum Number of Alloys

This question is very likely to be asked in your Microsoft interview

You're given resources and machine blueprints. Determine the maximum number of identical alloys you can create by optimally distributing your resources across the machines.

Binary Search

Median of Two Sorted Arrays

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

ArraysBinary Search

If you have a Microsoft interview, it's very likely that you will get this question

#13. Median of Two Sorted Arrays

This question is very likely to be asked in your Microsoft interview

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

ArraysBinary Search

Group Anagrams

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

ArraysStrings

If you have a Microsoft interview, it's very likely that you will get this question

#14. Group Anagrams

This question is very likely to be asked in your Microsoft interview

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

ArraysStrings

Minimum Difficulty of a Job Schedule

You're given a list of job difficulties and a number of days. Find the minimum total difficulty to schedule all jobs, ensuring at least one job is done each day.

ArraysDynamic Programming

If you have a Microsoft interview, it's very likely that you will get this question

#15. Minimum Difficulty of a Job Schedule

ArraysDynamic Programming

You're given a list of job difficulties and a number of days. Find the minimum total difficulty to schedule all jobs, ensuring at least one job is done each day.

This question is very likely to be asked in your Microsoft interview

Subarray Sum Equals K

Determine the total number of continuous subarrays within a given array that sum up to a specific target value, k.

ArraysSliding WindowsDynamic Programming

If you have a Microsoft interview, it's very likely that you will get this question

#16. Subarray Sum Equals K

ArraysSliding WindowsDynamic Programming

Determine the total number of continuous subarrays within a given array that sum up to a specific target value, k.

This question is very likely to be asked in your Microsoft interview

Roman to Integer

Convert a Roman numeral string into its corresponding integer value. The input string will represent a valid Roman numeral.

If you have a Microsoft interview, it's very likely that you will get this question

#17. Roman to Integer

Convert a Roman numeral string into its corresponding integer value. The input string will represent a valid Roman numeral.

This question is very likely to be asked in your Microsoft interview

Longest Palindromic Substring

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

StringsDynamic ProgrammingTwo Pointers

If you have a Microsoft interview, it's very likely that you will get this question

#18. Longest Palindromic Substring

StringsDynamic ProgrammingTwo Pointers

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

This question is very likely to be asked in your Microsoft interview

Trapping Rain Water

Given an array representing the height of bars, calculate how much water can be trapped between them after rain. Think about finding the maximum height to the left and right of each bar.

ArraysTwo PointersDynamic Programming

If you have a Microsoft interview, it's very likely that you will get this question

#19. Trapping Rain Water

ArraysTwo PointersDynamic Programming

Given an array representing the height of bars, calculate how much water can be trapped between them after rain. Think about finding the maximum height to the left and right of each bar.

This question is very likely to be asked in your Microsoft interview

Contains Duplicate

Determine if any value appears at least twice in an array of numbers. Return true if duplicates exist; otherwise, return false.

If you have a Microsoft interview, it's very likely that you will get this question

#20. Contains Duplicate

Determine if any value appears at least twice in an array of numbers. Return true if duplicates exist; otherwise, return false.