Tap here to switch tabs
Problem
Submissions

Problem: Complete Prime Number

Complete Prime Number checks whether every prefix and suffix of a given positive integer is prime, returning true only when all numbers formed from its decimal digits meet that condition.

Statement

An integer num is defined as a complete prime number if every prefix and every suffix formed by its decimal representation is a prime number.

Given an integer num, return true if num is a complete prime number, or false otherwise.

Constraints:

  • 1≤1 \leq num ≤109\leq 10^9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Complete Prime Number

Complete Prime Number checks whether every prefix and suffix of a given positive integer is prime, returning true only when all numbers formed from its decimal digits meet that condition.

Statement

An integer num is defined as a complete prime number if every prefix and every suffix formed by its decimal representation is a prime number.

Given an integer num, return true if num is a complete prime number, or false otherwise.

Constraints:

  • 1≤1 \leq num ≤109\leq 10^9