Bny Mellon Coding Interview Questions
We track 16 coding questions asked at Bny Mellon, tagged with the algorithms and concepts they test. The most common: Array, Sorting, Dynamic Programming, Hash Table, Math.
Browse all 16 Bny Mellon questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- Array23.3%
- Sorting10.6%
- Dynamic Programming9.8%
- Hash Table6.8%
- Two Pointers6.2%
- String5.7%
- Math4.9%
- Bit Manipulation3.6%
- Greedy3.6%
- Prefix Sum3.3%
- Other (15)21.8%
How many questions involve each concept
Share of all 16 tracked Bny Mellon questions that touch each concept. Questions usually involve several, so these overlap.
- Array81.2%
- Sorting37.5%
- Dynamic Programming31.2%
- Hash Table25.0%
- Math18.8%
- String18.8%
- Two Pointers18.8%
- Bit Manipulation12.5%
- Depth-First Search12.5%
- Graph Theory12.5%
- Greedy12.5%
- Prefix Sum12.5%
Where Bny Mellon differs from the average company
Concept weight at Bny Mellon relative to the average across all companies we track. Green means Bny Mellon leans on it harder than most.
- Sorting2.7×
- Graph Theory2.3×
- Bit Manipulation2.3×
- Prefix Sum2.1×
- String0.60×
Bny Mellon specialties
Concepts that show up at Bny Mellon but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 16 tracked Bny Mellon questions.
- Junior19% (3)
- Mid/Senior63% (10)
- Staff19% (3)
Every concept in Bny Mellon interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 13 | 81.2% | 23.3% |
| Sorting | 6 | 37.5% | 10.6% |
| Dynamic Programming | 5 | 31.2% | 9.8% |
| Hash Table | 4 | 25.0% | 6.8% |
| Math | 3 | 18.8% | 4.9% |
| String | 3 | 18.8% | 5.7% |
| Two Pointers | 3 | 18.8% | 6.2% |
| Bit Manipulation | 2 | 12.5% | 3.6% |
| Depth-First Search | 2 | 12.5% | 2.3% |
| Graph Theory | 2 | 12.5% | 2.3% |
| Greedy | 2 | 12.5% | 3.6% |
| Prefix Sum | 2 | 12.5% | 3.3% |
| Backtracking | 1 | 6.2% | 1.6% |
| Breadth-First Search | 1 | 6.2% | 1.0% |
| Combinatorics | 1 | 6.2% | 1.2% |
| Divide and Conquer | 1 | 6.2% | 1.2% |
| Enumeration | 1 | 6.2% | 1.6% |
| Heap (Priority Queue) | 1 | 6.2% | 1.2% |
| Memoization | 1 | 6.2% | 1.2% |
| Monotonic Stack | 1 | 6.2% | 1.6% |
| Number Theory | 1 | 6.2% | 1.6% |
| Quickselect | 1 | 6.2% | 1.2% |
| Stack | 1 | 6.2% | 1.6% |
| Topological Sort | 1 | 6.2% | 1.2% |
| Union-Find | 1 | 6.2% | 1.0% |
Practice a Bny Mellon interview
Take a realistic AI-led mock interview with questions Bny Mellon actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required