Grammarly Software Engineer Interview: Tackling String Challenges and Word Corrections

Software Engineering
,
1

Grammarly | Software Engineer | Interview Experience

Interview Date: Not specified
Result: Not specified
Difficulty: Not specified

Interview Process

The interview consisted of two main coding questions. The format was likely a live coding session, where candidates were expected to solve problems in real-time. The duration of the interview was not specified.

Technical Questions

  1. Remove All Adjacent Duplicates In String (Stack, String)
  2. Closest Word from Dictionary (HashMap, String Manipulation)
    • Given a dictionary of words {kite, yellow} and a list of words {KITe, kiTE, yollow, yeellow}, the task was to output {kite, kite, yellow, }.
      • Rule 1: A lowercase match in the word dictionary is sufficient.
      • Rule 2: Vowels (a, e, i, o, u) can be replaced for matching.

Tips & Insights

It is important to handle edge cases when implementing the solutions, especially regarding the matching rules for the second question. Ensure to test all possible cases before concluding the solution.