Leetcode 821. Shortest Distance to a Character
For each index i in string s, compute the minimum absolute distance to the nearest occurrence of character c. This can be solved in linear time by tracking nearest c positions from the left and right (two-pass sweep).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.