Leetcode 1968. Array With Elements Not Equal to Average of Neighbors

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1968. Array With Elements Not Equal to Average of Neighbors

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact