Practice problems across 75+ categories
Practice problems frequently asked at Stack • 172 problems | 23 Easy | 97 Medium | 51 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 91 | Maximum Nesting Depth of the Parentheses | Easy | StringStack |
| 92 | Maximum Nesting Depth of Two Valid Parentheses Strings | Medium | StringStack |
| 93 | Maximum Number of Books You Can Take | Hard | ArrayDynamic ProgrammingStack |
| 94 | Maximum of Minimum Values in All Subarrays | Medium | ArrayStackMonotonic Stack |
| 95 | Maximum Score From Removing Substrings | Medium | StringStackGreedy |
| 96 | Maximum Score of a Good Subarray | Hard | ArrayTwo PointersBinary Search |
| 97 | Maximum Subarray Min-Product | Medium | ArrayStackMonotonic Stack |
| 98 | Maximum Sum Queries | Hard | ArrayBinary SearchStack |
| 99 | Maximum Twin Sum of a Linked List | Medium | Linked ListTwo PointersStack |
| 100 | Maximum Width Ramp | Medium | ArrayTwo PointersStack |
| 101 | Min Stack | Medium | StackDesign |
| 102 | Mini Parser | Medium | StringStackDepth-First Search |
| 103 | Minimum Add to Make Parentheses Valid | Medium | StringStackGreedy |
| 104 | Minimum Additions to Make Valid String | Medium | StringDynamic ProgrammingStack |
| 105 | Minimum Cost to Change the Final Value of Expression | Hard | MathStringDynamic Programming |
Powerful online tools to boost your productivity
Coding Ground For Developers
Code, Edit, Run and ShareIgnite your coding potential on Coding Ground - an immersive online platform for hands-on learning, collaboration, and skill development.
