n this challenge, the set of translations forms a directed graph on the $26$ letters of the alphabet. You are given two query words s$1$s$2$s$3...$sL and t$1$t$2$t$3...$tL of equal length L$.$ You need to check whether for each $1<=$i$<=$L$,$ there is a path from si to ti in the graph of letter translations. Keep in mind, that if the lengths are different, the answer is definately $"$no$".$

An easy way of doing this is to precompute the transitive closure of the graph using the Floyd$-$Warshall algorithm. This algorithm allows to check each pair $($si$,$ ti$)$ in constant time. Since the bounds are small, you may use any polynomial time algorithm.