← Back to Directory

BlackRock

Large Enterprises

Screna has 8 BlackRock interview write-ups. The most reported round is the technical phone screen (7).

8 interview notes · updated Jun 2026

BlackRock·Software Engineer·Technical Phone Screen

Jun 2026
BlackRock Data Engineer interview with a classic interval merging problem. Pretty standard algorithmic screen, nothing too wild, but the edge cases will get you if you're not careful.
  • Given a sorted list of non-overlapping intervals and a new interval, insert the new interval into the list such that the result remains sorted and non-overlapping, merging where needed.

“I jumped straight to coding and missed the overlap condition for a minute.”

View Post

BlackRock·Software Engineer·Onsite - System Design / Architecture

Jun 2026
BlackRock system design round for a software engineering role. One meaty OOP question that branched out pretty far once they started asking about extensions.
  • Design a parking lot system that handles multiple vehicle types (motorcycle, car, truck) with appropriately sized spots, multiple floors, ticket generation on entry, fee calculation on exit, and logic for finding available spots. Walk through the class hierarchy, key APIs, and how you'd extend it to support reservations or real-time availability.

“Spent the first few minutes just laying out the class structure: Vehicle as a base with subtypes, ParkingSpot sized accordingly, ParkingLot holding multiple Levels.”

View Post

BlackRock·Software Engineer·Technical Phone Screen

Jun 2026
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.
  • Given an array of intervals, merge all overlapping ones and return the resulting non-overlapping intervals.

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

View Post

BlackRock·Software Engineer·Technical Phone Screen

May 2026
BlackRock software engineer interview with a binary tree traversal question that required both recursive and iterative implementations plus complexity analysis. Pretty standard algorithms round but they pushed hard on the iterative version.
  • Given a binary tree, implement in-order traversal both recursively and iteratively using a stack. Discuss the time and space complexity of each approach.

“Recursive was fine, wrote it in like two minutes.”

View Post

BlackRock·Software Engineer·Technical Phone Screen

May 2026
BlackRock quant engineer interview, one meaty technical question about quantitative modeling that required covering a lot of ground fast. Pretty rigorous for a single question but felt representative of what the role actually demands.
  • Walk me through a quantitative model you've built or worked with to analyze market data. What was it trying to do, what assumptions did it rely on, how did you test those assumptions, and where did it fall short?

“This question is deceptively broad.”

View Post

BlackRock·Software Engineer·Technical Phone Screen

Apr 2026
BlackRock Quant Engineer interview with a broad open-ended question about where quant finance is heading. Single question, more of a discussion than a technical grilling, which I did not expect going in.
  • Where do you see quantitative finance going over the next 5 to 10 years, and what trends do you think will have the biggest impact on the field and the broader global economy?

“I rambled a bit.”

View Post

BlackRock·Software Engineer·Technical Phone Screen

Apr 2026
BlackRock quant engineer interview, one question that sounds deceptively philosophical but is actually a pretty rigorous test of whether you can think outside your own domain.
  • Can you describe a concrete problem outside of finance where you applied a markets or quantitative thinking lens? What worked, and what didn't carry over?

“This one tripped me up more than I expected.”

View Post

BlackRock·Software Engineer·Technical Phone Screen

Apr 2026
BlackRock software engineer interview that was pretty much a deep dive into 2D prefix sums. One question, but they pushed hard on the extensions so it stretched longer than expected.
  • Given an m by n integer matrix, design a solution that preprocesses it so any query for the sum of elements in a submatrix from (0,0) to (x,y) runs in O(1). Then extend it to handle arbitrary range queries from (r1,c1) to (r2,c2). Walk through preprocessing time, space, and the generalization.

“The basic prefix sum table part went fine, I'd seen 1D prefix sums before and the 2D version isn't a huge leap.”

View Post