Pattern Matching Problem Statement

Given a pattern as a string and a set of words, determine if the pattern and the words list align in the same sequence.

Input:

T (number of test cases)
For each test case:
pattern (a string), N (number of words)
words (N words separated by spaces)

Output:

Return 'True' for each test case in a new line if the sequence of words matches the order of characters in the pattern. Otherwise, return 'False'.

Example:

Input:
T = 1
pattern = 'abba', words = 'dog cat cat dog'

Output:
True

Constraints:

• 1 <= T <= 100
• 1 <= |pattern| <= 5000
• 1 <= N <= 5000
• 1 <= Length of each word <= 6

Note:

Ensure that your function handles the input correctly as the output will be auto collected.