← 返回博客列表
Bloomberg

Bloomberg 26NG Superday Coding Recap: Max-Depth Parentheses Substrings + 3 BQ Prompts

2026-04-14

Bloomberg Cover

Bloomberg 26NG Superday coding screenshot

This was a Bloomberg 26NG Superday coding problem. The algorithm is straightforward, but communication quality is what really differentiates candidates.


Clarifications first

I would confirm two points up front:

  1. Is the parentheses string always valid? Yes.
  2. Can the content inside parentheses be empty? Yes, e.g. ().

These clarifications keep the implementation focused.


Improved interview wording (ready to say)

I scan left to right and maintain three states:

Rules while scanning:

  1. On '(': Increase depth and start collecting for a deeper layer. Deeper layers are the only candidates for larger depth answers.

  2. On ')': We are about to leave the current layer. If depth > maxDepth, clear previous answers, add curr, and update maxDepth. If depth == maxDepth, append curr. Then clear curr and decrement depth.

  3. On normal characters: Append to curr.

At the end, return all substrings associated with maximum depth (format depends on the prompt).


Complexity


Common pitfalls


3 practical BQ prompts (for Bloomberg Superday)

BQ1: Tell me about a time you fixed a high-pressure issue quickly

Structure:

BQ2: Tell me about a disagreement with a teammate

Structure:

BQ3: Tell me about a time you improved efficiency proactively

Structure:


Takeaway

This problem is essentially one-pass state tracking. In Bloomberg-style interviews, correctness matters, but clear state reasoning and edge-case communication matter just as much.


If you are preparing for Bloomberg / Google / Amazon interviews, feel free to reach out.

#bloomberg #superday #vo #newgrad #sde #interview


Further Reading (External Links)


Need real interview questions? Contact WeChat Coding0201: Get Questions.

Contact

Email: [email protected]
Telegram: @OAVOProxy