freeCodeCamp/curriculum/challenges/arabic/08-coding-interview-prep/project-euler/problem-37-truncatable-primes.arabic.md

id	challengeType	title	videoUrl	localeTitle
5900f3911000cf542c50fea4	5	Problem 37: Truncatable primes

Description

undefined

Instructions

undefined

Tests

tests:
  - text: ''
    testString: 'assert(truncatablePrimes(8) == 1986, "<code>truncatablePrimes(8)</code> should return 1986.");'
  - text: ''
    testString: 'assert(truncatablePrimes(9) == 5123, "<code>truncatablePrimes(9)</code> should return 5123.");'
  - text: ''
    testString: 'assert(truncatablePrimes(10) == 8920, "<code>truncatablePrimes(10)</code> should return 8920.");'
  - text: ''
    testString: 'assert(truncatablePrimes(11) == 748317, "<code>truncatablePrimes(11)</code> should return 748317.");'

Challenge Seed

function truncatablePrimes(n) {
  // Good luck!
  return n;
}

truncatablePrimes(11);

Solution

// solution required