#3460 - Longest Common Prefix After at Most One Removal

Medium • View on LeetCode • View on GitHub

Problem Description

You are given two strings s and t.

Return the length of the longest common prefix between s and t after removing at most one character from s.

Note: s can be left without any removal.

Solution

/**
 * @param {string} s
 * @param {string} t
 * @return {number}
 */
var longestCommonPrefix = function(s, t) {
  let i = 0;
  let j = 0;
  let result = 0;
  let isRemoved = false;

  while (i < s.length && j < t.length) {
    if (s[i] === t[j]) {
      i++;
      j++;
      result++;
    } else if (isRemoved) {
      return result;
    } else {
      isRemoved = true;
      i++;
    }
  }

  return result;
};