|All-time Popular Problems|
|Construct Tree from Inorder & Preorder|
|Sum of two large numbers|
|Level order traversal in spiral form|
|Spirally traversing a matrix|
|Angle between hour and minute hand|
|Binary Tree to DLL|
|Smallest Positive missing number|
|Height of Binary Tree|
|Largest Number formed from an Array|
Given a text 'str' and a wildcard pattern 'pattern',your task is to complete the function wildcard that returns '1' if the wildcard pattern is matched with text else returns '0'.The function takes two strings as arguments 'str' and 'pattern'.
The wildcard pattern can include the characters ‘?’ and ‘*’
‘?’ – matches any single character
‘*’ – Matches any sequence of characters (including the empty sequence)
Text = "baaabab", Pattern = “*****ba*****ab", output : true Pattern = "baaa?ab", output : true Pattern = "ba*a?", output : true Pattern = "a*ab", output : false
Note: The matching should cover the entire text (not partial text).
The first line of input will contain no of test cases T . Then T test cases follow . Each test case contains 2 lines. The first line of each test case represent a string pat denoting the pattern and the next line contains string str .
Output will be 1 if the string follows the pattern else it will be 0.
1<=length of(str,pat) <=50