2015-07-01 18:48:04 +08:00
{
" cells " : [
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2016-07-31 20:11:18 +08:00
" This notebook was prepared by [Donne Martin](http://donnemartin.com). Source and license info is on [GitHub](https://github.com/donnemartin/interactive-coding-challenges). "
2015-07-04 08:07:07 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Challenge Notebook "
2015-07-01 18:48:04 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Problem: Implement fibonacci recursively, dynamically, and iteratively. \n " ,
" \n " ,
" * [Constraints](#Constraints) \n " ,
" * [Test Cases](#Test-Cases) \n " ,
" * [Algorithm](#Algorithm) \n " ,
" * [Code](#Code) \n " ,
2015-07-04 08:07:07 +08:00
" * [Unit Test](#Unit-Test) \n " ,
" * [Solution Notebook](#Solution-Notebook) "
2015-07-01 18:48:04 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Constraints \n " ,
" \n " ,
2016-07-11 12:12:10 +08:00
" * Does the sequence start at 0 or 1? \n " ,
" * 0 \n " ,
" * Can we assume the inputs are valid non-negative ints? \n " ,
" * Yes \n " ,
" * Are you looking for a recursive or iterative solution? \n " ,
" * Implement both \n " ,
" * Can we assume this fits memory? \n " ,
" * Yes "
2015-07-01 18:48:04 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
" * n = 0 -> 0 \n " ,
2015-07-08 07:56:21 +08:00
" * n = 1 -> 1 \n " ,
2016-07-11 12:12:10 +08:00
" * n = 6 -> 8 \n " ,
" * Fib sequence: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34... "
2015-07-01 18:48:04 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Algorithm \n " ,
" \n " ,
2015-07-05 19:59:00 +08:00
" Refer to the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/recursion_dynamic/fibonacci/fibonacci_solution.ipynb). If you are stuck and need a hint, the solution notebook ' s algorithm discussion might be a good place to start. "
2015-07-01 18:48:04 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Code "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
" def fib_recursive(n): \n " ,
" # TODO: Implement me \n " ,
" pass "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
2016-07-11 12:12:10 +08:00
" def fib_iterative(n): \n " ,
2015-07-01 18:48:04 +08:00
" # TODO: Implement me \n " ,
" pass "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
2016-07-11 12:12:10 +08:00
" def fib_dynamic(n): \n " ,
2015-07-01 18:48:04 +08:00
" # TODO: Implement me \n " ,
" pass "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Unit Test \n " ,
" \n " ,
2015-07-04 08:07:07 +08:00
" \n " ,
2015-07-01 18:48:04 +08:00
" \n " ,
" **The following unit test is expected to fail until you solve the challenge.** "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
" # %lo ad test_fibonacci.py \n " ,
" from nose.tools import assert_equal \n " ,
" \n " ,
" \n " ,
" class TestFib(object): \n " ,
2015-07-12 03:35:34 +08:00
" \n " ,
2015-07-01 18:48:04 +08:00
" def test_fib(self, func): \n " ,
" result = [] \n " ,
2016-07-11 12:12:10 +08:00
" expected = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34] \n " ,
" for i in range(len(expected)): \n " ,
2015-07-01 18:48:04 +08:00
" result.append(func(i)) \n " ,
2016-07-11 12:12:10 +08:00
" assert_equal(result, expected) \n " ,
2015-07-01 18:48:04 +08:00
" print( ' Success: test_fib ' ) \n " ,
" \n " ,
2015-07-12 03:35:34 +08:00
" \n " ,
2015-07-01 18:48:04 +08:00
" def main(): \n " ,
" test = TestFib() \n " ,
" test.test_fib(fib_recursive) \n " ,
" test.test_fib(fib_dynamic) \n " ,
" test.test_fib(fib_iterative) \n " ,
" \n " ,
2015-07-12 03:35:34 +08:00
" \n " ,
2015-07-01 18:48:04 +08:00
" if __name__ == ' __main__ ' : \n " ,
" main() "
]
2015-07-04 08:07:07 +08:00
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Solution Notebook \n " ,
" \n " ,
2015-07-05 19:59:00 +08:00
" Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/recursion_dynamic/fibonacci/fibonacci_solution.ipynb) for a discussion on algorithms and code solutions. "
2015-07-04 08:07:07 +08:00
]
2015-07-01 18:48:04 +08:00
}
] ,
" metadata " : {
" kernelspec " : {
2016-07-11 12:12:10 +08:00
" display_name " : " Python 3 " ,
2015-07-01 18:48:04 +08:00
" language " : " python " ,
2016-07-11 12:12:10 +08:00
" name " : " python3 "
2015-07-01 18:48:04 +08:00
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
2016-07-11 12:12:10 +08:00
" version " : 3
2015-07-01 18:48:04 +08:00
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
2016-07-11 12:12:10 +08:00
" pygments_lexer " : " ipython3 " ,
" version " : " 3.5.0 "
2015-07-01 18:48:04 +08:00
}
} ,
" nbformat " : 4 ,
" nbformat_minor " : 0
}