2015-07-04 07:55:56 +08:00
{
" cells " : [
{
" 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 07:55:56 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Challenge Notebook "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2016-02-09 20:00:41 +08:00
" ## Problem: Compress a string such that ' AAABCCDDDD ' becomes ' A3BC2D4 ' . Only compress the string if it saves space. \n " ,
2015-07-04 07:55:56 +08:00
" \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 the string is ASCII? \n " ,
" * Yes \n " ,
" * Note: Unicode strings could require special handling depending on your language \n " ,
2016-06-05 01:40:15 +08:00
" * Is this case sensitive? \n " ,
" * Yes \n " ,
2015-07-04 07:55:56 +08:00
" * Can you use additional data structures? \n " ,
" * Yes \n " ,
2016-06-05 01:40:15 +08:00
" * Can we assume this fits in memory? \n " ,
2015-07-08 05:15:18 +08:00
" * Yes "
2015-07-04 07:55:56 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
" * None -> None \n " ,
" * ' ' -> ' ' \n " ,
" * ' AABBCC ' -> ' AABBCC ' \n " ,
2016-02-09 20:00:41 +08:00
" * ' AAABCCDDDD ' -> ' A3BC2D4 ' "
2015-07-04 07:55:56 +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/arrays_strings/compress/compress_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-04 07:55:56 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Code "
]
} ,
{
" cell_type " : " code " ,
" execution_count " : null ,
" metadata " : {
" collapsed " : false
} ,
" outputs " : [ ] ,
" source " : [
" def compress_string(string): \n " ,
" # TODO: Implement me \n " ,
" pass "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Unit Test "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" \n " ,
" \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_compress.py \n " ,
" from nose.tools import assert_equal \n " ,
" \n " ,
" \n " ,
" class TestCompress(object): \n " ,
2015-07-12 03:34:14 +08:00
" \n " ,
2015-07-04 07:55:56 +08:00
" def test_compress(self, func): \n " ,
" assert_equal(func(None), None) \n " ,
" assert_equal(func( ' ' ), ' ' ) \n " ,
" assert_equal(func( ' AABBCC ' ), ' AABBCC ' ) \n " ,
2016-02-09 20:00:41 +08:00
" assert_equal(func( ' AAABCCDDDD ' ), ' A3BC2D4 ' ) \n " ,
2015-07-04 07:55:56 +08:00
" print( ' Success: test_compress ' ) \n " ,
" \n " ,
2015-07-12 03:34:14 +08:00
" \n " ,
2015-07-04 07:55:56 +08:00
" def main(): \n " ,
" test = TestCompress() \n " ,
" test.test_compress(compress_string) \n " ,
" \n " ,
2015-07-12 03:34:14 +08:00
" \n " ,
2015-07-04 07:55:56 +08:00
" if __name__ == ' __main__ ' : \n " ,
" main() "
]
} ,
{
" 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/arrays_strings/compress/compress_solution.ipynb) for a discussion on algorithms and code solutions. "
2015-07-04 07:55:56 +08:00
]
}
] ,
" metadata " : {
" kernelspec " : {
2016-02-09 20:00:41 +08:00
" display_name " : " Python 3 " ,
2015-07-04 07:55:56 +08:00
" language " : " python " ,
2016-02-09 20:00:41 +08:00
" name " : " python3 "
2015-07-04 07:55:56 +08:00
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
2016-02-09 20:00:41 +08:00
" version " : 3
2015-07-04 07:55:56 +08:00
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
2016-02-09 20:00:41 +08:00
" pygments_lexer " : " ipython3 " ,
" version " : " 3.4.3 "
2015-07-04 07:55:56 +08:00
}
} ,
" nbformat " : 4 ,
" nbformat_minor " : 0
}