Given a text and a wildcard pattern,
implement wildcard pattern matching algorithm that finds if wildcard pattern is matched with text.
The matching should cover the entire text (not partial text).
The wildcard pattern can include the characters ? and *.
? – matches any single character
– Matches any sequence of characters (including the empty sequence)
Copyright Notice
This problem is based on content
from GeeksforGeeks
written by Aditya Goel
and subject to GeeksforGeeks copyright.
The original content from GeeksforGeeks and any modifications made here are attributed to GeeksforGeeks contributors,
and this work is shared under CC BY-SA 4.0.