## Editorial for JDCC '16 Contest 2 P2 - Broken Telephone

Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.

Submitting an official solution before solving the problem yourself is a bannable offence.

Author: aurpine

Determine if the length of the string has been changed or if more than two letters have been changed. To determine how many letters have been changed, iterate with a for loop. Remember to read all the words for every test case.

Time Complexity: $$\mathcal{O}(NS)$$ per test case, where $$S$$ is the length of the string.