Problem Statement | |||||||||||||
| Bob and Doug have recently moved from Canada to the United States, and they are confused by this strange letter, "ZEE". They need your assistance. Given a String text, replace every occurrence of the word, "ZEE", with the word, "ZED", and return the result.
Note that if "ZEE" is just part of a larger word (for example, "ZEES"), it should not be altered. | |||||||||||||
Definition | |||||||||||||
| |||||||||||||
Constraints | |||||||||||||
| - | text will contain between 1 and 50 characters inclusive. | ||||||||||||
| - | Each character in text will either be a space (' '), or a capital letter ('A'-'Z'). | ||||||||||||
| - | text will have precisely one space between consecutive words, and it will have no leading or trailing spaces. | ||||||||||||
Examples | |||||||||||||
| 0) | |||||||||||||
| |||||||||||||
| 1) | |||||||||||||
| |||||||||||||
| 2) | |||||||||||||
| |||||||||||||
| 3) | |||||||||||||
| |||||||||||||