Take the n last elements and prepend them to the beginning of the list.
Unflatten the matrix.
-- In haskell strings are lists of chars, so "abcd" is the same as ['a','b','c','d'] but shorter to type.shift1["abcd","1234","code","blah"]-- [ "habc", "d123", "4cod", "ebla" ]
Haskell
Basically the algorithm is as follows:
simple. 👍🏿
i still feel like Haskell has too many non-alpha characters in the syntax set. 🙄
Haha, yeah, it's marginally easier once you get used to them though.
i'll take your word for it and stay in my (((safe (space)))) for now . . .
🤗