0
Diverse arrays code-golf open-ended-function
Given an integer \$ n \$ \$ (n \ge 1) \$, your task is to output an array of integers \$ a \$ such that all possible pairs of integers \$ (x, y) \$ satisfying \$ 1 \le x, y \le n \$ exist as a subarray in \$ a \$, and that the length of \$ a \$ is mini...