A 6 letter password was hashed.
All its consecutive fragments of length 3 were preserved, out of order:
$$ \texttt{ABA},\ \texttt{BAC},\ \texttt{ACB},\ \texttt{CBA}. $$
Reconstruct the original password.
Didactic closure of the level
If you can justify why recurrence is correct and not just use it, you are already at a solid level.