Grammarly · Phone screen
Not reportedGrammarly SWE Phone Screen Questions: 1 Experience
A Q3 2026 Grammarly SWE phone screen asked LeetCode 1028 and a list intersection question. The candidate felt the answers were good, then got no reply.
At a glance
- Process: applied online → one technical phone screen with two coding questions → no reply afterwards, however the candidate tried to get in touch (report 01)
- Asked recently: Recover a Tree From Preorder Traversal (LeetCode 1028) and a question the candidate calls list intersection (report 01)
- Difficulty: the candidate rated it average and felt the answers were quite good (report 01)
- Practise first: Recover a Tree From Preorder Traversal, then Interval List Intersections, FastPrep's closest Grammarly match for the list question
Coverage: One candidate with a master's degree, changing jobs, who applied online for a full-time general software engineering role. The report covers one technical phone screen. It gives July to September 2026 as the interview period and went up on November 19, 2026. The candidate's title calls the company Superhuman; the employer listed is Grammarly.
What came up
Two coding questions, which the candidate counts among the common ones in other people's reports: rebuilding a binary tree from a string, and a list intersection (report 01).
Questions we found
Algorithms / Data Structures
| Question | Reports | Last seen |
|---|---|---|
| Recover a Tree From Preorder Traversal (LeetCode 1028) | 1 | Q3 2026 |
| List intersection (closest match: Interval List Intersections) | 1 | Q3 2026 |
1 detailed candidate timeline, loops, and screens
01: Full-time SWE, phone screen on LeetCode 1028 and a list intersection, then silence
Report date: November 19, 2026 · Interview period: 2026 Q3 · Role: Software engineer, changing jobs · Degree listed: Master's · Channel: Applied online · Candidate's rating: Negative experience, average difficulty · Result: No reply after the screen (marked as other)
Technical phone screen
- The screen had two coding questions. The candidate describes both as common ones that other people's reports had already mentioned.
- The first was LeetCode 1028, Recover a Tree From Preorder Traversal. The candidate gives only the number. In the public problem, which FastPrep's version follows, a binary tree is written out as one string during a preorder walk: each node shows up as its value with one dash in front of it for every level of depth, and the task is to rebuild the tree from that string.
- The second the candidate names only as list intersection, without saying what kind of lists were involved. FastPrep links it to Interval List Intersections, the intersection question already on FastPrep from an earlier Grammarly phone screen report. That task gives two sorted lists of closed intervals, with no overlaps inside either list, and asks for every overlap between an interval in the first list and one in the second. It may not be the exact version this candidate got.
- The candidate felt the answers were quite good, and also talked through different ways to solve the questions with the interviewer.
After the screen
- Then nothing. The candidate says the company ghosted them: however they tried to get in touch, nobody wrote back.
Common questions
What does the Grammarly phone screen ask?
In report 01, two coding questions: LeetCode 1028, which rebuilds a tree from a preorder string, and one the candidate calls list intersection.
How hard is the Grammarly SWE phone screen?
The candidate in report 01 rated it average and felt the answers were quite good.
Does Grammarly get back to candidates after the phone screen?
The one candidate here heard nothing back, despite trying to get in touch (report 01).
Keep practicing
- Phone screen: Recover a Tree From Preorder Traversal and Interval List Intersections (report 01).
- More Grammarly questions: the Grammarly coding question bank. It needs sign-in.
- Hiring insights: the Grammarly hiring insights page.
- More firsthand reports: browse the Experience feed.
Sources: Anywhere useful interview info can be found.
Comments
0No comments yet — be the first to share what you know.