Aabddeefghiijklmnooprstuuvxyyth... _top_ ✦ Easy

Let’s sort the string alphabetically (ignoring duplicates for a moment): a, a, b, d, d, e, e, f, g, h, i, i, j, k, l, m, n, o, o, p, r, s, t, u, u, v, x, y, y, t, h

At first glance, it appears to be chaos. But look closer. This 32-character sequence (excluding the ellipsis) contains an intriguing structure: it begins with a double "a," then "b," double "d," double "e," then "f," "g," "h," double "i," "j," "k," "l," "m," "n," double "o," "p," "r," "s," "t," double "u," "v," "x," "y," "y," "t," "h," followed by an ellipsis. Aabddeefghiijklmnooprstuuvxyyth...

Upon closer inspection, we notice that the string consists mainly of letters from the English alphabet, with a few notable exceptions. The string begins with "A" and "a" is not present, however, there are two "A"s. There are also consecutive letters in the alphabet missing; for example, there are no "Q", "Z". Upon closer inspection, we notice that the string

In computing, this could be output from a broken UTF-8 decoder, or a hash fragment. For example, it resembles a base64 string missing padding. In computing, this could be output from a

"Keyword squatting" on nonsense strings to see how quickly a unique term can be indexed and ranked. The Phonetic Breakdown

Menu