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
- Valid Mountain ArrayeasyArrayfrequency 12.0
- Validate Binary Tree NodesmediumTreeDepth-First SearchBreadth-First SearchUnion-Find+2frequency 12.0
- Ways to Make a Fair ArraymediumArrayPrefix Sumfrequency 12.0
- Zero Array Transformation ImediumArrayPrefix Sumfrequency 12.0
- Zero Array Transformation IIImediumArrayTwo PointersGreedySorting+2frequency 12.0
- 132 PatternmediumArrayBinary SearchStackMonotonic Stack+1frequency 7.3
- 4Sum IImediumArrayHash Tablefrequency 7.3
- Add Two Promiseseasyfrequency 7.3
- Adding Spaces to a StringmediumArrayTwo PointersStringSimulationfrequency 7.3
- Adjacent Increasing Subarrays Detection IeasyArrayfrequency 7.3
- All Possible Full Binary TreesmediumDynamic ProgrammingTreeRecursionMemoization+1frequency 7.3
- Apply Operations to an ArrayeasyArrayTwo PointersSimulationfrequency 7.3
- Arithmetic Slices II - SubsequencehardArrayDynamic Programmingfrequency 7.3
- Array Prototype Lasteasyfrequency 7.3
- Array Reduce Transformationeasyfrequency 7.3
- Average of Levels in Binary TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 7.3
- Best Meeting PointhardArrayMathSortingMatrixfrequency 7.3
- Best Team With No ConflictsmediumArrayDynamic ProgrammingSortingLongest Increasing Subsequencefrequency 7.3
- Best Time to Buy and Sell Stock using StrategymediumArraySliding WindowPrefix Sumfrequency 7.3
- Biggest Single NumbereasyDatabasefrequency 7.3
- Binary Number with Alternating BitseasyBit Manipulationfrequency 7.3
- Binary Prefix Divisible By 5easyArrayBit Manipulationfrequency 7.3
- Binary Tree Level Order Traversal IImediumTreeBreadth-First SearchBinary Treefrequency 7.3
- Binary Tree PathseasyStringBacktrackingTreeDepth-First Search+1frequency 7.3
- Binary Tree Postorder TraversaleasyStackTreeDepth-First SearchBinary Treefrequency 7.3
- Block Placement QuerieshardArrayBinary SearchBinary Indexed TreeSegment Tree+1frequency 7.3
- Brightest Position on StreetmediumArraySortingPrefix SumOrdered Setfrequency 7.3
- Broken CalculatormediumMathGreedyfrequency 7.3
- Cache With Time Limitmediumfrequency 7.3
- Calculator with Method Chainingeasyfrequency 7.3
- Can I WinmediumMathDynamic ProgrammingBit ManipulationMemoization+2frequency 7.3
- Cat and MousehardMathDynamic ProgrammingGraph TheoryTopological Sort+4frequency 7.3
- Check If Digits Are Equal in String After Operations IeasyMathStringSimulationCombinatorics+1frequency 7.3
- Check If It Is a Good ArrayhardArrayMathNumber TheoryBézout's Lemma+3frequency 7.3
- Check If N and Its Double ExisteasyArrayHash TableTwo PointersBinary Search+1frequency 7.3
- Check If a Word Occurs As a Prefix of Any Word in a SentenceeasyTwo PointersStringString Matchingfrequency 7.3
- Check if Array is GoodeasyArrayHash TableSortingfrequency 7.3
- Check if One String Swap Can Make Strings EqualeasyHash TableStringCountingfrequency 7.3
- Check if Strings Can be Made Equal With Operations IeasyStringfrequency 7.3
- Check if Strings Can be Made Equal With Operations IImediumHash TableStringSortingfrequency 7.3
- Checking Existence of Edge Length Limited PathshardArrayTwo PointersUnion-FindGraph Theory+1frequency 7.3
- Coloring A BordermediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 7.3
- Combination Sum IVmediumArrayDynamic Programmingfrequency 7.3
- Construct Binary Tree from Preorder and Postorder TraversalmediumArrayHash TableDivide and ConquerTree+1frequency 7.3
- Construct Quad TreemediumArrayDivide and ConquerTreeMatrixfrequency 7.3
- Construct the Longest New StringmediumMathDynamic ProgrammingGreedyBrainteaserfrequency 7.3
- Construct the Minimum Bitwise Array IeasyArrayBit Manipulationfrequency 7.3
- Continuous SubarraysmediumArrayQueueSliding WindowHeap (Priority Queue)+2frequency 7.3
- Convert 1D Array Into 2D ArrayeasyArrayMatrixSimulationfrequency 7.3
- Convert Binary Search Tree to Sorted Doubly Linked ListmediumLinked ListStackTreeDepth-First Search+3frequency 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.