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
- Lowest Common Ancestor of Deepest LeavesmediumHash TableTreeDepth-First SearchBreadth-First Search+4frequency 13.4
- Make Array Elements Equal to ZeroeasyArraySimulationPrefix Sumfrequency 13.4
- Make Sum Divisible by PmediumArrayHash TablePrefix Sumfrequency 13.4
- Map of Highest PeakmediumArrayBreadth-First SearchMatrixfrequency 13.4
- Market Analysis ImediumDatabasefrequency 13.4
- Max Difference You Can Get From Changing an IntegermediumMathGreedyfrequency 13.4
- Max Sum of Rectangle No Larger Than KhardArrayBinary SearchMatrixPrefix Sum+1frequency 13.4
- Maximal SquaremediumArrayDynamic ProgrammingMatrixfrequency 13.4
- Maximum 69 NumbereasyMathGreedyfrequency 13.4
- Maximum Amount of Money Robot Can EarnmediumArrayDynamic ProgrammingMatrixfrequency 13.4
- Maximum Average Pass RatiomediumArrayGreedyHeap (Priority Queue)frequency 13.4
- Maximum Difference Between Increasing ElementseasyArrayfrequency 13.4
- Maximum Erasure ValuemediumArrayHash TableSliding Windowfrequency 13.4
- Maximum Frequency StackhardHash TableStackDesignOrdered Setfrequency 13.4
- Maximum Length Substring With Two OccurrenceseasyHash TableStringSliding Windowfrequency 13.4
- Maximum Matrix SummediumArrayGreedyMatrixfrequency 13.4
- Maximum Palindromes After OperationsmediumArrayHash TableStringGreedy+2frequency 13.4
- Maximum Product of Splitted Binary TreemediumTreeDepth-First SearchBinary Treefrequency 13.4
- Maximum Product of Two DigitseasyMathSortingfrequency 13.4
- Maximum Repeating SubstringeasyStringDynamic ProgrammingString Matchingfrequency 13.4
- Maximum Score From Removing SubstringsmediumStringStackGreedyfrequency 13.4
- Maximum Square Area by Removing Fences From a FieldmediumArrayHash TableEnumerationfrequency 13.4
- Maximum Sum of 3 Non-Overlapping SubarrayshardArrayDynamic ProgrammingSliding WindowPrefix Sumfrequency 13.4
- Maximum Tastiness of Candy BasketmediumArrayBinary SearchGreedySortingfrequency 13.4
- Maximum Unique Subarray Sum After DeletioneasyArrayHash TableGreedyfrequency 13.4
- Meeting RoomseasyArraySortingQuicksortfrequency 13.4
- Merge Two Binary TreeseasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 13.4
- Minimum Array EndmediumBit Manipulationfrequency 13.4
- Minimum Cost of Buying Candies With DiscounteasyArrayGreedySortingfrequency 13.4
- Minimum Deletions to Make String BalancedmediumStringDynamic ProgrammingStackfrequency 13.4
- Minimum Deletions to Make String K-SpecialmediumHash TableStringGreedySorting+1frequency 13.4
- Minimum Falling Path SummediumArrayDynamic ProgrammingMatrixfrequency 13.4
- Minimum Index Sum of Two ListseasyArrayHash TableStringfrequency 13.4
- Minimum Number of Removals to Make Mountain ArrayhardArrayBinary SearchDynamic ProgrammingGreedyfrequency 13.4
- Minimum Operations to Make Array Elements ZerohardArrayMathBit Manipulationfrequency 13.4
- Minimum Operations to Make Array Values Equal to KeasyArrayHash Tablefrequency 13.4
- Minimum Operations to Reduce an Integer to 0mediumDynamic ProgrammingGreedyBit Manipulationfrequency 13.4
- Minimum Penalty for a ShopmediumStringPrefix Sumfrequency 13.4
- Mirror Distance of an IntegereasyMathfrequency 13.4
- Most Frequent Even ElementeasyArrayHash TableCountingfrequency 13.4
- Moving Average from Data StreameasyArrayDesignQueueData Streamfrequency 13.4
- My Calendar ImediumArrayBinary SearchDesignSegment Tree+1frequency 13.4
- N-Repeated Element in Size 2N ArrayeasyArrayHash TablePigeonhole Principlefrequency 13.4
- N-ary Tree Postorder TraversaleasyStackTreeDepth-First Searchfrequency 13.4
- Nearest Exit from Entrance in MazemediumArrayBreadth-First SearchMatrixfrequency 13.4
- Nim GameeasyMathBrainteaserMinimaxGame Theory+2frequency 13.4
- Nth DigitmediumMathBinary Searchfrequency 13.4
- Number of Distinct IslandsmediumArrayHash TableDepth-First SearchBreadth-First Search+4frequency 13.4
- Number of Paths with Max ScorehardArrayDynamic ProgrammingMatrixfrequency 13.4
- Number of Steps to Reduce a Number to ZeroeasyMathBit Manipulationfrequency 13.4