Company: Ion group_26july
Difficulty: medium
Missing Words Problem Description Given two strings, one is a subsequence if all of the elements of the first string occur in the same order within the second string. The elements do not have to be contiguous in the second string, but order must be maintained. For example, given the string 'I like cheese', the words ('I', 'cheese') are one possible subsequence of that string. Words are space delimited. Given two strings, s and t , where t is a subsequence of s , report the words of s that are missing in t (case sensitive), in the order they are missing. Complete the function missingWords in the editor with the following parameter(s): string s : a sentence of space-separated words string t : a sentence of space-separated words Returns: string[] : all words in s that are missing from t , in the order they occur within s Examples Example 1: Input: s = "I am using HackerRank to improve programming", t = "I am HackerRank to improve" Output: ["using", "programming"] Explanation: The missing