Article Categories
- All Categories
-
Data Structure
-
Networking
-
RDBMS
-
Operating System
-
Java
-
MS Excel
-
iOS
-
HTML
-
CSS
-
Android
-
Python
-
C Programming
-
C++
-
C#
-
MongoDB
-
MySQL
-
Javascript
-
PHP
-
Economics & Finance
Selected Reading
Forming palindrome using at most one deletion in JavaScript
We need to write a JavaScript function that checks if a string can be made into a palindrome by deleting at most one character.
Problem
Given a string, determine if it can become a palindrome after removing at most one character. A palindrome reads the same forwards and backwards.
For example, with the input string 'dr.awkward', we can remove the '.' character to get 'drawkward', which is a palindrome.
Algorithm Approach
We use a two-pointer technique:
- Compare characters from both ends moving inward
- When we find a mismatch, try removing either the left or right character
- Check if the remaining substring is a palindrome
Example Implementation
const str = 'dr.awkward';
const validPalindrome = (str = '') => {
// Helper function to check if substring is palindrome
const isPalindrome = (left, right) => {
for (let i = left; i
true
true
false
Step-by-Step Breakdown
Let's trace through 'dr.awkward':
const traceExample = (str) => {
console.log(`Checking: "${str}"`);
for (let i = 0; i
Checking: "dr.awkward"
Comparing str[0] = 'd' with str[9] = 'd'
Comparing str[1] = 'r' with str[8] = 'r'
Comparing str[2] = '.' with str[7] = 'a'
Mismatch found! Trying to remove one character...
Test Cases
const testCases = [
'dr.awkward', // true - remove '.'
'racecar', // true - already palindrome
'abcdef', // false - cannot form palindrome
'a', // true - single character
'ab', // true - remove 'a' or 'b'
'abc' // false - cannot form palindrome
];
testCases.forEach(test => {
console.log(`"${test}" -> ${validPalindrome(test)}`);
});
"dr.awkward" -> true
"racecar" -> true
"abcdef" -> false
"a" -> true
"ab" -> true
"abc" -> false
Time and Space Complexity
| Aspect | Complexity | Explanation |
|---|---|---|
| Time | O(n) | Single pass through string, constant work per character |
| Space | O(1) | Only using variables, no additional data structures |
Conclusion
The two-pointer approach efficiently solves the palindrome problem with at most one deletion in O(n) time. When characters don't match, we test both deletion possibilities to determine if a palindrome can be formed.
Advertisements
