Explain the question with test cases

#1

why CB doesnt provide good test cases , its worst test case , its not even telling what to do ,

expplain this question and also give good test case , which make clear condition in mind

#2

Hey @Himanshu-Jhawar-2273952536067590
consider this example
abcdefc
a*f?
we need to tell whether the given pattern match with input pattern or not.
some constraint that r given

  • -> it can match with any number of characters
    ? -> it can match with any one character.

input - >abcdefc
pattern-> a*f?
a bcdefc a *f?
a of input matched with a of pattern .

a bcde fc a*f?
bcde of input matched with * of pattern

abcde f c a* f ?
f of input matched with f of pattern

abcdef c a*f ?

c of input matched with ? of pattern

so this string is matched with the given pattern
First try the recursive solution then use dp