Open vcnovaes opened 2 years ago
🚨Please review the guidelines for contributing to this repository.
This is a solution for the problem summation triangle of the Code Wars site: Summation Triangle - Code Wars
Above you have the problem description!
In this code we have two solutions but only the pg_approach(unsigneed n) is accepted by CodeWars, the brute_force(int n) approach fails in terms of complexity, so it's not accepted by CodeWars, but it gives the right results :heart: Thank you!
pg_approach(unsigneed n)
brute_force(int n)
Your checklist for this pull request
🚨Please review the guidelines for contributing to this repository.
Description
This is a solution for the problem summation triangle of the Code Wars site: Summation Triangle - Code Wars
Above you have the problem description!
In this code we have two solutions but only the
pg_approach(unsigneed n)
is accepted by CodeWars, thebrute_force(int n)
approach fails in terms of complexity, so it's not accepted by CodeWars, but it gives the right results :heart: Thank you!