Microsoft Interview Question Bank
Microsoft runs two parallel hiring tracks: the standardized Hiring Event (HE) loop covering Azure, Cloud, Copilot, and Office orgs, and Mustafa Suleyman's MAI org with its own recruiter pool and a distinctly OpenAI-flavored coding rotation. The HE bar is consistent — four 60-minute rounds back-to-back on a fixed weekday — with medium-difficulty algorithms and one system-design slot; MAI loops add project deep-dive depth and pull problems from an in-memory-DB / beam-search / streaming-decoder pool that does not overlap with classic LeetCode prep.
248
questions
Last updated
Before you start
Showing 39 of 39
OJ Problems
practice in the online judgeZigzag Level Order Traversal of a Binary TreePalindrome Linked List with O(1) Extra SpaceImplement an LRU CacheSpiral Traversal of a MatrixLowest Common Ancestor of a Binary TreeLowest Common Ancestor of a Binary Search TreeMerge IntervalsGenerate Lexicographically Sorted String Subsets0/1 KnapsackReturn the Top K Largest NumbersMaximum XOR ProductLargest Time for Given DigitsMinimum Cost Travel with City-Specific Fuel PricesMaximum Strength of Each Neuron in a Tree NetworkMaximum XOR ProductPossible Bipartition VariationSerialize and Deserialize Binary TreeNumber of IslandsShortest Path in a Grid with at Most K Cells per MoveDesign and Implement a URL ShortenerImplement K-Means ClusteringIn-Memory SQL with CSV InitializationOrder Records by Matching Start/End and Concatenate PayloadsImplement K-Means ClusteringImplement a Tiny Feed-Forward Next-Token Predictor in PyTorch (Fill TODOs)Output all overlapping intervalsRotate String (variant with two string arrays)Heap-based problem (unknown exact prompt)LFU Cache (wrapped variant)Implement Greedy Decoding (k=1) and Beam Search (k>1) with Length Normalization