Grammarly interview questions¶
The most frequent LeetCode problems tagged to Grammarly. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 9 distinct problems tagged to Grammarly in the last 6 months (5 in the last 30 days, 6 in the last 3 months, 30 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Difficulty mix (last 6 months): Medium 67%, Easy 22%, Hard 11%
Most tagged topics (share of problems): Array 67%, String 56%, Dynamic Programming 33%, Hash Table 33%, Sorting 22%, Binary Search 22%, Depth-First Search 22%, Greedy 11%, Heap (Priority Queue) 11%, Tree 11%
Watch out: Grammarly has thin LeetCode data. Weight the reported questions and the format notes above more than this list.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Non-overlapping Intervals | Medium | 30 days | Array, Dynamic Programming, Greedy, Sorting |
| 2 | Two Best Non-Overlapping Events | Medium | 30 days | Array, Binary Search, Dynamic Programming, Sorting |
| 3 | Recover a Tree From Preorder Traversal | Hard | 30 days | String, Tree, Depth-First Search, Binary Tree |
| 4 | Search Insert Position | Easy | 30 days | Array, Binary Search |
| 5 | Minimum Substring Partition of Equal Character Frequency | Medium | 30 days | Hash Table, String, Dynamic Programming, Counting |
| 6 | Word Search | Medium | 3 months | Array, String, Backtracking, Depth-First Search |
| 7 | Remove All Adjacent Duplicates In String | Easy | 6 months | String, Stack |
| 8 | Insert Delete GetRandom O(1) | Medium | 6 months | Array, Hash Table, Math, Design |
| 9 | Vowel Spellchecker | Medium | 6 months | Array, Hash Table, String |
Signature problems¶
Problems where Grammarly accounts for a large share of all recent tags across companies. These are the most Grammarly-specific questions in the data.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Non-overlapping Intervals | Medium | 30 days | Array, Dynamic Programming, Greedy, Sorting |
| 2 | Two Best Non-Overlapping Events | Medium | 30 days | Array, Binary Search, Dynamic Programming, Sorting |
| 3 | Recover a Tree From Preorder Traversal | Hard | 30 days | String, Tree, Depth-First Search, Binary Tree |
| 4 | Minimum Substring Partition of Equal Character Frequency | Medium | 30 days | Hash Table, String, Dynamic Programming, Counting |
| 5 | Vowel Spellchecker | Medium | 6 months | Array, Hash Table, String |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies