← Back to Directory

Duolingo

Mid-sized

Screna has 4 Duolingo interview write-ups. The most reported round is the technical phone screen (4).

4 interview notes · updated Jun 2026

Duolingo·Software Engineer·Technical Phone Screen

Jun 2026
Duolingo software engineer interview with a coding round centered on a string encryption/decryption design problem. The question had more depth than it looked at first glance, especially around the decrypt side.
  • Design an Encrypter/Decrypter class: given a 1-to-1 mapping from single characters to two-character strings, implement encrypt (replace each character with its mapped value) and decrypt (return how many words from a given dictionary, when encrypted, produce the target string).

“I jumped straight to the forward map for encrypt and felt pretty good about that part.”

View Post

Duolingo·Software Engineer·Technical Phone Screen

May 2026
Did a technical screen for a software engineer role at Duolingo that came down to a sorting problem with multiple custom keys. Pretty focused, not a lot of fluff.
  • Given a list of word-translation hint objects, each with a source word, a list of candidate translations, a score, a language pair, and a category, sort them by: score descending, then source word ascending, then length of the first candidate translation ascending.

“The multi-key sort itself wasn't too bad once I remembered you can negate floats in a tuple key to flip the sort direction.”

View Post

Duolingo·Software Engineer·Technical Phone Screen

May 2026
Did a first round for a software engineer role at Duolingo. It was a LeetCode-style coding question, pretty close to a known problem but with a twist on what the function actually needs to return.
  • Given an encrypted string and a key, implement a decrypt function that returns the full decoded string rather than just a count.

“Recognized the base problem pretty quickly since it's close to a well-known LeetCode question.”

View Post

Duolingo·Software Engineer·Technical Phone Screen

Apr 2026
Pair programming screen at Duolingo for a software engineering role. The problem itself wasn't algorithmically hard but the follow-up discussion on complexity and extensibility is where I think they were really evaluating you.
  • Given a list of word-translation hint objects, each with a source word, a list of translations, a confidence score, and a language pair field, sort them by score descending, then source word alphabetically, then by the length of the first translation ascending. Implement this in Python using a tuple key with sorted().
  • What is the runtime complexity of your sorting solution, and how would you extend it to support additional sort criteria?

“The tuple key approach clicked pretty fast for me.”

View Post