#3765

Complete Prime Number

expert · 1055 · lc medium +32 · 37% accepted · 47 likes · top 15%

Description

Given an integer num, determine whether it is a Complete Prime Number — meaning every prefix (first k digits) and every suffix (last k digits) of num is itself prime, where single-digit numbers qualify only if they are prime — and return true if so, otherwise false.

Code

1

2

3

class Solution:
    def completePrime(self, num: int) -> bool:

class Solution:
    def completePrime(self, num: int) -> bool: