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 Product of Subsequences With an Alternating Sum Equal to KhardArrayHash TableDynamic Programmingfrequency 12.0
- Maximum Product of Two Elements in an ArrayeasyArraySortingHeap (Priority Queue)frequency 12.0
- Maximum Score From Removing SubstringsmediumStringStackGreedyfrequency 12.0
- Maximum Size Subarray Sum Equals kmediumArrayHash TablePrefix Sumfrequency 12.0
- Maximum Subarray Sum with One DeletionmediumArrayDynamic Programmingfrequency 12.0
- Maximum Twin Sum of a Linked ListmediumLinked ListTwo PointersStackfrequency 12.0
- Maximum Units on a TruckeasyArrayGreedySortingfrequency 12.0
- Maximum XOR of Two Numbers in an ArraymediumArrayHash TableBit ManipulationTriefrequency 12.0
- Merge BSTs to Create Single BSThardArrayHash TableTreeDepth-First Search+2frequency 12.0
- Merge In Between Linked ListsmediumLinked Listfrequency 12.0
- Minimize XORmediumGreedyBit Manipulationfrequency 12.0
- Minimum Absolute Distance Between Mirror PairsmediumArrayHash TableMathfrequency 12.0
- Minimum Bit Flips to Convert NumbereasyBit Manipulationfrequency 12.0
- Minimum Cost For TicketsmediumArrayDynamic Programmingfrequency 12.0
- Minimum Cost Walk in Weighted GraphhardArrayBit ManipulationUnion-FindGraph Theoryfrequency 12.0
- Minimum Cost to Make Array EqualhardArrayBinary SearchGreedySorting+1frequency 12.0
- Minimum Cost to Move Chips to The Same PositioneasyArrayMathGreedyfrequency 12.0
- Minimum Cost to Reach Destination in TimehardArrayDynamic ProgrammingGraph TheoryDijkstra's Algorithmfrequency 12.0
- Minimum Difference Between Highest and Lowest of K ScoreseasyArraySliding WindowSortingfrequency 12.0
- Minimum Domino Rotations For Equal RowmediumArrayGreedyfrequency 12.0
- Minimum Element After Replacement With Digit SumeasyArrayMathfrequency 12.0
- Minimum Height TreesmediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sortfrequency 12.0
- Minimum Increments to Equalize Leaf PathsmediumArrayDynamic ProgrammingTreeDepth-First Searchfrequency 12.0
- Minimum Number of Flips to Make the Binary String AlternatingmediumStringDynamic ProgrammingSliding Windowfrequency 12.0
- Minimum Number of Operations to Make Array ContinuoushardArrayHash TableBinary SearchSliding Windowfrequency 12.0
- Minimum Number of Swaps to Make the String BalancedmediumTwo PointersStringStackGreedy+1frequency 12.0
- Minimum Operations to Equalize Binary StringhardMathStringBreadth-First SearchUnion-Find+1frequency 12.0
- Minimum Operations to Make Array Sum Divisible by KeasyArrayMathfrequency 12.0
- Minimum Operations to Make Array Values Equal to KeasyArrayHash Tablefrequency 12.0
- Minimum Operations to Make a Uni-Value GridmediumArrayMathSortingMatrixfrequency 12.0
- Minimum Penalty for a ShopmediumStringPrefix Sumfrequency 12.0
- Most Common WordeasyArrayHash TableStringCountingfrequency 12.0
- Move Pieces to Obtain a StringmediumTwo PointersStringfrequency 12.0
- Moving Average from Data StreameasyArrayDesignQueueData Streamfrequency 12.0
- My Calendar ImediumArrayBinary SearchDesignSegment Tree+1frequency 12.0
- N-ary Tree Level Order TraversalmediumTreeBreadth-First Searchfrequency 12.0
- Nth DigitmediumMathBinary Searchfrequency 12.0
- Number of Increasing Paths in a GridhardArrayDynamic ProgrammingDepth-First SearchBreadth-First Search+4frequency 12.0
- Number of Steps to Reduce a Number in Binary Representation to OnemediumStringBit ManipulationSimulationfrequency 12.0
- Number of Sub-arrays of Size K and Average Greater than or Equal to ThresholdmediumArraySliding Windowfrequency 12.0
- Number of Subsequences That Satisfy the Given Sum ConditionmediumArrayTwo PointersBinary SearchSortingfrequency 12.0
- Number of Ways to Arrive at DestinationmediumDynamic ProgrammingGraph TheoryTopological SortShortest Path+1frequency 12.0
- Number of Zero-Filled SubarraysmediumArrayMathfrequency 12.0
- Number of ZigZag Arrays IhardDynamic ProgrammingPrefix Sumfrequency 12.0
- Optimal Account BalancinghardArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 12.0
- Paint HousemediumArrayDynamic Programmingfrequency 12.0
- Painting a Grid With Three Different ColorshardDynamic ProgrammingGraph Coloringfrequency 12.0
- Palindrome PermutationeasyHash TableStringBit Manipulationfrequency 12.0
- Parallel Courses IIIhardArrayDynamic ProgrammingGraph TheoryTopological Sort+1frequency 12.0
- Path with Maximum ProbabilitymediumArrayGraph TheoryHeap (Priority Queue)Shortest Path+1frequency 12.0
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.