All Microsoft Coding Interview Questions
1176 questions we track for Microsoft, most frequently asked first. Practice any of them in the code editor and get AI feedback on your solution.
- Junior27% (319)
- Mid/Senior56% (658)
- Staff17% (199)
Questionspage 12 of 12
- Maximum Energy Boost From Two Drinks1 companyMid/Senior
- Final Array State After K Multiplication Operations I4 companiesJunior
- Reach End of Array With Max Score3 companiesMid/Senior
- The Two Sneaky Numbers of Digitville4 companiesJunior
- Find the K-th Character in String Game I5 companiesJunior
- Count of Substrings Containing Every Vowel and K Consonants II3 companiesMid/Senior
- Construct the Minimum Bitwise Array I5 companiesJunior
- Construct the Minimum Bitwise Array II4 companiesMid/Senior
- Find X-Sum of All K-Long Subarrays I5 companiesJunior
- Find the Original Typed String I7 companiesJunior
- Find the Original Typed String II5 companiesStaff
- Smallest Divisible Digit Product II3 companiesStaff
- Adjacent Increasing Subarrays Detection I4 companiesJunior
- Make Array Elements Equal to Zero5 companiesJunior
- Zero Array Transformation I5 companiesMid/Senior
- Zero Array Transformation III5 companiesMid/Senior
- Minimum Array Sum6 companiesMid/Senior
- Smallest Number With All Set Bits3 companiesJunior
- Minimum Operations to Make Array Values Equal to K4 companiesJunior
- Digit Operations to Make Two Integers Equal1 companyMid/Senior
- Transformed Array4 companiesJunior
- Count Subarrays of Length Three With a Condition5 companiesJunior
- Count Paths With the Given XOR Value1 companyMid/Senior
- Minimum Number of Operations to Make Elements in Array Distinct5 companiesJunior
- Find the Lexicographically Largest String From the Box I5 companiesMid/Senior
- Maximum Amount of Money Robot Can Earn5 companiesMid/Senior
- Count Non-Decreasing Subarrays After K Operations2 companiesStaff
- Maximum Difference Between Adjacent Elements in a Circular Array5 companiesJunior
- Count Partitions with Even Sum Difference5 companiesJunior
- Count Mentions Per User4 companiesMid/Senior
- Maximum Frequency After Subarray Operation4 companiesMid/Senior
- Reschedule Meetings for Maximum Free Time II4 companiesMid/Senior
- Maximum Difference Between Even and Odd Frequency I4 companiesJunior
- Maximum Manhattan Distance After K Changes4 companiesMid/Senior
- Maximum Difference Between Even and Odd Frequency II6 companiesStaff
- Sort Matrix by Diagonals5 companiesMid/Senior
- Length of Longest V-Shaped Diagonal Segment5 companiesStaff
- Check If Digits Are Equal in String After Operations I4 companiesJunior
- Maximum Sum With at Most K Elements2 companiesMid/Senior
- Lexicographically Smallest Generated String5 companiesStaff
- Fruits Into Baskets II5 companiesJunior
- Fruits Into Baskets III4 companiesMid/Senior
- Maximize Subarrays After Removing One Conflicting Pair5 companiesStaff
- Maximum Unique Subarray Sum After Deletion5 companiesJunior
- Find the Minimum Amount of Time to Brew Potions6 companiesMid/Senior
- Minimum Pair Removal to Sort Array I5 companiesJunior
- Minimum Pair Removal to Sort Array II3 companiesStaff
- Minimum Operations to Make Array Sum Divisible by K4 companiesJunior
- Smallest Palindromic Rearrangement I2 companiesMid/Senior
- Equal Sum Grid Partition I4 companiesMid/Senior
- Equal Sum Grid Partition II2 companiesStaff
- Transform Array to All Equal Elements3 companiesMid/Senior
- Count Partitions With Max-Min Difference at Most K4 companiesMid/Senior
- Minimum Increments to Equalize Leaf Paths2 companiesMid/Senior
- Maximize Spanning Tree Stability with Upgrades3 companiesStaff
- Power Grid Maintenance7 companiesMid/Senior
- Minimize Maximum Component Cost4 companiesMid/Senior
- Trionic Array II6 companiesStaff
- Minimum Sensors to Cover Grid4 companiesMid/Senior
- Minimum Cost Path with Edge Reversals8 companiesMid/Senior
- Best Time to Buy and Sell Stock using Strategy5 companiesMid/Senior
- GCD of Odd and Even Sums3 companiesJunior
- Maximum Walls Destroyed by Robots3 companiesStaff
- Twisted Mirror Path Count2 companiesMid/Senior
- Minimum Operations to Equalize Binary String4 companiesStaff
- Bitwise OR of Even Numbers in an Array2 companiesJunior
- Longest Balanced Substring II6 companiesMid/Senior
- Stable Subarrays With Equal Boundary and Interior Sum2 companiesMid/Senior
- Minimum Distance Between Three Equal Elements II3 companiesMid/Senior
- Maximum Path Score in a Grid2 companiesMid/Senior
- Minimum Absolute Distance Between Mirror Pairs4 companiesMid/Senior
- Maximum Subgraph Score in a Tree1 companyStaff
- Count Routes to Climb a Rectangular Grid1 companyStaff
- Count Residue Prefixes2 companiesJunior
- Maximum Capacity Within Budget2 companiesMid/Senior
- Count Good Subarrays2 companiesStaff