Skip to content

Practice Maximize Distance to Closest Person

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#849
LeetCode Problem

Maximize Distance to Closest Person

Array

Problem Statement

You are given an array representing a row of seats where seats[i] = 1 represents a person sitting in the ith seat, and seats[i] = 0 represents that the ith seat is empty (0-indexed). There is at least one empty seat, and at least one person sitting. Alex wants to sit in the seat such that the distance between him and the closest person to him is maximized. Return that maximum distance to the closest person.

Source: Maximize Distance to Closest Person on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
seats = [1,0,0,0,1,0,1]
Output
2

# Example 2

Input
seats = [1,0,0,0]
Output
3

# Example 3

Input
seats = [0,1]
Output
1

Constraints

2 <= seats.length <= 2 * 10^4
seats[i] is 0 or 1.
At least one seat is empty.
At least one seat is occupied.

Related LeetCode Problems

Practice more problems similar to Maximize Distance to Closest Person.

1 Two Sum Easy4 Median of Two Sorted Arrays Hard11 Container With Most Water Medium14 Longest Common Prefix Easy15 3Sum Medium
← Previous Shifting LettersNext → Rectangle Area II

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free