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.
Project Euler #106: Special subset sums: meta-testing
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.
+ 0 comments I lost my confidence because this is marked as easy.
Hints for those who come later:
- Your clever DP solution will score 0.00
- Your O(n) solution will score 0.00
- I got 100 after looking up some basic modular arithmetic and combining everything
No more comments
Sort 2 Discussions, By:
Please Login in order to post a comment