Available question text
Find the smallest rotation k of nums that maximizes the number of positions where the rotated value is <= its index. With n up to 1e5 and values in [0,n-1], the challenge is to compute each element’s contribution across all rotations efficiently (e.g., by converting valid rotation ranges into range updates and scanning with a prefix sum).
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 798. Smallest Rotation with Highest Score
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source