Shortest Distance to a Character | LeetCode 821 | Arrays

Given a string s and a character c that occurs in s, return an array of integers answer where answer.length == s.length and answer[i] is the shortest distance from s[i] to the character c in s.

Example 1:

Input: s = "loveleetcode", c = "e"
Output: [3,2,1,0,1,0,0,1,2,2,1,0]
#competitiveprogramming #interview #interviewquestion
#coding #leetcode #programmer #tech #software #leetcode #programmingisfun

Видео Shortest Distance to a Character | LeetCode 821 | Arrays канала The Code Architect