Question
To check whether a given string is palindrome or not.
Answer :
Word Count : 253
______ _______ _____ _______ _________ _______ _________ __________ ________ ________.
_________ ___ __________ ____ _________ __________ ___.
________ ________ _____ ___ ___ __________ __________ ________ ___ _________ ____ _____.
______ _____ _______ ____ ______ __________ ___.
_____ ___ _________ _______ ________.
____ __________ _____ ______ ______.
___ __________ __________ ______ __________ __________.
___ _____ ____ _______ ____ ________ _______ _______ __________ _____ ______.
_____ ________ ____ ______ ____ ________ ________ ______ __________ __________ __________.
__________ _______ __________ ______ __________ _____ ________ ______.
______ _____ ______ _______ _____ ________ ___ ______ _____ ______.
_________ __________ _______ ____ ____ __________ _______ ______ ____ ______.
____ ________ ______ ____ _____ ____ _______ ______ ___ ________.
_________ ______ _______ __________ _____ ______ _________.
_______ _____ _______ ______ __________ ______ ___.
__________ _________ __________ _____ _______ ____ ____.
___ __________ _____ _______ ________ _______ ______ _____ _________ ________.
___ ____ ________ ________ ___ _________.
Skip in 10
To check whether a given string is a palindrome in programming, you can follow a few common approaches. A palindrome is a string that reads the same forward and backward, like "radar" or "level". One approach is using a loop to compare characters from the start and end. Initialize two pointers, one at the beginning (index 0) and one at the end (index length-1) of the string. Compare the characters at these positions. If they match, move the start pointer forward and the end pointer backward. Repeat this until the pointers meet or cross each other. If all characters
______ ____ ____ _____ _______.______ _______ _____ _______ _________ _______ _________ __________ ________ ________.
_________ ___ __________ ____ _________ __________ ___.
________ ________ _____ ___ ___ __________ __________ ________ ___ _________ ____ _____.
______ _____ _______ ____ ______ __________ ___.
_____ ___ _________ _______ ________.
____ __________ _____ ______ ______.
___ __________ __________ ______ __________ __________.
___ _____ ____ _______ ____ ________ _______ _______ __________ _____ ______.
_____ ________ ____ ______ ____ ________ ________ ______ __________ __________ __________.
__________ _______ __________ ______ __________ _____ ________ ______.
______ _____ ______ _______ _____ ________ ___ ______ _____ ______.
_________ __________ _______ ____ ____ __________ _______ ______ ____ ______.
____ ________ ______ ____ _____ ____ _______ ______ ___ ________.
_________ ______ _______ __________ _____ ______ _________.
_______ _____ _______ ______ __________ ______ ___.
__________ _________ __________ _____ _______ ____ ____.
___ __________ _____ _______ ________ _______ ______ _____ _________ ________.
___ ____ ________ ________ ___ _________.
IGNOU ACADEMY
Your IGNOU journey, made easier.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
Continue Reading — It's Free
Sign in with Google to unlock more of this answer.
✓ Free access
✓ Unlock up to 60% of the answer
✓ No payment required
✓ Unlock up to 60% of the answer
✓ No payment required
Quick Google sign-in. No separate registration form.