String Transformation Using Given Dictionary Of Words

You are given a dictionary of words and two strings, start and stop. All given strings have equal length.

Transform string start to string stop one character per step using words from the dictionary. For example, "abc" -> "abd" is a valid transformation step because only one character is changed (c->d) while "abc" -> "axy" is not a valid step transformation because two characters are changed (b->x and c->y).

You need to find the shortest possible sequence of strings (two or more) such that:

1. First string is start.
2. Last string is stop.
3. Every string (except the first one) differs from the previous one by exactly one character.
4. Every string (except, possibly, first and last ones) are in the dictionary of words.

i.e. output = [start, <strings from="" the="" given="" dictionary="">, stop] and len(output) >= 2.</strings>

If two or more such sequences exist, any one of them is a correct answer.

If no such sequence is there to be found, [“-1”] (a sequence of one string, “-1”) is the correct answer.

Example One

Input:

start = "bat"

Output:

or

From "bat" change character 't' to 'd', so new string will be "bad".

From "bad" change character 'b' to 'h', so new string will be "had".

or

From "bat" change character 'b' to 'h', so new string will be "hat".

From "hat" change character 't' to 'd', so new string will be "had".

Example Two

Input:

words = []

start = bbb

stop = bbc

Output: ["bbb", "bbc"]

From "bbb" change the last character 'b' to 'c', so new string will be "bbc".

Example Three

Input:

words = []

start = "zzzzzz"

stop = "zzzzzz"

Output: ["-1"]

Function must return an array of strings of length >= 2, where the first string is start and the last string is stop, if the transformation is possible. Else return an array of strings containing only one string "-1", i.e. return ["-1"].

Here, the words dictionary is empty and ["zzzzzz", "zzzzzz"] is not a valid transformation hence return ["-1"].

Example Four

Input:

words = ["cccw", "accc", "accw"]

start = "cccc"

stop = "cccc"

Output:

["cccc", "cccw", "cccc"]

Or:

["cccc", "accc", "cccc"]

Notes

Input Parameters:

There are three arguments:

1. Array of strings words,
2. String start,
3. String stop.

Output: Function must return an array of strings of length >= 2, where the first string is start and the last string is stop, if the transformation is possible. Else return an array of strings containing only one string "-1", i.e. return ["-1"].

##### Constraints:
• All input strings consist of lowercase Latin characters only.
• 0 words combined
• Dictionary words are not in any particular order, there may be duplicates, too.

#### Optimal Solution

This problem can be solved using BFS.

From current string, when we want to update neighbour strings (strings having different character at exactly one position), there are two methods possible:

1) Visit every string in words array and check.

There are no_of_words strings in words array and each has length len. So, for one string to find neighbour strings, time taken will be O(no_of_words * len). And we will find neighbours for O(no_of_words) strings, hence time complexity of this solution will be O(no_of_words ^ 2 * len). When no_of_words is big, this solution will timeout.

2) For current string we will generate all possible strings having different character at exactly one position, and we will update strings that are in words array i.e. they are neighbours. We can use hashmap to check if any string is in words array or not in O(len) time, instead of O(no_of_words * len) time using simple array search.

Now there can be O(26 * len) different strings having different character at exactly one position. And for each string we will spend O(len) time to check if it is in words array or not. We will find neighbours for O(no_of_words) strings, hence time complexity of this solution will be O(no_of_words * len^2 * 26). Now when string length is high, this solution will timeout.

