Sliding-Window Text Chunking

You are given an array of words words, a positive integer chunkSize, and an integer overlap satisfying 0 <= overlap < chunkSize.
Starting at index 0, create a chunk containing up to chunkSize consecutive words. Then advance the start index by chunkSize - overlap and repeat while the start index is within the array.
Return all chunks in source order. Keep the final non-empty chunk even if it contains fewer than chunkSize words. If words is empty, return an empty array.

Function
chunkText(words: String[], chunkSize: int, overlap: int) → String[][]

Examples
Example 1
words = ["a","b","c","d","e"]
chunkSize = 3
overlap = 1
return = [["a","b","c"],["c","d","e"],["e"]]
The window starts at indices 0, 2, and 4. Consecutive chunks overlap by one word.
Example 2
words = ["one","two","three","four"]
chunkSize = 2
overlap = 0
return = [["one","two"],["three","four"]]
With zero overlap, each window begins immediately after the previous one.
Example 3
words = []
chunkSize = 4
overlap = 1
return = []
There are no words, so no chunks are emitted.

Constraints
0 <= words.length <= 10^5
1 <= chunkSize <= 10^5
0 <= overlap < chunkSize
Each word is a non-null string.

The trick is that there's no real window to maintain. Compute step = chunkSize - overlap. Since overlap is strictly less than chunkSize, step is at least 1, so the loop always advances and never hangs. Then loop start from 0 while start < n, and slice from start to min(start + chunkSize, n). Push each slice. That's O(n * chunkSize / step) output size, which is expected since overlapping words get copied. The common pitfall is the stop condition. Don't stop when a chunk reaches the end of the array, because Example 1 expects the trailing ["e"] chunk starting at index 4. Another pitfall is forgetting the empty input case, though the while loop handles it for free. Watch for off-by-one on the slice end, and don't use end-exclusive logic in one language and end-inclusive in another. If you blank during the live OA, StealthCoder is the hedge that gets you the loop skeleton fast.

Drill it cold or hedge it with StealthCoder. Either way, don't walk into the OA hoping you remember the trick.