Problems
Callback's own problems and the LeetCode questions companies have been asking, in one place — filter by category, company, topic, difficulty, and how recently a question showed up.
Asked on LeetCode
1,384 questions at Microsoft · all time
- Fruit Into BasketsmediumArrayHash TableSliding Windowfrequency 31.1
- IPOhardArrayGreedySortingHeap (Priority Queue)frequency 31.1
- Invert Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 31.1
- Longest Substring with At Least K Repeating CharactersmediumHash TableStringDivide and ConquerSliding Windowfrequency 31.1
- Max Pair Sum in an ArrayeasyArrayHash Tablefrequency 31.1
- Maximum Number of Operations With the Same Score IImediumArrayDynamic ProgrammingMemoizationfrequency 31.1
- Maximum Product of Splitted Binary TreemediumTreeDepth-First SearchBinary Treefrequency 31.1
- Minimum Absolute DifferenceeasyArraySortingfrequency 31.1
- Minimum Adjacent Swaps for K Consecutive OneshardArrayGreedySliding WindowPrefix Sumfrequency 31.1
- Minimum Common ValueeasyArrayHash TableTwo PointersBinary Searchfrequency 31.1
- Minimum Time to Make Rope ColorfulmediumArrayStringDynamic ProgrammingGreedyfrequency 31.1
- Monthly Transactions ImediumDatabasefrequency 31.1
- Number of Students Unable to Eat LuncheasyArrayStackQueueSimulationfrequency 31.1
- Partition Array According to Given PivotmediumArrayTwo PointersSimulationfrequency 31.1
- Partition Array Into Three Parts With Equal SumeasyArrayGreedyfrequency 31.1
- Power of TwoeasyMathBit ManipulationRecursionfrequency 31.1
- Print Words VerticallymediumArrayStringSimulationfrequency 31.1
- Reduction Operations to Make the Array Elements EqualmediumArraySortingfrequency 31.1
- Remove Digit From Number to Maximize ResulteasyStringGreedyEnumerationfrequency 31.1
- Shortest Path in Binary MatrixmediumArrayBreadth-First SearchMatrixfrequency 31.1
- Smallest Missing Integer Greater Than Sequential Prefix SumeasyArrayHash TableSortingfrequency 31.1
- Smallest String With SwapsmediumArrayHash TableStringDepth-First Search+3frequency 31.1
- Students and ExaminationseasyDatabasefrequency 31.1
- Substring with Concatenation of All WordshardHash TableStringSliding Windowfrequency 31.1
- Sum of Digits of String After ConverteasyStringSimulationfrequency 31.1
- The Knight’s TourmediumArrayBacktrackingMatrixfrequency 31.1
- Valid Perfect SquareeasyMathBinary Searchfrequency 31.1
- Binary Subarrays With SummediumArrayHash TableSliding WindowPrefix Sumfrequency 29.3
- Bulb Switcher IImediumMathBit ManipulationDepth-First SearchBreadth-First Searchfrequency 29.3
- Bus RouteshardArrayHash TableBreadth-First Searchfrequency 29.3
- Cinema Seat AllocationmediumArrayHash TableGreedyBit Manipulationfrequency 29.3
- Clumsy FactorialmediumMathStackSimulationfrequency 29.3
- Consecutive NumbersmediumDatabasefrequency 29.3
- Count of Smaller Numbers After SelfhardArrayBinary SearchDivide and ConquerBinary Indexed Tree+4frequency 29.3
- Customers Who Never OrdereasyDatabasefrequency 29.3
- Design Add and Search Words Data StructuremediumStringDepth-First SearchDesignTriefrequency 29.3
- Duplicate EmailseasyDatabasefrequency 29.3
- Find All Duplicates in an ArraymediumArrayHash TableSortingfrequency 29.3
- Find Bottom Left Tree ValuemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 29.3
- Find Eventual Safe StatesmediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+2frequency 29.3
- Find Missing and Repeated ValueseasyArrayHash TableMathMatrixfrequency 29.3
- Find the Start and End Number of Continuous RangesmediumDatabasefrequency 29.3
- Friend Requests II: Who Has the Most FriendsmediumDatabasefrequency 29.3
- Insert into a Binary Search TreemediumTreeBinary Search TreeBinary Treefrequency 29.3
- Kids With the Greatest Number of CandieseasyArrayfrequency 29.3
- Largest Palindromic NumbermediumHash TableStringGreedyCountingfrequency 29.3
- Lowest Common Ancestor of a Binary Tree IIImediumHash TableTwo PointersTreeBinary Tree+2frequency 29.3
- Maximum Employees to Be Invited to a MeetinghardArrayDynamic ProgrammingDepth-First SearchGraph Theory+3frequency 29.3
- Maximum Number of AlloysmediumArrayBinary Searchfrequency 29.3
- Maximum Subgraph Score in a TreehardArrayDynamic ProgrammingTreeDepth-First Searchfrequency 29.3
Listings only — titles, difficulty, and tags link out to LeetCode. Imported from the leetcode-company-wise-problems snapshot dated 1 June 2025. Frequency is that dataset's own relative score within a company and time range.