mirror of
https://github.com/donnemartin/interactive-coding-challenges
synced 2026-01-04 00:18:02 +00:00
Appended _solution to current notebooks to prepare for challenge and solution notebooks.
This commit is contained in:
Donne Martin
226
linked_lists/palindrome/palindrome_solution.ipynb
Normal file
226
linked_lists/palindrome/palindrome_solution.ipynb
Normal file
@@ -0,0 +1,226 @@
|
||||
{
|
||||
"cells": [
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"<small><i>This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://bit.ly/code-notes).</i></small>"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Problem: Determine if a linked list is a palindrome.\n",
|
||||
"\n",
|
||||
"* [Constraints](#Constraints)\n",
|
||||
"* [Test Cases](#Test-Cases)\n",
|
||||
"* [Algorithm](#Algorithm)\n",
|
||||
"* [Code](#Code)\n",
|
||||
"* [Unit Test](#Unit-Test)"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Constraints\n",
|
||||
"\n",
|
||||
"*Problem statements are often intentionally ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n",
|
||||
"\n",
|
||||
"* Is a single character or number a palindrome?\n",
|
||||
" * No\n",
|
||||
"* Can we assume we already have a linked list class that can be used for this problem?\n",
|
||||
" * Yes"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Test Cases\n",
|
||||
"\n",
|
||||
"\n",
|
||||
"* Empty list\n",
|
||||
"* Single element list\n",
|
||||
"* Two element list, not a palindrome\n",
|
||||
"* Three element list, not a palindrome\n",
|
||||
"* General case: Palindrome with even length\n",
|
||||
"* General case: Palindrome with odd length"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Algorithm\n",
|
||||
"\n",
|
||||
"* Reverse the linked list\n",
|
||||
"* Compare the reversed list with the original list\n",
|
||||
" * Only need to compare the first half\n",
|
||||
"\n",
|
||||
"Complexity:\n",
|
||||
"* Time: O(1)\n",
|
||||
"* 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",
|
||||
"execution_count": 1,
|
||||
"metadata": {
|
||||
"collapsed": true
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"%run linked_list.py"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 2,
|
||||
"metadata": {
|
||||
"collapsed": false
|
||||
},
|
||||
"outputs": [],
|
||||
"source": [
|
||||
"class MyLinkedList(LinkedList):\n",
|
||||
" 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",
|
||||
" \n",
|
||||
" # Reverse the linked list\n",
|
||||
" while curr is not None:\n",
|
||||
" reversed_list.insert_to_front(curr.data)\n",
|
||||
" length += 1\n",
|
||||
" curr = curr.next\n",
|
||||
" \n",
|
||||
" # Compare the reversed list with the original list\n",
|
||||
" # Only need to compare the first half \n",
|
||||
" iterations_to_compare_half = length / 2\n",
|
||||
" curr = self.head\n",
|
||||
" curr_reversed = reversed_list.head\n",
|
||||
" for _ in xrange(0, iterations_to_compare_half):\n",
|
||||
" if curr.data != curr_reversed.data:\n",
|
||||
" return False\n",
|
||||
" curr = curr.next\n",
|
||||
" curr_reversed = curr_reversed.next\n",
|
||||
" return True"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"## Unit Test"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "markdown",
|
||||
"metadata": {},
|
||||
"source": [
|
||||
"*It is important to identify and run through general and edge cases from the [Test Cases](#Test-Cases) section by hand. You generally will not be asked to write a unit test like what is shown below.*"
|
||||
]
|
||||
},
|
||||
{
|
||||
"cell_type": "code",
|
||||
"execution_count": 3,
|
||||
"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: Three element list, not a palindrome\n",
|
||||
"Test: General case: Palindrome with even length\n",
|
||||
"Test: General case: Palindrome with odd length\n",
|
||||
"Success: test_is_palindrome\n"
|
||||
]
|
||||
}
|
||||
],
|
||||
"source": [
|
||||
"from nose.tools import assert_equal\n",
|
||||
"\n",
|
||||
"class Test(object):\n",
|
||||
" def test_is_palindrome(self):\n",
|
||||
" 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: Three element list, not a palindrome')\n",
|
||||
" linked_list.append(3)\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",
|
||||
" \n",
|
||||
" print('Success: test_is_palindrome')\n",
|
||||
"\n",
|
||||
"if __name__ == '__main__':\n",
|
||||
" test = Test()\n",
|
||||
" test.test_is_palindrome()"
|
||||
]
|
||||
}
|
||||
],
|
||||
"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",
|
||||
"version": "2.7.10"
|
||||
}
|
||||
},
|
||||
"nbformat": 4,
|
||||
"nbformat_minor": 0
|
||||
}
|
||||
Reference in New Issue
Block a user