You have to write a function whose prototype is given bellow. this function
will accept two char * named subject and pattern. for example
subject=abracadbra
and pattern=bca.now it should check occurrences of all chars of string
pattern in subject . If any match occurs then it will remove that char
Is this your college assignment?
On Aug 7, 9:00 pm, Arulanandan P [EMAIL PROTECTED] wrote:
You have to write a function whose prototype is given bellow. this function
will accept two char * named subject and pattern. for example
subject=abracadbra
and pattern=bca.now it should check
Hi
this is the problem :
How many strings with length N that contains Only 0 and 1 exist that
not contains a specific pattern with length K
input isa string with length k and k and N .
thanks and Good luck ;)
--~--~-~--~~~---~--~~
You received this
You could do this a lot of ways, but I'd use a char array[] with a
size equal to the length of the subject string (including the end of
string null char '\0').
Then copy the subject string into the array[]. This would be the
working array[], where char's are deleted as they're found in the
