Add O(1) optimized solution for Project Euler Problem 6 #1485

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

Open

KRiSHnA88H wants to merge 1 commit into TheAlgorithms:master from KRiSHnA88H:add-o1-solution-problem-6

KRiSHnA88H commented Sep 16, 2025

Description

This PR adds an O(1) optimized solution for Project Euler Problem 6 in C.
It uses the mathematical formulas:

Sum of squares = n(n+1)(2n+1)/6
Square of sum = (n(n+1)/2)^2

Changes

Added new file o(1)sol.c in project_euler/problem_6/
Provides a faster O(1) implementation compared to iterative methods
Included comments and example usage for better understanding

Example

Input:
100

Output:
25164150

Notes

Uses long long to avoid overflow for larger values of n
Code is well-documented to support educational use

Thank you for reviewing this contribution 🚀


          Add O(1) optimized solution for Project Euler Problem 6

74871c8

KRiSHnA88H requested review from Panquesito7, tjgurwara99 and alexpantyukhin as code owners

September 16, 2025 14:22

mindaugl approved these changes

View reviewed changes

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

Reviewers

Panquesito7 Awaiting requested review from Panquesito7 Panquesito7 is a code owner

tjgurwara99 Awaiting requested review from tjgurwara99 tjgurwara99 is a code owner

alexpantyukhin Awaiting requested review from alexpantyukhin alexpantyukhin is a code owner

1 more reviewer

mindaugl mindaugl approved these changes

At least 1 approving review is required to merge this pull request.

Labels

None yet