129 - Krypton Factor

This problem asks you to generate the i-th string of a list of strings (in alphabetical order) that do not contain identical, adjacent substrings.

I could not derive an algorithm that generate the i-th string directly. Instead, I enumerated all strings until the i-th string (fortunately this did not yield a TLE). A reference solution is here.