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.

Sign up for GitHub

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

Jump to bottom

Greedy/Sherlock and the Beast is a Diophantine equation which can be solved without loops. #240

Open

jeffreydwalter opened this issue Jan 29, 2019 · 1 comment

jeffreydwalter commented Jan 29, 2019

I have implemented this solution in Go in this PR: #239

You guys might want to update the java solution to match. :)

Author

jeffreydwalter commented Jan 29, 2019

I would also note that the mathematical solution is O(1), not O(n) like the currently listed solution.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment