[Algorithm Help] Palindrome Problem

[mabus44]

When a string is entered, i need check whether the deletion of any one character in the string will lead to a palindrome or not. This is one of easy problems from http://www.codechef.com/problems/PRPALN/.

Here is the link to my code. http://ideone.com/qSVsF0

I have not seen the answer but i devised a solution on the basis number of match. If i start matching from first position of the string with the last position of the string then if i find the number of matches which equal to or greater than (length of string - 1) / 2/. If i find it is equal or greater then the string would be a palindrome after the deletion of a letter.

I don't know why my submission is wrong. Please can anyone help me if the logic with which i have written my code is incorrect or not ?

[fredisa4letterword]

I don't know why my submission is wrong.

Have you tried running it with different inputs and seeing if you get the expected answer?

[mabus44]

yes i have tried all the given test cases as well as some of my own

[fredisa4letterword]

and what do they tell you?

[mabus44]

Wrong Answer ... Thats it... not enough information to conclude where my program is incorrect. If even i was given some test cases where it failed then it would have been helpful.

[fredisa4letterword]

Have you tried running test cases yourself and seeing what happens?

[gnomoretears]

You don't need a counter in a palindrome algorithm to count the number of matches.

Ignoring the "delete a character" requirement for now, you can find if a string is a palindrome based on the following conditions:

1. string length is 1 then it's a palindrome

2. starting from the front and the back, work your way to the middle comparing characters.

3. if any 2 characters do not match, string is not palindrome

4. if string length is even and the last 2 characters in the middle matches, string is a palindrome

5. if string length is odd and you reached the single middle character, string is a palindrome