We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The task can only be solved under the condition that the array is divided into blocks of size multiples of 2*k, where in each block, result[i] = input[i] + k for "k" times and result[i] = input[i] - k for "k" times. Example for k=2, (k+1,k+2,3-k,4-k) (k+5,k+6,7-k,8-k) ... result=[3,4,1,2 7,8,5,6, ...]
Absolute Permutation
You are viewing a single comment's thread. Return to all comments →
The task can only be solved under the condition that the array is divided into blocks of size multiples of 2*k, where in each block, result[i] = input[i] + k for "k" times and result[i] = input[i] - k for "k" times. Example for k=2, (k+1,k+2,3-k,4-k) (k+5,k+6,7-k,8-k) ... result=[3,4,1,2 7,8,5,6, ...]
Sorry if I didn't explain it very clearly. fore more visit https://www.firenzerentals.com/