We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
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.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #106: Special subset sums: meta-testing
You are viewing a single comment's thread. Return to all 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.