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.

Be the first one to answer
Select
Add answer anonymously...

Top SDE-2 Interview Questions Asked at JPMorgan Chase & Co.

Q. Design a parking system for a parking lot. The parking lot has three kinds of pa...read more
Q. Given a string s, find the number of substrings without repeating characters.
Q. Debugging a Java Code
SDE-2 Interview Questions
Stay ahead in your career. Get AmbitionBox app
play-icon
play-icon
qr-code
Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+

Reviews

10L+

Interviews

4 Cr+

Salaries

1.5 Cr+

Users

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2025 Info Edge (India) Ltd.

Follow Us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter
Profile Image
Hello, Guest
AmbitionBox Employee Choice Awards 2025
Winners announced!
awards-icon
Contribute to help millions!
Write a review
Write a review
Share interview
Share interview
Contribute salary
Contribute salary
Add office photos
Add office photos
Add office benefits
Add office benefits