If the Given Prefix can be split into Primes then for the remaining String from i to j Check if Prime . If yes calculate the minimum split till j
if ( splitDP [ i ] != - 1 ) { for ( let j = 1 ; j <= 6 && i + j <= numLen ; j ++ ) {