Substring with Concatenation of All Words

Описание к видео Substring with Concatenation of All Words

#leetcode You are given a string s and an array of strings words. All the strings of words are of the same length.
A concatenated string is a string that exactly contains all the strings of any permutation of words concatenated.
Return an array of the starting indices of all the concatenated substrings in s. You can return the answer in any order.

Комментарии

Информация по комментариям в разработке

Похожие видео