Company interviews / BNY Mellon
BNY Mellon interview practice
17 coding questions are known to come up in BNY Mellon interviews (1 easy, 10 medium, 6 hard), 3 of them in the last six months. The most common topics are Array, Dynamic Programming, Hash Table, Sorting.
17Known questions
3Asked in last 6 months
10Medium
6Hard
Coding questions BNY Mellon asks
From public company-tagged interview question lists. Most recent and most frequent first.
Easy 1Medium 10Hard 6
- Array13
- Dynamic Programming7
- Hash Table6
- Sorting4
- String3
- Math2
- Greedy2
- Graph2
- Prefix Sum2
- Bit Manipulation2
- Matrix1
- Linked List1
| Question | Difficulty | Asked recently |
|---|---|---|
| Cherry Pickup | Hard | Yes |
| LFU Cache | Hard | Yes |
| Find the Maximum Length of a Good Subsequence II | Hard | Yes |
| Minimize Length of Array Using Operations | Medium | — |
| Count Visited Nodes in a Directed Graph | Hard | — |
| Sum of Distances | Medium | — |
| Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | — |
| Minimize Malware Spread | Hard | — |
| Bitwise ORs of Subarrays | Medium | — |
| Car Fleet | Medium | — |
| Group Anagrams | Medium | — |
| Find the Count of Monotonic Pairs II | Hard | — |
| Count Number of Maximum Bitwise-OR Subsets | Medium | — |
| Palindromic Substrings | Medium | — |
| Kth Largest Element in an Array | Medium | — |
| Best Time to Buy and Sell Stock | Easy | — |
| Longest Substring Without Repeating Characters | Medium | — |
Practice a BNY Mellon interview
Take the same AI interview a BNY Mellon candidate would face: you talk it through while you code, and get a scorecard with what earned each score. Three single-question interviews a day are free.