Bloomberg Interview Question Bank
Bloomberg's loop is a coding-heavy gauntlet: three back-to-back technical rounds each pack two LeetCode-style problems with little hand-holding, plus an HR screen and an engineering manager round that anchors on a single deep project story. The coding bar emphasizes pristine communication — dry-running, edge cases, and complexity discussion are graded as heavily as the solution itself, and interviewers routinely push for second-best alternatives even after a working answer. New-grad and tech-screen verdicts often arrive within hours, while jump-shift onsites favor candidates who can explain past trade-offs without prompting.
37
questions
Last updated
Before you start
Showing 37 of 37
Choose a Wordle Guess Using One-Step MinimaxImplement Wordle FeedbackDesign a Mutable Sparse Matrix and Implement Matrix MultiplicationDesign a Sparse Array and Compute Sparse Vector Dot ProductsDecode StringFind All Duplicates in an ArrayLowest Common Ancestor in an N-ary TreeMinimum Number of Steps to Make Two Strings AnagramDetect Fraudulent TransactionsAuto CorrectorStock Price Tracker (Online Stock Span)Shortest Path in a Grid with Obstacles EliminationFair Electoral Vote ApportionmentRefactor an LRU Cache into a Pluggable Eviction-Policy CacheAlien Dictionary / Recover Character Order from Sorted WordsDetect Duplicate Items Within a 60-Second Sliding WindowMinimum Cost to Send People to Two Cities (Generalized to K)Design an OOP LRU CacheShortest Path on a Grid with Gas Stations (State Reset)Add Two Numbers (Forward Order Linked Lists)Van Eck-like Sequence: N-th TermFlatten a Multilevel Linked List (Pointer Reconnection)Check Connectivity Between Two Subway StationsTwo-City Onsite Flight Cost MinimizationEnumerate Round-Robin Match Schedules (Generate All Possible Pairings by Round)Remove Invalid Parentheses (Minimum Removal, Return All Valid Strings)Bucket Values Into Boundary RangesFind the Root Cause Node from Parent-to-Children LogsDesign a data structure supporting insert, delete, and query Top-K frequent elementsCandy Crush in 1D (Stabilize by Repeatedly Removing Groups)