← Back to Dashboard

Bloomberg Interview Questions

Curated from verified interview reports: a mixed Coding slate - string filtering, tree-level analysis, grid navigation, and dual-extremes data structures.

5 real interview questions reported from Bloomberg Software Engineer interviews (Coding round): 2 easy, 1 medium, 2 hard. Each question shows its interview round and how often it was reported, and coding questions come with runnable tests.

Bloomberg Coding round questions (5)

  • Densest Tree Level - Medium, free preview
    Run a level-order traversal and return the 1-indexed level containing the most N-ary tree nodes.
  • Dual Extremes Queue - Hard, free preview
    Design a FIFO latency buffer that supports amortized O(1) enqueue, dequeue, min, and max.
  • Fuel Grid Navigation - Hard
    Search the grid over position-plus-fuel states so refueling stations can reset your remaining range.
  • Tree Min Leaf Sum - Easy
    Find the smallest root-to-leaf path sum in an N-ary tree, even when values can be negative.
  • Word Puzzle Filter - Easy
    Filter a candidate dictionary down to words that use only allowed letters and include one required letter.