3302. Find the Lexicographically Smallest Valid Sequence

You are given two strings word1 and word2. A string x is called almost equal to y if you can change at most one character in x to make it identical to y. A sequence of indices seq is called valid if: - The indices are sorted in ascending order. - Concatenating the characters at these indices in word1 in the same order results in a string that is almost equal to word2. Return an array of size