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
- Minimum Difference in Sums After Removal of ElementshardArrayDynamic ProgrammingHeap (Priority Queue)frequency 8.2
- Minimum Distance to the Target ElementeasyArrayfrequency 8.2
- Minimum Falling Path Sum IIhardArrayDynamic ProgrammingMatrixfrequency 8.2
- Minimum Interval to Include Each QueryhardArrayBinary SearchSweep LineSorting+1frequency 8.2
- Minimum Jumps to Reach HomemediumArrayHash TableBreadth-First Searchfrequency 8.2
- Minimum Moves to Balance Circular ArraymediumArrayGreedySortingfrequency 8.2
- Minimum Moves to Clean the ClassroommediumArrayHash TableBit ManipulationBreadth-First Search+1frequency 8.2
- Minimum Moves to Equal Array ElementsmediumArrayMathfrequency 8.2
- Minimum Moves to Reach Target in GridhardMathfrequency 8.2
- Minimum Number GameeasyArraySortingHeap (Priority Queue)Simulationfrequency 8.2
- Minimum Number of Changes to Make Binary String BeautifulmediumStringfrequency 8.2
- Minimum Number of Coins to be AddedmediumArrayGreedySortingfrequency 8.2
- Minimum Number of Operations to Make Array ContinuoushardArrayHash TableBinary SearchSliding Windowfrequency 8.2
- Minimum Number of People to TeachmediumArrayHash TableGreedyfrequency 8.2
- Minimum Number of Pushes to Type Word IImediumHash TableStringGreedySorting+1frequency 8.2
- Minimum One Bit Operations to Make Integers ZerohardMathDynamic ProgrammingBit ManipulationRecursion+1frequency 8.2
- Minimum Operations to Make All Array Elements EqualmediumArrayBinary SearchSortingPrefix Sumfrequency 8.2
- Minimum Operations to Make Binary Array Elements Equal to One ImediumArrayBit ManipulationQueueSliding Window+1frequency 8.2
- Minimum Operations to Make the Array AlternatingmediumArrayHash TableGreedyCountingfrequency 8.2
- Minimum Swaps To Make Sequences IncreasinghardArrayDynamic Programmingfrequency 8.2
- Minimum Time to Make Rope ColorfulmediumArrayStringDynamic ProgrammingGreedyfrequency 8.2
- Most Frequent Subtree SummediumHash TableTreeDepth-First SearchBinary Tree+1frequency 8.2
- Most Popular Video CreatormediumArrayHash TableStringSorting+1frequency 8.2
- Move Pieces to Obtain a StringmediumTwo PointersStringfrequency 8.2
- Naming a CompanyhardArrayHash TableStringBit Manipulation+1frequency 8.2
- Network Recovery PathwayshardArrayBinary SearchDynamic ProgrammingGraph Theory+3frequency 8.2
- Number of BoomerangsmediumArrayHash TableMathfrequency 8.2
- Number of Distinct Substrings in a StringmediumStringTrieRolling HashSuffix Array+1frequency 8.2
- Number of Equivalent Domino PairseasyArrayHash TableCountingfrequency 8.2
- Number of Good PathshardArrayHash TableTreeUnion-Find+2frequency 8.2
- Number of Perfect PairsmediumArrayMathTwo PointersSortingfrequency 8.2
- Number of Strings That Appear as Substrings in WordeasyArrayStringfrequency 8.2
- Number of Sub-arrays With Odd SummediumArrayMathDynamic ProgrammingPrefix Sumfrequency 8.2
- Number of Sub-arrays of Size K and Average Greater than or Equal to ThresholdmediumArraySliding Windowfrequency 8.2
- Number of Unique Subjects Taught by Each TeachereasyDatabasefrequency 8.2
- Number of Unique XOR Triplets IImediumArrayMathBit ManipulationEnumerationfrequency 8.2
- Number of Visible People in a QueuehardArrayStackMonotonic Stackfrequency 8.2
- Number of Ways to Divide a Long CorridorhardMathStringDynamic Programmingfrequency 8.2
- Number of Ways to Form a Target String Given a DictionaryhardArrayStringDynamic Programmingfrequency 8.2
- Number of Ways to Split ArraymediumArrayPrefix Sumfrequency 8.2
- Number of ZigZag Arrays IhardDynamic ProgrammingPrefix Sumfrequency 8.2
- Numbers With Same Consecutive DifferencesmediumBacktrackingBreadth-First Searchfrequency 8.2
- Optimal Account BalancinghardArrayDynamic ProgrammingBacktrackingBit Manipulation+1frequency 8.2
- Orderly QueuehardMathStringSortingLexicographically Minimal String Rotationfrequency 8.2
- Out of Boundary PathsmediumDynamic Programmingfrequency 8.2
- Paint House IVmediumArrayDynamic Programmingfrequency 8.2
- Partition Array Into Three Parts With Equal SumeasyArrayGreedyfrequency 8.2
- Partition to K Equal Sum SubsetsmediumArrayDynamic ProgrammingBacktrackingBit Manipulation+2frequency 8.2
- Pass the PilloweasyMathSimulationfrequency 8.2
- Path Existence Queries in a Graph IIhardArrayTwo PointersBinary SearchDynamic Programming+4frequency 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.