Skip to content
New issue

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

incomplete solution in 2-starting-out for rotate #12

Open
scottnm opened this issue Dec 21, 2018 · 0 comments
Open

incomplete solution in 2-starting-out for rotate #12

scottnm opened this issue Dec 21, 2018 · 0 comments

Comments

@scottnm
Copy link

scottnm commented Dec 21, 2018

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 be n mod (length list)

@scottnm scottnm changed the title incorrect solution in 2-starting-out incomplete solution in 2-starting-out for rotate Dec 21, 2018
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant