Match a pattern and String without using regular expressions
A string and a pattern are given to you. You have to match the pattern and string without using regular expression.
Input:
Test Case T.
T no. of lines with the strings and patterns.
E.g.
3
abcbbabc
aba
Includehelp
aa
GreenRedYellowRed
GRYR
Output:
Print the character with their respectively representation.
Example
T= 3
Input:
String : abcbbabc
Pattern: aba
Output:
a → abc
b → bb
Input:
String : Includehelp
Pattern: aa
Output:
Matching not possible.
Input:
String : GreenRedYellowRed
Pattern: GRYR
Output:
G → Green
R → Red
Y → Yellow
Match a string with a pattern is a problem of combination and we will solve this problem with the backtracking process.
To solve this problem, we will follow this algorithm,
C++ implementation:
Output
need an explanation for this answer? contact us directly to get an explanation for this answer