30. Substring with Concatenation of All Words

Every word has the same length wordLen, and that single fact reshapes the problem: a valid window is exactly wordCount back-to-back words on a grid with stride wordLen. So a starting position only…