leetcode problem 849. Maximize Distance to Closest Person.

[vermaaarti]

Hey @Saikat2407, I would like to contribute to this problem, Please do assign it to me.

where:
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.

[nikunj441]

Hey @Saikat2407 , I would like to contribute to this problem, Please do assign it to me.
I am 4 start on codechef and specialist on codeforces.
I have a great command in data structures and algorithms. Will surely, provide you the best optimal solution.