Companies
Amazon837 questions
Meta471 questions
Google371 questions
Uber278 questions
Microsoft223 questions
Apple141 questions
Stripe183 questions
Snowflake156 questions
OpenAI163 questions
Netflix87 questions
Databricks94 questions
IBM117 questions
Roblox73 questions
DoorDash112 questions
Anthropic89 questions
Coinbase87 questions
Bloomberg102 questions
ByteDance / TikTok98 questions
LinkedIn94 questions
Salesforce83 questions
Citadel / Citadel Securities77 questions
Rippling65 questions
Airbnb71 questions
Pinterest63 questions
Oracle63 questions
Reddit40 questions
Waymo57 questions
xAI39 questions
NVIDIA52 questions
Perplexity32 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.
102
questions
Last updated
Before you start
Showing 25 of 25
OJ Problems
practice in the online judgeMinimum 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 TraversalWord Search in a 2D boardImplement atoi (string to integer conversion)Grid Path Reachability with Refueling (Fuel-Constrained BFS)Validate Stack SequencesGas Station Feasibility / Complete CircuitMeeting Rooms IIOptimizing Hard Problem Solution