You have two strings of lowercase English letters. You can perform two types of operations on the first string:
Append a lowercase English letter to the end of the string.
Delete the last character of the string. Performing this operation on an empty string results in an empty string.
Given an integer, , and two strings, and , determine whether or not you can convert to by performing exactly of the above operations on . If it's possible, print Yes. Otherwise, print No.
To convert to , we first delete all of the characters in moves. Next we add each of the characters of in order. On the move, you will have the matching string. Return Yes.
If there were more moves available, they could have been eliminated by performing multiple deletions on an empty string. If there were fewer than moves, we would not have succeeded in creating the new string.
Complete the appendAndDelete function in the editor below. It should return a string, either Yes or No.
appendAndDelete has the following parameter(s):
string s: the initial string
string t: the desired string
int k: the exact number of operations that must be performed
string: either Yes or No
The first line contains a string , the initial string.
The second line contains a string , the desired final string.
The third line contains an integer , the number of operations.
and consist of lowercase English letters, .
Sample Input 0
Sample Output 0
We perform delete operations to reduce string to hacker. Next, we perform append operations (i.e., r, a, n, and k), to get hackerrank. Because we were able to convert to by performing exactly operations, we return Yes.
Sample Input 1
Sample Output 1
We perform delete operations to reduce string to the empty string. Recall that though the string will be empty after deletions, we can still perform a delete operation on an empty string to get the empty string. Next, we perform append operations (i.e., a, b, and a). Because we were able to convert to by performing exactly operations, we return Yes.
Sample Input 2
Sample Output 2
To convert ashley to ash a minimum of steps are needed. Hence we print No as answer.