Maximize Distance to Closest Person: coding question

Available question text

Given a binary array where 1s are occupied seats, find an empty seat that maximizes the distance to the nearest occupied seat. The core challenge is identifying the longest runs of zeros (with edge runs counted fully and interior runs giving half the run length) to compute the maximal minimum distance.

Continue with questions that share topics or the same question type.

3Sum Closest
Coding · Array · Sorting · Two Pointers
K Closest Points to Origin
Coding · Array · Divide and Conquer · Geometry
Shortest Distance from All Buildings
Coding · Array · Breadth-First Search · Matrix
Shortest Word Distance
Coding · Array · String

Sources · 2 references

These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.

Hello Interview · 1 record

No company association
Leetcode 849. Maximize Distance to Closest Person
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source

LeetCode company tags · 3 records

Adobe
Maximize Distance to Closest Person
Reported date not specified · Source window: 3mo
Source snapshot: Oct 20, 2026
Source frequency score: 81.4. This is not an interview probability.
View source
Adobe
Maximize Distance to Closest Person
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 79.4. This is not an interview probability.
View source
Roblox
Maximize Distance to Closest Person

Available question text

Maximize Distance to Closest Person

Available question text

Related questions

Maximize Distance to Closest Person

Available question text

Related questions