We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
rotate's solution is rotate n l = drop n l ++ take n l
rotate n l = drop n l ++ take n l
this doesn't take into account rotations larger than the length of the list.
occurrences of n should be n mod (length list)
n
n mod (length list)
The text was updated successfully, but these errors were encountered:
No branches or pull requests
rotate's solution is
rotate n l = drop n l ++ take n l
this doesn't take into account rotations larger than the length of the list.
occurrences of
n
should ben mod (length list)
The text was updated successfully, but these errors were encountered: