freeCodeCamp/curriculum/challenges/arabic/08-coding-interview-prep/project-euler/problem-158-exploring-strings-for-which-only-one-character-comes-lexicographically-after-its-neighbour-to-the-left.arabic.md

id	challengeType	title	videoUrl	localeTitle
5900f40a1000cf542c50ff1d	5	Problem 158: Exploring strings for which only one character comes lexicographically after its neighbour to the left

Description

undefined

Instructions

undefined

Tests

tests:
  - text: ''
    testString: 'assert.strictEqual(euler158(), 409511334375, "<code>euler158()</code> should return 409511334375.");'

Challenge Seed

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

euler158();

Solution

// solution required