Given a dictionary of words where each word follows CamelCase notation, print all words in the dictionary that match with a given pattern consisting of uppercase characters only.
CamelCase is the practice of writing compound words or phrases such that each word or abbreviation begins with a capital letter. Common examples include: “PowerPoint” and “WikiPedia”, “GeeksForGeeks”, “CodeBlocks”, etc.
The first line of input contains an integer T denoting the number of test cases. Then the description of T test cases follow. Each test case contains an integer n denoting the number of words in the dictionary. The next line contains the vector of strings in the dictionary. The last line contains the pattern.
Print all words in the dictionary that match with a given pattern consisting of uppercase characters only. If pattern is not found, print "No match found" (without quotes).
1<=length of string<=100
1<=length of patter<=length of string<=100
Hi Hello HelloWorld HiTech HiGeek HiTechWorld HiTechCity HiTechLab
WelcomeGeek WelcomeToGeeksForGeeks GeeksForGeeks
No match found