Leetcode 848. Shifting Letters

Given a lowercase string s and an array shifts where shifts[i] means add shifts[i] circular shifts to the first i+1 letters, compute the final string by accumulating the total shift for each position (use a running suffix sum from the end) and applying each net shift modulo 26.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 848. Shifting Letters

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact