Files
freeCodeCamp/curriculum/challenges/english/99-dev-playground/daily-coding-challenges-javascript/javascript-challenge-10.md

1.1 KiB

id, title, challengeType, dashedName
id title challengeType dashedName
681cb1b0dab50c87ddb2e51b JavaScript Challenge 10: 3 Strikes 28 javascript-challenge-10

--description--

Given an integer between 1 and 10,000, return a count of how many numbers from 1 up to that integer whose square contains at least one digit 3.

--hints--

squaresWithThree(1) should return 0.

assert.equal(squaresWithThree(1), 0);

squaresWithThree(10) should return 1.

assert.equal(squaresWithThree(10), 1);

squaresWithThree(100) should return 19.

assert.equal(squaresWithThree(100), 19);

squaresWithThree(1000) should return 326.

assert.equal(squaresWithThree(1000), 326);

squaresWithThree(10000) should return 4531.

assert.equal(squaresWithThree(10000), 4531);

--seed--

--seed-contents--

function squaresWithThree(n) {

  return n;
}

--solutions--

function squaresWithThree(n) {
  let count = 0;

  for (let i = 1; i <= n; i++) {
    const square = i * i;
    if (square.toString().includes('3')) {
      count++;
    }
  }

  return count;
}