Company: Typeface_12july
Difficulty: medium
Word Transformation Problem Description For a string word of length n consisting of lowercase English characters, it can be transformed as follows: For each character of the string, If the character is 'z', it is replaced by "ab". Otherwise, it is replaced by its next higher character, for example, 'a' is replaced by 'b', 'b' by 'c', and 'y' by 'z'. Thus, if the initial string is "azbk" it is "babol" after 1 transformation. As a fun trivia, HackerRank publishes a puzzle for all its employees each week. The goal for this week is to find the length of the resultant string after exactly t transformations are performed as described above. Since the answer can be large, find the answer taking modulo (10 9 + 7). Function Description Complete the function getTransformedLength in the editor below. getTransformedLength has the following parameters: string word : the initial string int t : the number of transformations Returns int : the length of the string after t transformations, modulo (10 9