for the string s at 0.

Iterate through each word in words:

For each character in the word, check if it matches s[i].
If any character does not match or if i exceeds the length of s, return false.
Increment i for each matched character.
If i reaches the length of s, return true (all of s matched).

If the loop ends and i is not equal to the length of s, return false.

Edge cases:

[{"language":"C++","code":"class Solution {\npublic:\n    bool isPrefixString(string s, vector<string>& words) {