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
- Patients With a ConditioneasyDatabasefrequency 8.2
- Put Marbles in BagshardArrayGreedySortingHeap (Priority Queue)frequency 8.2
- Range Addition IIeasyArrayMathfrequency 8.2
- Range Sum of Sorted Subarray SumsmediumArrayTwo PointersBinary SearchSorting+1frequency 8.2
- Reach a NumbermediumMathBinary Searchfrequency 8.2
- Rearrange Spaces Between WordseasyStringfrequency 8.2
- Rearranging FruitshardArrayHash TableGreedySortfrequency 8.2
- Rectangle AreamediumMathGeometryfrequency 8.2
- Remove Digit From Number to Maximize ResulteasyStringGreedyEnumerationfrequency 8.2
- Remove Invalid ParentheseshardStringBacktrackingBreadth-First Searchfrequency 8.2
- Replace Non-Coprime Numbers in ArrayhardArrayMathStackNumber Theory+2frequency 8.2
- Reschedule Meetings for Maximum Free Time ImediumArrayGreedySliding Windowfrequency 8.2
- Reverse Words in a String IIIeasyTwo PointersStringfrequency 8.2
- Robot Bounded In CirclemediumMathStringSimulationfrequency 8.2
- Root Equals Sum of ChildreneasyTreeBinary Treefrequency 8.2
- Sales Analysis IIIeasyDatabasefrequency 8.2
- Score of ParenthesesmediumStringStackBracket Sequencesfrequency 8.2
- Scramble StringhardStringDynamic Programmingfrequency 8.2
- Select Dataeasyfrequency 8.2
- Self CrossinghardArrayMathGeometryfrequency 8.2
- Sentence Similarity IIImediumArrayTwo PointersStringfrequency 8.2
- Shifting LettersmediumArrayStringPrefix Sumfrequency 8.2
- Shortest BridgemediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 8.2
- Shortest Common SupersequencehardStringDynamic ProgrammingLongest Common Subsequencefrequency 8.2
- Shortest Impossible Sequence of RollshardArrayHash TableGreedyfrequency 8.2
- Shortest Path in a Hidden GridmediumArrayDepth-First SearchBreadth-First SearchMatrix+1frequency 8.2
- Smallest Integer Divisible by KmediumHash TableMathPigeonhole Principlefrequency 8.2
- Smallest Number in Infinite SetmediumHash TableDesignHeap (Priority Queue)Ordered Setfrequency 8.2
- Smallest String With SwapsmediumArrayHash TableStringDepth-First Search+3frequency 8.2
- Solving Questions With BrainpowermediumArrayDynamic Programmingfrequency 8.2
- Sort Array By Parity IIeasyArrayTwo PointersSortingfrequency 8.2
- Sort Byeasyfrequency 8.2
- Sort Items by Groups Respecting DependencieshardDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+1frequency 8.2
- Sort the PeopleeasyArrayHash TableStringSortingfrequency 8.2
- Sorted GCD Pair QuerieshardArrayHash TableMathBinary Search+6frequency 8.2
- Special Array IImediumArrayBinary SearchPrefix Sumfrequency 8.2
- Spiral Matrix IImediumArrayMatrixSimulationfrequency 8.2
- Split Linked List in PartsmediumLinked Listfrequency 8.2
- Stock Price FluctuationmediumHash TableDesignHeap (Priority Queue)Data Stream+1frequency 8.2
- Stone Game IImediumArrayMathDynamic ProgrammingMinimax+3frequency 8.2
- Stone Game IIIhardArrayMathDynamic ProgrammingMinimax+2frequency 8.2
- Strong Password CheckerhardStringGreedyHeap (Priority Queue)frequency 8.2
- Student Attendance Record IeasyStringfrequency 8.2
- Student Attendance Record IIhardDynamic Programmingfrequency 8.2
- Substrings of Size Three with Distinct CharacterseasyHash TableStringSliding WindowCountingfrequency 8.2
- Sum of All Subset XOR TotalseasyArrayMathBacktrackingBit Manipulation+2frequency 8.2
- Sum of Digits of String After ConverteasyStringSimulationfrequency 8.2
- Sum of Distances in TreehardDynamic ProgrammingTreeDepth-First SearchGraph Theory+1frequency 8.2
- Sum of GCD of Formed PairsmediumArrayMathTwo PointersSorting+2frequency 8.2
- Sum of Unique ElementseasyArrayHash TableCountingfrequency 8.2
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.