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
- Count Hills and Valleys in an ArrayeasyArrayfrequency 16.1
- Count Square Submatrices with All OnesmediumArrayDynamic ProgrammingMatrixfrequency 16.1
- Count Subarrays With Score Less Than KhardArrayBinary SearchSliding WindowPrefix Sumfrequency 16.1
- Count Symmetric IntegerseasyMathEnumerationfrequency 16.1
- Count Ways To Build Good StringsmediumDynamic Programmingfrequency 16.1
- Count the Number of Complete ComponentsmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 16.1
- Count the Number of Good SubarraysmediumArrayHash TableSliding Windowfrequency 16.1
- Defuse the BombeasyArraySliding Windowfrequency 16.1
- Design a Stack With Increment OperationmediumArrayStackDesignfrequency 16.1
- Determine Whether Matrix Can Be Obtained By RotationeasyArrayMatrixfrequency 16.1
- Determine if Two Strings Are ClosemediumHash TableStringSortingCountingfrequency 16.1
- Detonate the Maximum BombsmediumArrayMathDepth-First SearchBreadth-First Search+2frequency 16.1
- Duplicate ZeroseasyArrayTwo Pointersfrequency 16.1
- Element Appearing More Than 25% In Sorted ArrayeasyArrayfrequency 16.1
- Exclusive Time of FunctionsmediumArrayStackfrequency 16.1
- Final Array State After K Multiplication Operations IeasyArrayMathHeap (Priority Queue)Simulationfrequency 16.1
- Find Duplicate SubtreesmediumHash TableTreeDepth-First SearchBinary Treefrequency 16.1
- Find Kth Bit in Nth Binary StringmediumStringRecursionSimulationfrequency 16.1
- Find Minimum Time to Finish All JobshardArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 16.1
- Find Right IntervalmediumArrayBinary SearchSortingfrequency 16.1
- Find the Closest PalindromehardMathStringfrequency 16.1
- Find the Largest Area of Square Inside Two RectanglesmediumArrayMathGeometryfrequency 16.1
- Find the Lexicographically Largest String From the Box ImediumTwo PointersStringEnumerationfrequency 16.1
- Find the Maximum Length of Valid Subsequence IImediumArrayDynamic Programmingfrequency 16.1
- Find the Minimum and Maximum Number of Nodes Between Critical PointsmediumLinked Listfrequency 16.1
- Find the Original Typed String IIhardStringDynamic ProgrammingPrefix Sumfrequency 16.1
- Fix Names in a TableeasyDatabasefrequency 16.1
- Flatten a Multilevel Doubly Linked ListmediumLinked ListDepth-First SearchDoubly-Linked Listfrequency 16.1
- Four DivisorsmediumArrayMathPrime FactorizationSieve Theoryfrequency 16.1
- Greatest Sum Divisible by ThreemediumArrayDynamic ProgrammingGreedySortingfrequency 16.1
- Hand of StraightsmediumArrayHash TableGreedySortingfrequency 16.1
- Image SmoothereasyArrayMatrixfrequency 16.1
- Jump Game VImediumArrayDynamic ProgrammingQueueHeap (Priority Queue)+1frequency 16.1
- Keyboard RoweasyArrayHash TableStringfrequency 16.1
- Largest Odd Number in StringeasyMathStringGreedyfrequency 16.1
- Largest Submatrix With RearrangementsmediumArrayGreedySortingMatrixfrequency 16.1
- Last Person to Fit in the BusmediumDatabasefrequency 16.1
- Last Substring in Lexicographical OrderhardTwo PointersStringLyndon Factorizationfrequency 16.1
- Max Sum of a Pair With Equal Sum of DigitsmediumArrayHash TableSortingHeap (Priority Queue)frequency 16.1
- Maximize Happiness of Selected ChildrenmediumArrayGreedySortingfrequency 16.1
- Maximum 69 NumbereasyMathGreedyfrequency 16.1
- Maximum Count of Positive Integer and Negative IntegereasyArrayBinary SearchCountingfrequency 16.1
- Maximum Level Sum of a Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 16.1
- Maximum Non Negative Product in a MatrixmediumArrayDynamic ProgrammingMatrixfrequency 16.1
- Maximum Number of BalloonseasyHash TableStringCountingfrequency 16.1
- Maximum Subsequence ScoremediumArrayGreedySortingHeap (Priority Queue)frequency 16.1
- Maximum Sum BST in Binary TreehardDynamic ProgrammingTreeDepth-First SearchBinary Search Tree+2frequency 16.1
- Maximum Sum of 3 Non-Overlapping SubarrayshardArrayDynamic ProgrammingSliding WindowPrefix Sumfrequency 16.1
- Min Cost to Connect All PointsmediumArrayUnion-FindGraph TheoryMinimum Spanning Tree+3frequency 16.1
- MinesweepermediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 16.1
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.