Halloween Sale
Unlock all premium questions for over 30% off
Find Unused Subsequence Words
Easy
Question
You are given two strings, s and t, each holding a sentence of words separated by spaces. The words of t are guaranteed to form a subsequence of the words of s: they appear in s in the same order, though not necessarily next to each other.
...
Asked at:IBM
More IBM interview questions
- Count Mismatched Sale Priceseasy
- Minimum Device Purchase Costeasy
- Largest Number Using Parity Swapsmedium
- Largest Bounded XORmedium
- Earliest Target Reach Timeeasy
- Smallest Nondecreasing Incrementeasy
- Maximum Distinct Split Scoreeasy
- Maximum Test Window Efficiencymedium
OfferRetriever
Master technical interviews with real questions from top companies. Build your confidence and career.
LEGAL
© 2026 Purple Business Holdings LLC. All rights reserved. See Terms of Service.