Given a string s and a character c, return a new list of integers of the same length as s where for each index i its value is set the closest distance of s[i] to c. You can assume c exists in s.
Constraints
n ≤ 100,000 where n is the length of shttps://binarysearch.com/problems/Closest-Distance-to-Character
Input
aabaabbOutput
[2, 1, 0, 1, 1, 0]Given two strings s0 and s1, return the number of substrings where s1 contains any anagram of s0.
You are given two non-empty strings a and b that are the same length. Partition them into substrings such that each pair of a and b’s substring is the same s...
You are given three lowercase alphabet strings a, b and target. Strings a and b have the same length and are defined to be equivalent: a[i] = b[i]. For examp...
Given two lowercase alphabet strings a and b, return the length of a minimum substring in a that contains all the characters of b.
Leave a comment