Palindrome Word

L2 Easy Strings

Concept

Two pointers meet in the middle: one starts at the front, one at the back, and together they test symmetry efficiently.

A word is a palindrome when it reads the same forward and backward. Given a single word word, return true if it is one, ignoring letter case. There are no spaces or punctuation to worry about.

Examples

▸ word = "racecar"

→ true

▸ word = "Racecar"

→ true

▸ word = "swift"

→ false

Progressive Hints

Hint 1 · Nudge

Symmetry means the front and the back should agree as you squeeze inward.

Hint 2 · Plan

Ignore letter case by comparing lowercased letters. Check the first and last characters; if they differ, it's not a palindrome. Move one step inward and repeat until the two sides meet.

Hint 3 · Approach

left = 0, right = last index. While left < right: if lower(s[left]) differs from lower(s[right]) return false. Move left inward by 1 and right inward by 1. Return true.

Output

// Run your code to see the output here.