← Back to Directory

Coursera interview notes, page 1 of 2

Large Enterprises

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

13 interview notes · updated Jul 2026

Coursera·Business Analyst·Hiring Manager Screen

Apr 2026
Interviewed at Coursera, got a sales/business analytics type question that felt more like a case prompt than a standard PM screen.
  • If sales dropped in a specific month, how would you approach diagnosing and responding to that?

“My first instinct was to jump straight to solutions, which was probably the wrong move.”

View Post

Coursera·Backend Engineer·Technical Phone Screen

Apr 2026
Coursera backend engineer interview with a coding question around election ballot processing. Pretty clean problem on the surface but the tie-breaking condition is the kind of thing you can easily forget to handle under pressure.
  • 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 how many voters submitted that exact ranking. Find the candidate with the most first-choice votes. If there's a tie, return the lexicographically smallest name among the tied candidates.

“The core aggregation part is straightforward, just pull index 0 from each tuple and sum up the counts.”

View Post

Coursera·Product Manager·Onsite - Product Sense / Strategy

Apr 2026
Coursera product interview, one question about segmenting website visitors for self-service signup optimization. Not much else to go on from what I remember.
  • How would you segment website visitors to optimize self-service signups?

“I went straight to intent-based segmentation, first-time vs returning visitors, then layered in acquisition channel because that felt like low-hanging fruit.”

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

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·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·Product Manager·Onsite - Product Sense / Strategy

May 2026
Product strategy question for Coursera focused on their B2B self-service product. One question, no frills, but it's the kind that can spiral if you're not careful about scoping.
  • How would you improve retention for Coursera's self-service product aimed at teams?

“I went straight to activation metrics and probably spent too long there before even touching retention properly.”

View Post

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.”

View Post

Coursera·Product Manager·Onsite - Product Sense / Strategy

Jun 2026
Interviewed at Coursera for a product role, got asked the classic product launch question. Short and to the point, nothing too surprising.
  • How would you go about launching a product?

“Walked through the usual stuff: target audience, positioning, pricing, channels, success metrics.”

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