Available question text
Rearrange a given array of distinct integers so that for every internal index i, nums[i] is not equal to the average of its neighbors — equivalently, no three consecutive elements form an arithmetic progression. Return any permutation satisfying this (n up to 1e5).
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 1968. Array With Elements Not Equal to Average of Neighbors
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source