DSA Doctor
Verified Company Vault
Grammarly DSA Interview Questions
28 curated coding interview questions directly asked in Grammarly technical rounds, sorted by frequency with recency and difficulty diagnostics.
28
Total Questions
7 (25%)
Easy Problems
18 (64%)
Medium Problems
3 (11%)
Hard Problems
🔥 Most Tested Topics:
Strings (9)Arrays (7)Core DSA (7)Binary Search (4)Dynamic Programming (4)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 35 | Search Insert Position | Easy | Binary Search | Binary Search | 51.3% | 100.0% | 3m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 87.5% | 6m |
| 966 | Vowel Spellchecker | Medium | Core DSA | Implementation / Reasoning | 61.4% | 87.5% | 6m |
| 1047 | Remove All Adjacent Duplicates In String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 73.2% | 87.5% | 6m |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 87.5% | 6m |
| 359 | Logger Rate Limiter | Easy | Design | Data Structure Design | 76.8% | 87.5% | 6m |
| 435 | Non-overlapping Intervals | Medium | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 57.1% | 87.5% | 6m |
| 2054 | Two Best Non-Overlapping Events | Medium | Greedy | Greedy | 64.0% | 87.5% | 6m |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 87.5% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 87.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 87.5% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 75.0% | all |
| 187 | Repeated DNA Sequences | Medium | Core DSA | Implementation / Reasoning | 53.3% | 75.0% | all |
| 507 | Perfect Number | Easy | Core DSA | Implementation / Reasoning | 48.9% | 75.0% | all |
| 404 | Sum of Left Leaves | Easy | Arrays | Sorting / Prefix / Scan | 62.7% | 75.0% | all |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 75.0% | all |
| 140 | Word Break II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 55.6% | 62.5% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 62.5% | all |
| 150 | Evaluate Reverse Polish Notation | Medium | Core DSA | Implementation / Reasoning | 57.8% | 62.5% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 50.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 50.0% | all |
| 761 | Special Binary String | Hard | Strings | Hashing / Sliding Window | 79.3% | 50.0% | all |
| 2075 | Decode the Slanted Ciphertext | Medium | Dynamic Programming | State Transition | 67.6% | 50.0% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 50.0% | all |
| 3035 | Maximum Palindromes After Operations | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 46.5% | 50.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | all |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 50.0% | all |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium | Strings | Hashing / Sliding Window | 61.6% | 50.0% | all |