← Back to Directory

Coursera

Mid-sized

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

4 interview notes · updated Jun 2026

Coursera·Software Engineer·Technical Phone Screen

May 2026
Coursera software engineer interview with a simulation problem that looks approachable until you actually try to implement it cleanly under pressure. One question, but it had enough moving parts to keep me busy.
  • Given a list of ranked ballots where each ballot is an ordered list of candidate names, implement Instant Runoff Voting. Each round, count the first active candidate on each ballot. If someone clears 50%, they win. Otherwise eliminate the candidate with the fewest votes, breaking ties by keeping the lexicographically smallest name alive. Return the winner.

“My first instinct was to mutate the ballots directly and I immediately regretted it.”

View Post

Coursera·Backend Engineer·Technical Phone Screen

Apr 2026
Coursera backend engineer interview with a coding question around election ballot processing. Pretty niche problem but the logic wasn't too bad once I broke it down.
  • You're given a map where each key is a tuple representing a voter's full candidate ranking (most preferred first) and each value is the number of voters who submitted that exact ranking. Return the candidate with the most first-choice votes. If there's a tie, return the lexicographically smallest name among the tied candidates.

“First instinct was to overcomplicate it.”

View Post

Coursera·Backend Engineer·Technical Phone Screen

Apr 2026
Coursera backend interview with a pretty meaty algorithmic problem around Instant-Runoff Voting. The problem itself is well-defined but has enough edge cases that you really need to nail down the tie-breaking rules before writing a single line of code.
  • Given a map of voter ballots (where each key is a full candidate ranking and the value is how many voters submitted that ranking), implement the Instant-Runoff Voting algorithm to find the winner. The procedure: tally first-choice votes, declare a winner if someone exceeds 50% of remaining votes, otherwise eliminate the last-place candidate and redistribute their ballots to the next valid choice. Repeat until a winner emerges.

“The core logic isn't the hard part.”

View Post

Coursera·Software Engineer·Technical Phone Screen

Apr 2026
Coursera software engineering interview with a coding question around voting logic. Pretty straightforward problem on the surface but the tie-breaking condition is where things get interesting.
  • Given a list of ranked ballots where each ballot is an ordered list of candidate names, implement plurality voting by counting only the first choice on each ballot and returning the candidate with the most first-choice votes. If there's a tie, return the lexicographically smallest candidate name.

“The core counting part took me like two minutes, just a frequency map over the first element of each ballot.”

View Post