Palindrome Program in Hindi Programming

The program

Edit anything and press Run. The output below was produced by running this exact code.

palindrome-check.altf

// Palindrome check: ulta padho toh bhi same?

karya kya_palindrome(text) {
  rakho s = chhota(text);
  rakho left = 0;
  rakho right = lambai(s) - 1;
  jab_tak (left < right) {
    agar (s[left] != s[right]) {
      lautao galat;
    }
    left = left + 1;
    right = right - 1;
  }
  lautao sahi;
}

rakho words = ["Naman", "Malayalam", "AltFLang", "Kayak", "Chai"];
chalo (rakho i = 0; i < lambai(words); i = i + 1) {
  agar (kya_palindrome(words[i])) {
    bol(words[i], "-> palindrome hai");
  } warna {
    bol(words[i], "-> palindrome nahi hai");
  }
}

Open in playground

Expected output

Press Run to try it

Naman -> palindrome haiMalayalam -> palindrome haiAltFLang -> palindrome nahi haiKayak -> palindrome haiChai -> palindrome nahi hai

How it works

A palindrome reads the same forwards and backwards. chhota lowercases the word first so that "Naman" counts. Then two positions walk towards each other: left from the start and right from the end.

You can read a single character of text with square brackets, exactly like a list item. If the two characters ever differ, the word is not a palindrome and the function returns galat straight away. If the pointers meet without a mismatch, it returns sahi.

The one-line alternative is chhota(word) == ulta(chhota(word)) — but the loop shows what that shortcut is doing for you.

The program

How it works

More example programs