Coursera·Backend Engineer·Technical Phone Screen
May 2026
Coursera backend interview with a pretty involved algorithmic problem around Instant-Runoff Voting. The question had enough edge cases that you really had to think through the procedure carefully, and clarifying tie-break behavior with the interviewer was part of the exercise.
- You're given a map of election ballots where each key is a tuple representing a voter's full candidate ranking (most preferred first) and each value is the count of voters with that exact ranking. Implement the Instant-Runoff Voting algorithm: repeatedly 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 ranked choice. What are the tie-break rules for elimination and for the majority check?
“The redistribution logic is where I got a bit tangled.” The rest of the author's notes on Backend Engineer interview at Coursera, Technical Phone Screen round, covers how they worked through the question, what the panel pushed back on, and what they would do differently.
View Post