Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-63-powerful-digit-counts.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

1.0 KiB

id, challengeType, title, forumTopicId
id challengeType title forumTopicId
5900f3ab1000cf542c50febe 5 Problem 63: Powerful digit counts 302175

Description

The 5-digit number, 16807 = 75, is also a fifth power. Similarly, the 9-digit number, 134217728 = 89, is a ninth power.

How many n-digit positive integers exist which are also an nth power?

Instructions

Tests

tests:
  - text: <code>powerfulDigitCounts()</code> should return a number.
    testString: assert(typeof powerfulDigitCounts() === 'number');
  - text: <code>powerfulDigitCounts()</code> should return 49.
    testString: assert.strictEqual(powerfulDigitCounts(), 49);

Challenge Seed

function powerfulDigitCounts() {
  // Good luck!
  return true;
}

powerfulDigitCounts();

Solution

// solution required