Find Whether Given String is palindrome or Not.

Objective : Write an algorithm to find Whether Given String is palindrome or Not.

Input:  A String,

Output: true or false on whether string is palindrome or not

Approach:

• Use recursive approach
• Compare first and last characters if they are not same- return false
• If they are same make, remove the first and last characters and make a recursive call. 

Example:

Jain niaJ => compare ‘J’ with ‘J’ =>returns true

ain nia => compare ‘a’ with ‘a’ =>returns true

in ni => compare ‘i’ with ‘i’ =>returns true

n n => compare ‘n’ with ‘n’ =>returns true

string length <2 => returns true

Run This Code

Code:

Is Sumit Palindrome ??? :false
Is SumuS Palindrome ??? :true
Is ABCDEFGHGFEDCBA Palindrome ??? :true
Is Jain niaJ Palindrome ??? :true
Is SumuaS Palindrome ??? :false

Also Read:

- Find Election Winner Beginner
- Find the first repeating character in a given string Beginner
- Dynamic Programming - Stairs Climbing Puzzle Beginner
- Replace Elements with Greatest Element on Right Beginner
- Find a peak element in a Given Array Beginner
- Count number of pairs in an array with sum = K Medium
- Depth-First Search (DFS) in 2D Matrix/2D-Array - Recursive Solution Beginner
- Divide and Conquer - Rearrange array elements in special order Medium