Occurrences After Bigram LeetCode solution in JavaScript

1
var findOcurrences = function (text, first, second) {
2
  let result = [];
3
  let txt = text.split(" ");
4
  for (let i = 0; i < txt.length - 2; i++) {
5
    if (txt[i] === first && txt[i + 1] === second) result.push(txt[i + 2]);
6
  }
7
  return result;
8
};