Coupang

Result
Ongoing
Posted
20 Oct 2025
474 reads

Summary

I recently interviewed at Coupang and was presented with LeetCode problem 296, Best Meeting Point, as a coding challenge.

How it went

During my interview process with Coupang, the primary focus was a coding task. I was presented with LeetCode problem 296, known as 'Best Meeting Point', and had to work through its solution.

Questions asked (1)

  1. 01

    Best Meeting Point

    Data Structures & Algorithms · Medium

    Given a binary matrix grid where each 1 marks the home of a friend, we need to find a 'meeting point' such that the total travel distance of all friends to that point is minimized. The travel distance is calculated using the Manhattan distance. The meeting point can be any cell on the grid.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Coupang recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!