2015-07-04 07:57:24 +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 07:57:24 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" # Challenge Notebook "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
2016-12-18 20:20:35 +08:00
" ## Problem: Implement an algorithm to determine if a string has all unique characters. \n " ,
2015-07-04 07:57:24 +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 " ,
2016-06-13 11:19:09 +08:00
" * Can we assume the string is ASCII? \n " ,
2015-07-04 07:57:24 +08:00
" * Yes \n " ,
" * Note: Unicode strings could require special handling depending on your language \n " ,
" * Can we assume this is case sensitive? \n " ,
" * Yes \n " ,
2016-06-13 11:19:09 +08:00
" * Can we use additional data structures? \n " ,
" * Yes \n " ,
" * Can we assume this fits in memory? \n " ,
2015-07-04 07:57:24 +08:00
" * Yes "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Test Cases \n " ,
" \n " ,
2016-06-13 11:19:09 +08:00
" * None -> False \n " ,
2015-07-04 07:57:24 +08:00
" * ' ' -> True \n " ,
" * ' foo ' -> False \n " ,
" * ' bar ' -> True "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Algorithm \n " ,
" \n " ,
2015-07-05 20:30:45 +08:00
" Refer to the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/arrays_strings/unique_chars/unique_chars_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:57:24 +08:00
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Code "
]
} ,
{
" cell_type " : " code " ,
2015-07-05 19:56:28 +08:00
" execution_count " : null ,
2020-07-04 22:56:49 +08:00
" metadata " : { } ,
2015-07-04 07:57:24 +08:00
" outputs " : [ ] ,
" source " : [
2016-08-13 18:42:05 +08:00
" class UniqueChars(object): \n " ,
" \n " ,
" def has_unique_chars(self, string): \n " ,
" # TODO: Implement me \n " ,
" pass "
2015-07-04 07:57:24 +08:00
]
} ,
{
" 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 " ,
2015-07-05 19:56:28 +08:00
" execution_count " : null ,
2020-07-04 22:56:49 +08:00
" metadata " : { } ,
2015-07-05 19:56:28 +08:00
" outputs " : [ ] ,
2015-07-04 07:57:24 +08:00
" source " : [
" # %lo ad test_unique_chars.py \n " ,
2020-07-04 22:56:49 +08:00
" import unittest \n " ,
2015-07-04 07:57:24 +08:00
" \n " ,
" \n " ,
2020-07-04 22:56:49 +08:00
" class TestUniqueChars(unittest.TestCase): \n " ,
2015-07-04 07:57:24 +08:00
" \n " ,
2015-07-12 03:34:14 +08:00
" def test_unique_chars(self, func): \n " ,
2020-07-04 22:56:49 +08:00
" self.assertEqual(func(None), False) \n " ,
" self.assertEqual(func( ' ' ), True) \n " ,
" self.assertEqual(func( ' foo ' ), False) \n " ,
" self.assertEqual(func( ' bar ' ), True) \n " ,
2015-07-04 07:57:24 +08:00
" print( ' Success: test_unique_chars ' ) \n " ,
" \n " ,
2015-07-12 03:34:14 +08:00
" \n " ,
2015-07-04 07:57:24 +08:00
" def main(): \n " ,
" test = TestUniqueChars() \n " ,
2016-08-13 18:42:05 +08:00
" unique_chars = UniqueChars() \n " ,
" test.test_unique_chars(unique_chars.has_unique_chars) \n " ,
2015-07-04 07:57:24 +08:00
" try: \n " ,
2016-08-13 18:42:05 +08:00
" unique_chars_set = UniqueCharsSet() \n " ,
" test.test_unique_chars(unique_chars_set.has_unique_chars) \n " ,
" unique_chars_in_place = UniqueCharsInPlace() \n " ,
" test.test_unique_chars(unique_chars_in_place.has_unique_chars) \n " ,
2015-07-04 07:57:24 +08:00
" except NameError: \n " ,
" # Alternate solutions are only defined \n " ,
" # in the solutions file \n " ,
" pass \n " ,
2015-07-12 03:34:14 +08:00
" \n " ,
" \n " ,
2015-07-04 07:57:24 +08:00
" if __name__ == ' __main__ ' : \n " ,
" main() "
]
} ,
{
" cell_type " : " markdown " ,
" metadata " : { } ,
" source " : [
" ## Solution Notebook \n " ,
" \n " ,
2015-07-05 20:30:45 +08:00
" Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/arrays_strings/unique_chars/unique_chars_solution.ipynb) for a discussion on algorithms and code solutions. "
2015-07-04 07:57:24 +08:00
]
}
] ,
" metadata " : {
" kernelspec " : {
2016-06-13 11:19:09 +08:00
" display_name " : " Python 3 " ,
2015-07-04 07:57:24 +08:00
" language " : " python " ,
2016-06-13 11:19:09 +08:00
" name " : " python3 "
2015-07-04 07:57:24 +08:00
} ,
" language_info " : {
" codemirror_mode " : {
" name " : " ipython " ,
2016-06-13 11:19:09 +08:00
" version " : 3
2015-07-04 07:57:24 +08:00
} ,
" file_extension " : " .py " ,
" mimetype " : " text/x-python " ,
" name " : " python " ,
" nbconvert_exporter " : " python " ,
2016-06-13 11:19:09 +08:00
" pygments_lexer " : " ipython3 " ,
2020-07-04 22:56:49 +08:00
" version " : " 3.7.2 "
2015-07-04 07:57:24 +08:00
}
} ,
" nbformat " : 4 ,
2020-07-04 22:56:49 +08:00
" nbformat_minor " : 1
2015-07-04 07:57:24 +08:00
}