The minimal superpermutation problem asks how many symbols a string must have before it contains all $n!$ permutations of $\{1,\ldots,n\}$ as substrings. The Haruhi problem asks for the most efficient way to watch the anime ``The Melancholy of Haruhi Suzumiya'' in every way possible. Remarkably, these two problems turn out to be equivalent. Even more remarkably, the anime community has made more progress on this problem than the mathematicians! In this talk we will discuss an improved lower bound to the minimal superpermutation problem that was recently discovered on 4chan, as well as the anime theoretic motivation for considering this problem. As time permits we will also briefly discuss De Brujin sequences. This talk will be entirely self contained and assume no prior knowledge of anime.