समस्या
Rotate the list to the right by steps positions: the last element moves to the front, steps times.
Implement rotate_right(numbers, steps).
Input
numbers: The list of integers. steps: How many positions to rotate.
Output
Return the rotated list.
सीमाएँ
0 ≤ length ≤ 100,000; 0 ≤ steps ≤ 10⁹
उदाहरण
इनपुट:
numbers = [1, 2, 3, 4, 5]
steps = 2
अपेक्षित आउटपुट:
expected = [4, 5, 1, 2, 3]
इनपुट:
std::vector<long long> numbers = {1, 2, 3, 4, 5};
long long steps = 2;
अपेक्षित आउटपुट:
std::vector<long long> expected = {4, 5, 1, 2, 3};
इनपुट:
long[] numbers = new long[] {1, 2, 3, 4, 5};
long steps = 2;
अपेक्षित आउटपुट:
long[] expected = new long[] {4, 5, 1, 2, 3};
व्याख्या
Two right rotations: [5, 1, 2, 3, 4], then [4, 5, 1, 2, 3].
इनपुट:
numbers = [1, 2, 3]
steps = 3
अपेक्षित आउटपुट:
expected = [1, 2, 3]
इनपुट:
std::vector<long long> numbers = {1, 2, 3};
long long steps = 3;
अपेक्षित आउटपुट:
std::vector<long long> expected = {1, 2, 3};
इनपुट:
long[] numbers = new long[] {1, 2, 3};
long steps = 3;
अपेक्षित आउटपुट:
long[] expected = new long[] {1, 2, 3};
व्याख्या
Rotating by the length brings the list back: [1, 2, 3].
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
A rotation by the list length changes nothing, so only the remainder matters.
संकेत 2
Think of splitting the list near the end and moving that tail to the front.
संकेत 3
Handle very large step counts by reducing them before rearranging.
अपेक्षित जटिलता
O(n) time, O(n) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।