Microsoft SWE Intern, Early 2026: 54 Experiences (Part 2 of 6)

Shared by janebeingjane ·
Company
Microsoft
Reports
54 interview reports
Level
Internship
Stages
OA → Phone screen → Onsite

Microsoft SWE intern reports from January to June 2026: résumé and behavioral questions led, and Israel's interviews ran 75 or 90 minutes.

At a glance

  • Process: OA or home assignments, phone screens, then interview rounds; four of the eight Israel reports describe 75- or 90-minute interviews, longer than the 45-minute rounds common elsewhere.
  • Asked: résumé and project questions in 20 of these 54 reports and behavioral questions in 18; arrays and hashing (15) and linked lists (11) led the coding.
  • More: the question tables for all 232 reports, the regional notes and the patterns are in Part 1.

Coverage: Internship cohort, Software Engineering Intern role, reports 49–102, dated January 2 to June 28, 2026. None is from the Security & Identity internship. Locations: not stated 20, US 12, Israel 8, India 8, Romania 3, Egypt 2, Serbia 1. Stages: OA and home assignments, phone screens, interview rounds and finals. Dates are report dates unless a report gives an interview date.

In this series

  • Part 1: Software Engineering Intern reports 01–48, July to November 2026. Also has the overview, question tables, regional notes and patterns for all 232 Software Engineering Intern reports.
  • Part 2 (current): Software Engineering Intern reports 49–102, January to June 2026.
  • Part 3: Software Engineering Intern reports 103–149, October to December 2025.
  • Part 4: Software Engineering Intern reports 150–191, July to September 2025.
  • Part 5: Software Engineering Intern reports 192–232, January to June 2025 (plus one dated only to 2025).
  • Part 6: The other internship programs: Explore Intern (1 report), Student Software Engineer roles in Israel and Denmark (10) and one SWE Co-op (1).

What came up

In these 54 reports, the candidate's own story took up a lot of the interview time: resume and project questions came up in 20 and behavioral questions in 18. Arrays and hashing (15) and linked lists (11) led the coding topics.

Topic Reports Last seen
Resume, project and past-internship deep dives 20 of 54 Jun 2026 (report date)
Behavioral and motivation questions 18 of 54 Jun 2026 (report date)
Arrays and hashing 15 of 54 Jun 2026 (report date)
Linked lists 11 of 54 Jun 2026 (report date)
CS fundamentals (OS, OOP, DBMS, networks) 9 of 54 May 2026 (report date)
Strings 8 of 54 Jun 2026 (report date)
Dynamic programming 8 of 54 Jun 2026 (report date)
Trees, BSTs and tries 8 of 54 Jun 2026 (report date)
Graphs, BFS/DFS and dependency ordering 7 of 54 May 2026 (report date)
Binary search 5 of 54 Jun 2026 (report date)
System and low-level design 5 of 54 Jun 2026 (report date)
Math, bits and puzzles 5 of 54 Jun 2026 (report date)
Design a data structure or class (LRU, trie, setAll, hash map) 4 of 54 Jun 2026 (report date)
Greedy and backtracking 3 of 54 Jun 2026 (report date)
Stacks, queues and heaps 2 of 54 May 2026 (report date)
Grids and matrices 2 of 54 Feb 2026 (report date)
Sliding window and two pointers 1 of 54 Feb 2026 (report date)

A report can count toward several topics. The counts use this part's 54 reports.

Questions we found

These tables cover only this part's 54 reports. Part 1 has the tables for all 232 Software Engineering Intern reports.

Algorithms / Data Structures

