challenge

Mock Interview Practice

31 / 31

45 minchallenge

You completed the free preview — you are ready for the full path.

All lessons are readable below. To write and run code from lesson 11 onwards, upgrade to Path Plus ($9/mo) or Pro.

1 min read

Palindromes are a classic interview problem. The optimal solution uses two pointers and ignores non-alphanumeric characters.

Your Task

Implement isPalindrome so it returns true for "A man, a plan, a canal: Panama".

You completed the free preview — you are ready for the full path.

All lessons are readable below. To write and run code from lesson 11 onwards, upgrade to Path Plus ($9/mo) or Pro.

1 min read

Palindromes are a classic interview problem. The optimal solution uses two pointers and ignores non-alphanumeric characters.

Implement isPalindrome so it returns true for "A man, a plan, a canal: Panama".

1 min read

Palindromes are a classic interview problem. The optimal solution uses two pointers and ignores non-alphanumeric characters.

Implement isPalindrome so it returns true for "A man, a plan, a canal: Panama".

1 min read

Palindromes are a classic interview problem. The optimal solution uses two pointers and ignores non-alphanumeric characters.

Implement isPalindrome so it returns true for "A man, a plan, a canal: Panama".