Not able to proceed further

#1

I get the question is indirectly asking us to find the maximum number of prime numbers possible in the given string without overlapping but I am not able to convert this into a code.
So I decided to break the problem into two parts-Find prime numbers and second eliminate overlapping prime numbers
I know the code to find prime numbers but facing problem with the second part

#2

@sunidhi10bamity,
It is not prime numbers.

  1. 0 and 1 are not a CB number.
  2. 2,3,5,7,11,13,17,19,23,29 are CB numbers.
  3. Any number not divisible by the numbers in point 2( Given above) are also CB numbers.

Check for divisibility with only numbers given in 2.

Approach:

  1. check for all sub-strings of the given string of digits, starting from the all strings of length 1 and then gradually checking for the strings of increasing size:

1.1. check if the sub-string is CB number: for this, create a function
1.1.1. if sub-string is 1 or 0 return false.
1.1.2. if sub-string is any of the {2,3,5,7,11,13,17,19,23,29}, then return true.
1.1.3. if sub-string is divisible by any of the {2,3,5,7,11,13,17,19,23,29}, then return false.
1.1.4. return false

1.2. now if it is a substring:
1.2.1. call a function that marks the index as visited for indexes which are part of that CB number.

1.3. increment the count for CB number.

  1. Print the count
#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.