Practice problems across 75+ categories
Practice problems frequently asked at Stack • 172 problems | 23 Easy | 97 Medium | 51 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 31 | Construct Binary Search Tree from Preorder Traversal | Medium | ArrayStackTree |
| 32 | Construct Binary Tree from String | Medium | StringStackTree |
| 33 | Construct Smallest Number From DI String | Medium | StringBacktrackingStack |
| 34 | Convert Binary Search Tree to Sorted Doubly Linked List | Medium | Linked ListStackTree |
| 35 | Count Collisions on a Road | Medium | StringStackSimulation |
| 36 | Count Non-Decreasing Subarrays After K Operations | Hard | ArrayStackSegment Tree |
| 37 | Count Submatrices With All Ones | Medium | ArrayDynamic ProgrammingStack |
| 38 | Crawler Log Folder | Easy | ArrayStringStack |
| 39 | Create Maximum Number | Hard | ArrayTwo PointersStack |
| 40 | Daily Temperatures | Medium | ArrayStackMonotonic Stack |
| 41 | Decode String | Medium | StringStackRecursion |
| 42 | Decoded String at Index | Medium | StringStack |
| 43 | Design a Stack With Increment Operation | Medium | ArrayStackDesign |
| 44 | Design a Text Editor | Hard | Linked ListStringStack |
| 45 | Design an Expression Tree With Evaluate Function | Medium | ArrayMathStack |
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.
