Camelcase Matching LeetCode solution in JavaScript

1
var camelMatch = function (queries, pattern) {
2
  function camelMatch(q, p) {
3
    let qlist = [];
4
    let plist = [];
5
    for (let a of q) if (a <= "Z") qlist.push(a);
6
    for (let a of p) if (a <= "Z") plist.push(a);
7
    return plist.join("") === qlist.join("");
8
  }
9
  function seqMatch(q, p) {
10
    if (!camelMatch(p, q)) return false;
11
    let pi = 0;
12
    for (let qi = 0; qi < q.length; qi++) {
13
      if (pi < p.length && p[pi] === q[qi]) pi++;
14
    }
15
    return pi === p.length;
16
  }
17

18
  return queries.map((q) => seqMatch(q, pattern));
19
};