maximumRemovals1 = function(s, p, removable) {
  let k = 0;
  // removable.reverse();
  s = s.split('');
  p = p.split('');

  for (let i = 0; i < removable.length; i++) {
    s[removable[i]] = -1;
    if (isSubSet1(s, p)) {
      k++;
      continue;
    } 
    return k;
  }

  return k;
}
https://leetcode.com/problems/maximum-number-of-removable-characters/

Brute force
Time O(removable.length * s.length) | Space O(n)
@param {string} s
@param {string} p
@param {number[]} removable
@return {number}