Given a string str containing only characters x and y, the task is to perform the following operations while possible:
Find an index such that s[i] = ‘x’ and s[i+1] = ‘y’ and delete both the characters s[i] and s[i+1], if no such index is found then find an index such that s[i] = ‘y’ and s[i+1] = ‘x’ and swap(s[i], s[i+1]).
Print the final string after performing the given operation.
Input: str = “xyyxx”
Step 1: yxx (xy got deleted)
Step 2: xyx (yx got swapped)
Step 3: x (xy got deleted)
Input: str = “xxyyxyy”
Approach: In the final string there will be either only x or only y because if we have both x and y in the string then there would be a point where we have either xy or yx as sub-string.
- If it’s xy, we delete it straight away.
- If it is yx, we reverse it to get xy and then delete it.
Since in each deletion step, one x and one y gets deleted, the final string would have min(x, y) number of x and y characters deleted.
Below is the implementation of the above approach:
- Final state of the string after modification
- Sub-string that contains all lowercase alphabets after performing the given operation
- Print the final string when minimum value strings get concatenated in every operation
- Minimum number of given operations required to convert a string to another string
- Encrypt the given string with the following operations
- Operations required to make the string empty
- Converting one string to other using append and delete last operations
- Minimum reduce operations to convert a given string into a palindrome
- Count of operations to make a binary string"ab" free
- Minimum operations required to convert a binary string to all 0s or all 1s
- Minimum given operations required to convert a given binary string to all 1's
- Maximum number of given operations to remove the entire string
- Form N-copy string with add, remove and append operations
- Minimum number of operations required to sum to binary string S
- Minimum operations required to make the string satisfy the given condition
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.