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
- Max Chunks To Make Sorted IIhardArrayStackGreedySorting+1frequency 8.2
- Max Consecutive Ones IImediumArrayDynamic ProgrammingSliding Windowfrequency 8.2
- Max Dot Product of Two SubsequenceshardArrayDynamic ProgrammingLongest Common Subsequencefrequency 8.2
- Maximal Score After Applying K OperationsmediumArrayGreedyHeap (Priority Queue)frequency 8.2
- Maximize Active Section with Trade ImediumStringEnumerationfrequency 8.2
- Maximize Active Section with Trade IIhardArrayStringBinary SearchSegment Treefrequency 8.2
- Maximize Distance to Closest PersonmediumArrayfrequency 8.2
- Maximize Subarrays After Removing One Conflicting PairhardArraySegment TreeEnumerationPrefix Sumfrequency 8.2
- Maximize the Distance Between Points on a SquarehardArrayMathBinary SearchGeometry+1frequency 8.2
- Maximize the Minimum Powered CityhardArrayBinary SearchGreedyQueue+2frequency 8.2
- Maximum Binary TreemediumArrayDivide and ConquerStackTree+3frequency 8.2
- Maximum Candies You Can Get from BoxeshardArrayBreadth-First SearchGraph Theoryfrequency 8.2
- Maximum Difference Between Adjacent Elements in a Circular ArrayeasyArrayfrequency 8.2
- Maximum Difference Between Even and Odd Frequency IIhardStringSliding WindowEnumerationPrefix Sumfrequency 8.2
- Maximum Difference Between Node and AncestormediumTreeDepth-First SearchBinary Treefrequency 8.2
- Maximum Distance in ArraysmediumArrayGreedyfrequency 8.2
- Maximum Element After Decreasing and RearrangingmediumArrayGreedySortingfrequency 8.2
- Maximum Frequency After Subarray OperationmediumArrayHash TableDynamic ProgrammingGreedy+2frequency 8.2
- Maximum Frequency of an Element After Performing Operations ImediumArrayBinary SearchSliding WindowSorting+1frequency 8.2
- Maximum Frequency of an Element After Performing Operations IIhardArrayBinary SearchSliding WindowSorting+1frequency 8.2
- Maximum GapmediumArraySortingBucket SortRadix Sort+1frequency 8.2
- Maximum Ice Cream BarsmediumArrayGreedySortingCounting Sortfrequency 8.2
- Maximum Matching of Players With TrainersmediumArrayTwo PointersGreedySortingfrequency 8.2
- Maximum Number of BalloonseasyHash TableStringCountingfrequency 8.2
- Maximum Number of Distinct Elements After OperationsmediumArrayGreedySortingfrequency 8.2
- Maximum Number of Integers to Choose From a Range ImediumArrayHash TableBinary SearchGreedy+1frequency 8.2
- Maximum Number of Points From Grid QuerieshardArrayTwo PointersBreadth-First SearchUnion-Find+3frequency 8.2
- Maximum Number of Tasks You Can AssignhardArrayTwo PointersBinary SearchGreedy+3frequency 8.2
- Maximum Running Time of N ComputershardArrayBinary SearchGreedySortingfrequency 8.2
- Maximum Score of a Good SubarrayhardArrayTwo PointersBinary SearchStack+2frequency 8.2
- Maximum Subsequence ScoremediumArrayGreedySortingHeap (Priority Queue)frequency 8.2
- Maximum Sum BST in Binary TreehardDynamic ProgrammingTreeDepth-First SearchBinary Search Tree+2frequency 8.2
- Maximum Sum of Edge Values in a GraphhardMathGreedyGraph Theoryfrequency 8.2
- Maximum Total Damage With Spell CastingmediumArrayHash TableTwo PointersBinary Search+3frequency 8.2
- Maximum Units on a TruckeasyArrayGreedySortingfrequency 8.2
- Maximum XOR for Each QuerymediumArrayBit ManipulationPrefix Sumfrequency 8.2
- Meeting Rooms IIIhardArrayHash TableSortingHeap (Priority Queue)+1frequency 8.2
- Memoizemediumfrequency 8.2
- Merge In Between Linked ListsmediumLinked Listfrequency 8.2
- Merge Two 2D Arrays by Summing ValueseasyArrayHash TableTwo Pointersfrequency 8.2
- Mini ParsermediumStringStackDepth-First Searchfrequency 8.2
- Minimize Hamming Distance After Swap OperationsmediumArrayDepth-First SearchUnion-Findfrequency 8.2
- Minimize String LengtheasyHash TableStringfrequency 8.2
- Minimized Maximum of Products Distributed to Any StoremediumArrayBinary SearchGreedyfrequency 8.2
- Minimum Bit Flips to Convert NumbereasyBit Manipulationfrequency 8.2
- Minimum Changes To Make Alternating Binary StringeasyStringfrequency 8.2
- Minimum Common ValueeasyArrayHash TableTwo PointersBinary Searchfrequency 8.2
- Minimum Cost Path with Edge ReversalsmediumGraph TheoryHeap (Priority Queue)Shortest Pathfrequency 8.2
- Minimum Cuts to Divide a CircleeasyMathGeometryfrequency 8.2
- Minimum Difference Between Highest and Lowest of K ScoreseasyArraySliding WindowSortingfrequency 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.