BlackRock LeetCode Questions
14 questions all-time · 6 easy · 7 medium · 1 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Happy Number Hash Table, Math, Two Pointers | Easy | 100 | 0.6% |
| 2 | Find the Maximum Sum of Node Values Array, Dynamic Programming, Greedy, Bit Manipulation, Tree, Sorting | Hard | 71 | 0.7% |
| 3 | Maximum Subtree of the Same Color Array, Dynamic Programming, Tree, Depth-First Search | Medium | 70 | 0.6% |
| 4 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 61 | 0.7% |
| 5 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 58 | 0.6% |
| 6 | Valid Parentheses String, Stack | Easy | 54 | 0.4% |
| 7 | Maximum Profit From Trading Stocks Array, Dynamic Programming | Medium | 49 | 0.5% |
| 8 | Number of Islands Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix | Medium | 42 | 0.6% |
| 9 | Longest Palindromic Substring Two Pointers, String, Dynamic Programming | Medium | 42 | 0.4% |
| 10 | Two Sum Array, Hash Table | Easy | 42 | 0.6% |
| 11 | Missing Number Array, Hash Table, Math, Binary Search, Bit Manipulation, Sorting | Easy | 42 | 0.7% |
| 12 | Climbing Stairs Math, Dynamic Programming, Memoization | Easy | 42 | 0.5% |
| 13 | Integer to Roman Hash Table, Math, String | Medium | 42 | 0.7% |
| 14 | Find the Duplicate Number Array, Two Pointers, Binary Search, Bit Manipulation | Medium | 42 | 0.6% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.