BNY Mellon
18 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | Medium | 100% | TopicsArrayGreedySorting |
| 2876. Count Visited Nodes in a Directed Graph | Hard | 100% | TopicsDynamic ProgrammingDepth-First SearchGraph TheoryTopological SortMemoizationKosaraju's AlgorithmTarjan's SCC Algorithm |
| 2615. Sum of Distances | Medium | 100% | TopicsArrayHash TablePrefix Sum |
| 3012. Minimize Length of Array Using Operations | Medium | 100% | TopicsArrayMathGreedyNumber Theory |
| 924. Minimize Malware Spread | Hard | 87.9% | TopicsArrayHash TableDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Cherry Pickup | Hard | 87.9% | TopicsArrayDynamic ProgrammingMatrix |
| 853. Car Fleet | Medium | 74.9% | TopicsArrayStackSortingMonotonic Stack |
| 898. Bitwise ORs of Subarrays | Medium | 74.9% | TopicsArrayDynamic ProgrammingBit Manipulation |
| LFU Cache | Hard | 74.9% | TopicsHash TableLinked ListDesignDoubly-Linked List |
| 3948. Lexicographically Maximum MEX Array | Hard | 74.9% | TopicsArrayHash TableGreedyQueue |
| 56. Merge Intervals | Medium | 74.9% | TopicsArraySortingQuicksort |
| 2044. Count Number of Maximum Bitwise-OR Subsets | Medium | 64.5% | TopicsArrayBacktrackingBit ManipulationEnumeration |
| 121. Best Time to Buy and Sell Stock | Easy | 64.5% | TopicsArrayDynamic Programming |
| 215. Kth Largest Element in an Array | Medium | 64.5% | TopicsArrayDivide and ConquerSortingHeap (Priority Queue)Quickselect |
| 647. Palindromic Substrings | Medium | 64.5% | TopicsTwo PointersStringDynamic Programming |
| 3. Longest Substring Without Repeating Characters | Medium | 64.5% | TopicsHash TableStringSliding Window |
| 3878. Count Good Subarrays | Hard | 64.5% | TopicsArrayStackBit ManipulationMonotonic Stack |
| 3177. Find the Maximum Length of a Good Subsequence II | Hard | 64.5% | TopicsArrayHash TableDynamic Programming |