Question Reports Last seen
Reverse a linked list 2: 52, 71 Jun 2026 (report date)
LRU Cache 2: 52, 69 Jun 2026 (report date)
Binary tree zigzag level-order traversal 2: 76, 91 Mar 2026 (report date)
Word Break II (all sentences) 1: 50 Jun 2026 (report date)
Split an array into K groups to minimize the largest sum 1: 51 Jun 2026 (report date)
Search in Rotated Sorted Array 1: 52 Jun 2026 (report date)
Majority Element 1: 53 Jun 2026 (report date)
Largest combination with bitwise AND above zero 1: 53 Jun 2026
Binary tree level-order traversal 1: 54 Jun 2026
Map with O(1) get, set and setAll 1: 55 Jun 2026 (report date)
Climbing Stairs 1: 56 Jun 2026 (report date)
Smallest difference between any two numbers 1: 57 May 2026
Rotate one array by the values of another 1: 58 May 2026
Merge Intervals 1: 60 May 2026 (report date)
Longest Valid Parentheses 1: 63 May 2026
Find All Anagrams in a String 1: 65 Apr 2026
Palindrome linked list 1: 70 Mar 2026 (report date)
Do two rectangles overlap? 1: 78 Mar 2026
All pairs with the minimum difference 1: 78 Mar 2026 (report date)
Redundant Connection 1: 80 Mar 2026
Pick songs that fill a time window as fully as possible 1: 82 Mar 2026
Count battleships on a board 1: 84 Feb 2026 (report date)
Add Binary 1: 89 Jan 2026
Valid Sudoku 1: 92 Jan 2026
Multiply two integers without the * operator 1: 93 Jan 2026
Is this array a BST postorder traversal? 1: 94 Jan 2026
Mean, median and mode of a stream 1: 97 Jan 2026
Users-and-groups membership structure 1: 102 Jan 2026
Keep unique elements with no extra data structure 1: 102 Jan 2026

Low-Level Design (LLD/OOD)

Question Reports Last seen
Design a parking lot with O(1) park and leave 1: 53 Jun 2026
Design a smart elevator 1: 86 Feb 2026

System Design

Question Reports Last seen
Speed up a 500 ms database call 1: 78 Mar 2026
Avoid serving stale cache data when the data updates every 5 minutes 1: 78 Mar 2026

Behavioral (BQ)

Question Reports Last seen
Tell me about yourself 2: 66, 88 Apr 2026
How do you handle a conflict at work? (practice) 1: 49 Jun 2026
Why Microsoft? / Why do you want to join Microsoft? (practice) 1: 66 Apr 2026 (report date)
Tell me about a failure / how do you handle failure? (practice) 1: 73 Mar 2026 (report date)
A technical challenge, or the hardest problem you solved (practice) 1: 75 Mar 2026 (report date)
What do you think about using AI? (practice) 1: 76 Mar 2026
How do you react to criticism? (practice) 1: 76 Mar 2026 (report date)
Strengths and weaknesses (practice) 1: 78 Mar 2026
A time you worked with engineers to fix a technical issue (practice) 1: 80 Mar 2026
How would you handle refactoring a pull request? (practice) 1: 83 Feb 2026
How do you handle errors? (practice) 1: 83 Feb 2026
How do you decide when you have several possible solutions? (practice) 1: 83 Feb 2026
How do you debug? (practice) 1: 83 Feb 2026
Security and testing, discussed in depth (practice) 1: 85 Feb 2026
Your favorite accomplishment (practice) 1: 88 Jan 2026
How did you deal with a bad team member? (practice) 1: 99 Jan 2026

CS fundamentals (concept questions)

Question Reports Last seen
Arrays vs. linked lists 2: 102, 89 Jan 2026
Linear search vs. binary search 1: 63 May 2026
What a linked list, a BST and an in-order traversal are 1: 72 Mar 2026
OOP principles (the four pillars) 1: 72 Mar 2026
How would you make your system crash with code? 1: 78 Mar 2026
How a hash map keeps keys unique 1: 102 Jan 2026

Puzzles

Question Reports Last seen
Three switches and three bulbs 1: 78 Mar 2026
100 doors puzzle 1: 78 Mar 2026

54 detailed candidate timelines, loops, and screens

49: Three one-hour interviews, all with managers

Report date: 2026-06-28 · Role: Software Engineer (Internship) · Location: Not stated · Result: No offer

Online test (3 algorithm questions)

Three interviews with managers (1 hour each)

  1. A coding problem in each interview (not named).
  2. How do you react to a conflict at work, and how do you handle it?

