for this problem can someone please tell where i am wrong ?? My thinking approach -----> if i find the length of LCS (Longest Common Subsequence) and then find Remain Length i.e. total — Lcs . after this i iterate over Patter (p) and if i found * i return true and if there is not any * we will take count of ? and subtract that with remaining length . Now if remaining length become 0 we return true else false ..

But this solution fails .... someone please explain why this wrong thinking ??