Leetcode 932. Beautiful Array

Return a permutation of 1..n with the property that no element sitting between two others equals their arithmetic mean (i.e., no i<k<j with 2*nums[k]=nums[i]+nums[j]). The standard approach builds such a permutation recursively using odd/even index mappings (divide-and-conquer).