50: Straight into Word Break II

Report date: 2026-06-24 · Role: Software Engineer (Internship) · Location: Not stated · Result: No offer

Online assessment, then a long wait.

Technical interview (45 minutes, no introductions)

  1. Word Break II, the DP version that returns every sentence (hard).

51: Haifa — the OA was the whole story

Report date: 2026-06-23 · Role: Software Engineer (Internship) · Location: Haifa, Israel · Channel: University channel · Result: Offer

Online assessment (HackerRank)

  1. Split an array of server capacities into K contiguous groups so the largest group sum is as small as possible, and return that smallest possible maximum. The usual route is binary search on the answer with a greedy check.

The process took about a week.


52: Herzliya — three 90-minute interviews in two days

Report date: 2026-06-20 · Role: Software Engineer (Internship) · Location: Herzliya, Israel · Channel: Applied online · Result: No offer

Online code assessment

Three online interviews (90 minutes each, two senior interviewers per session, all within two days)

  1. Reverse a linked list.
  2. Implement an LRU cache.
  3. Search in Rotated Sorted Array.

53: Tel Aviv — project review, two coding tasks, then a parking lot

Report date: 2026-06-17 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Result: No offer

Three virtual interviews in one day, each 75 minutes on Teams.

Round 1, project and architecture review

  1. Present a personal or academic project, then field detailed questions on its architecture, algorithm choices, trade-offs and design decisions.

Round 2, coding (Teams plus HackerRank, 2 problems)

  1. Largest combination with bitwise AND above zero: find the biggest subset of an integer array whose AND is still greater than zero. Counting set bits per bit position does it.
  2. Majority Element: the value that appears more than n/2 times (guaranteed to exist). A hash map or Boyer-Moore voting.

Round 3, low-level design

  1. Design a parking lot. It grew into picking data structures so parking, leaving and finding each vehicle's physical spot are all O(1): an array of spots, a doubly linked list of free spots, and a map from vehicle ID to its node.

54: Bengaluru — 25 minutes of open source, then level order

Report date: 2026-06-10 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: University channel · Result: Offer

Interview

  1. About 25 minutes on their open-source work (a decompression project).
  2. Binary tree level-order traversal. Follow-up: print it level by level without storing a vector of vectors.

The candidate got the offer and declined it.


55: Tel Aviv — home exam, then a setAll map

Report date: 2026-06-06 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Channel: Referral · Result: No offer

Home exam about a month after applying.

Three interviews on one day (about 75 minutes each), roughly a month after the exam

  1. Build a map whose get, set and setAll all run in O(1).

56: Home exam, three technical rounds, one HR round

Report date: 2026-06-01 · Role: Software Engineer (Internship) · Location: Not stated · Result: No offer

Home exam (HackerRank)

Three technical interviews

  1. Climbing Stairs.
  2. System architecture topics.

HR interview


57: Cairo — HR first, then two problem-solving rounds

Report date: 2026-05-30 · Role: Software Engineer (Internship) · Location: Cairo, Egypt · Result: No offer

HR interview

Two problem-solving interviews (on HackerRank)

  1. Find the smallest difference between any two numbers in a list.

The candidate's tips: use your strongest language and think out loud.


58: Hyderabad — rotate one array by another

Report date: 2026-05-28 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Channel: University channel · Result: No offer

Interview (about 1 hour, 1 problem)

  1. Rotate the first array according to the values in a second array and return the result, then optimize it.

59: Tel Aviv — a take-home with one easy and one hard task

Report date: 2026-05-23 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Channel: Recruiter · Result: No offer

Take-home (HackerRank, about 10 days to finish, 2 problems)

  1. An easy-to-medium question (not named).
  2. A hard question built on range frequency queries.

The recruiter reached out on LinkedIn. About two weeks end to end.


60: Redmond — one behavioral hour, one Merge Intervals hour

Report date: 2026-05-12 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Interview 1, behavioral (1 hour)

  1. Ordinary behavioral questions, but with deep follow-ups.

Interview 2, technical (1 hour, back-to-back)

  1. Merge Intervals.

