human
Split the given string into Primes : Digit DP | Function to check whether a string is a prime number or not.
A recursive function to find the minimum number of segments the given string can be divided such that every segment is a prime.
If the number is null.
checkPrime function is called to check if the number is a prime or not ..
A very large number denoting maximum.
Consider a minimum of 6 and length since the primes are less than 10 ^ 6.
Recursively call the function to check for the remaining string.
Evaluating minimum splits into Primes for the suffix.
Checks if no combination found.
Driver code"
Solution in Python:
assistant
#Here is code to split the given string into Primes : Digit DP and the other steps required.
 def checkPrime ( number ) :
	num = int ( number )
	for i in range ( 2 , int ( num ** 0.5 ) ) :
		if ( ( num % i ) == 0 ) :
			return False
	return True
def splitIntoPrimes ( number ) :
	if ( number == ' ' ) :
		return 0
	if ( len ( number ) <= 6 and checkPrime ( number ) ) :
		return 1
	else :
		numLen = len ( number )
		ans = 1000000
		for i in range ( 1 , ( min ( 6 , numLen ) + 1 ) ) :
			if ( checkPrime ( number [ : i ] ) ) :
				val = splitIntoPrimes ( number [ i : ] )
				if ( val != - 1 ) :
					ans = min ( ans , 1 + val )
		if ( ans == 1000000 ) :
			return - 1
		return ans
print ( splitIntoPrimes ( "13499315" ) )
print ( splitIntoPrimes ( "43" ) )