Please provide hint

#1

unable to get idea to solve

#2

hello @kartik-malik

this problem is based on greedy apporach ,where we will try to find all cb number of length 1 and mark them visited . and then all cb number of length 2 from unvisited charatcer … so on .

image

#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.