About two weeks end to end.


61: Three rounds — two easy problems and a hard tree

Report date: 2026-05-11 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer

Three rounds. Across them:

  1. Two easy algorithm questions.
  2. A hard binary-tree question, with time and space complexity.

62: A 90-minute OA on hashing, graphs and trees

Report date: 2026-05-06 · Role: Software Engineer (Internship) · Location: Not stated · Result: No offer

Online assessment (about 90 minutes, 2–3 algorithm problems on hashing, graphs and trees)

No response after the OA when they posted.


63: Bengaluru — longest valid parentheses and a harder DP

Report date: 2026-05-05 · Role: Software Engineer (Internship) · Location: Bengaluru, India · Channel: Applied online · Result: Offer

Online assessment

Technical interview

  1. A stack problem: find the longest valid sequence.
  2. A harder dynamic programming question.
  3. Linear search vs. binary search, and their time complexities.

Three days end to end.


64: University channel — DP and graphs in the OA

Report date: 2026-05-04 · Role: Software Engineer (Internship) · Location: Not stated · Channel: University channel · Result: No offer

Online assessment: dynamic programming and graph problems.

Technical interviews 1 and 2: coding and DSA discussion in both.

About two months end to end.


65: Three back-to-back rounds and one named problem

Report date: 2026-04-29 · Role: Software Engineer (Internship) · Location: Not stated · Result: No offer

Online assessment

Three back-to-back technical interviews

  1. Find All Anagrams in a String.

66: Seattle — a behavioral screen, then two coding problems

Report date: 2026-04-21 · Role: Software Engineer (Internship) · Location: Seattle, Washington, US · Result: No offer

Behavioral round

  1. Tell me about yourself, and why do you want to work for Microsoft? The round also screened the resume.

Technical interview (2 problems)

  1. One medium and one easy coding problem.

67: Tel Aviv — three 45-minute rounds, passed one

Report date: 2026-04-21 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Channel: Referral through the university · Result: No offer

Interview day (three rounds of about 45 minutes)

The candidate passed one of the three and shared no questions. A referral through the university started the process; about three weeks end to end.


68: Third-year internship — a graph problem with a trie angle, then a review of it

Report date: 2026-04-02 · Role: Internship (third year; SWE implied) · Location: Not stated · Result: Not stated (passed round 1)

OA (around 90 minutes)

  1. Described only in general terms: two or three DSA questions on arrays, strings and graphs, sometimes DP or greedy.

Interview 1, DSA

  1. One main graph problem that could be sped up with a trie or string matching. The interviewer kept asking for alternatives and improvements, with little theory. Shortlisted for the next round within hours.

Interview 2, same day

  1. Opened by going back over the round 1 solution: why that approach, what could be better, where to optimize.
  2. Current projects and internship work.
  3. OOP and core CS ideas, with design-style reasoning.
  4. Linked-list questions with twists: edge cases, pointer handling, small changes to standard problems.

69: Two online rounds in March — stack choices and an LRU cache

Report date: 2026-03-30 · Role: Software Engineer (Internship) · Location: Not stated · Channel: Applied online · Result: No offer

Technical interview and a second interview, back to back and online

  1. Self-introduction and resume projects, including why they chose their frontend stack.
  2. Code an LRU cache and explain the complexity of the data structures.

70: Belgrade — palindrome lists, then counting palindromes

Report date: 2026-03-29 · Role: Software Engineer (Internship) · Location: Belgrade, Serbia · Channel: Applied online · Result: No offer

Coding challenge (2 easy-to-medium exercises)

Three live-coding sessions (45 minutes each; about 15 minutes of behavioral and CV questions in each)

  1. Is a linked list a palindrome? Follow-up: count how many palindromes a given linked list contains.

About three months end to end.


71: Kanpur — reverse half a list, then the whole list

Report date: 2026-03-28 · Role: Software Engineer (Internship) · Location: Kanpur, India · Channel: University channel · Result: No offer

Interview (2–3 questions)

  1. Linked-list traversal, then reversing half the list and the full list with recursion.
  2. Questions from graphs, linked lists or DP, pushed step by step toward the best complexity.

