Project Euler Problems 101 to 200 - Problem 103: Special subset sums: optimum

Tell us what’s happening:
Hi guys, i’m stuck at this problem that I tried to figure it out.
How can I do this?

Your code so far

function optimumSpecialSumSet() {

  return true;
}

optimumSpecialSumSet();

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/114.0.0.0 Safari/537.36

Challenge: Project Euler Problems 101 to 200 - Problem 103: Special subset sums: optimum

Link to the challenge:

What have you tried so far?

Well, the text said, “Given that A is an optimum special sum set for n=7
, find its set string.” So, I tried to put string ‘20313839404245’ next to the word return, but it didn’t work. What should I do to fix this problem?

The tests won’t let you hard-code an answer, no.

What have you tried in terms of developing a process to solve the problem?

This topic was automatically closed 182 days after the last reply. New replies are no longer allowed.