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,223 questions at Bloomberg · all time
- Intersection of Two Arrays IIeasyArrayHash TableTwo PointersBinary Search+1frequency 24.6
- Kth Smallest Product of Two Sorted ArrayshardArrayBinary Searchfrequency 24.6
- Largest Triangle AreaeasyArrayMathGeometryPolygonsfrequency 24.6
- Last Stone WeighteasyArrayHeap (Priority Queue)frequency 24.6
- Longest PalindromeeasyHash TableStringGreedyfrequency 24.6
- Longest Palindromic SubsequencemediumStringDynamic Programmingfrequency 24.6
- Longest Strictly Increasing or Strictly Decreasing SubarrayeasyArrayfrequency 24.6
- Making A Large IslandhardArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 24.6
- Maximum Number of Events That Can Be AttendedmediumArrayGreedySortingHeap (Priority Queue)frequency 24.6
- Maximum Width RampmediumArrayTwo PointersStackMonotonic Stackfrequency 24.6
- Minimum Limit of Balls in a BagmediumArrayBinary Searchfrequency 24.6
- Next Greater Numerically Balanced NumbermediumHash TableMathBacktrackingCounting+1frequency 24.6
- Number of Longest Increasing SubsequencemediumArrayDynamic ProgrammingBinary Indexed TreeSegment Tree+1frequency 24.6
- Number of Subsequences That Satisfy the Given Sum ConditionmediumArrayTwo PointersBinary SearchSortingfrequency 24.6
- Partition Array for Maximum SummediumArrayDynamic Programmingfrequency 24.6
- Primary Department for Each EmployeeeasyDatabasefrequency 24.6
- Rabbits in ForestmediumArrayHash TableMathGreedyfrequency 24.6
- Reconstruct ItineraryhardArrayStringDepth-First SearchGraph Theory+5frequency 24.6
- Score of a StringeasyStringfrequency 24.6
- Smallest Range Covering Elements from K ListshardArrayHash TableGreedySliding Window+2frequency 24.6
- Subtree of Another TreeeasyTreeDepth-First SearchString MatchingBinary Tree+1frequency 24.6
- Sum Root to Leaf NumbersmediumTreeDepth-First SearchBinary Treefrequency 24.6
- Sum of Root To Leaf Binary NumberseasyTreeDepth-First SearchBinary Treefrequency 24.6
- Trips and UsershardDatabasefrequency 24.6
- Two Sum IV - Input is a BSTeasyHash TableTwo PointersTreeDepth-First Search+3frequency 24.6
- User Activity for the Past 30 Days IeasyDatabasefrequency 24.6
- Valid NumberhardStringfrequency 24.6
- Valid WordeasyStringfrequency 24.6
- Add to Array-Form of IntegereasyArrayMathfrequency 21.4
- Array PartitioneasyArrayGreedySortingCounting Sortfrequency 21.4
- Backspace String CompareeasyTwo PointersStringStackSimulationfrequency 21.4
- Best Time to Buy and Sell Stock with CooldownmediumArrayDynamic Programmingfrequency 21.4
- Binary Search Tree IteratormediumStackTreeDesignBinary Search Tree+2frequency 21.4
- Binary Tree Preorder TraversaleasyStackTreeDepth-First SearchBinary Treefrequency 21.4
- Bitwise ORs of SubarraysmediumArrayDynamic ProgrammingBit Manipulationfrequency 21.4
- Car FleetmediumArrayStackSortingMonotonic Stackfrequency 21.4
- Car PoolingmediumArraySortingHeap (Priority Queue)Simulation+1frequency 21.4
- Clear DigitseasyStringStackSimulationfrequency 21.4
- Consecutive CharacterseasyStringfrequency 21.4
- Convert Sorted Array to Binary Search TreeeasyArrayDivide and ConquerTreeBinary Search Tree+1frequency 21.4
- Convert a Number to HexadecimaleasyMathStringBit Manipulationfrequency 21.4
- Count Complete Tree NodesmediumBinary SearchBit ManipulationTreeBinary Treefrequency 21.4
- Count Elements With Maximum FrequencyeasyArrayHash TableCountingfrequency 21.4
- Count Negative Numbers in a Sorted MatrixeasyArrayBinary SearchMatrixfrequency 21.4
- Count Submatrices With All OnesmediumArrayDynamic ProgrammingStackMatrix+1frequency 21.4
- Count the Hidden SequencesmediumArrayPrefix Sumfrequency 21.4
- Count the Number of Arrays with K Matching Adjacent ElementshardMathCombinatoricsFermat's Little Theoremfrequency 21.4
- Count the Number of Fair PairsmediumArrayTwo PointersBinary SearchSortingfrequency 21.4
- Counting BitseasyDynamic ProgrammingBit Manipulationfrequency 21.4
- Couples Holding HandshardGreedyDepth-First SearchBreadth-First SearchUnion-Find+1frequency 21.4
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.