72: Bucharest — explain the basics

Report date: 2026-03-26 · Role: Software Engineer (Internship) · Location: Bucharest, Romania · Result: Offer

Interviews (round count not given)

  1. Explain what a linked list, a binary search tree and an in-order traversal are.
  2. OOP principles.
  3. Behavioral, CV and personal-project questions.

The candidate got the offer and declined it.


73: Hyderabad campus — two 45-minute rounds

Report date: 2026-03-25 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Channel: On campus · Result: No offer

Two interview rounds (45 minutes each)

  1. Easy and medium DSA questions.
  2. A deep dive into resume projects.
  3. DBMS and OOP fundamentals.
  4. How do you handle failure?

74: Redmond — a screen, then a coding round with optimization follow-ups

Report date: 2026-03-22 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online, then recruiter · Result: Offer

Phone / virtual interview

  1. Basic technical questions, plus behavioral questions about experience, projects and interest in the role.

Technical interview

  1. Coding problems on data structures, explained aloud, with follow-ups on optimization.

The candidate got the offer and declined it.


75: Three 45-minute interviews, two questions each

Report date: 2026-03-21 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer

Three back-to-back interviews (45 minutes each)

  1. Tell me about a technical challenge.
  2. One technical question per interview (not named).

76: Redmond — zigzag traversal, a path variant, and views on AI

Report date: 2026-03-17 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer

Online assessment (HackerRank)

Two final interviews (45 minutes each, behavioral plus technical, 15-minute break)

  1. Zigzag level-order traversal of a tree.
  2. A variant of the binary-tree path problems.
  3. How do you react to criticism, for example on a graded assignment?
  4. What do you think about using AI?
  5. Resume projects the interviewer picked.

77: Manipal — a heap problem solved with a linked list

Report date: 2026-03-15 · Role: Software Engineer (Internship) · Location: Manipal, India · Channel: University channel · Result: No offer

Interview (1 problem)

  1. A heap problem. The candidate used a linked list instead; the answer was correct but slow, and they hit a segmentation fault.

Done in one day.


78: Lucknow — closest latency spikes, two puzzles and a rectangle check

Report date: 2026-03-14 · Role: Software Engineer (Internship) · Location: Lucknow, India · Channel: University channel · Result: No offer

Online assessment, two interview rounds and an HR round, all in one day. Across them:

  1. Find the pairs with the smallest absolute difference, framed as the closest latency spikes.
  2. The three switches and three bulbs puzzle, where you may enter the room only once.
  3. The 100 doors puzzle: doors are toggled over many passes; which stay open?
  4. Your cache holds data that updates every 5 minutes. How do you avoid serving stale data?
  5. A database call takes 500 ms. How would you speed it up?

The HR round had one DSA, one behavioral and one OS question:

  1. What are your strengths and weaknesses?
  2. Given two rectangles' coordinates, do they overlap?
  3. How would you make your system crash using code?

79: Redmond — four easy problems over two interviews

Report date: 2026-03-13 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Two interviews on the same day (2 problems each)

  1. Two easy coding problems per interview, each with time and space complexity.
  2. Explain a project of your choice from the resume.

About four weeks end to end.


80: An easy OA, then a hard graph problem

Report date: 2026-03-05 · Role: Software Engineer (Internship) · Location: Not stated · Channel: Applied online · Result: No offer

Online assessment (easy)

Two back-to-back interviews

  1. The first 15 minutes were behavioral: a time you worked with engineers on a team to fix a technical issue.
  2. A hard graph problem the candidate believes was Redundant Connection.

81: Bucharest — a three-hour block with three interviewers

Report date: 2026-03-04 · Role: Software Engineer (Internship) · Location: Bucharest, Romania · Channel: Applied online · Result: No offer

Three interviews of about an hour each, back to back

  1. One problem per interviewer, plus questions about the code, the candidate and their projects.
  2. Assorted questions on hash tables.

About four weeks end to end.


82: Seattle — an easy DP and a song-picking problem

