freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-99-largest-exponential.english.md

id, challengeType, title

id	challengeType	title
5900f3d01000cf542c50fee2	5	Problem 99: Largest exponential

Description

Comparing two numbers written in index form like 211 and 37 is not difficult, as any calculator would confirm that 211 = 2048 < 37 = 2187. However, confirming that 632382518061 > 519432525806 would be much more difficult, as both numbers contain over three million digits. Using base_exp.txt (right click and 'Save Link/Target As...'), a 22K text file containing one thousand lines with a base/exponent pair on each line, determine which line number has the greatest numerical value. NOTE: The first two lines in the file represent the numbers in the example given above.

Instructions

Tests

tests:
  - text: <code>euler99()</code> should return 709.
    testString: assert.strictEqual(euler99(), 709, '<code>euler99()</code> should return 709.');

Challenge Seed

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

euler99();

Solution

// solution required