So, we can combine both methods in one solution to bring down time complexity to O((no_of_words * len * min((no_of_words, 26 * len)). When (no_of_words <= 26="" *="" len)="" use="" first="" method="" and="" when="" (no_of_words=""> 26 * len) use the second method!</=>

Have a look at the solution provided by us, it contains necessary comments to understand the solution.

Time Complexity:

O(no_of_words * len * min(no_of_words, 26 * len)).

Auxiliary Space Used:

O(no_of_words * len).

Space Complexity:

O(no_of_words  * len).

As input is O(no_of_words * len) and auxiliary space used is also O(no_of_words * len). So, O(no_of_words * len) + O(no_of_words * len) -> O(no_of_words * len).

``````
// Each variable is explained in the code, where it is used first.
int len, no_of_words;
queue bfs_q;
vector visited;
unordered_map position;
unordered_map parent;

// Check if str1 and str2 differs ar exactly one positon.
bool only_one_char_difference(int len, string &str1, string &str2)
{
int difference = 0;
for (int i = 0; i < len; i++)
{
if (str1[i] != str2[i])
{
// If there is already one miss match, and now we have found another.
if (difference == 1)
{
return false;
}
difference++;
}
}
// If difference == 0, it means strings are same. So, difference == 1 is needed.
return difference == 1;
}

// Update neighbours using O(len * len * 26) method.
{
// For each position.
for (int i = 0; i < len; i++)
{
// For each possible character.
for (char ch = 'a'; ch <= 'z'; ch++)
{
// We want to find string having one different character, so need to skip this.
if (ch == cur_str[i])
{
continue;
}
// Store the original character, this will help to backtrack the change.
char original = cur_str[i];
// Set new character.
cur_str[i] = ch;
// Check if new string is in words array or not.
auto it = position.find(cur_str);
// If new string is in words array.
if (it != position.end())
{
int position_of_cur_str_in_words_array = it->second;
// If neighbour string is not already visited.
if (visited[position_of_cur_str_in_words_array] == false)
{
// Visit it.
visited[position_of_cur_str_in_words_array] = true;
/*
This string is visited by idx th string.
So, remember it. This will help us to construct the answer later.
*/
parent[position_of_cur_str_in_words_array] = idx;
/*
If we have reached the stop string.
Do you remember we have pushed the stop string at the end of words array!
*/
if (position_of_cur_str_in_words_array == no_of_words - 1)
{
return;
}
bfs_q.push(position_of_cur_str_in_words_array);
}
}
// Backtrack.
cur_str[i] = original;
}
}
}

// Update neighbours using O(no_of_words * len) method.
void add_neighbours_with_method1(vector &words, string &cur_str, int idx)
{
// Iterate over all words.
for (int i = 0; i < no_of_words; i++)
{
// If neighbour is not visited and has only one character different from current string.
if (visited[i] == false && only_one_char_difference(len, cur_str, words[i]))
{
// Mark as visited.
visited[i] = true;
/*
This string is visited by idx th string.
So, remember it. This will help us to construct the answer later.
*/
parent[i] = idx;
/*
If we have reached the stop string.
Do you remember we have pushed the stop string at the end of words array!
*/
if (i == no_of_words - 1)
{
return;
}
bfs_q.push(i);
}
}
}

void solution(vector &words, string &start, string &stop)
{
/*
When no_of_words > len * 26, we are going to use method2.
So, we need to use hash map for faster search.
For search if string is present in words array or not in O(len) time.
*/
if (no_of_words > len * 26)
{
for (int i = 0; i < no_of_words; i++)
{
position[words[i]] = i;
}
}
// -1 means start string.
bfs_q.push(-1);
/*
Visited array to track if string is visited or not, during BFS.
visited[i] = true -> words[i] is visited in BFS.
visited[i] = false -> words[i] is not visited in BFS till now.
*/
visited.assign(no_of_words, false);
while (bfs_q.empty() == false)
{
int idx = bfs_q.front();
bfs_q.pop();
// Stores string that is at the front of queue.
string cur_str;
if (idx == -1)
{
cur_str = start;
}
else
{
cur_str = words[idx];
}
// Call appropriate method to update the neighbours.
if (no_of_words <= len * 26)
{
}
else
{
}
}
}

vector string_transformation(vector words, string start, string stop)
{
// Length of each string in input.
len = start.length();
/*
This is not necessary, but this will help to simplify the code.
*/
words.push_back(stop);
// Total no of words. stop is also included.
no_of_words = words.size();
// Do BFS.
solution(words, start, stop);
// From parent information gathered from BFS, construct the actual string transformation.
vector ans;
/*
Start from stop string. Go to its parent, then its parent's parent... till we reach start
string.
*/
int stop_idx = no_of_words - 1;
// If stop string is not reached in BFS.
if (parent.find(stop_idx) == parent.end())
{
ans.push_back("-1");
return ans;
}
/*
Start from stop string. Go to its parent, then its parent's parent... till we reach start
string.
*/
while (stop_idx != -1)
{
ans.push_back(words[stop_idx]);
stop_idx = parent[stop_idx];
}