DAY 24 OF 90 · Walk the string

Palindrome check

Easy90 Days of Looping

Inputs

text is 0 to 16 lowercase letters (a to z).

Use a loop over positions 0 up to (but not including) half the length of text.
At each position i, compare text[i] with the character the same distance from the other end: text[len - 1 - i]. If they differ, return false straight away.
If the loop finishes without a mismatch, the text reads the same both ways.
Complete isPalindrome so it returns true or false. Return it, do not print it.

With text = "racecar", isPalindrome returns true.

TEST DATA 1: text is "racecar"

TEST DATA 2: text is "abca"

Text is just a list of characters, so everything you know about lists applies. String problems in interviews are array problems with letters.

DAY 24 OF 90 · Walk the string

Easy90 Days of Looping

text is 0 to 16 lowercase letters (a to z).

Use a loop over positions 0 up to (but not including) half the length of text.
At each position i, compare text[i] with the character the same distance from the other end: text[len - 1 - i]. If they differ, return false straight away.
If the loop finishes without a mismatch, the text reads the same both ways.
Complete isPalindrome so it returns true or false. Return it, do not print it.

With text = "racecar", isPalindrome returns true.

TEST DATA 1: text is "racecar"

TEST DATA 2: text is "abca"

Text is just a list of characters, so everything you know about lists applies. String problems in interviews are array problems with letters.