This notebook was prepared by Donne Martin. Source and license info is on GitHub.

# Challenge Notebook¶

## Constraints¶

• Can we assume this is a non-circular, singly linked list?
• Yes
• Is a single character or number a palindrome?
• No
• Can we assume we already have a linked list class that can be used for this problem?
• Yes
• Can we use additional data structures?
• Yes
• Can we assume this fits in memory?
• Yes

## Test Cases¶

• Empty list -> False
• Single element list -> False
• Two or more element list, not a palindrome -> False
• General case: Palindrome with even length -> True
• General case: Palindrome with odd length -> True

## Algorithm¶

Refer to the Solution Notebook. If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start.

## Code¶

In [ ]:
%run ../linked_list/linked_list.py

In [ ]:
class MyLinkedList(LinkedList):

def is_palindrome(self):
# TODO: Implement me
pass


## Unit Test¶

The following unit test is expected to fail until you solve the challenge.

In [ ]:
# %load test_palindrome.py
import unittest

class TestPalindrome(unittest.TestCase):

def test_palindrome(self):
print('Test: Empty list')

print('Test: Single element list')

print('Test: Two element list, not a palindrome')

print('Test: General case: Palindrome with even length')

print('Test: General case: Palindrome with odd length')

print('Success: test_palindrome')

def main():
test = TestPalindrome()
test.test_palindrome()

if __name__ == '__main__':
main()


## Solution Notebook¶

Review the Solution Notebook for a discussion on algorithms and code solutions.