Palindrome String

Easy Strings

Check whether a given string is a palindrome — it reads the same forwards and backwards.

Sample input

madam

Sample output

true

Solution

def is_palindrome(s):
    return s == s[::-1]

print(is_palindrome("madam"))

function isPalindrome(s) {
  return s === s.split("").reverse().join("");
}

console.log(isPalindrome("madam"));

public class Main {
    static boolean isPalindrome(String s) {
        return s.equals(new StringBuilder(s).reverse().toString());
    }

    public static void main(String[] args) {
        System.out.println(isPalindrome("madam"));
    }
}

fun isPalindrome(s: String) = s == s.reversed()

fun main() {
    println(isPalindrome("madam"))
}

func isPalindrome(_ s: String) -> Bool {
    return s == String(s.reversed())
}

print(isPalindrome("madam"))

bool isPalindrome(String s) => s == s.split('').reversed.join();

void main() {
  print(isPalindrome('madam'));
}

#include <iostream>
#include <algorithm>
using namespace std;

bool isPalindrome(string s) {
    string r(s.rbegin(), s.rend());
    return s == r;
}

int main() {
    cout << (isPalindrome("madam") ? "true" : "false") << endl;
    return 0;
}

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

int isPalindrome(const char *s) {
    int i = 0, j = strlen(s) - 1;
    while (i < j) {
        if (s[i] != s[j]) return 0;
        i++; j--;
    }
    return 1;
}

int main() {
    printf("%s\n", isPalindrome("madam") ? "true" : "false");
    return 0;
}