Microsoft OA Questions, October 2026: 4 Experiences

Shared by janebeingjane ·
Company
Microsoft
Reports
4 interview reports
Level
Unknown
Stages
OA

Four Microsoft online assessment reports from October 2026, split by hiring level, with each coding task they named and how candidates approached it.

At a glance

  • Process: One coding assessment with two tasks in every group. Internship: two tasks each (01, 02). Experienced: two tasks in 90 minutes (03). Level not reported: two tasks (04).
  • Asked recently: Internship: dynamic programming (DP) and equation parsing (01), binary search on the answer and interval overlap (02). Experienced: powers of two and counting with DP (03). Level not reported: substring counting and a non-adjacent pick (04).
  • Difficulty: No report rated it. In 03 the candidate expected DP on the second task and started with brute force.
  • Practise first: Minimum Changes for a Beautiful String (internship) and Count Nondecreasing Digit-Sum Arrays (experienced) for DP, then Maximum Alloy Production Within Budget (internship) for binary search on the answer.

Coverage: Four OA reports posted in October 2026: two internship (October 6–15; one Data Science Intern for summer 2027, one with no role named), one experienced candidate changing jobs (October 3), and one with no hiring level (October 1). None gave a location or a result.

What came up

DP is the one topic seen in more than one group: the internship report 01 used it on a string task, and the experienced report 03 expected it on a counting task. Binary search on the answer shows up once, in the internship group (02).

Questions we found

Data Science Intern (01)

Question Reports Last seen
Balance a Chemical Equation 1 Oct 2026
Minimum Changes for a Beautiful String 1 Oct 2026

Intern, role not named (02)

Question Reports Last seen
Maximum Alloy Production Within Budget 1 Oct 2026
Maximum Interactive Team Size 1 Oct 2026

Experienced full-time (03)

Question Reports Last seen
Minimum Operations to Reduce an Integer to Zero 1 Oct 2026
Count Nondecreasing Digit-Sum Arrays 1 Oct 2026

Hiring level not reported (04)

Question Reports Last seen
Maximum Valid Substring Frequency 1 Oct 2026
Minimum Non-Adjacent Selection Capability 1 Oct 2026

Internship OA reports

01: A Python data science OA with a chemistry twist

Report date: October 15, 2026 · Role: Data Science Intern (summer 2027)

The candidate explained both tasks.

  1. Balance a Chemical Equation. The input looks like HCl + NaOH - H2O + NaCl: a spaced hyphen splits the two sides, and a spaced plus splits the compounds. A number after an element is its count (none means 1). No brackets, and an element can repeat within a compound. Return the smallest whole-number coefficient for each compound, in order. The task asked for Python using the SymPy math library.
    • The candidate wrote one equation per element (atoms on the left equal atoms on the right). That gives a grid with a row per element and a column per compound: reactant counts positive, product counts negative.
    • Any nonzero solution balances the equation. They took one from SymPy, scaled it to whole numbers, made the signs positive and divided by the greatest common divisor.
    • Their caveat: using only SymPy's first solution assumes there is one balancing ratio. Their tests never broke that.
  2. Minimum Changes for a Beautiful String. A lowercase string is "beautiful" when no two neighbors are the same letter or next to each other in the alphabet, so bc fails but az is fine. One change swaps any letter for any other. Return the fewest changes. For bddje the answer is 1: turn the second d into f.
    • They first tried fixing bad pairs from left to right and dropped it. A letter that suits its left neighbor can still clash with its right one.
    • They switched to DP over the last letter. For each position and each of the 26 letters, keep the fewest changes so far if the string ends in that letter, and only allow steps where the two letters are more than one apart. That is about 26 × 26 work per character.

02: An alloy budget and overlapping work hours

Report date: October 6, 2026 · Role: Intern (role not named)

  1. Maximum Alloy Production Within Budget. One alloy unit needs composition[i] of each metal i. You already hold stock[i], and each extra unit costs cost[i]. With a fixed budget, make as many alloy units as you can. In the shown example (composition [1, 2], stock [0, 1], cost [1, 1], budget 3) the answer was 1. The post's approach was binary search on the number of units: for a guess, add up what you would have to buy beyond your stock, and check it against the budget.
  2. Maximum Interactive Team Size. Each employee works from a start time to an end time; two can interact when their hours overlap. A team is valid when one member overlaps everyone else on it, even if the others don't overlap each other. Return the biggest team. In the example (starts [1, 6, 4, 3, 1], ends [2, 7, 5, 8, 2]) the answer was 3. The post's approach: for each employee, count how many others overlap them, and the best team is that employee plus everyone who does.

Experienced full-time OA report

03: Ninety minutes, powers of two and a digit-sum count

Report date: October 3, 2026 · Level: Experienced (changing jobs)

This was the candidate's most recent Microsoft OA: 90 minutes, two coding tasks.

  1. The first task was named as a well-known exercise but not described. It matches Minimum Operations to Reduce an Integer to Zero: in each step you add or subtract a power of two, and you want the fewest steps to reach zero.
  2. Count Nondecreasing Digit-Sum Arrays. You get an array requiredSum of length n. Count the arrays of the same length that never go down, where every value is between 1 and 5000 and the digits of the value at position i add up to requiredSum[i]. Return the count modulo 10^9 + 7. For requiredSum = [1] there are four such arrays: [1], [10], [100] and [1000]. The limits were n up to 5000 and each required sum up to 31.

On the second task the candidate expected DP but started with brute force. The report gives no difficulty rating or outcome.


Report with no hiring level

04: Substring counts and non-adjacent picks

Report date: October 1, 2026 · Employment: Full-time (level not given)

  1. Maximum Valid Substring Frequency. Find how often the most frequent substring appears, counting only substrings whose length falls inside given bounds and that use no more than a given number of distinct letters.
  2. Minimum Non-Adjacent Selection Capability. Choose a required number of positions, no two side by side, so that the largest chosen value is as small as possible.

One line per task; no timing, platform or result.


Patterns across the reports

  1. Two coding tasks per sitting. Internship: both reports (01, 02). Experienced: the one report (03). Level not reported: the one report (04). Only 03 gave a time limit.

Common questions

How long is the Microsoft OA?

Experienced: 90 minutes for two tasks (03). The internship reports and the no-level report did not give a length.

How many questions are on the Microsoft OA?

Two coding tasks in each report: both internship reports (01, 02), the experienced report (03) and the no-level report (04).

How hard is the Microsoft OA?

No report rated it. The experienced candidate (03) expected DP on the counting task and started with brute force.

Is the Microsoft data science intern OA different?

Only one data science report is here (01). Its chemistry task asked for Python with SymPy; its other task was a string DP.

Keep practicing

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.

Comments

0

No comments yet — be the first to share what you know.