BNY Mellon LeetCode Questions
17 questions all-time · 2 easy · 11 medium · 4 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts Array, Greedy, Sorting | Medium | 100 | 0.4% |
| 2 | Count Visited Nodes in a Directed Graph Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort, Memoization | Hard | 100 | 0.3% |
| 3 | Sum of Distances Array, Hash Table, Prefix Sum | Medium | 100 | 0.5% |
| 4 | Minimize Length of Array Using Operations Array, Math, Greedy, Number Theory | Medium | 100 | 0.4% |
| 5 | Minimize Malware Spread Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory | Hard | 78 | 0.4% |
| 6 | Car Fleet Array, Stack, Sorting, Monotonic Stack | Medium | 71 | 0.6% |
| 7 | Bitwise ORs of Subarrays Array, Dynamic Programming, Bit Manipulation | Medium | 71 | 0.6% |
| 8 | Kth Largest Element in an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 71 | 0.7% |
| 9 | Group Anagrams Array, Hash Table, String, Sorting | Medium | 61 | 0.7% |
| 10 | Find the Count of Monotonic Pairs II Array, Math, Dynamic Programming, Combinatorics, Prefix Sum | Hard | 61 | 0.2% |
| 11 | 3Sum Array, Two Pointers, Sorting | Medium | 61 | 0.4% |
| 12 | Count Number of Maximum Bitwise-OR Subsets Array, Backtracking, Bit Manipulation, Enumeration | Medium | 61 | 0.9% |
| 13 | Merge Sorted Array Array, Two Pointers, Sorting | Easy | 61 | 0.6% |
| 14 | Best Time to Buy and Sell Stock Array, Dynamic Programming | Easy | 61 | 0.6% |
| 15 | Palindromic Substrings Two Pointers, String, Dynamic Programming | Medium | 61 | 0.7% |
| 16 | Longest Substring Without Repeating Characters Hash Table, String, Sliding Window | Medium | 61 | 0.4% |
| 17 | Count Good Subarrays Array, Stack, Bit Manipulation, Monotonic Stack | Hard | 61 | 0.3% |
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.