Ad
  • Default User Avatar

    It looks like there's no upper bound for n dependent on the sequence length. In this case solutions like this can crash with out-out-range item access at large ns. Either tests with large ns or the upper bound for n should be added. (There are no such tests at least in Rust.)

  • Custom User Avatar

    Haskell translation

    Please note I have updated the description: use double quotes for strings because Haskell reserves single quotes for single characters, moved the section explaining de Bruijn sequences up top, and minor updates to spelling, grammar and markup. If you disagree with any change, it can be changed again.