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,399 questions at Meta · all time
- Avoid Flood in The CitymediumArrayHash TableBinary SearchGreedy+1frequency 8.0
- Basic Calculator IIIhardMathStringStackRecursionfrequency 8.0
- Best Time to Buy and Sell Stock VmediumArrayDynamic Programmingfrequency 8.0
- Binary Tree Longest Consecutive Sequence IImediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 8.0
- Bulls and CowsmediumHash TableStringCountingfrequency 8.0
- Check If Digits Are Equal in String After Operations IeasyMathStringSimulationCombinatorics+1frequency 8.0
- Check If a String Contains All Binary Codes of Size KmediumHash TableStringBit ManipulationRolling Hash+2frequency 8.0
- Cherry Pickup IIhardArrayDynamic ProgrammingMatrixfrequency 8.0
- Concatenated DivisibilityhardArrayDynamic ProgrammingBit ManipulationBitmaskfrequency 8.0
- Construct Binary Tree from Preorder and Postorder TraversalmediumArrayHash TableDivide and ConquerTree+1frequency 8.0
- Construct K Palindrome StringsmediumHash TableStringGreedyCountingfrequency 8.0
- Construct Quad TreemediumArrayDivide and ConquerTreeMatrixfrequency 8.0
- Continuous SubarraysmediumArrayQueueSliding WindowHeap (Priority Queue)+2frequency 8.0
- Convert BST to Greater TreemediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 8.0
- Corporate Flight BookingsmediumArrayPrefix Sumfrequency 8.0
- Count Number of Balanced PermutationshardMathStringDynamic ProgrammingCombinatoricsfrequency 8.0
- Count Numbers with Unique DigitsmediumMathDynamic ProgrammingBacktrackingfrequency 8.0
- Count Subarrays Where Max Element Appears at Least K TimesmediumArraySliding Windowfrequency 8.0
- Count Subarrays With Majority Element ImediumArrayHash TableDivide and ConquerSegment Tree+3frequency 8.0
- Count Submatrices With All OnesmediumArrayDynamic ProgrammingStackMatrix+1frequency 8.0
- Count the Number of Arrays with K Matching Adjacent ElementshardMathCombinatoricsFermat's Little Theoremfrequency 8.0
- Count the Number of Fair PairsmediumArrayTwo PointersBinary SearchSortingfrequency 8.0
- Count the Number of Good SubarraysmediumArrayHash TableSliding Windowfrequency 8.0
- Count the Number of Powerful IntegershardMathStringDynamic Programmingfrequency 8.0
- Course Schedule IVmediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sortfrequency 8.0
- Create Binary Tree From DescriptionsmediumArrayHash TableTreeBinary Treefrequency 8.0
- Cyclically Rotating a GridmediumArrayMatrixSimulationfrequency 8.0
- Decoded String at IndexmediumStringStackfrequency 8.0
- Design File SystemmediumHash TableStringDesignTriefrequency 8.0
- Design Memory AllocatormediumArrayHash TableDesignSimulationfrequency 8.0
- Detect SquaresmediumArrayHash TableDesignCounting+1frequency 8.0
- Display the First Three Rowseasyfrequency 8.0
- Distant BarcodesmediumArrayHash TableGreedySorting+2frequency 8.0
- Divide Intervals Into Minimum Number of GroupsmediumArrayTwo PointersGreedySorting+2frequency 8.0
- Divide Nodes Into the Maximum Number of GroupshardDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 8.0
- Event Emittermediumfrequency 8.0
- Extra Characters in a StringmediumArrayHash TableStringDynamic Programming+1frequency 8.0
- Factorial Trailing ZeroesmediumMathfrequency 8.0
- Fair Candy SwapeasyArrayHash TableBinary SearchSortingfrequency 8.0
- Find All K-Distant Indices in an ArrayeasyArrayTwo Pointersfrequency 8.0
- Find Bottom Left Tree ValuemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 8.0
- Find Building Where Alice and Bob Can MeethardArrayBinary SearchStackBinary Indexed Tree+3frequency 8.0
- Find Common CharacterseasyArrayHash TableStringfrequency 8.0
- Find Common Elements Between Two ArrayseasyArrayHash Tablefrequency 8.0
- Find Minimum Time to Finish All JobshardArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 8.0
- Find Minimum in Rotated Sorted Array IIhardArrayBinary Searchfrequency 8.0
- Find Missing ElementseasyArrayHash TableSortingfrequency 8.0
- Find Mode in Binary Search TreeeasyTreeDepth-First SearchBinary Search TreeBinary Treefrequency 8.0
- Find Root of N-Ary TreemediumHash TableBit ManipulationTreeDepth-First Searchfrequency 8.0
- Find Score of an Array After Marking All ElementsmediumArrayHash TableSortingHeap (Priority Queue)+1frequency 8.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.