BNY Mellon LeetCode interview questions

Explore BNY Mellon questions from the all problems list. Search by title or topic, filter by difficulty, and track solved problems on this device.

Time range

Problems in range

Solved

0 / 18

Range progress

Problem list

Select a problem to open it on LeetCode.

Problem	Difficulty	Frequency	Acceptance
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts Array Greedy Sorting MEDIUM	Medium	100.0%	0.4%
Count Visited Nodes in a Directed Graph Dynamic Programming Depth-First Search Graph Theory +4 HARD	Hard	100.0%	0.3%
Sum of Distances Array Hash Table Prefix Sum MEDIUM	Medium	100.0%	0.5%
Minimize Length of Array Using Operations Array Math Greedy +1 MEDIUM	Medium	100.0%	0.4%
Minimize Malware Spread Array Hash Table Depth-First Search +3 HARD	Hard	87.9%	0.4%
Cherry Pickup Array Dynamic Programming Matrix HARD	Hard	87.9%	0.4%
Car Fleet Array Stack Sorting +1 MEDIUM	Medium	74.9%	0.6%
Bitwise ORs of Subarrays Array Dynamic Programming Bit Manipulation MEDIUM	Medium	74.9%	0.6%
LFU Cache Hash Table Linked List Design +1 HARD	Hard	74.9%	0.5%
Lexicographically Maximum MEX Array Array Hash Table Greedy +1 HARD	Hard	74.9%	0.5%
Merge Intervals Array Sorting Quicksort MEDIUM	Medium	74.9%	0.5%
Count Number of Maximum Bitwise-OR Subsets Array Backtracking Bit Manipulation +1 MEDIUM	Medium	64.5%	0.9%
Best Time to Buy and Sell Stock Array Dynamic Programming EASY	Easy	64.5%	0.6%
Kth Largest Element in an Array Array Divide and Conquer Sorting +2 MEDIUM	Medium	64.5%	0.7%
Palindromic Substrings Two Pointers String Dynamic Programming MEDIUM	Medium	64.5%	0.7%
Longest Substring Without Repeating Characters Hash Table String Sliding Window MEDIUM	Medium	64.5%	0.4%
Count Good Subarrays Array Stack Bit Manipulation +1 HARD	Hard	64.5%	0.3%
Find the Maximum Length of a Good Subsequence II Array Hash Table Dynamic Programming HARD	Hard	64.5%	0.3%

Showing 1–18 of 18 matching problems · All Problems

BNY Mellon LeetCode Interview Questions | Grind Practice