Companies
Amazon1005 questions
Meta532 questions
Google472 questions
Uber336 questions
ByteDance / TikTok405 questions
Microsoft264 questions
Apple182 questions
Snowflake193 questions
OpenAI207 questions
Stripe205 questions
Databricks119 questions
DoorDash139 questions
Netflix97 questions
Pinterest102 questions
Roblox89 questions
Anthropic105 questions
IBM125 questions
Citadel / Citadel Securities122 questions
Bloomberg118 questions
Salesforce112 questions
Coinbase93 questions
LinkedIn111 questions
Capital One107 questions
Goldman Sachs105 questions
Airbnb104 questions
Oracle103 questions
Rippling82 questions
Snapchat94 questions
Waymo93 questions
JPMorgan Chase84 questions

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.
264
questions
Last updated
Before you start
Showing 47 of 47
OJ Problems
practice in the online judgeValidate an Employee Hierarchy and Find the Maximum Root-to-Employee DistanceBasic Calculator IIIAlien DictionaryCount Maximum Occurrences in SuffixesSubtract Two Numbers Represented by Forward-Order Linked ListsFind All Anagrams of a Target StringMaximum Stock Profit with Up to Two TransactionsBounded Keyed Task ExecutorZigzag 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 Initialization
