← Back to Directory

Grammarly

Mid-sized

Most of these Grammarly write-ups come from Software Engineers (30). The most reported rounds are the technical phone screen (14), the system design round (11), the behavioral / leadership round (2) and the executive / final round (1).

30 interview notes · updated Jun 2026

Grammarly·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Did the system design round for a software engineer role at Grammarly. One thing worth flagging: they've moved away from Google Docs and now use an Excalidraw-based tool for the design round, which threw me a little since most prep resources don't mention that.
  • Design a read-once chat system, where messages can only be read one time before they disappear.

“Seen this one floating around on forums so I had a rough idea going in.”

View Post

Grammarly·Software Engineer·Onsite - System Design / Architecture

Jun 2026
Grammarly system design round, one big question about a disappearing-message broadcast system. The problem sounded deceptively simple and I underestimated how deep the interviewer wanted to go on the storage and consistency side.
  • Design a chat system where a sender can broadcast the same message to multiple recipients privately (each recipient sees a separate 1:1 thread), messages can only be read once and are then permanently deleted, and the sender gets per-recipient delivery and read status.

“I went straight for a shared message row with per-recipient state records, which felt right, but the interviewer kept poking at what happens if a delete fails partway through.”

View Post

Grammarly·Software Engineer·Onsite - Behavioral / Leadership

Jun 2026
Grammarly has this resume deep-dive round that I wasn't expecting. They go through everything you listed, line by line, and then throw behavioral questions at you based on those specific experiences. Clean up your resume before you go in.
  • Looking back at a project you described on your resume from a few years ago, how would you approach it differently today?

“This one stung a bit because I had a project on my resume I hadn't thought about in ages.”

View Post

Grammarly·Software Engineer·Technical Phone Screen

Jun 2026
Phone screen at Grammarly for a software engineer role, three binary tree problems back to back. Nothing crazy in terms of topics but the third one had some teeth to it.
  • Find the maximum depth of a binary tree.
  • Given a binary tree, return its level-order traversal as a list of lists, one per level.
  • In a binary tree where each node holds a value 0 to 25 representing letters a through z, find the lexicographically smallest string formed by reading from any leaf up to the root.

“Classic warmup.”

View Post

Grammarly·Software Engineer·Technical Phone Screen

Jun 2026
Grammarly coding screen, one algorithmic question on interval merging. Pretty standard stuff but the implementation details trip you up if you're not careful.
  • Given an array of intervals, merge all overlapping ones and return the resulting non-overlapping intervals.

“Sort by start time first, then sweep through and keep merging into the last result interval whenever the current start falls within the previous end.”

View Post

Grammarly·Software Engineer·Technical Phone Screen

Jun 2026
Grammarly coding round, one problem the whole time. The question looked like a stack problem until the sliding window constraint showed up and made things messier than expected.
  • Given a string with letters and digits, an integer k, and a window size W, repeatedly remove groups of exactly k consecutive identical characters whose starting position falls within the current sliding window (which advances each time a removal happens or no removal is possible). Return the final string after no more removals can be made.

“I jumped straight to the stack approach and felt pretty good about it until they asked how the window interacts with the stack state after a removal shifts things.”

View Post

Grammarly·Software Engineer·Technical Phone Screen

Jun 2026
Interviewed for a software engineering role at Grammarly and got a string manipulation problem that looked deceptively simple. The stack approach clicked for me eventually but I fumbled explaining the time complexity at first.
  • Given a string of lowercase letters, repeatedly remove adjacent duplicate characters until no more removals are possible. Return the resulting string. Walk through an O(n) stack-based solution.

“My first instinct was to loop and splice, which is obviously not O(n).”

View Post

Grammarly·Software Engineer·Onsite - System Design / Architecture

May 2026
System design round at Grammarly for a software engineer role. The whole thing was basically one big question about building a collaborative design tool like Figma, and they wanted you to go pretty deep on the distributed systems side of it.
  • Design a real-time collaborative whiteboard tool similar to Figma. Your design should support multiple users editing vector shapes simultaneously, show live cursors and presence, persist data, and maintain version history. Walk through how you'd handle conflict resolution, offline edits, and scaling to many concurrent users on the same document.

“This is a beast of a question.”

View Post

Grammarly·Software Engineer·Technical Phone Screen

May 2026
Grammarly technical screen, one coding problem, stack-based string manipulation. Pretty clean question but the constraint about proving uniqueness of the answer is the kind of thing that trips you up if you haven't seen it before.
  • Given a string of lowercase letters, repeatedly remove pairs of adjacent identical characters until no more removals are possible. Return the final string. Solve it in linear time using a stack.

“Knew immediately it was a stack problem, which helped.”

View Post

Grammarly·Software Engineer·Technical Phone Screen

May 2026
Had a technical phone screen for a software engineer role at Grammarly. The whole thing centered on one data structures problem, which felt pretty focused but also left me wondering if I'd done enough.
  • Design a time-based key-value store that supports storing multiple values per key at different timestamps, and retrieving the value associated with the largest timestamp that doesn't exceed a given query timestamp.

“I got the brute-force working pretty fast, just scanning through stored values linearly, and part of me thought that was enough.”

View Post

Grammarly interview FAQ

What rounds are in the Grammarly interview?

Candidates most often report a technical phone screen (14 write-ups), a system design round (11), a behavioral / leadership round (2) and an executive / final round (1).

What does the Grammarly technical phone screen cover?

Across 14 technical phone screen write-ups, the most tagged question topics are Algorithms & Data Structures (17 questions), Technical Trade-offs (7) and System Design (2).

What is asked in the Grammarly system design round?

Across 11 system design write-ups, the most tagged question topics are System Design (14 questions), Technical Trade-offs (12) and API & Integrations (6).