Question 1

Happy Number — BlackRock Interview Question

Accepted Answer

"Happy Number" is a easy difficulty problem asked at BlackRock interviews. It covers the following topics: Hash Table, Math, Two Pointers. You can practice it on LeetCode: https://leetcode.com/problems/happy-number

Question 2

Valid Parentheses — BlackRock Interview Question

Accepted Answer

"Valid Parentheses" is a easy difficulty problem asked at BlackRock interviews. It covers the following topics: String, Stack. You can practice it on LeetCode: https://leetcode.com/problems/valid-parentheses

Question 3

Evaluate Division — BlackRock Interview Question

Accepted Answer

"Evaluate Division" is a medium difficulty problem asked at BlackRock interviews. It covers the following topics: Array, String, Depth-First Search, Breadth-First Search, Union Find, Graph, Shortest Path. You can practice it on LeetCode: https://leetcode.com/problems/evaluate-division

Question 4

Find the Maximum Sum of Node Values — BlackRock Interview Question

Accepted Answer

"Find the Maximum Sum of Node Values" is a hard difficulty problem asked at BlackRock interviews. It covers the following topics: Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting. You can practice it on LeetCode: https://leetcode.com/problems/find-the-maximum-sum-of-node-values

Question 5

Pairs of Songs With Total Durations Divisible by 60 — BlackRock Interview Question

Accepted Answer

"Pairs of Songs With Total Durations Divisible by 60" is a medium difficulty problem asked at BlackRock interviews. It covers the following topics: Array, Hash Table, Counting. You can practice it on LeetCode: https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60

Question 6

Maximum Subtree of the Same Color — BlackRock Interview Question

Accepted Answer

"Maximum Subtree of the Same Color" is a medium difficulty problem asked at BlackRock interviews. It covers the following topics: Array, Dynamic Programming, Tree, Depth-First Search. You can practice it on LeetCode: https://leetcode.com/problems/maximum-subtree-of-the-same-color

#	Question Title	Difficulty	Frequency	Topics
1	Happy Number	EASY	100.0	Hash TableMathTwo Pointers
2	Valid Parentheses	EASY	94.0	StringStack
3	Evaluate Division	MEDIUM	82.3	ArrayStringDepth-First Search+4
4	Find the Maximum Sum of Node Values	HARD	73.2	ArrayDynamic ProgrammingGreedy+3
5	Pairs of Songs With Total Durations Divisible by 60	MEDIUM	71.4	ArrayHash TableCounting
6	Maximum Subtree of the Same Color	MEDIUM	71.4	ArrayDynamic ProgrammingTree+1
7	Group Anagrams	MEDIUM	58.6	ArrayHash TableString+1
8	Best Time to Buy and Sell Stock	EASY	58.6	ArrayDynamic Programming
9	Path with Maximum Probability	MEDIUM	49.2	ArrayGraphHeap (Priority Queue)+1
10	Maximum Profit From Trading Stocks	MEDIUM	49.2	ArrayDynamic Programming

Explore 450+ Companies

Companies

BlackRock

Want to see more?

BlackRock Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

BlackRock

Want to see more?

BlackRock Interview Questions

Ai Assistant Kas