Forming palindrome using at most one deletion in JavaScript

Problem

We are required to write a JavaScript function that takes in a string, str, as the first and the only argument.

Our function may delete at most one character from the string str and we are required to check whether we can make it a palindrome doing so.

For example, if the input to the function is

Input

const str = 'dr.awkward';

Output

const output = true;

Output Explanation

Because if we delete ‘.’ from the string,

Example

Following is the code −

 Live Demo

const str = 'dr.awkward';
const validPalindrome = (str = '') => {
   const valid = (left, right) => {
         for (let i = left; i <= Math.floor((left + right) / 2); i++) {
         if (str[i] !== str[right - (i - left)]) {
            return false
         }
      }
      return true
   }
   for (let i = 0; i <= Math.floor(str.length / 2); i++) {
      const right = str.length - 1 - i
      if (str[i] !== str[right]) {
         return valid(i, right - 1) || valid(i + 1, right)
      }
   }
   return true
}
console.log(validPalindrome(str));

Output

true

AmitDiwan

Published on 24-Apr-2021 10:25:17

• Related Questions & Answers
• Finding the maximum number using at most one swap in JavaScript
• Smallest number formed by shuffling one digit at most in JavaScript
• Form the largest number using at most one swap operation C++
• Form the smallest number using at most one swap operation in C++
• Match any string containing at most one p.
• Forming string using 0 and 1 in JavaScript
• Maximum sum subarray removing at most one element in C++
• Forming the nearest time using current time in JavaScript
• Forming the longest word in JavaScript
• Maximum Subarray Sum with One Deletion in C++
• C++ program to find string with palindrome substring whose length is at most k
• Program to check linked list items are forming palindrome or not in Python
• Maximize the maximum subarray sum after removing at most one element in C++
• Program to check if binary string has at most one segment of ones or not using Python
• Counting pairs when a person can form pair with at most one in C++