Approach to problem

#1

how to approach to this problem?

#2

According to the Problem the work is to find the Max CB numbers from the given number.

  • As to work on substrings of the given number, we will capture the element into the String instead of integer .
  • The number ‘n’ given is nothing to do with our approach(as we are working on String) but can be useful according to your approach.
    Intuition to solve this problem:
  • Put loop on string that will give substring of every length.
  • create a function that will return true if the passed number is a CB number otherwise return false.
  • To put a check if the digit is already a part of the any other CB number, create an boolean array say, valid which store which digits till now has been a part of any other CB number.
  • Take a counter and increment if a CB number is found.
  • At the end print the count.
#3

https://ide.codingblocks.com/s/224786 i’m getting 3 test-case fail, what’s the issue ?

#4

At line 38 you are checking status only for first element of substring, instead check for the whole substring.

#5

i did the change but its still not working.

#6

You are checking substrings in the wrong manner. You need to firstly check substrings of length 1, then of length 2 and so on to get maximum CB numbers.