String Matching Problem

Given 2 string a and b , find whether we can find b in string a if we are allowed to ignore at most k characters in string a.

Find the position where the string b occurs as a substring of a. If it is >k , then No else Yes

I don’t think salman3007 means b to be a substring of a.
Rather I believe that the question is ignoring any number of letters less than k is it possible to read string a as string b.
For example for a = “fierce” and b = “fce” and k = 3, the answer would be yes since we can remove the 3 letters i, e, r from string a.