QUESTIONS BY COMPANY

BNY Mellon LeetCode Questions 2026

Browse LeetCode problems frequently asked by BNY Mellon. Filter by difficulty and timeframe to focus your interview prep.

Last updated: 20 Feb 2026

ProblemDifficultyFrequencyTopics
Roman to IntegerEASY
62.5%
Hash TableMathString
Maximum Area of a Piece of Cake After Horizontal and Vertical CutsMEDIUM
100%
ArrayGreedySorting
Group AnagramsMEDIUM
62.5%
ArrayHash TableStringSorting
Count Visited Nodes in a Directed GraphHARD
100%
Dynamic ProgrammingDepth-First SearchGraph TheoryTopological SortMemoization
Sum of DistancesMEDIUM
100%
ArrayHash TablePrefix Sum
Minimize Length of Array Using OperationsMEDIUM
100%
ArrayMathGreedyNumber Theory
Find the Count of Monotonic Pairs IIHARD
62.5%
ArrayMathDynamic ProgrammingCombinatoricsPrefix Sum
3SumMEDIUM
62.5%
ArrayTwo PointersSorting
Car FleetMEDIUM
75%
ArrayStackSortingMonotonic Stack
Count Number of Maximum Bitwise-OR SubsetsMEDIUM
62.5%
ArrayBacktrackingBit ManipulationEnumeration
Minimize Malware SpreadHARD
75%
ArrayHash TableDepth-First SearchBreadth-First SearchUnion-FindGraph Theory
Bitwise ORs of SubarraysMEDIUM
75%
ArrayDynamic ProgrammingBit Manipulation
Merge Sorted ArrayEASY
62.5%
ArrayTwo PointersSorting
Best Time to Buy and Sell StockEASY
62.5%
ArrayDynamic Programming
Kth Largest Element in an ArrayMEDIUM
75%
ArrayDivide and ConquerSortingHeap (Priority Queue)Quickselect

Need Help Solving These Problems?

CodingInterviewAI can instantly identify algorithms and generate optimal solutions for any LeetCode problem. Get step-by-step explanations and ace your next technical interview.

CodingInterviewAI logo

© 2026 CodingInterviewAI. All rights reserved

CodingInterviewAI

HomeBlogGive Feedback