Given a string. The task is to check if the string is a palindrome or not using pointers. You are not allowed to use any built-in string functions.
A string is said to be a palindrome if the reverse of the string is same as the original string. For example, “madam” is palindrome because when the string is reversed same string is achieved, but “Madam” is not a palindrome.
Input: str = "Madam" Output: String is not a Palindrome. Input: str = "madam" Output: String is Palindrome. Input: str = "radar" Output: String is Palindrome.
- Take two pointers say, ptr and rev.
- Initialize ptr to the base address of the string and move it forward to point to the last character of the string.
- Now, initialize rev to the base address of the string and start moving rev in forward direction and ptr in backward direction simultaneously until middle of the string is reached.
- If at any point the character pointed by ptr and rev does not match, then break from the loop.
- Check if ptr and rev crossed each other, i.e. rev > ptr. If so, then the string is palindrome otherwise not.
Below is the implementation of the above approach:
String is Palindrome
Want to learn from the best curated videos and practice problems, check out the C Foundation Course for Basic to Advanced C.