Problem Brief

Find Words in String Not in Subsequence (MLE :)

NEW GRADOA

See Salesforce online assessment and hiring insights

Given two strings s and t, where t is a subsequence of s. This means that the words in t appear in s in the same order but not necessarily consecutively.

Your task is to find the words in s that are not in t, and output them in their original order.

1Example 1

Input

s = "I like cheese", t = "like"

Output

["I", "cheese"]

Explanation

These words are in s but not part of t.

Draft autosaves locally

public String[] findWordsNotInSubsequence(String s, String t) {
  // write your code here
}

Input

"I like cheese"

"like"

Output

["I", "cheese"]