Palindrome (String) in C, C++, Java & Python – Code with Explanation & Examples in Short and Simple

  

C Program

#include<stdio.h>
#include<string.h>

int main() {
    char s[100];
    scanf("%s", s);
    int n = strlen(s), p = 1;
    for (int i = 0; i < n / 2; i++)
        if (s[i] != s[n - i - 1]) p = 0;
    printf(p ? "Palindrome" : "Not Palindrome");
}

C Output

Input: level  
Output: Palindrome

C++ Program

#include<iostream>
using namespace std;

int main() {
    string s;
    cin >> s;
    int n = s.size(), p = 1;
    for (int i = 0; i < n / 2; i++)
        if (s[i] != s[n - i - 1]) p = 0;
    cout << (p ? "Palindrome" : "Not Palindrome");
}

C++ Output

Input: hello  
Output: Not Palindrome

JAVA Program

import java.util.*;

class P {
    public static void main(String[] a) {
        String s = new Scanner(System.in).next();
        String r = new StringBuilder(s).reverse().toString();
        System.out.print(s.equals(r) ? "Palindrome" : "Not Palindrome");
    }
}

JAVA Output

Input: madam  
Output: Palindrome

Python Program

s = input()
print("Palindrome" if s == s[::-1] else "Not Palindrome")

Python Output

Input: racecar  
Output: Palindrome

In-Depth Learning – Whole Concept in Paragraphs

What Is a Palindrome String?

A palindrome string is a term, phrase, or sequence of letters that reads the same backward as forward. The order of the letters from the beginning is the same as the order from the end. Examples are "madam", "racecar", "level", and "noon". Palindromes can range in complexity from a simple word to complicated whole phrases (excluding punctuation and spaces), but for programming purposes we typically work with plain strings.

How Does the Code Work?

To verify if a string is a palindrome, the concept is to compare characters from both sides of the string — toward the middle. If all the characters from the front match their counterparts from the back, the string is a palindrome. Otherwise, it is not.

In C and C++, we do this in a for loop by comparing s[i] with s[n-i-1]. On finding any difference, flag is made equal to false (0). In Java and Python, we utilize built-in functions — such as StringBuilder.reverse() in Java and slicing [::-1] in Python — to reverse the string and directly compare it.

Example

Consider the string "madam":

Characters: m == m, a == a, d == d (middle), thus it's a palindrome.

Now try "hello":

h != o, thus it's not a palindrome.

This reasoning applies to any string where from front to back character-wise symmetry is present. 

Real-Life Analogy

Picture holding a mirror in the middle of a word. If the word appears to be identical on each side of the mirror, it's a palindrome. It's similar to reading an identification tag from left and right and observing the same text. Palindromes are an entertaining form of expressing symmetry, that is why they're not only prevalent in coding but in art, poetry, and even in genetic codes (e.g., palindromic DNA strings in bioinformatics).

Why String Palindrome is Helpful

Palindrome verification is a problem that is more than a starter's issue — it teaches character indexing, looping, string reversing methods, and comparison. It is commonly used in coding interviews to challenge a programmer's knowledge of strings and control structures. Moreover, it builds the basis for more advanced issues such as longest palindromic substring, sentence reversal, text handling, and natural language processing. The simplicity and effectiveness of palindrome verification also render it a favorite among online tests and coding competitions.

Python-Specific Benefit

Python provides the ability to reverse strings with slicing ([::-1]), which makes the palindrome test really neat and concise — usually a one-liner. This is just part of why Python is popular for fast logic puzzles, and students can easily visualize and play around with string manipulation. 

SEO-Optimized Natural Paragraph for Ranking

Find the simplest and most elegant way to test whether a string is a palindrome? This tutorial offers the most compact and 100% functional code in C, C++, Java, and Python — ideal for beginners and those practicing for coding interviews or exams. The problem of checking whether a string is a palindrome is a basic exercise that covers essential string operations, indexing, and symmetry logic. Whether you are beginner in programming, training to get a job in TCS, Wipro, or Infosys, or developing text validation code, this solution provides easy, example-oriented learning coupled with real world explanations. Learning to reverse and compare strings is an essential skill in developing efficient algorithms and acing string-based problems.