Given an integer, identify and extract all non-empty consecutive digit substrings that represent prime numbers. Print all such prime substrings in order. If no prime substrings exist, output "No prime combo".
Example 1:
Input: 359
Output: 3 5 59 359
Example 2:
Input: 446
Output: "No prime combo"
Step 1: Convert Number to String
Step 2: Generate Substrings
Step 3: Convert Substring to Integer
Step 4: Check If the Number is Prime
Step 5: Collect and Print Primes

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is the purpose of the return keyword?