mirror of
https://github.com/donnemartin/interactive-coding-challenges.git
synced 2024-03-22 13:11:13 +08:00
177 lines
3.9 KiB
Python
177 lines
3.9 KiB
Python
|
{
|
||
|
"cells": [
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"This notebook was prepared by [Donne Martin](https://github.com/donnemartin). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges)."
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"# Challenge Notebook"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"## Problem: Given an int, repeatedly add its digits until the result is one digit.\n",
|
||
|
"\n",
|
||
|
"* [Constraints](#Constraints)\n",
|
||
|
"* [Test Cases](#Test-Cases)\n",
|
||
|
"* [Algorithm](#Algorithm)\n",
|
||
|
"* [Code](#Code)\n",
|
||
|
"* [Unit Test](#Unit-Test)\n",
|
||
|
"* [Solution Notebook](#Solution-Notebook)"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"## Constraints\n",
|
||
|
"\n",
|
||
|
"* Can we assume num is not negative?\n",
|
||
|
" * Yes\n",
|
||
|
"* Can we assume the inputs are valid?\n",
|
||
|
" * No\n",
|
||
|
"* Can we assume this fits memory?\n",
|
||
|
" * Yes"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"## Test Cases\n",
|
||
|
"\n",
|
||
|
"<pre>\n",
|
||
|
"* None input -> TypeError\n",
|
||
|
"* negative input -> ValueError\n",
|
||
|
"* 9 -> 9\n",
|
||
|
"* 138 -> 3\n",
|
||
|
"* 65536 -> 7\n",
|
||
|
"</pre>"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"## Algorithm\n",
|
||
|
"\n",
|
||
|
"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."
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"## Code"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "code",
|
||
|
"execution_count": null,
|
||
|
"metadata": {
|
||
|
"collapsed": false
|
||
|
},
|
||
|
"outputs": [],
|
||
|
"source": [
|
||
|
"class Solution(object):\n",
|
||
|
"\n",
|
||
|
" def add_digits(self, val):\n",
|
||
|
" # TODO: Implement me\n",
|
||
|
" pass"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"## Unit Test"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"**The following unit test is expected to fail until you solve the challenge.**"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "code",
|
||
|
"execution_count": null,
|
||
|
"metadata": {
|
||
|
"collapsed": false
|
||
|
},
|
||
|
"outputs": [],
|
||
|
"source": [
|
||
|
"# %load test_add_digits.py\n",
|
||
|
"from nose.tools import assert_equal, assert_raises\n",
|
||
|
"\n",
|
||
|
"\n",
|
||
|
"class TestAddDigits(object):\n",
|
||
|
"\n",
|
||
|
" def test_add_digits(self, func):\n",
|
||
|
" assert_raises(TypeError, func, None)\n",
|
||
|
" assert_raises(ValueError, func, -1)\n",
|
||
|
" assert_equal(func(0), 0)\n",
|
||
|
" assert_equal(func(9), 9)\n",
|
||
|
" assert_equal(func(138), 3)\n",
|
||
|
" assert_equal(func(65536), 7) \n",
|
||
|
" print('Success: test_add_digits')\n",
|
||
|
"\n",
|
||
|
"\n",
|
||
|
"def main():\n",
|
||
|
" test = TestAddDigits()\n",
|
||
|
" solution = Solution()\n",
|
||
|
" test.test_add_digits(solution.add_digits)\n",
|
||
|
" try:\n",
|
||
|
" test.test_add_digits(solution.add_digits_optimized)\n",
|
||
|
" except NameError:\n",
|
||
|
" # Alternate solutions are only defined\n",
|
||
|
" # in the solutions file\n",
|
||
|
" pass\n",
|
||
|
"\n",
|
||
|
"\n",
|
||
|
"if __name__ == '__main__':\n",
|
||
|
" main()"
|
||
|
]
|
||
|
},
|
||
|
{
|
||
|
"cell_type": "markdown",
|
||
|
"metadata": {},
|
||
|
"source": [
|
||
|
"## Solution Notebook\n",
|
||
|
"\n",
|
||
|
"Review the [Solution Notebook]() for a discussion on algorithms and code solutions."
|
||
|
]
|
||
|
}
|
||
|
],
|
||
|
"metadata": {
|
||
|
"kernelspec": {
|
||
|
"display_name": "Python 3",
|
||
|
"language": "python",
|
||
|
"name": "python3"
|
||
|
},
|
||
|
"language_info": {
|
||
|
"codemirror_mode": {
|
||
|
"name": "ipython",
|
||
|
"version": 3
|
||
|
},
|
||
|
"file_extension": ".py",
|
||
|
"mimetype": "text/x-python",
|
||
|
"name": "python",
|
||
|
"nbconvert_exporter": "python",
|
||
|
"pygments_lexer": "ipython3",
|
||
|
"version": "3.5.0"
|
||
|
}
|
||
|
},
|
||
|
"nbformat": 4,
|
||
|
"nbformat_minor": 0
|
||
|
}
|