Leetcode 296. Best Meeting Point
Given a grid of homes (1s) find a meeting cell that minimizes the total Manhattan distance from all homes. Key insight: Manhattan distance is separable by rows and columns, so reduce to two 1D problems and choose the median row and median column to minimize total distance.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
Mid October, 2024
Mid-level
Minimum cost to delete all leaf nodes from a weighted binary tree, with the option to delete non-leaf nodes as well to minimize operations
Mid October, 2024
Mid-level
Find minimum time for n friends to reach m restaurants in a bidirectional graph. Given n friends and m restaurants as graph nodes with unit distance taking unit time to travel, determine the minimum time for all friends to gather at a single restaurant.
Early October, 2024
Mid-level
Min Time for n friends to reach m cafes, given as bidirectional graph nodes, with unit distance taking unit time to travel for all friends
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.