Bloomberg
Practical loops with a strong C++ and data-structures core, then a design round and questions about handling real-time market data.
Typical loop
- 1Recruiter screen
- 2Technical phone screen: data structures
- 3Onsite: two coding rounds
- 4System design round
- 5Team-fit conversation
Questions
Callback's practice questions and the LeetCode questions Bloomberg has been asking, filtered together.
Asked on LeetCode
1,223 questions · all time
- Shortest PalindromehardStringRolling HashString MatchingHash Function+3frequency 40.1
- Sort Array by Increasing FrequencyeasyArrayHash TableSortingfrequency 40.1
- Add Two IntegerseasyMathfrequency 38.7
- Asteroid CollisionmediumArrayStackSimulationfrequency 38.7
- Combination Sum IImediumArrayBacktrackingfrequency 38.7
- Contiguous ArraymediumArrayHash TablePrefix Sumfrequency 38.7
- Count and SaymediumStringfrequency 38.7
- Customers Who Never OrdereasyDatabasefrequency 38.7
- Design Hit CountermediumArrayBinary SearchDesignQueue+1frequency 38.7
- Implement Stack using QueueseasyStackDesignQueuefrequency 38.7
- Non-overlapping IntervalsmediumArrayDynamic ProgrammingGreedySortingfrequency 38.7
- Ransom NoteeasyHash TableStringCountingfrequency 38.7
- Reverse Linked List IImediumLinked Listfrequency 38.7
- Reverse String IIeasyTwo PointersStringfrequency 38.7
- Shortest Path in Binary MatrixmediumArrayBreadth-First SearchMatrixfrequency 38.7
- Sum of Subarray MinimumsmediumArrayDynamic ProgrammingStackMonotonic Stackfrequency 38.7
- Employee BonuseasyDatabasefrequency 37.2
- Find Customer RefereeeasyDatabasefrequency 37.2
- Find Minimum in Rotated Sorted ArraymediumArrayBinary Searchfrequency 37.2
- First Bad VersioneasyBinary SearchInteractivefrequency 37.2
- Increasing Triplet SubsequencemediumArrayGreedyLongest Increasing Subsequencefrequency 37.2
- Is SubsequenceeasyTwo PointersStringDynamic Programmingfrequency 37.2
- Kill ProcessmediumArrayHash TableTreeDepth-First Search+1frequency 37.2
- Multiply StringsmediumMathStringSimulationfrequency 37.2
- Number of Substrings Containing All Three CharactersmediumHash TableStringSliding Windowfrequency 37.2
- Perfect SquaresmediumMathDynamic ProgrammingBreadth-First SearchKnapsack Problem+1frequency 37.2
- Queries Quality and PercentageeasyDatabasefrequency 37.2
- Remove Duplicates from Sorted List IImediumLinked ListTwo Pointersfrequency 37.2
- Remove Outermost ParentheseseasyStringStackBracket Sequencesfrequency 37.2
- Reordered Power of 2mediumHash TableMathSortingCounting+1frequency 37.2
- Subarray Sums Divisible by KmediumArrayHash TablePrefix Sumfrequency 37.2
- Substring with Concatenation of All WordshardHash TableStringSliding Windowfrequency 37.2
- Target SummediumArrayDynamic ProgrammingBacktrackingKnapsack Problem+1frequency 37.2
- Basic Calculator IImediumMathStringStackfrequency 35.6
- Consecutive NumbersmediumDatabasefrequency 35.6
- Count Good NumbersmediumMathRecursionfrequency 35.6
- Delete Node in a BSTmediumTreeBinary Search TreeBinary Treefrequency 35.6
- Dot Product of Two Sparse VectorsmediumArrayHash TableTwo PointersDesign+1frequency 35.6
- Find if Path Exists in GrapheasyDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 35.6
- How Many Numbers Are Smaller Than the Current NumbereasyArrayHash TableSortingCounting Sortfrequency 35.6
- Immediate Food Delivery IImediumDatabasefrequency 35.6
- Lemonade ChangeeasyArrayGreedyfrequency 35.6
- Maximum Profit in Job SchedulinghardArrayBinary SearchDynamic ProgrammingSortingfrequency 35.6
- Maximum Sum of Distinct Subarrays With Length KmediumArrayHash TableSliding Windowfrequency 35.6
- Maximum SwapmediumMathGreedyfrequency 35.6
- Number of Digit OnehardMathDynamic ProgrammingRecursionfrequency 35.6
- Partition ListmediumLinked ListTwo Pointersfrequency 35.6
- Path Sum IImediumBacktrackingTreeDepth-First SearchBinary Treefrequency 35.6
- Permutation SequencehardMathRecursionfrequency 35.6
- Product Price at a Given DatemediumDatabasefrequency 35.6