Coursera Software Engineer interview questions

6 Software Engineers have shared notes from their Coursera interviews, with the questions they were asked in each round. That is 46% of the 13 Coursera interview notes on Screna AI.

6 Software Engineer interview notes

Coursera·Software Engineer·Technical Phone Screen

Jul 2026
Coding screen for a software engineer role at Coursera, centered on an election simulation problem. Two parts to the same problem, and the second one had enough edge cases to keep me busy for a while.
  • Given a list of ranked ballots, implement a simple plurality voting system that returns the candidate with the most first-choice votes, breaking ties by lexicographic order.
  • Using the same ballot input, implement instant-runoff voting: repeatedly eliminate the candidate with the fewest votes each round until someone crosses 50%, handling ties by eliminating the lexicographically largest candidate.

“Pretty straightforward once you realize you only look at the first element of each ballot.”

View Post

Coursera·Software Engineer·Technical Phone Screen

Jun 2026
Coursera software engineer interview with a simulation problem that looks straightforward until you actually try to implement it cleanly. The IRV question had enough edge cases to keep things interesting for a while.
  • Given a list of ranked ballots where each ballot is an ordered list of candidate names, implement Instant Runoff Voting: each round count only the top still-active candidate per ballot, declare a winner if someone exceeds 50% of votes, otherwise eliminate the candidate with the fewest votes (breaking ties by eliminating the lexicographically largest name), and return the final winner.

“My first instinct was to mutate the ballots as candidates got eliminated and I wasted a few minutes going down that path before realizing it was a mess.”

View Post

Coursera·Software Engineer·Technical Phone Screen

Jun 2026
Coursera SWE interview that leaned pretty heavily into algorithm fundamentals. The coding problem looked simple at first glance but the majority vote part had a real constraint that tripped me up a bit.
  • Given an array of candidate votes, implement a plurality voting function that returns the candidate with the most votes, breaking ties by returning the lexicographically or numerically smallest candidate.
  • Implement a majority vote function using the Boyer-Moore algorithm that returns the candidate with strictly more than half the votes, or null if none exists, in O(n) time and O(1) space.

“The counting part was fine, just a frequency map and a scan.”

View Post

Coursera·Software Engineer·Onsite - Product Sense / Strategy

May 2026
Interviewed at Coursera for what seemed like a sales or product strategy role. Just the one question about enterprise positioning, so hard to say much about the overall process.
  • How would you position Coursera's enterprise offerings?

“Tried to frame it around the B2B value prop vs the consumer side, like why a company would pay for Coursera for Teams instead of just letting employees self-subscribe.”

View Post

Coursera·Software Engineer·Onsite - Product Sense / Strategy

May 2026
Coursera interview, one question about enterprise sales strategy through consumer targeting. Not a lot of context to go on but it's a meaty enough question that I spent a while thinking through it.
  • How would you target consumers to drive enterprise sales?

“This is a bottom-up growth question and I fumbled the opening by going straight to tactics before establishing why consumer adoption even matters to an enterprise deal.”

View Post

Coursera·Software Engineer·Technical Phone Screen

May 2026
Coursera software engineer interview with a voting algorithm problem. Pretty clean coding question, nothing too exotic, but the tie-breaking condition is the kind of thing that'll bite you if you're not careful.
  • 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 votes. If there's a tie, return the lexicographically smallest candidate name.

“The core counting part is straightforward, just a frequency map over the first element of each ballot.”

View Post