MoreStrings
Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay in its original order.
InputRead from standard input three space separated strings s1, s2, s3 each of length < 100 characters.
OutputTo the standard Output, output “yes” or “no” depending on whether s3 can be formed from s1 and s2 by the described procedure. That is, “yes” if it can be formed, and “no” if it can’t.
Sample Input:
String theory Stthreionrgy
Sample Output :
yes
Sample Input:
east west wesseatt
Sample Output:
no
Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.