BlackRock Interview Guide

Showing 3 of 15 questions

Ranking

A question's ranking corresponds to how commonly it's asked by BlackRock. The higher the ranking, the more likely you'll encounter it in a BlackRock interview.

Question

Frequency

Difficulty

Happy Number

Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

Two Pointers

Very likely

If you have a BlackRock interview, it's very likely that you will get this question

Easy

#1. Happy Number

Easy

Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

Two Pointers

This question is very likely to be asked in your BlackRock interview

Find the Maximum Sum of Node Values

Given a tree, find the maximum possible sum of node values you can obtain by selecting nodes such that no two selected nodes are directly connected by an edge.

Dynamic ProgrammingGreedy AlgorithmsTreesGraphsBit Manipulation

Very likely

If you have a BlackRock interview, it's very likely that you will get this question

Hard

#2. Find the Maximum Sum of Node Values

Hard

Given a tree, find the maximum possible sum of node values you can obtain by selecting nodes such that no two selected nodes are directly connected by an edge.

Dynamic ProgrammingGreedy AlgorithmsTreesGraphsBit Manipulation

This question is very likely to be asked in your BlackRock interview

Maximum Subtree of the Same Color

Given a tree where each node has a color, find the largest subtree where all nodes have the same color. Return the number of nodes in that subtree.

TreesGraphsRecursionDynamic Programming

Somewhat likely

If you have a BlackRock interview, you might get this question

Medium

#3. Maximum Subtree of the Same Color

Medium

Given a tree where each node has a color, find the largest subtree where all nodes have the same color. Return the number of nodes in that subtree.

TreesGraphsRecursionDynamic Programming

This question is somewhat likely to be asked in your BlackRock interview