Bny-Mellon Questions
Here are the LeetCode questions for Bny-Mellon.
Total: 15
Easy: 3
Medium: 9
Hard: 3
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 10 | |
| 2 | Sorting | 6 | |
| 3 | Hash Table | 5 | |
| 4 | String | 4 | |
| 5 | Two Pointers | 3 | |
| 6 | Binary Search | 2 | |
| 7 | Divide and Conquer | 1 | |
| 8 | Depth-First Search | 1 | |
| 9 | Greedy | 1 | |
| 10 | Quickselect | 1 | |
| 11 | Bit Manipulation | 1 | |
| 12 | Matrix | 1 | |
| 13 | Binary Tree | 1 | |
| 14 | Tree | 1 | |
| 15 | Math | 1 | |
| 16 | Simulation | 1 | |
| 17 | Dynamic Programming | 1 | |
| 18 | Heap (Priority Queue) | 1 | |
| 19 | Prefix Sum | 1 | |
| 20 | Counting | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Find the Count of Monotonic Pairs II | Visit | Hard | |
| 2 | Minimize Length of Array Using Operations | Visit | Medium | |
| 3 | Count Visited Nodes in a Directed Graph | Visit | Hard | |
| 4 | Sum of Distances | Visit | Medium | |
| 5 | Count Number of Maximum Bitwise-OR Subsets | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 15 questions for free!
Log In