Skip to content

BNY Mellon interview questions

The most frequent LeetCode problems tagged to BNY Mellon. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.

Based on 4 distinct problems tagged to BNY Mellon in the last 6 months (4 in the last 30 days, 4 in the last 3 months, 21 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.

Difficulty mix (last 6 months): Hard 100%

Most tagged topics (share of problems): Array 75%, Hash Table 75%, Dynamic Programming 50%, Matrix 25%, Greedy 25%, Queue 25%, Linked List 25%, Design 25%, Doubly-Linked List 25%

Watch out: BNY Mellon has thin LeetCode data. Weight the reported questions and the format notes above more than this list.

Most frequent problems

Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.

# Problem Difficulty Last seen Topics
1 Cherry Pickup Hard 30 days Array, Dynamic Programming, Matrix
2 Lexicographically Maximum MEX Array Hard 30 days Array, Hash Table, Greedy, Queue
3 LFU Cache Hard 30 days Hash Table, Linked List, Design, Doubly-Linked List
4 Find the Maximum Length of a Good Subsequence II Hard 30 days Array, Hash Table, Dynamic Programming

Signature problems

Problems where BNY Mellon accounts for a large share of all recent tags across companies. These are the most BNY Mellon-specific questions in the data.

# Problem Difficulty Last seen Topics
1 Cherry Pickup Hard 30 days Array, Dynamic Programming, Matrix
2 Lexicographically Maximum MEX Array Hard 30 days Array, Hash Table, Greedy, Queue
3 Find the Maximum Length of a Good Subsequence II Hard 30 days Array, Hash Table, Dynamic Programming

Sources

Next: More companies