← Google questions
CodingReported in a candidate post, Jan 2025

Substring with Concatenation of All Words Equivalent

Filed under Google

Given a string s and an array of words of the same length, find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and without any intervening…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Google questions

Collected from public candidate posts and coding forums. Updated Nov 2026.