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.
This problem is frustrating not for its complexity; it's actually quite intriguing and interesting all the logic and optimizations you can go through. I went from several loops to consolidating down to a very concise setup, breaking down into combinatorics and factorials. But, the testcases are not scaled well, at all. None of my optimizations mattered until I found an exact algorithm in the OEIS. I wish I'd gotten some positive feedback from optimizing from n = 15 to n= 10000, but none of it mattered...
https://medium.com/andys-coding-blog/project-euler-106-subset-sums-meta-testing-e5b222c5a45e
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 →
This problem is frustrating not for its complexity; it's actually quite intriguing and interesting all the logic and optimizations you can go through. I went from several loops to consolidating down to a very concise setup, breaking down into combinatorics and factorials. But, the testcases are not scaled well, at all. None of my optimizations mattered until I found an exact algorithm in the OEIS. I wish I'd gotten some positive feedback from optimizing from n = 15 to n= 10000, but none of it mattered... https://medium.com/andys-coding-blog/project-euler-106-subset-sums-meta-testing-e5b222c5a45e