Interview - Coupang | Interview Experiences

Summary

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

Full Experience

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.

Interview Questions (1)

Best Meeting Point

Data Structures & AlgorithmsMedium

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.

Coupang

Summary

Full Experience

Interview Questions (1)

Join the Discussion

No comments yet