15 curated coding interview questions directly asked in Bny Mellon technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1465 | Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | Arrays | Sorting / Prefix / Scan | 41.4% | 100.0% | all |
| 2876 | Count Visited Nodes in a Directed Graph | Hard | Trees; Graphs | DFS / BFS; BFS / DFS / Topological Sort | 30.8% | 100.0% | all |
| 2615 | Sum of Distances | Medium | Arrays | Sorting / Prefix / Scan | 50.4% | 100.0% | all |
| 3012 | Minimize Length of Array Using Operations | Medium | Arrays | Sorting / Prefix / Scan | 35.8% | 100.0% | all |
| 853 | Car Fleet | Medium | Core DSA | Implementation / Reasoning | 55.1% | 75.0% | all |
| 924 | Minimize Malware Spread | Hard | Core DSA | Implementation / Reasoning | 43.2% | 75.0% | all |
| 898 | Bitwise ORs of Subarrays | Medium | Arrays | Sorting / Prefix / Scan | 56.9% | 75.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 75.0% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | all |
| 3251 | Find the Count of Monotonic Pairs II | Hard | Core DSA | Implementation / Reasoning | 24.7% | 62.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 2044 | Count Number of Maximum Bitwise-OR Subsets | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 89.5% | 62.5% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 62.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 62.5% | all |