Step 1: Divide the number into separate digits:
93322 => 9 3 3 2 2
Step 2: Calculate the distance between each digit and the next (the last digit with the first):
9 to 3 => 6
3 to 3 => 0
3 to 2 => 1
2 to 2 => 0
2 to 9 => 7
Step 3: Convert distances to codes (0=E[qual],
1 & 9 = C[onsecutive], 2-8 = N[one]):
6 => N
0 => E
1 => C
0 => E
7 => N
Step 4: Combine the filters to a string:
N E C E N = NECEN