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
- Kill ProcessmediumArrayHash TableTreeDepth-First Search+1frequency 7.3
- Kth Largest Sum in a Binary TreemediumTreeBreadth-First SearchSortingBinary Treefrequency 7.3
- Largest Number At Least Twice of OtherseasyArraySortingfrequency 7.3
- Largest Substring Between Two Equal CharacterseasyHash TableStringfrequency 7.3
- Largest Time for Given DigitsmediumArrayStringBacktrackingEnumerationfrequency 7.3
- Length of Longest V-Shaped Diagonal SegmenthardArrayDynamic ProgrammingMemoizationMatrixfrequency 7.3
- Letter Tile PossibilitiesmediumHash TableStringBacktrackingCountingfrequency 7.3
- Lexicographically Minimum String After Removing StarsmediumHash TableStringStackGreedy+1frequency 7.3
- Lexicographically Smallest Generated StringhardStringGreedyString Matchingfrequency 7.3
- Longest Absolute File PathmediumStringStackDepth-First Searchfrequency 7.3
- Longest Balanced Substring IImediumHash TableStringPrefix Sumfrequency 7.3
- Longest Cycle in a GraphhardDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+2frequency 7.3
- Longest Even Odd Subarray With ThresholdeasyArraySliding Windowfrequency 7.3
- Longest Harmonious SubsequenceeasyArrayHash TableSliding WindowSorting+1frequency 7.3
- Longest Ideal SubsequencemediumHash TableStringDynamic Programmingfrequency 7.3
- Longest Mountain in ArraymediumArrayTwo PointersDynamic ProgrammingEnumerationfrequency 7.3
- Longest Subarray With Maximum Bitwise ANDmediumArrayBit ManipulationBrainteaserfrequency 7.3
- Longest Substring with At Most Two Distinct CharactersmediumHash TableStringSliding Windowfrequency 7.3
- Longest Turbulent SubarraymediumArrayDynamic ProgrammingSliding Windowfrequency 7.3
- Longest Word in DictionarymediumArrayHash TableStringTrie+1frequency 7.3
- Longest ZigZag Path in a Binary TreemediumDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 7.3
- Magic Squares In GridmediumArrayHash TableMathMatrixfrequency 7.3
- Magical StringmediumTwo PointersStringfrequency 7.3
- Make Array Elements Equal to ZeroeasyArraySimulationPrefix Sumfrequency 7.3
- Make The String GreateasyStringStackfrequency 7.3
- Matrix Similarity After Cyclic ShiftseasyArrayMathMatrixSimulationfrequency 7.3
- Max Chunks To Make Sorted IIhardArrayStackGreedySorting+1frequency 7.3
- Maximize Active Section with Trade ImediumStringEnumerationfrequency 7.3
- Maximize Greatness of an ArraymediumArrayTwo PointersGreedySortingfrequency 7.3
- Maximize Spanning Tree Stability with UpgradeshardBinary SearchGreedyUnion-FindGraph Theory+1frequency 7.3
- Maximum Building HeighthardArrayMathSortingfrequency 7.3
- Maximum Difference Between Increasing ElementseasyArrayfrequency 7.3
- Maximum Distance Between a Pair of ValuesmediumArrayTwo PointersBinary Searchfrequency 7.3
- Maximum Element After Decreasing and RearrangingmediumArrayGreedySortingfrequency 7.3
- Maximum Fruits Harvested After at Most K StepshardArrayBinary SearchSliding WindowPrefix Sumfrequency 7.3
- Maximum Good People Based on StatementshardArrayBacktrackingBit ManipulationEnumerationfrequency 7.3
- Maximum Ice Cream BarsmediumArrayGreedySortingCounting Sortfrequency 7.3
- Maximum Length Substring With Two OccurrenceseasyHash TableStringSliding Windowfrequency 7.3
- Maximum Nesting Depth of Two Valid Parentheses StringsmediumStringStackBracket Sequencesfrequency 7.3
- Maximum Number of Coins You Can GetmediumArrayMathGreedySorting+1frequency 7.3
- Maximum Number of Items From Sale ImediumArrayDynamic ProgrammingGreedyfrequency 7.3
- Maximum Number of K-Divisible ComponentshardTreeDepth-First Searchfrequency 7.3
- Maximum Number of Points with CostmediumArrayDynamic ProgrammingMatrixfrequency 7.3
- Maximum Number of Words Found in SentenceseasyArrayStringfrequency 7.3
- Maximum Students Taking ExamhardArrayDynamic ProgrammingBit ManipulationMatrix+11frequency 7.3
- Maximum Sum With at Most K ElementsmediumArrayGreedySortingHeap (Priority Queue)+1frequency 7.3
- Maximum Sum of Distinct Subarrays With Length KmediumArrayHash TableSliding Windowfrequency 7.3
- Maximum Tastiness of Candy BasketmediumArrayBinary SearchGreedySortingfrequency 7.3
- Maximum Total Damage With Spell CastingmediumArrayHash TableTwo PointersBinary Search+3frequency 7.3
- Maximum Total Subarray Value IIhardArrayGreedySegment TreeHeap (Priority Queue)frequency 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.