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
- Number of People Aware of a SecretmediumDynamic ProgrammingQueueSimulationfrequency 21.4
- Path With Minimum EffortmediumArrayBinary SearchDepth-First SearchBreadth-First Search+4frequency 21.4
- Range Sum Query 2D - MutablemediumArrayDesignBinary Indexed TreeSegment Tree+2frequency 21.4
- Rank Teams by VotesmediumArrayHash TableStringSorting+1frequency 21.4
- Relative RankseasyArraySortingHeap (Priority Queue)frequency 21.4
- Repeated Substring PatterneasyStringString MatchingZ AlgorithmKnuth–Morris–Pratt Algorithmfrequency 21.4
- Reverse Substrings Between Each Pair of ParenthesesmediumStringStackBracket Sequencesfrequency 21.4
- Robot Return to OrigineasyStringSimulationfrequency 21.4
- Rotate FunctionmediumArrayMathDynamic Programmingfrequency 21.4
- Shortest Subarray to be Removed to Make Array SortedmediumArrayTwo PointersBinary SearchStack+1frequency 21.4
- Snakes and LaddersmediumArrayBreadth-First SearchMatrixfrequency 21.4
- Stone GamemediumArrayMathDynamic ProgrammingMinimax+2frequency 21.4
- The k-th Lexicographical String of All Happy Strings of Length nmediumStringBacktrackingfrequency 21.4
- Triangle JudgementeasyDatabasefrequency 21.4
- Type of TriangleeasyArrayMathSortingPolygonsfrequency 21.4
- Ugly Number IImediumHash TableMathDynamic ProgrammingHeap (Priority Queue)frequency 21.4
- Unique Binary Search Trees IImediumDynamic ProgrammingBacktrackingTreeBinary Search Tree+1frequency 21.4
- Unique Length-3 Palindromic SubsequencesmediumHash TableStringBit ManipulationPrefix Sumfrequency 21.4
- Using a Robot to Print the Lexicographically Smallest StringmediumHash TableStringStackGreedyfrequency 21.4
- Ways to Express an Integer as Sum of PowersmediumDynamic Programmingfrequency 21.4
- Zero Array Transformation ImediumArrayPrefix Sumfrequency 21.4
- Add StringseasyMathStringSimulationfrequency 17.7
- All O`one Data StructurehardHash TableLinked ListDesignDoubly-Linked Listfrequency 17.7
- Amount of Time for Binary Tree to Be InfectedmediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 17.7
- Apply Operations to an ArrayeasyArrayTwo PointersSimulationfrequency 17.7
- Biggest Single NumbereasyDatabasefrequency 17.7
- Binary Tree CamerashardDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 17.7
- Binary WatcheasyBacktrackingBit Manipulationfrequency 17.7
- Brick WallmediumArrayHash Tablefrequency 17.7
- Burst BalloonshardArrayDynamic Programmingfrequency 17.7
- Check if Grid can be Cut into SectionsmediumArraySortingfrequency 17.7
- Check if Number is a Sum of Powers of ThreemediumMathfrequency 17.7
- Combination Sum IIImediumArrayBacktrackingfrequency 17.7
- Construct Binary Search Tree from Preorder TraversalmediumArrayStackTreeBinary Search Tree+2frequency 17.7
- Contains Duplicate IIIhardArraySliding WindowSortingBucket Sort+1frequency 17.7
- Continuous SubarraysmediumArrayQueueSliding WindowHeap (Priority Queue)+2frequency 17.7
- Count Hills and Valleys in an ArrayeasyArrayfrequency 17.7
- Count Salary CategoriesmediumDatabasefrequency 17.7
- Count Special TripletsmediumArrayHash TableCountingfrequency 17.7
- Count Subarrays Where Max Element Appears at Least K TimesmediumArraySliding Windowfrequency 17.7
- Count the Number of Consistent StringseasyArrayHash TableStringBit Manipulation+1frequency 17.7
- Create Binary Tree From DescriptionsmediumArrayHash TableTreeBinary Treefrequency 17.7
- Create Maximum NumberhardArrayTwo PointersStackGreedy+1frequency 17.7
- DI String MatcheasyArrayTwo PointersStringGreedyfrequency 17.7
- Delete and EarnmediumArrayHash TableDynamic Programmingfrequency 17.7
- Design Circular QueuemediumArrayLinked ListDesignQueuefrequency 17.7
- Design Linked ListmediumLinked ListDesignfrequency 17.7
- Design Task ManagermediumHash TableDesignHeap (Priority Queue)Ordered Setfrequency 17.7
- Design TwittermediumHash TableLinked ListDesignHeap (Priority Queue)frequency 17.7
- Distribute CandieseasyArrayHash Tablefrequency 17.7