Question
Problem 1: Implement a function that determines if a word is palindrome. Examples of palindrome words: abba, Anna, Kayak. The function must return TRUE when
Problem 1: Implement a function that determines if a word is palindrome. Examples of palindrome words: \abba", \Anna", \Kayak". The function must return TRUE when the word contains only a single character. The function must return TRUE when it received a palindrome word, and FALSE otherwise. The function should be case insensitive. Assume that words are only composed of both capital or lower-case letters. Hint: Use the tolower() or toupper() functions declared in ctype.h. See http://examples.yourdictionary.com/palindrome-examples.html for single word palindrome examples.
The function must have the following properties: 1. Name: IsPalindrome
2. Return type: int
3. Input type: Non-mutable pointer to a string (i.e., a constant string).
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started