Suffix Stream

Solve a hard-level problem of identifying word suffixes from a stream of characters.

Problem statement

Given an array of strings called words and a stream of letters S, check if a suffix of these letters is present as a string in the input array of words. If a non-empty suffix is present as a string, then return true; else, return false.

Example

Sample input

Get hands-on with 1400+ tech skills courses.