← BlackRock Interview Insights

BlackRock·Software Engineer·Technical Phone Screen·Intermediate

Intermediate
Jun 2026

Summary

BlackRock Data Engineer interview with a classic interval merging problem. Nothing too wild but it's the kind of question where you either see the sorting trick immediately or you don't.

Questions Asked (1)

Q1

Given an array of intervals, merge all overlapping ones and return the resulting non-overlapping intervals.

Algorithms & Data Structures
Author's notes

I stared at this for a beat longer than I should have.

Create a free account to read the full note

AI HintsAI Generated

Suggested Approach

Start by clarifying the problem constraints (e.g., interval endpoints, input size, sortedness). Then propose sorting intervals by start time and merging in a single pass, explaining the logic and handling edge cases. Finally, analyze time and space complexity and discuss potential optimizations or alternative approaches.

Pro tip: Mention that sorting is key to achieving O(n log n) time, and if the input is already sorted, the merge can be done in O(n). This shows you consider input characteristics and can optimize accordingly.

1. Clarify requirements and constraints

Ask about interval representation (inclusive/exclusive endpoints), input size, whether intervals are sorted, and expected output format. This ensures you understand the problem fully before coding.

2. Outline the algorithm

Explain that you will sort intervals by start time, then iterate through them, merging overlapping intervals by comparing the current interval's start with the previous merged interval's end.

3. Walk through an example

Use a small example (e.g., [[1,3],[2,6],[8,10],[15,18]]) to demonstrate how the algorithm works step by step, showing the merge process and final result.

4. Analyze complexity

State that sorting takes O(n log n) time and the merge pass takes O(n) time, resulting in O(n log n) overall. Space complexity is O(n) for the output (or O(1) extra if done in-place).

5. Discuss edge cases and optimizations

Mention edge cases like empty input, single interval, intervals with same start, and touching intervals (e.g., [1,2] and [2,3] may or may not merge depending on definition). If input is already sorted, the merge can be O(n).

Key Points to Mention

  • Sorting intervals by start time is crucial for efficient merging.
  • Merge condition: if current interval's start <= previous merged interval's end, they overlap.
  • When merging, update the end to max(previous end, current end).
  • Time complexity: O(n log n) due to sorting; space complexity: O(n) for output.
  • Edge cases: empty array, single interval, intervals that touch at endpoints.
  • If input is already sorted, the algorithm can run in O(n) time.

AI-generated suggestions, not part of the candidate's original notes. May be inaccurate — verify before relying on them.