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 \leq$ num $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.