Report date: 2026-03-03 · Role: Software Engineer (Internship) · Location: Seattle, Washington, US · Channel: Applied online · Result: No offer

Coding assessment (2 problems; the stage isn't named)

  1. An easy DP problem.
  2. Pick songs that fill a time window as fully as possible. The candidate sorted and used binary search, and thought it was a greedy problem.

The candidate applied in early 2025; the report is dated March 2026.


83: Two rounds, and the second had no coding

Report date: 2026-02-12 · Role: Software engineering intern · Location: Not stated · Channel: Applied online · Result: Passed

Round 1

  1. One medium problem from a popular practice list (not named).
  2. How do you decide when you have several possible solutions?

Round 2 (no coding)

  1. How do you debug?
  2. How do you handle errors?
  3. How would you handle refactoring a pull request?

The candidate felt the problems weren't hard and that rounds vary a lot from team to team.


84: Three rounds in a day, and a battleship grid

Report date: 2026-02-06 · Role: Software Engineer (Internship) · Location: Not stated · Result: Offer

Three rounds on one day; you have to pass the first two to meet the hiring manager.

  1. An easy warm-up such as an anagram check.
  2. A medium battleship problem.

85: Back-to-back rounds with a deep look at security and testing

Report date: 2026-02-06 · Role: Software engineering intern · Location: Not stated · Channel: Applied online · Result: Rejected

Two back-to-back rounds

Round 1

  1. A 10-minute resume deep dive, with follow-ups on what they said.
  2. A sliding-window problem from a popular practice list (not named).

Round 2

  1. About 20 minutes of behavioral questions that went deep on security and testing.
  2. A hash map problem (not named).

86: Bucharest — a modified problem and a smart elevator

Report date: 2026-02-05 · Role: Software Engineer (Internship) · Location: Bucharest, Romania · Channel: Applied online · Result: No offer

Technical test (2 problems)

Phone interview (30 minutes; this candidate skipped it)

Three 45-minute final rounds (15-minute breaks)

  1. A coding problem, then a modified version of the same problem.
  2. CV projects, then how would you design a smart elevator?
  3. Basic OOP questions.

About three weeks end to end.


87: An OA a month after applying, then a wait

Report date: 2026-02-03 · Role: Software engineering intern · Location: Not stated · Channel: Applied online · Result: Waiting when posted

Online assessment, about a month after applying (2 problems)

  1. An easy first problem.
  2. A harder second problem; they passed 10 of its 15 tests.

88: Redmond — favorite accomplishment and a resume grill

Report date: 2026-01-28 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: Offer

Two back-to-back 45-minute interviews

  1. Tell me about yourself and your favorite accomplishment.
  2. coding questions, plus a hard look at the resume.

The candidate got the offer and declined it.


89: Hyderabad campus — Add Binary and array basics

Report date: 2026-01-26 · Role: Software Engineer (Internship) · Location: Hyderabad, India · Channel: On campus · Result: Offer

Two rounds

  1. Add two binary strings and return the sum as a binary string.
  2. What arrays are, how they differ from linked lists, and the idea behind binary search.

Three days end to end.


90: University channel — a three-problem OA

Report date: 2026-01-26 · Role: Software Engineer (Internship) · Location: Not stated · Channel: University channel · Result: No offer

Online assessment (3 problems): two DP questions and one vector question, from easy-medium to medium-hard.

Two technical / HR rounds

  1. String questions.

91: Tel Aviv — three technical rounds, no behavioral

Report date: 2026-01-24 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Result: No offer

Three technical interviews (no behavioral questions)

  1. Print a BST in zigzag level order.
  2. Two more questions that weren't typical algorithm puzzles (not described).

92: Valid Sudoku and an easy-medium follow-on

Report date: 2026-01-22 · Role: Software Engineer (Internship) · Location: Not stated · Channel: Applied online · Result: Offer

Two back-to-back 45-minute interviews (coding plus behavioral)

  1. Valid Sudoku.
  2. Another easy-to-medium question.

About four weeks end to end.


93: Atlanta — multiply without the * operator

Report date: 2026-01-22 · Role: Software Engineer (Internship) · Location: Atlanta, Georgia, US · Channel: Applied online · Result: Offer

Interview

  1. Multiply two integers without using the multiplication operator.
  2. How would you scale the projects on your resume?

About two weeks end to end.


94: Is this array a BST postorder?

Report date: 2026-01-22 · Role: Software Engineer (Internship) · Location: Not stated · Result: No offer

Online assessment (HackerRank)

Two back-to-back interviews, each with behavioral questions

  1. Check whether an array is a valid postorder traversal of a BST, then its time and space complexity.

95: Tel Aviv — three 90-minute interviews

Report date: 2026-01-21 · Role: Software Engineer (Internship) · Location: Tel Aviv, Israel · Channel: Applied online · Result: No offer

Three interviews (90 minutes each)

  1. A BFS-style problem (the candidate doesn't remember the rest).
  2. Algorithm and design-style questions.

96: Redmond — a third of the time on the resume

Report date: 2026-01-20 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Two rounds

  1. Tell me about a project you worked on. About a third of the time went to resume and experience.
  2. An easy coding question.

About a week end to end.


97: Redmond — stats on an endless stream

Report date: 2026-01-15 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: No offer

Interview 1 (1 problem)

  1. Given an endless stream of numbers, report the mean, median and mode.

Interview 2 (1 problem)

  1. A hash map question.

Arrays and linked lists also came up.


98: Redmond — two problems in an hour

Report date: 2026-01-14 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Result: No offer

Interview (1 hour)

  1. Two easy-to-medium coding questions.
  2. Tell me about your resume.

99: Superday — a resume grill, then easy, medium, hard

Report date: 2026-01-13 · Role: Software Engineer (Internship) · Location: Not stated · Channel: Applied online · Result: No offer

Superday interview 1 (1 hour with an engineer, no technical questions)

  1. How did you deal with a bad team member?
  2. A grilling on the resume.

Superday interview 2 (1 hour with an engineer)

  1. Three coding questions: easy, then medium, then hard.

They heard back within a week.


100: Redmond — two 45-minute DSA rounds

Report date: 2026-01-07 · Role: Software Engineer (Internship) · Location: Redmond, Washington, US · Channel: Applied online · Result: Offer

Two DSA rounds (45 minutes each)

  1. Linked-list and string-manipulation questions.

About three months from application to offer.


101: Cairo — two senior engineers, coding and databases

Report date: 2026-01-04 · Role: Software Engineer (Internship) · Location: Cairo, Egypt · Channel: Applied online · Result: No offer

Two online interviews, each with a senior engineer

  1. coding problems (not named).
  2. Database questions.
  3. Resume projects.

102: Referral SDE intern — no hash maps allowed, then allowed

Report date: 2026-01-02 · Role: SDE Intern · Location: Not stated · Channel: Referral · Result: Not stated

Round 1, fundamentals (60 minutes, conversational, focused on trade-offs)

  1. Linked lists: real uses, how they compare with arrays, and when to choose one.
  2. Hash maps: how keys stay unique, and hashing at a high level.
  3. Keep elements unique. The candidate proposed a hash map. The interviewer then banned any extra data structure, and the candidate switched to sorting and comparing neighbors.

Round 2, same day: design, then code

  1. Users-and-groups membership structure: a user can be in many groups; return all groups for a user and all users in a group. Hash maps were off the table at first. The candidate talked through an adjacency (graph) layout and weighed a union-find (DSU) idea, and every design drew scalability questions. Then they coded it with hash maps allowed, keeping it modular.

Common questions

How long are Microsoft SWE intern interviews in Israel?

Four of the eight Israel reports in this part describe 75- or 90-minute interviews, longer than the 45-minute rounds common elsewhere.

Keep practicing

In this series: Part 1 · Part 2 (current) · Part 3 · Part 4 · Part 5 · Part 6

Sources: Anywhere useful interview info can be found.

Next in this seriesMicrosoft SWE Intern, Late 2025: 47 Experiences (Part 3 of 6)
0 total reactions. Your reactions: none.

Comments

0

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