Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 932. Beautiful Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source