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 Value of an Ordered Triplet IeasyArrayPrefix Sumfrequency 7.3
- Maximum Value of an Ordered Triplet IImediumArrayPrefix Sumfrequency 7.3
- Maximum Walls Destroyed by RobotshardArrayBinary SearchDynamic ProgrammingSortingfrequency 7.3
- Merge Two 2D Arrays by Summing ValueseasyArrayHash TableTwo Pointersfrequency 7.3
- Merge Two Binary TreeseasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 7.3
- Mice and CheesemediumArrayGreedySortingHeap (Priority Queue)frequency 7.3
- Minimize Malware SpreadhardArrayHash TableDepth-First SearchBreadth-First Search+2frequency 7.3
- Minimize Maximum Component CostmediumBinary SearchUnion-FindGraph TheorySortingfrequency 7.3
- Minimized Maximum of Products Distributed to Any StoremediumArrayBinary SearchGreedyfrequency 7.3
- Minimum Add to Make Parentheses ValidmediumStringStackGreedyBracket Sequencesfrequency 7.3
- Minimum Additions to Make Valid StringmediumStringDynamic ProgrammingStackGreedyfrequency 7.3
- Minimum Area RectanglemediumArrayHash TableMathGeometry+1frequency 7.3
- Minimum Array SummediumArrayDynamic Programmingfrequency 7.3
- Minimum Changes To Make Alternating Binary StringeasyStringfrequency 7.3
- Minimum Cost Homecoming of a Robot in a GridmediumArrayGreedyfrequency 7.3
- Minimum Cost Path with Edge ReversalsmediumGraph TheoryHeap (Priority Queue)Shortest Pathfrequency 7.3
- Minimum Cost to Convert String IIhardArrayStringDynamic ProgrammingGraph Theory+2frequency 7.3
- Minimum Cost to Hire K WorkershardArrayGreedySortingHeap (Priority Queue)frequency 7.3
- Minimum Cuts to Divide a CircleeasyMathGeometryfrequency 7.3
- Minimum Difference in Sums After Removal of ElementshardArrayDynamic ProgrammingHeap (Priority Queue)frequency 7.3
- Minimum Distance Between Three Equal Elements IImediumArrayHash Tablefrequency 7.3
- Minimum Distance to Type a Word Using Two FingershardStringDynamic Programmingfrequency 7.3
- Minimum Falling Path Sum IIhardArrayDynamic ProgrammingMatrixfrequency 7.3
- Minimum Index of a Valid SplitmediumArrayHash TableSortingfrequency 7.3
- Minimum Insertion Steps to Make a String PalindromehardStringDynamic Programmingfrequency 7.3
- Minimum Jumps to Reach HomemediumArrayHash TableBreadth-First Searchfrequency 7.3
- Minimum Limit of Balls in a BagmediumArrayBinary Searchfrequency 7.3
- Minimum Number of Changes to Make Binary String BeautifulmediumStringfrequency 7.3
- Minimum Number of Operations to Make Elements in Array DistincteasyArrayHash Tablefrequency 7.3
- Minimum Number of Operations to Move All Balls to Each BoxmediumArrayStringPrefix Sumfrequency 7.3
- Minimum Number of Taps to Open to Water a GardenhardArrayDynamic ProgrammingGreedyfrequency 7.3
- Minimum Operations to Make the Array IncreasingeasyArrayGreedyfrequency 7.3
- Minimum Pair Removal to Sort Array IIhardArrayHash TableLinked ListHeap (Priority Queue)+3frequency 7.3
- Minimum Score After Removals on a TreehardArrayBit ManipulationTreeDepth-First Searchfrequency 7.3
- Minimum Score Triangulation of PolygonmediumArrayDynamic ProgrammingTriangulationPolygonsfrequency 7.3
- Minimum Score of a Path Between Two CitiesmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 7.3
- Minimum Substring Partition of Equal Character FrequencymediumHash TableStringDynamic ProgrammingCountingfrequency 7.3
- Minimum Suffix FlipsmediumStringGreedyfrequency 7.3
- Minimum Sum of Mountain Triplets IeasyArrayfrequency 7.3
- Minimum Swaps to Group All 1's Together IImediumArraySliding Windowfrequency 7.3
- Minimum Swaps to Make Strings EqualmediumMathStringGreedyfrequency 7.3
- Minimum Time Visiting All PointseasyArrayMathGeometryfrequency 7.3
- Minimum Total Distance TraveledhardArrayDynamic ProgrammingSortingfrequency 7.3
- Mirror ReflectionmediumMathGeometryNumber TheoryLeast Common Multiple+1frequency 7.3
- Most Frequent Subtree SummediumHash TableTreeDepth-First SearchBinary Tree+1frequency 7.3
- N-th Tribonacci NumbereasyMathDynamic ProgrammingMemoizationfrequency 7.3
- Nearest Exit from Entrance in MazemediumArrayBreadth-First SearchMatrixfrequency 7.3
- Next Greater Numerically Balanced NumbermediumHash TableMathBacktrackingCounting+1frequency 7.3
- Non-decreasing SubsequencesmediumArrayHash TableBacktrackingBit Manipulationfrequency 7.3
- Number of AtomshardHash TableStringStackSortingfrequency 7.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.