Grammarly
NLP-adjacent loops pairing algorithms with design questions about latency-sensitive suggestions across every editor they plug into.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: two coding rounds
- 4Design round on latency-sensitive NLP serving
- 5Behavioral round
Asked on LeetCode
All 30 by time range →- Merge IntervalsmediumArraySortingQuicksortfrequency 100.0
- Remove All Adjacent Duplicates In StringeasyStringStackfrequency 91.8
- Insert Delete GetRandom O(1)mediumArrayHash TableMathDesign+1frequency 89.1
- Search in Rotated Sorted ArraymediumArrayBinary Searchfrequency 89.1
- Vowel SpellcheckermediumArrayHash TableStringfrequency 89.1
- Remove All Adjacent Duplicates in String IImediumStringStackfrequency 87.7
- Climbing StairseasyMathDynamic ProgrammingMemoizationfrequency 84.4
- Non-overlapping IntervalsmediumArrayDynamic ProgrammingGreedySortingfrequency 80.5