BNY Mellon DSA Interview Questions

What BNY Mellon asks in the DSA round

BNY Mellon mixes easy-to-medium DSA with strong Java, SQL and OOP design questions, plus a domain round on custody and settlement systems.

Across the 21 questions on this page, the weight sits on these patterns:

• Dynamic Programming — 7 questions · read the dynamic programming guide
• Greedy — 3 questions · read the greedy guide
• Monotonic Stack — 2 questions · read the monotonic stack guide
• Two Pointers — 2 questions · read the two pointers guide
• Backtracking — 1 question · read the backtracking guide
• Breadth-First Search — 1 question · read the breadth first search (bfs) guide
• Design — 1 question · read the design data structure guide
• Divide and Conquer — 1 question

How to prepare for the BNY Mellon interview

1. 1. Start at the top of the list above. The patterns are ordered by how often BNY Mellon uses them, so the first two or three buy you the most coverage per hour.
2. 2. Solve by pattern, not at random. Doing eight dynamic programming problems in a row is what makes the ninth recognisable in an interview — jumping between topics does not.
3. 3. Tick problems off as you go so the gaps are visible. The per-pattern counts tell you which BNY Mellon topic you have actually covered.
4. 4. Write the approach before the code. BNY Mellon interviews are judged on the reasoning as much as the working solution.
5. 5. Pair this with the pattern guides when a topic is new, and the system design sheet if the role is senior enough to have that round.
6. 6. If this is a campus or off-campus drive rather than a lateral move, the placement preparation guide covers the stages around the DSA round — aptitude, core subjects and the HR interview — in the order they actually happen.

BNY Mellon interview questions — FAQ

Related