Word Predecessor presented by Easy LeetCode

function isPredecessor(wordA: string, wordB: string) {
  if (wordB.length - wordA.length !== 1) return false;

  for (let i = 0, j = 0; i < wordA.length && j < wordB.length; i++, j++) {
    while (wordB[j] !== wordA[i]) {
      j++;

      if (j > i + 1 || j > wordB.length - 1) {
        return false;
      }
    }
  }

  return true;
}

Use Word Predecessor on LeetCode

Copy this snippet and paste it to the bottom of your LeetCode editor so that you can use the Word Predecessor.

Don’t use it where the problem itself is to implement a Word Predecessor.