19/23

Palindrome Checker

Easy

Given a string, write an Appian expression to determine whether the string is a palindrome. A palindrome reads the same forward and backward.


Example 1:

Input: ri! word = "madam"
Output: "Madam is Palindrome"


This expression rule demonstrates the use of:

- String manipulation

- Looping and iteration

- Array processing

- Conditional evaluation

- Comparing characters from both ends of a string

ri! Rule Inputs

ri!wordText
"Madam"

Example 1 — Case 1

Input: ri!word
"Madam"
Output:
"Madam is Palindrome"

Example 2 — Case 2

Input: ri!word
"Appian"
Output:
"Appian is not Palindrome"

Example 3 — Case 3

Input: ri!word
"level"
Output:
"level is Palindrome"

Appian Expression Tips

  • • Use ri!variableName for rule inputs
  • • Use a!localVariables(local!x: …, body) for locals
  • • Use a!forEach(items: …, expression: fv!item) to iterate
  • • Use where() / reject(fn!isnull, list) to filter