Transformed Array

Problem Description

You are given an integer array nums that represents a circular array. Your task is to create a new array result of the same size, following these rules:

• If nums[i] > 0: Start at index i and move nums[i] steps to the right in the circular array. Set result[i] to the value of the index where you land.
• If nums[i] < 0: Start at index i and move abs(nums[i]) steps to the left in the circular array. Set result[i] to the value of the index where you land.
• If nums[i] == 0: Set result[i] to nums[i].

Return the new array result.

Key Insights

• The problem involves simulating movements in a circular array based on the values in the array.
• The wrapping behavior can be handled using the modulo operator to ensure indices stay within bounds.
• The input array can contain both positive and negative integers, affecting the direction of movement.

Space and Time Complexity

Time Complexity: O(n)
Space Complexity: O(n)

Solution

To solve the problem, we can create a result array of the same length as the input array. We will iterate through each element of the input array and calculate the new index based on the value at that index. For positive values, we move right, and for negative values, we move left, using the modulo operator to wrap around the circular array. This approach ensures that we efficiently determine the new indices without any extra space apart from the result array.

Code Solutions