freeCodeCamp/problem-112-bouncy-numbers.english.md at ce63de866cb47ef13145a9bb0caf8708b669a4e5

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.5 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f3dd1000cf542c50feef	5	Problem 112: Bouncy numbers

Description

Working from left-to-right if no digit is exceeded by the digit to its left it is called an increasing number; for example, 134468. Similarly if no digit is exceeded by the digit to its right it is called a decreasing number; for example, 66420. We shall call a positive integer that is neither increasing nor decreasing a "bouncy" number; for example, 155349. Clearly there cannot be any bouncy numbers below one-hundred, but just over half of the numbers below one-thousand (525) are bouncy. In fact, the least number for which the proportion of bouncy numbers first reaches 50% is 538. Surprisingly, bouncy numbers become more and more common and by the time we reach 21780 the proportion of bouncy numbers is equal to 90%. Find the least number for which the proportion of bouncy numbers is exactly 99%.

Instructions

Tests

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

Challenge Seed

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

euler112();

Solution

// solution required

1.5 KiB Raw Blame History