Question for Project Euler 30

[opcleaver0]

Tell us what’s happening:
The code I have here is correct to case n=3 and n=4, but it is not correct for n=5 for some reason. Can someone help identify the error here? (Please ignore the “infinite loop” btw)

Code

function digitnPowers(n) {
var totalSum = 0;
for(let i = 2**n; i<9**(n+1); i++) {
  var numList = String(i).split("");
  var currNum = i;
  for(let j = 0; j<numList.length; j++) {
    currNum -= parseInt(numList[j])**n;
  }
  if(currNum===0) {
    totalSum += i;
  }
}
return totalSum;
}

digitnPowers(5);

Challenge: Problem 30: Digit n powers

Link to the challenge:

freeCodeCamp.org

[JeremyLT]

This code is passing for me…

[opcleaver0]

Does my laptop just have a low processing speed…?

[JeremyLT]

You can trim some time by failing early if the sum exceeds the target number.

[opcleaver0]

Adding a new if clause in the for loop kind of exacerbate the problem. I am trying some alternative method. Maybe artificially decrease the range.

[JeremyLT]

No, adding a ‘new clause’ in the loop makes the problem better, if you do it correctly. I know because I’ve done it and it works.

[JeremyLT]

You can also pre-compute the powers of each digit. There are only 10 powers possible.