Review Suggested Edit

You can't approve or reject suggested edits because you haven't yet earned the Edit Posts ability.

# [BQN](https://mlochbaum.github.io/BQN/), 11 bytes<sup>[SBCS](https://github.com/mlochbaum/BQN/blob/master/commentary/sbcs.bqn)</sup>
```
9|+⌜⟜⊐⍋3|↕9
```
[Run online!](https://mlochbaum.github.io/BQN/try.html#code=OXwr4oyc4p+c4oqQ4o2LM3zihpU5)
Assumes 0-index; add 1 for 13 bytes if 1-indexed is required. The result is a 9x9 matrix.
Idea is to use the numbers 0 to 8 in order for rows and the 3x3 transpose 036147258 for columns. Adding these in a [table](https://mlochbaum.github.io/BQN/doc/map.html#table) modulo 9 gives a valid solution. [Grade Up](https://mlochbaum.github.io/BQN/doc/order.html#grade) is used to get the transposed sequence and [Classify](https://mlochbaum.github.io/BQN/doc/selfcmp.html#classify) gets the original ordered range back, since all values in the argument are unique.
```
9|+⌜⟜⊐⍋3|↕9
↕9 # Range 0…8
3| # Mod 3: 012012012
⍋ # Grade: 036147258
+⌜⟜ # Addition table with…
⊐ # Classify 012345678
9| # Modulo 9
```

# [BQN](https://mlochbaum.github.io/BQN/), 11 bytes<sup>[SBCS](https://github.com/mlochbaum/BQN/blob/master/commentary/sbcs.bqn)</sup>
```
9|+⌜⟜⊐⍋3|↕9
```
[Run online!](https://mlochbaum.github.io/BQN/try.html#code=OXwr4oyc4p+c4oqQ4o2LM3zihpU5)
Uses the numbers 0 to 8. The result is a 9x9 matrix.
Idea is to use the numbers 0 to 8 in order for rows and the 3x3 transpose 036147258 for columns. Adding these in a [table](https://mlochbaum.github.io/BQN/doc/map.html#table) modulo 9 gives a valid solution. [Grade Up](https://mlochbaum.github.io/BQN/doc/order.html#grade) is used to get the transposed sequence and [Classify](https://mlochbaum.github.io/BQN/doc/selfcmp.html#classify) gets the original ordered range back, since all values in the argument are unique.
```
9|+⌜⟜⊐⍋3|↕9
↕9 # Range 0…8
3| # Mod 3: 012012012
⍋ # Grade: 036147258
+⌜⟜ # Addition table with…
⊐ # Classify 012345678
9| # Modulo 9
```