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.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #106: Special subset sums: meta-testing
  4. Discussions

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

Problem
Submissions
Leaderboard
Discussions

Sort 2 Discussions, By:

recency

Please Login in order to post a comment

  • sam_m_ramsey
    1 year ago+ 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|
    Permalink
  • phbnhien
    3 years ago+ 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
    0|
    Permalink

No more comments

Need Help?


View top submissions
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy