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
- Maximum Width of Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 29.3
- Meeting RoomseasyArraySortingQuicksortfrequency 29.3
- Minimum Deletions to Make Character Frequencies UniquemediumHash TableStringGreedySortingfrequency 29.3
- Minimum Falling Path SummediumArrayDynamic ProgrammingMatrixfrequency 29.3
- Minimum Fuel Cost to Report to the CapitalmediumTreeDepth-First SearchBreadth-First SearchGraph Theoryfrequency 29.3
- Minimum Operations to Make Array Equal to TargethardArrayDynamic ProgrammingStackGreedy+1frequency 29.3
- Minimum Sum of Squared DifferencemediumArrayBinary SearchGreedySorting+1frequency 29.3
- Number of Times Binary String Is Prefix-AlignedmediumArrayfrequency 29.3
- Number of Unique Flavors After Sharing K CandiesmediumArrayHash TableSliding Windowfrequency 29.3
- Optimal Partition of StringmediumHash TableStringGreedyfrequency 29.3
- Remove Duplicates From an Unsorted Linked ListmediumHash TableLinked Listfrequency 29.3
- Reverse Words in a String IImediumTwo PointersStringfrequency 29.3
- Search in Rotated Sorted Array IImediumArrayBinary Searchfrequency 29.3
- Shuffle StringeasyArrayStringfrequency 29.3
- Sliding Window MedianhardArrayHash TableSliding WindowHeap (Priority Queue)+1frequency 29.3
- Stone Game IVhardMathDynamic ProgrammingMinimaxGame Theory+3frequency 29.3
- Valid Parenthesis StringmediumStringDynamic ProgrammingStackGreedy+1frequency 29.3
- Widest Vertical Area Between Two Points Containing No PointseasyArraySortingfrequency 29.3
- Word Ladder IIhardHash TableStringBacktrackingBreadth-First Search+1frequency 29.3
- 01 MatrixmediumArrayDynamic ProgrammingBreadth-First SearchMatrixfrequency 27.3
- Add StringseasyMathStringSimulationfrequency 27.3
- All O`one Data StructurehardHash TableLinked ListDesignDoubly-Linked Listfrequency 27.3
- All the Matches of the LeagueeasyDatabasefrequency 27.3
- Amount of Time for Binary Tree to Be InfectedmediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 27.3
- Average Height of Buildings in Each SegmentmediumArraySortingHeap (Priority Queue)Prefix Sumfrequency 27.3
- Bitwise OR of Even Numbers in an ArrayeasyArrayBit ManipulationSimulationfrequency 27.3
- Bitwise ORs of SubarraysmediumArrayDynamic ProgrammingBit Manipulationfrequency 27.3
- Boundary of Binary TreemediumTreeDepth-First SearchBinary Treefrequency 27.3
- Car FleetmediumArrayStackSortingMonotonic Stackfrequency 27.3
- Cheapest Flights Within K StopsmediumDynamic ProgrammingDepth-First SearchBreadth-First SearchGraph Theory+2frequency 27.3
- Check if All A's Appears Before All B'seasyStringfrequency 27.3
- Closest Binary Search Tree ValueeasyBinary SearchTreeDepth-First SearchBinary Search Tree+1frequency 27.3
- Confirmation RatemediumDatabasefrequency 27.3
- Count Good SubarrayshardArrayStackBit ManipulationMonotonic Stackfrequency 27.3
- Count Number of Nice SubarraysmediumArrayHash TableMathSliding Window+1frequency 27.3
- Count Submatrices With Equal Frequency of X and YmediumArrayMatrixPrefix Sumfrequency 27.3
- Count Substrings That Differ by One CharactermediumHash TableStringDynamic ProgrammingEnumerationfrequency 27.3
- Countereasyfrequency 27.3
- Delete Duplicate EmailseasyDatabasefrequency 27.3
- Delete N Nodes After M Nodes of a Linked ListeasyLinked Listfrequency 27.3
- Delete Tree NodesmediumArrayTreeDepth-First SearchBreadth-First Search+1frequency 27.3
- Design Excel Sum FormulahardArrayHash TableStringGraph Theory+3frequency 27.3
- Design SkiplisthardLinked ListDesignfrequency 27.3
- Equal Rational NumbershardMathStringfrequency 27.3
- Find All The Lonely NodeseasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 27.3
- Find Smallest Common Element in All RowsmediumArrayHash TableBinary SearchMatrix+1frequency 27.3
- Find the DifferenceeasyHash TableStringBit ManipulationSortingfrequency 27.3
- Find the Level of Tree with Minimum SummediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 27.3
- Find the Longest Substring Containing Vowels in Even CountsmediumHash TableStringBit ManipulationPrefix Sumfrequency 27.3
- Find the Median of the Uniqueness ArrayhardArrayHash TableBinary SearchSliding Windowfrequency 27.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.