Companies
Amazon1009 questions
Meta533 questions
Google475 questions
Uber337 questions
ByteDance / TikTok409 questions
Microsoft264 questions
Snowflake197 questions
Apple182 questions
OpenAI210 questions
Stripe205 questions
Databricks119 questions
DoorDash139 questions
Pinterest104 questions
Netflix97 questions
Roblox89 questions
Anthropic107 questions
IBM125 questions
Citadel / Citadel Securities122 questions
Bloomberg118 questions
LinkedIn115 questions
Salesforce115 questions
Coinbase93 questions
Capital One107 questions
Goldman Sachs105 questions
Oracle104 questions
Airbnb104 questions
Rippling84 questions
Snapchat97 questions
Waymo93 questions
JPMorgan Chase84 questions

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.
118
questions
Last updated
Before you start
Showing 34 of 34
OJ Problems
practice in the online judgeAuto 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)Insert Delete GetRandom O(1)Design an Ordered StreamFlatten a Multilevel Doubly Linked ListTrain a Next-Word Predictor from Tokenized SentencesDecode an Encoded String with Nested PatternsDesign a Lottery System with O(1) DeleteFlatten a Linked List with Down PointersLength of the Longest Substring Without Repeating CharactersBinary Tree Vertical Order Traversal
