Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 848. Shifting Letters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source