Practice Shifting Letters

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#848

LeetCode Problem

Shifting Letters

Array String Prefix Sum

Problem Statement

You are given a string s of lowercase English letters and an integer array shifts of the same length. Call the shift() of a letter, the next letter in the alphabet, (wrapping around so that 'z' becomes 'a'). Now for each shifts[i] = x, we want to shift the first i + 1 letters of s, x times. Return the final string after all such shifts to s are applied.

Source: Shifting Letters on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

s = "abc", shifts = [3,5,9]

Output

"rpl"

# Example 2

Input

s = "aaa", shifts = [1,2,3]

Output

"gfd"

Constraints

1 <= s.length <= 10^5

s consists of lowercase English letters.

shifts.length == s.length

0 <= shifts[i] <= 10^9

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free