Substring with Concatenation of All Words

Given a string s and an array of equal-length words, find all starting indices of substrings in s that are a concatenation of each word exactly once in any order. The core challenge is matching a multiset of fixed-length tokens efficiently (typically with a sliding-window and frequency map) over s.