Deutsche Bank
19 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 2030. Smallest K-Length Subsequence With Occurrences of a Letter | Hard | 100% | TopicsStringStackGreedyMonotonic Stack |
| 2968. Apply Operations to Maximize Frequency Score | Hard | 100% | TopicsArrayBinary SearchSliding WindowSortingPrefix Sum |
| Maximum Coins Heroes Can Collect | Medium | 97% | TopicsArrayTwo PointersBinary SearchSortingPrefix Sum |
| 2039. The Time When the Network Becomes Idle | Medium | 97% | TopicsArrayBreadth-First SearchGraph Theory |
| 2141. Maximum Running Time of N Computers | Hard | 97% | TopicsArrayBinary SearchGreedySorting |
| Pour Water Between Buckets to Make Water Levels Equal | Medium | 97% | TopicsArrayBinary Search |
| 3068. Find the Maximum Sum of Node Values | Hard | 97% | TopicsArrayDynamic ProgrammingGreedyBit ManipulationTreeSorting |
| 1827. Minimum Operations to Make the Array Increasing | Easy | 97% | TopicsArrayGreedy |
| 2869. Minimum Operations to Collect Elements | Easy | 97% | TopicsArrayHash TableBit Manipulation |
| Different Ways to Add Parentheses | Medium | 79.4% | TopicsMathStringDynamic ProgrammingRecursionMemoizationBracket Sequences |
| Reverse Words in a String | Medium | 72.1% | TopicsTwo PointersString |
| 14. Longest Common Prefix | Easy | 61.8% | TopicsArrayStringTrie |
| 121. Best Time to Buy and Sell Stock | Easy | 61.8% | TopicsArrayDynamic Programming |
| 977. Squares of a Sorted Array | Easy | 61.8% | TopicsArrayTwo PointersSorting |
| N-Queens II | Hard | 61.8% | TopicsBacktrackingAlgorithm X |
| 118. Pascal's Triangle | Easy | 61.8% | TopicsArrayDynamic Programming |
| 805. Split Array With Same Average | Hard | 61.8% | TopicsArrayHash TableMathDynamic ProgrammingBit ManipulationMeet in the MiddleBitmask |
| 322. Coin Change | Medium | 61.8% | TopicsArrayDynamic ProgrammingBreadth-First SearchKnapsack ProblemComplete Knapsack |
| 54. Spiral Matrix | Medium | 61.8% | TopicsArrayMatrixSimulation |
