2017-03-28 17:13:55 +08:00
{
" 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: Find the highest product of three numbers in a list. \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 " ,
" * Is the input a list of integers? \n " ,
" * Yes \n " ,
" * Can we get negative inputs? \n " ,
" * Yes \n " ,
2017-05-16 12:30:12 +08:00
" * Can there be duplicate entries in the input? \n " ,
2017-03-28 17:13:55 +08:00
" * Yes \n " ,
" * Will there always be at least three integers? \n " ,
" * No \n " ,
" * Can we assume the inputs are valid? \n " ,
" * No, check for None input \n " ,
" * Can we assume this fits memory? \n " ,
" * Yes "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
" * None -> TypeError \n " ,
" * Less than three ints -> ValueError \n " ,
" * [5, -2, 3] -> -30 \n " ,
" * [5, -2, 3, 1, -1, 4] -> 60 "
]
} ,
{
" 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 max_prod_three(self, array): \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 " : [
" # %lo ad test_prod_three.py \n " ,
" from nose.tools import assert_equal, assert_raises \n " ,
" \n " ,
" \n " ,
" class TestProdThree(object): \n " ,
" \n " ,
" def test_prod_three(self): \n " ,
" solution = Solution() \n " ,
" assert_raises(TypeError, solution.max_prod_three, None) \n " ,
" assert_raises(ValueError, solution.max_prod_three, [1, 2]) \n " ,
" assert_equal(solution.max_prod_three([5, -2, 3]), -30) \n " ,
" assert_equal(solution.max_prod_three([5, -2, 3, 1, -1, 4]), 60) \n " ,
" print( ' Success: test_prod_three ' ) \n " ,
" \n " ,
" \n " ,
" def main(): \n " ,
" test = TestProdThree() \n " ,
" test.test_prod_three() \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
}