bloomberg logo
Bloomberg· Senior Software Engineer (SSE)

Bloomberg - Pune (India) | SSE | Interview R1 | Techincal Screening | 24th Dec 2025

Location
Pune (India)
Posted
5 Jan 2026
629 reads

Summary

I interviewed for a Senior Software Engineer role at Bloomberg in Pune. The interview covered resume discussion, core CS fundamentals including Java vs C++, Binary Trees, BSTs, AVL and Red-Black Trees, and a graph traversal DSA problem similar to Bus Routes. I felt comfortable with most parts and am awaiting feedback.

How it went

I recently interviewed for the Senior Software Engineer (SSE) role at Bloomberg. The interview began with a discussion around my resume, focusing on my past experience, projects, and technical contributions.

This was followed by core computer science fundamentals, including:

  • A comparison between Java and C++.

  • An explanation of Binary Trees and Binary Search Trees (BSTs), along with real-world use cases of BSTs.

  • A discussion on self-balancing trees, specifically AVL Trees and Red-Black Trees. While I was able to explain their purpose at a high level, I was unable to answer the follow up questions revolving around their internal balancing mechanisms.

The interview then moved to a DSA problem, conceptually similar to the “Bus Routes” problem reframed as Metro Routes ( https://leetcode.com/problems/bus-routes/description ) . The problem involved graph traversal and finding whether or not I can reach a destination station from a starting station. I was able to approach and solve this problem confidently.

Overall, I felt comfortable with most parts of the interview. One area for improvement I identified was explaining AVL and Red-Black Trees in greater depth. Currently, I’m awaiting feedback from the Bloomberg team regarding the interview outcome.

Questions asked (4)

  1. 01

    Java vs C++ Comparison

    Other

    A comparison between Java and C++.

  2. 02

    Binary Trees and BSTs: Explanation and Use Cases

    Data Structures & Algorithms

    An explanation of Binary Trees and Binary Search Trees (BSTs), along with real-world use cases of BSTs.

  3. 03

    AVL Trees and Red-Black Trees

    Data Structures & Algorithms

    A discussion on self-balancing trees, specifically AVL Trees and Red-Black Trees.

  4. 04

    Metro Routes (Bus Routes variation)

    Data Structures & Algorithms

    A DSA problem, conceptually similar to the “Bus Routes” problem reframed as Metro Routes. The problem involved graph traversal and finding whether or not I can reach a destination station from a starting station.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Bloomberg recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!