Practice problems across 75+ categories
Practice problems frequently asked at Design • 128 problems | 15 Easy | 81 Medium | 30 Hard
| # | Problem | Difficulty | Topics |
|---|---|---|---|
| 76 | Implement Trie II (Prefix Tree) | Unknown | Hash TableStringDesign |
| 77 | Implement Trie (Prefix Tree) | Medium | Hash TableStringDesign |
| 78 | Insert Delete GetRandom O(1) | Medium | ArrayHash TableMath |
| 79 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | ArrayHash TableMath |
| 80 | Iterator for Combination | Medium | StringBacktrackingDesign |
| 81 | Kth Ancestor of a Tree Node | Hard | Binary SearchDynamic ProgrammingBit Manipulation |
| 82 | Kth Largest Element in a Stream | Easy | TreeDesignBinary Search Tree |
| 83 | LFU Cache | Hard | Hash TableLinked ListDesign |
| 84 | Logger Rate Limiter | Easy | Hash TableDesignData Stream |
| 85 | Longest Uploaded Prefix | Medium | Hash TableBinary SearchUnion Find |
| 86 | LRU Cache | Medium | Hash TableLinked ListDesign |
| 87 | Map Sum Pairs | Medium | Hash TableStringDesign |
| 88 | Max Stack | Hard | Linked ListStackDesign |
| 89 | Maximum Frequency Stack | Hard | Hash TableStackDesign |
| 90 | Min Stack | Medium | StackDesign |
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.
