728x90 Substring with Concatenation of All Words1 [LeetCode] 30. Substring with Concatenation of All Words You are given a string s and an array of strings words. All the strings of words are of the same length. A concatenated substring in s is a substring that contains all the strings of any permutation of words concatenated. For example, if words = ["ab","cd","ef"], then "abcdef", "abefcd", "cdabef", "cdefab", "efabcd", and "efcdab" are all concatenated strings. "acdbef" is not a concatenated subst.. 2023. 10. 30. 이전 1 다음 728x90
