Company interviews / Grammarly
Grammarly interview practice
29 coding questions are known to come up in Grammarly interviews (6 easy, 19 medium, 4 hard), 7 of them in the last six months. The most common topics are String, Array, Dynamic Programming, Hash Table.
29Known questions
7Asked in last 6 months
19Medium
4Hard
Coding questions Grammarly asks
From public company-tagged interview question lists. Most recent and most frequent first.
Easy 6Medium 19Hard 4
- String15
- Array14
- Dynamic Programming9
- Hash Table9
- Math6
- Stack4
- Binary Search4
- Sorting4
- Depth-First Search3
- Backtracking3
- Memoization3
- Trie3
| Question | Difficulty | Asked recently |
|---|---|---|
| Remove All Adjacent Duplicates In String | Easy | Yes |
| Two Best Non-Overlapping Events | Medium | Yes |
| Non-overlapping Intervals | Medium | Yes |
| Search Insert Position | Easy | Yes |
| Recover a Tree From Preorder Traversal | Hard | Yes |
| Word Search | Medium | Yes |
| Minimum Substring Partition of Equal Character Frequency | Medium | Yes |
| Merge Intervals | Medium | — |
| Vowel Spellchecker | Medium | — |
| Insert Delete GetRandom O(1) | Medium | — |
| Search in Rotated Sorted Array | Medium | — |
| Remove All Adjacent Duplicates in String II | Medium | — |
| Climbing Stairs | Easy | — |
| Repeated DNA Sequences | Medium | — |
| Sqrt(x) | Easy | — |
| Generate Parentheses | Medium | — |
| Perfect Number | Easy | — |
| Sum of Left Leaves | Easy | — |
| Evaluate Reverse Polish Notation | Medium | — |
| Check If a String Contains All Binary Codes of Size K | Medium | — |
| Implement Trie (Prefix Tree) | Medium | — |
| Maximum Palindromes After Operations | Medium | — |
| Decode the Slanted Ciphertext | Medium | — |
| Special Binary String | Hard | — |
| Number of Islands | Medium | — |
Practice a Grammarly interview
Take the same AI interview a Grammarly candidate would face: you talk it through while you code, and get a scorecard with what earned each score. Three single-question interviews a day are free.