Leetcode 3379. Transformed Array

Given a circular integer array nums, build result where for each index i you move |nums[i]| steps from i (right if nums[i]>0, left if nums[i]<0, stay if 0) and set result[i] to the value at the position you land on. Return the resulting array.