Positional Awareness Positional Awareness

Your task is to generate a program that, for every permutation of its characters (which includes the original program), outputs the positions of every character relative to the original program.

If your program is

Derp


you must output

[0, 1, 2, 3]


(or some equivalent). This is because D is in the 0th position, e is in the 1st, r the 2nd, and p the 3rd.

Let's take another program which is the original program, but with its characters permuted:

epDr


You must output

[1, 3, 0, 2]


because e is in the 1st position of the original program, p is in the 3rd position, D the 0th, and r the 2nd.

If the original program has two repeating characters:

abcda -&gt; [0, 1, 2, 3, 4]


Then for the permutation, the 0 and the 4 in the array must be in ascending order:

baadc -&gt; [1, 0, 4, 3, 2] (0 first, then 4)


Rules:


Your program must contain at least two unique characters.
At most floor(n/2) characters are to be the same.

 aabb (acceptable)
 aaaabc (not acceptable, only floor(6/2) = 3 a's allowed)

Your program's output can be either an array (or something similar) containing all the characters' positions in order, or a string with any delimiter, so these are perfectly fine:

[0, 1, 2, 3]
0,1,2,3
0 1 2 3
Actually, 2 bytes

10


Try it online!

This prints

0
1


while the (only) other permutation

01


prints

1
0


How it works

In Actually, consecutive digits are parsed separately, so 10 pushes 1 on the stack, then 0 on top of it.

When the program finishes, the stack is printed top to bottom, so it prints 0 first, then a linefeed, then 1.

The derranged program 01 does the same, in the opposite order.