2015-05-20 05:20:56 +08:00
{
" cells " : [
2015-06-18 04:39:18 +08:00
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2015-07-05 19:59:00 +08:00
" <small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges).</i></small> "
2015-07-04 08:06:33 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Solution Notebook "
2015-06-18 04:39:18 +08:00
]
} ,
2015-05-20 05:20:56 +08:00
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Problem: Determine if a linked list is a palindrome. \n " ,
" \n " ,
2015-06-30 17:55:58 +08:00
" * [Constraints](#Constraints) \n " ,
2015-05-20 05:20:56 +08:00
" * [Test Cases](#Test-Cases) \n " ,
" * [Algorithm](#Algorithm) \n " ,
" * [Code](#Code) \n " ,
2015-06-26 17:07:19 +08:00
" * [Unit Test](#Unit-Test) "
2015-05-20 05:20:56 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2015-06-28 19:13:27 +08:00
" ## Constraints \n " ,
2015-06-26 17:07:19 +08:00
" \n " ,
2015-05-20 05:20:56 +08:00
" * Is a single character or number a palindrome? \n " ,
2015-06-26 17:07:19 +08:00
" * No \n " ,
" * Can we assume we already have a linked list class that can be used for this problem? \n " ,
" * Yes "
2015-05-20 05:20:56 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
2015-06-26 17:07:19 +08:00
" \n " ,
2015-06-30 19:31:34 +08:00
" * Empty list -> False \n " ,
" * Single element list -> False \n " ,
" * Two or more element list, not a palindrome -> False \n " ,
" * General case: Palindrome with even length -> True \n " ,
" * General case: Palindrome with odd length -> True "
2015-05-20 05:20:56 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Algorithm \n " ,
" \n " ,
" * Reverse the linked list \n " ,
2015-07-06 17:44:35 +08:00
" * Iterate through the current linked list \n " ,
" * Insert to front the current node into a new linked list \n " ,
2015-05-20 05:20:56 +08:00
" * Compare the reversed list with the original list \n " ,
" * Only need to compare the first half \n " ,
" \n " ,
" Complexity: \n " ,
2015-07-12 09:07:17 +08:00
" * Time: O(n) \n " ,
2015-05-20 05:20:56 +08:00
" * Space: O(n) \n " ,
" \n " ,
" Note: \n " ,
" * We could also do this iteratively, using a stack to effectively reverse the first half of the string. "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Code "
]
} ,
{
" cell_type " : " code " ,
2015-06-26 17:07:19 +08:00
" execution_count " : 1 ,
2015-05-20 05:20:56 +08:00
" metadata " : {
2015-06-30 19:31:34 +08:00
" collapsed " : false
2015-05-20 05:20:56 +08:00
} ,
" outputs " : [ ] ,
" source " : [
2015-06-30 19:31:34 +08:00
" %r un ../linked_list/linked_list.py "
2015-05-20 05:20:56 +08:00
]
} ,
{
" cell_type " : " code " ,
2015-06-26 17:07:19 +08:00
" execution_count " : 2 ,
2015-05-20 05:20:56 +08:00
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
2015-07-06 19:06:50 +08:00
" from __future__ import division \n " ,
" \n " ,
" \n " ,
2015-05-20 05:20:56 +08:00
" class MyLinkedList(LinkedList): \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-05-20 05:20:56 +08:00
" def is_palindrome(self): \n " ,
" if self.head is None or self.head.next is None: \n " ,
" return False \n " ,
" curr = self.head \n " ,
" reversed_list = MyLinkedList() \n " ,
" length = 0 \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-26 17:07:19 +08:00
" # Reverse the linked list \n " ,
2015-05-20 05:20:56 +08:00
" while curr is not None: \n " ,
" reversed_list.insert_to_front(curr.data) \n " ,
" length += 1 \n " ,
" curr = curr.next \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-26 17:07:19 +08:00
" # Compare the reversed list with the original list \n " ,
2015-07-12 03:34:52 +08:00
" # Only need to compare the first half \n " ,
2015-07-06 19:06:50 +08:00
" iterations_to_compare_half = length // 2 \n " ,
2015-05-20 05:20:56 +08:00
" curr = self.head \n " ,
" curr_reversed = reversed_list.head \n " ,
2015-07-06 18:15:53 +08:00
" for _ in range(0, iterations_to_compare_half): \n " ,
2015-05-20 05:20:56 +08:00
" if curr.data != curr_reversed.data: \n " ,
" return False \n " ,
" curr = curr.next \n " ,
" curr_reversed = curr_reversed.next \n " ,
" return True "
]
} ,
2015-06-26 17:07:19 +08:00
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Unit Test "
]
} ,
2015-05-20 05:20:56 +08:00
{
" cell_type " : " code " ,
2015-06-26 17:07:19 +08:00
" execution_count " : 3 ,
2015-05-20 05:20:56 +08:00
" metadata " : {
" collapsed " : false
} ,
2015-06-26 17:07:19 +08:00
" outputs " : [
{
" name " : " stdout " ,
" output_type " : " stream " ,
" text " : [
2015-06-30 19:31:34 +08:00
" Overwriting test_palindrome.py \n "
2015-06-26 17:07:19 +08:00
]
}
] ,
2015-05-20 05:20:56 +08:00
" source " : [
2015-06-30 19:31:34 +08:00
" %% writefile test_palindrome.py \n " ,
2015-06-26 17:07:19 +08:00
" from nose.tools import assert_equal \n " ,
" \n " ,
2015-06-30 19:31:34 +08:00
" \n " ,
" class TestPalindrome(object): \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-30 19:31:34 +08:00
" def test_palindrome(self): \n " ,
2015-06-26 17:07:19 +08:00
" print( ' Test: Empty list ' ) \n " ,
" linked_list = MyLinkedList() \n " ,
" assert_equal(linked_list.is_palindrome(), False) \n " ,
" \n " ,
" print( ' Test: Single element list ' ) \n " ,
" head = Node(1) \n " ,
" linked_list = MyLinkedList(head) \n " ,
" assert_equal(linked_list.is_palindrome(), False) \n " ,
" \n " ,
" print( ' Test: Two element list, not a palindrome ' ) \n " ,
" linked_list.append(2) \n " ,
" assert_equal(linked_list.is_palindrome(), False) \n " ,
" \n " ,
" print( ' Test: General case: Palindrome with even length ' ) \n " ,
" head = Node( ' a ' ) \n " ,
" linked_list = MyLinkedList(head) \n " ,
" linked_list.append( ' b ' ) \n " ,
" linked_list.append( ' b ' ) \n " ,
" linked_list.append( ' a ' ) \n " ,
" assert_equal(linked_list.is_palindrome(), True) \n " ,
" \n " ,
" print( ' Test: General case: Palindrome with odd length ' ) \n " ,
" head = Node(1) \n " ,
" linked_list = MyLinkedList(head) \n " ,
" linked_list.append(2) \n " ,
" linked_list.append(3) \n " ,
" linked_list.append(2) \n " ,
" linked_list.append(1) \n " ,
" assert_equal(linked_list.is_palindrome(), True) \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-30 19:31:34 +08:00
" print( ' Success: test_palindrome ' ) \n " ,
" \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-30 19:31:34 +08:00
" def main(): \n " ,
" test = TestPalindrome() \n " ,
" test.test_palindrome() \n " ,
2015-06-26 17:07:19 +08:00
" \n " ,
2015-07-12 03:34:52 +08:00
" \n " ,
2015-06-26 17:07:19 +08:00
" if __name__ == ' __main__ ' : \n " ,
2015-06-30 19:31:34 +08:00
" main() "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : 4 ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [
{
" name " : " stdout " ,
" output_type " : " stream " ,
" text " : [
" Test: Empty list \n " ,
" Test: Single element list \n " ,
" Test: Two element list, not a palindrome \n " ,
" Test: General case: Palindrome with even length \n " ,
" Test: General case: Palindrome with odd length \n " ,
" Success: test_palindrome \n "
]
}
] ,
" source " : [
" %r un -i test_palindrome.py "
2015-05-20 05:20:56 +08:00
]
}
] ,
" metadata " : {
" kernelspec " : {
" display_name " : " Python 2 " ,
" language " : " python " ,
" name " : " python2 "
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
" version " : 2
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
" pygments_lexer " : " ipython2 " ,
2015-06-18 04:39:18 +08:00
" version " : " 2.7.10 "
2015-05-20 05:20:56 +08:00
}
} ,
" nbformat " : 4 ,
" nbformat_minor " : 0
}