Project Euler #106: Special subset sums: meta-testing

  • + 0 comments

    I agree this is far from easy. As we progress in this series the difference in difficulty between the projecteuler.net problem and the hackerrank problem becomes vast. I can solve the first version easily using simple methods and then sweat for days or weeks to meet the performance constraints of the latter, often with a completely different solution approach. This one for example nearly made me quit.