Grammarly
27 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| 56. Merge Intervals | Medium | 100% | TopicsArraySortingQuicksort |
| 1047. Remove All Adjacent Duplicates In String | Easy | 97.1% | TopicsStringStack |
| 1209. Remove All Adjacent Duplicates in String II | Medium | 95.5% | TopicsStringStack |
| Insert Delete GetRandom O(1) | Medium | 95.5% | TopicsArrayHash TableMathDesignRandomized |
| 966. Vowel Spellchecker | Medium | 92% | TopicsArrayHash TableString |
| 33. Search in Rotated Sorted Array | Medium | 90% | TopicsArrayBinary Search |
| 435. Non-overlapping Intervals | Medium | 90% | TopicsArrayDynamic ProgrammingGreedySorting |
| 2054. Two Best Non-Overlapping Events | Medium | 90% | TopicsArrayBinary SearchDynamic ProgrammingSortingHeap (Priority Queue) |
| Repeated DNA Sequences | Medium | 87.8% | TopicsHash TableStringBit ManipulationSliding WindowRolling HashHash FunctionZ AlgorithmBoyer–Moore String-Search Algorithm |
| 70. Climbing Stairs | Easy | 87.8% | TopicsMathDynamic ProgrammingMemoization |
| 35. Search Insert Position | Easy | 85.4% | TopicsArrayBinary Search |
| 22. Generate Parentheses | Medium | 82.7% | TopicsStringDynamic ProgrammingBacktrackingBracket Sequences |
| Sqrt(x) | Easy | 82.7% | TopicsMathBinary SearchNewton's Method |
| 1028. Recover a Tree From Preorder Traversal | Hard | 82.7% | TopicsStringTreeDepth-First SearchBinary Tree |
| Perfect Number | Easy | 79.6% | TopicsMath |
| Logger Rate Limiter | Easy | 76.1% | TopicsHash TableDesignData Stream |
| 404. Sum of Left Leaves | Easy | 76.1% | TopicsTreeDepth-First SearchBreadth-First SearchBinary Tree |
| 3144. Minimum Substring Partition of Equal Character Frequency | Medium | 71.9% | TopicsHash TableStringDynamic ProgrammingCounting |
| 139. Word Break | Medium | 66.8% | TopicsArrayHash TableStringDynamic ProgrammingTrieMemoizationBrute-Force Search |
| 79. Word Search | Medium | 66.8% | TopicsArrayStringBacktrackingDepth-First SearchMatrix |
| Evaluate Reverse Polish Notation | Medium | 66.8% | TopicsArrayMathStack |
| Implement Trie (Prefix Tree) | Medium | 60.2% | TopicsHash TableStringDesignTrie |
| 1461. Check If a String Contains All Binary Codes of Size K | Medium | 60.2% | TopicsHash TableStringBit ManipulationRolling HashHash FunctionDirected Acyclic Graph |
| 200. Number of Islands | Medium | 51% | TopicsArrayDepth-First SearchBreadth-First SearchUnion-FindMatrix |
| 2075. Decode the Slanted Ciphertext | Medium | 51% | TopicsStringSimulation |
