Please explain this question

#1

i am not able to understand this question.

#2

This an advanced version of keypad recursion, If u are familiar with https://hack.codingblocks.com/app/contests/786/p/356

this can be just done in a similar fashion.
If not so, please try this once then continue.
SO input is a string
we have a preinitialised array searchIn [].
For the input string say temp, we find all the combination that can be made as we made in the keypad recursion problem.
eg: 26
am an ao bm bn bo cm cn co
So just check in which all string of searchIn[] any of these combination is present, if present put it in a vector and finally o/p that.

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