BlackRock Interview Questions

BlackRock Interview Questions

Showing 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

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.

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

#1. 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.

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

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

#2. 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

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

#3. 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

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

Valid Parentheses

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

Somewhat likely

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

#4. Valid Parentheses

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

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

Pairs of Songs With Total Durations Divisible by 60

You are given a list of song durations. Find the number of pairs of songs whose total duration is divisible by 60.

Somewhat likely

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

#5. Pairs of Songs With Total Durations Divisible by 60

You are given a list of song durations. Find the number of pairs of songs whose total duration is divisible by 60.

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

Best Time to Buy and Sell Stock

You're given daily stock prices. Find the maximum profit you can make by buying and selling the stock once. You must buy before you sell.

ArraysDynamic Programming

Somewhat likely

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

#6. Best Time to Buy and Sell Stock

You're given daily stock prices. Find the maximum profit you can make by buying and selling the stock once. You must buy before you sell.

ArraysDynamic Programming

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

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#7. Group Anagrams

Given a list of words, group together all the anagrams. Anagrams are words that contain the same letters rearranged.

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

Maximum Profit From Trading Stocks

You are given a list of stock prices for consecutive days. Determine the maximum profit you can achieve by buying once and selling once, making sure to buy before you sell.

ArraysGreedy Algorithms

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#8. Maximum Profit From Trading Stocks

You are given a list of stock prices for consecutive days. Determine the maximum profit you can achieve by buying once and selling once, making sure to buy before you sell.

ArraysGreedy Algorithms

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

Number of Islands

Given a grid representing land and water, count the number of distinct islands. An island is formed by connected land cells.

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#9. Number of Islands

Given a grid representing land and water, count the number of distinct islands. An island is formed by connected land cells.

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

Evaluate Division

You are given equations represented by pairs of variables and their corresponding values. Your task is to evaluate queries based on these equations, determining the value of expressions if possible, or returning -1.0 if not.

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#10. Evaluate Division

You are given equations represented by pairs of variables and their corresponding values. Your task is to evaluate queries based on these equations, determining the value of expressions if possible, or returning -1.0 if not.

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

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#11. Two Sum

Find two numbers in a given array that add up to a specific target value, and return their indices. Essentially, you need to efficiently locate the pair that satisfies the sum requirement.

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

Determine if two strings are anagrams of each other, meaning they contain the same characters in a different order. You need to check if one string can be rearranged to form the other.

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#12. Valid Anagram

Determine if two strings are anagrams of each other, meaning they contain the same characters in a different order. You need to check if one string can be rearranged to form the other.

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

Median of Two Sorted Arrays

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

ArraysBinary Search

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#13. Median of Two Sorted Arrays

Find the median of two sorted arrays. The arrays can be of different sizes, and you should aim for an efficient solution.

ArraysBinary Search

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

Longest Palindromic Substring

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

StringsTwo PointersDynamic Programming

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#14. Longest Palindromic Substring

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

StringsTwo PointersDynamic Programming

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

Boundary of Binary Tree

Traverse a binary tree and return its boundary nodes in a specific order: left boundary, leaves, and right boundary. Ensure to exclude duplicate nodes.

TreesRecursionStacks

If you have a BlackRock interview, it's unlikely that you will get this question. BlackRock does ask it, but it's rare

#15. Boundary of Binary Tree

Traverse a binary tree and return its boundary nodes in a specific order: left boundary, leaves, and right boundary. Ensure to exclude duplicate nodes.

TreesRecursionStacks

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

Copyright © Taro