BlackRock Interview Questions — 17 DSA Problems

14 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked BlackRock LeetCode questions for software engineering interviews.

• Happy Number (EASY) — Hash Table, Math, Two Pointers
• Valid Parentheses (EASY) — String, Stack
• Evaluate Division (MEDIUM) — Array, String, Depth-First Search, Breadth-First Search, Union Find, Graph, Shortest Path
• Find the Maximum Sum of Node Values (HARD) — Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting
• Pairs of Songs With Total Durations Divisible by 60 (MEDIUM) — Array, Hash Table, Counting
• Maximum Subtree of the Same Color (MEDIUM) — Array, Dynamic Programming, Tree, Depth-First Search
• Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Path with Maximum Probability (MEDIUM) — Array, Graph, Heap (Priority Queue), Shortest Path
• Maximum Profit From Trading Stocks (MEDIUM) — Array, Dynamic Programming
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Valid Anagram (EASY) — Hash Table, String, Sorting
• Coin Change (MEDIUM) — Array, Dynamic Programming, Breadth-First Search
• Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
• Maximize Greatness of an Array (MEDIUM) — Array, Two Pointers, Greedy, Sorting
• Boundary of Binary Tree (MEDIUM) — Tree, Depth-First Search, Binary Tree
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming