Grammarly Coding Interview Questions
We track 27 coding questions asked at Grammarly, tagged with the algorithms and concepts they test. The most common: Array, String, Dynamic Programming, Hash Table, Math.
Browse all 27 Grammarly questions →Concept mix
Each question's weight is split evenly across its concepts, so the shares sum to 100%.
- String14.6%
- Array13.0%
- Math10.4%
- Dynamic Programming7.5%
- Hash Table6.3%
- Stack5.9%
- Sorting5.6%
- Binary Search4.6%
- Backtracking2.6%
- Depth-First Search2.5%
- Other (21)27.1%
How many questions involve each concept
Share of all 27 tracked Grammarly questions that touch each concept. Questions usually involve several, so these overlap.
- Array48.1%
- String48.1%
- Dynamic Programming29.6%
- Hash Table29.6%
- Math22.2%
- Sorting18.5%
- Stack14.8%
- Backtracking11.1%
- Binary Search11.1%
- Depth-First Search11.1%
- Memoization11.1%
- Trie11.1%
Where Grammarly differs from the average company
Concept weight at Grammarly relative to the average across all companies we track. Green means Grammarly leans on it harder than most.
- Rolling Hash14.0×
- Memoization8.3×
- Hash Function7.0×
- Trie4.4×
- Breadth-First Search0.77×
- Array0.67×
- Matrix0.65×
- Greedy0.53×
Grammarly specialties
Concepts that show up at Grammarly but are rarely asked elsewhere. They are easy to get blindsided by.
Difficulty mix
Level split of the 27 tracked Grammarly questions.
- Junior22% (6)
- Mid/Senior67% (18)
- Staff11% (3)
Every concept in Grammarly interviews
| Concept | Questions | % of questions | Share of mix |
|---|---|---|---|
| Array | 13 | 48.1% | 13.0% |
| String | 13 | 48.1% | 14.6% |
| Dynamic Programming | 8 | 29.6% | 7.5% |
| Hash Table | 8 | 29.6% | 6.3% |
| Math | 6 | 22.2% | 10.4% |
| Sorting | 5 | 18.5% | 5.6% |
| Stack | 4 | 14.8% | 5.9% |
| Backtracking | 3 | 11.1% | 2.6% |
| Binary Search | 3 | 11.1% | 4.6% |
| Depth-First Search | 3 | 11.1% | 2.5% |
| Memoization | 3 | 11.1% | 2.5% |
| Trie | 3 | 11.1% | 2.2% |
| Bit Manipulation | 2 | 7.4% | 1.4% |
| Breadth-First Search | 2 | 7.4% | 1.7% |
| Design | 2 | 7.4% | 1.7% |
| Greedy | 2 | 7.4% | 1.6% |
| Hash Function | 2 | 7.4% | 1.4% |
| Matrix | 2 | 7.4% | 1.5% |
| Rolling Hash | 2 | 7.4% | 1.4% |
| Binary Tree | 1 | 3.7% | 1.0% |
| Combinatorics | 1 | 3.7% | 1.3% |
| Counting | 1 | 3.7% | 0.6% |
| Divide and Conquer | 1 | 3.7% | 1.3% |
| Heap (Priority Queue) | 1 | 3.7% | 0.8% |
| Monotonic Stack | 1 | 3.7% | 0.8% |
| Randomized | 1 | 3.7% | 0.8% |
| Simulation | 1 | 3.7% | 1.9% |
| Sliding Window | 1 | 3.7% | 0.6% |
| Tree | 1 | 3.7% | 1.0% |
| Two Pointers | 1 | 3.7% | 0.8% |
| Union-Find | 1 | 3.7% | 0.8% |
Practice a Grammarly interview
Take a realistic AI-led mock interview with questions Grammarly actually asks, with live voice and real feedback.
Start a mock interviewYour first interview is free · no credit card required