Replit·Software Engineer·Technical Phone Screen
May 2026
Replit SWE interview with a pretty involved coding problem around simulating a text editor's keystroke compression. The problem itself was well-designed but I spent way too long on edge cases and not enough time on the core logic upfront.
- You're given an initial document string and a sequence of keystroke operations (append a character, backspace, or move cursor right). Convert this sequence into a compressed list of higher-level operations: insert a string, delete k characters, or skip k positions. Consecutive same-type operations should be merged, and redundant sequences like appending then immediately deleting should cancel out.
“This one took me a while to frame correctly.”