BlackRock OA Guide: Question Types & Real Questions

As the world's largest asset manager, BlackRock's tech roles (especially teams around the Aladdin platform) run an OA that tests both algorithmic fundamentals and engineering/data skills. The coding assessment is usually delivered through HackerRank, with a fairly fixed mix of question types. This article breaks that OA into four categories and gives real-question-style solutions for each.

BlackRock OA Overview

Type 1: Array and String Processing

The most basic category, often "subarray sums" or "character frequency." A typical one: given an array, count contiguous subarrays whose sum equals a target.

Python Solution (Prefix Sum + Hash)

def subarray_sum_count(nums, target):
    count = 0
    prefix = 0
    seen = {0: 1}  # prefix sum -> occurrence count
    for x in nums:
        prefix += x
        count += seen.get(prefix - target, 0)
        seen[prefix] = seen.get(prefix, 0) + 1
    return count

Time complexity: O(n)　Space complexity: O(n)

Type 2: Graphs / Shortest Paths

Asset networks and dependency relationships are often wrapped as graph problems. Typical: given N nodes and weighted edges, find shortest distances from a source to all nodes.

Python Solution (Dijkstra + Heap)

import heapq
from collections import defaultdict

def shortest_paths(n, edges, src):
    graph = defaultdict(list)
    for u, v, w in edges:
        graph[u].append((v, w))
    dist = [float('inf')] * n
    dist[src] = 0
    pq = [(0, src)]
    while pq:
        d, u = heapq.heappop(pq)
        if d > dist[u]:
            continue
        for v, w in graph[u]:
            if d + w < dist[v]:
                dist[v] = d + w
                heapq.heappush(pq, (dist[v], v))
    return dist

Time complexity: O((V + E) log V)

Type 3: Dynamic Programming

BlackRock's DP problems lean toward "investment/return" scenarios, e.g. "maximum non-adjacent subsequence sum" (a stand-in for not investing in the same asset two periods in a row).

Python Solution

def max_non_adjacent_sum(nums):
    include, exclude = 0, 0  # include: take current; exclude: skip current
    for x in nums:
        include, exclude = exclude + x, max(include, exclude)
    return max(include, exclude)

Time complexity: O(n)　Space complexity: O(1)

Type 4: SQL Queries

Almost guaranteed for finance/data roles. Typical: given a transactions table, find each client's single largest transaction this month.

SQL Solution (Window Function)

SELECT client_id, txn_id, amount, txn_date
FROM (
    SELECT client_id, txn_id, amount, txn_date,
           ROW_NUMBER() OVER (
               PARTITION BY client_id
               ORDER BY amount DESC
           ) AS rn
    FROM transactions
    WHERE txn_date >= DATE_TRUNC('month', CURRENT_DATE)
) t
WHERE rn = 1;

The window function ROW_NUMBER() is the standard weapon for "group then take Top-1" problems — cleaner and more efficient than a self-join.

Preparation Strategy

BlackRock's OA isn't extreme in difficulty, but it has many questions in a tight window, and mixing SQL with coding makes it easy to lose your rhythm. Rotate practice across types and drill SQL window functions until they're muscle memory.

FAQ

How hard is the BlackRock OA versus LeetCode? Mostly Easy to Medium. Individual questions aren't hard, but the volume is high and time is tight, and the SQL mix demands good pacing.

What platform and duration? Most roles use HackerRank, some CodeSignal; 60–90 minutes with 3–5 questions.

Does BlackRock always test SQL? Data/finance-analytics tracks almost always do; pure backend/platform roles lean toward coding, but knowing window functions never hurts.

What's the process after the OA? After passing, you typically get a technical phone screen and a superday (multiple VO rounds) with coding, system/project discussion, and behavioral — about a 3–5 week cycle.

What if I run out of time or my SQL is rusty? We provide BlackRock OA support: targeted breakdowns and timed drills across the four question types, helping you score steadily within the tight window.

Preparing for the BlackRock OA?

The hard part isn't any single question — it's the "volume + SQL mix" rhythm. Our mentors offer high-frequency breakdowns across all four types, SQL window-function drills, and timed mocks. For a systematic plan, reach out — contact WeChat Coding0201 to get real questions and prep materials.

Contact

Email: [email protected] Telegram: @OAVOProxy