Is Subsequence LeetCode solution in JavaScript

1
/**
2
* @param {string} s
3
* @param {string} t
4
* @return {boolean}
5
*/
6
var isSubsequence = function (s, t) {
7
for (let i = 0, n = s.length; i < n; i++)
8
if (t.includes(s[i])) t = t.slice(t.indexOf(s[i]) + 1);
9
else return false;
10

11
return true;
12
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0