Given a string, find lexicographically next string.
If string is empty, we return ‘a’.
If string contains all characters as ‘z’, we append ‘a’ at the end.
Otherwise we find first character from end which is not z and increment it.
Copyright Notice
This problem is based on content
from GeeksforGeeks
written by GeeksforGeeks
and subject to GeeksforGeeks copyright.
The original content from GeeksforGeeks and any modifications made here are attributed to GeeksforGeeks contributors,
and this work is shared under CC BY-SA 4.0.