Given a string str consisting of lowercase English alphabets. The task is to add all the character values i.e. ‘a’ = 1, ‘b’ = 2, ‘c’ = 3, …, ‘z’ = 26 and output the character corresponding to the sum value. If it exceeds 26 then take sum % 26.
Input: str = “gfg”
(g + f + g) = 7 + 6 + 7 = 20 and t = 20
Input: str = “geeks”
- Find the sum of all character of the string and store it in a variable sum.
- If sum % 26 = 0 then print ‘z’.
- Else update sum = sum % 26 and print (sum + ‘a’ + 1).
Below is the implementation of the above approach:
- Minimal moves to form a string by adding characters or appending string itself
- Check if a two character string can be made using given words
- Check if a given string is made up of two alternating characters
- N-th character in the string made by concatenating natural numbers
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Lexicographically smallest string formed by appending a character from the first K characters of a given string
- Maximum number of characters between any two same character in a string
- Character whose frequency is equal to the sum of frequencies of other characters of the given string
- Minimum sum of squares of character counts in a given string after removing k characters
- Python | Replacing Nth occurrence of multiple characters in a String with the given character
- Find a string such that every character is lexicographically greater than its immediate next character
- Check whether the number can be made perfect square after adding 1
- Find the first non-repeating character from a stream of characters
- Find the longest string that can be made up of other strings from the array
- Find the starting indices of the substrings in string (S) which is made by concatenating all words from a list(L)
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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.