interactive-coding-challenges/sorting_searching/anagrams/anagrams_challenge.ipynb

167 lines
3.9 KiB
Python
Raw Normal View History

2017-03-27 17:13:54 +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: Sort an array of strings so all anagrams are next to each other.\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",
"* Are there any other sorting requirements other than the grouping of anagrams?\n",
" * No\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",
"* None -> Exception\n",
"* [] -> []\n",
"* General case\n",
" * Input: ['ram', 'act', 'arm', 'bat', 'cat', 'tab']\n",
" * Result: ['arm', 'ram', 'act', 'cat', 'bat', 'tab']"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Algorithm\n",
"\n",
2018-04-09 08:22:14 +08:00
"Refer to the [Solution Notebook](http://nbviewer.jupyter.org/github/donnemartin/interactive-coding-challenges/blob/master/sorting_searching/anagrams/anagrams_solution.ipynb). If you are stuck and need a hint, the solution notebook's algorithm discussion might be a good place to start."
2017-03-27 17:13:54 +08:00
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Code"
]
},
{
"cell_type": "code",
"execution_count": null,
2018-04-09 08:22:14 +08:00
"metadata": {},
2017-03-27 17:13:54 +08:00
"outputs": [],
"source": [
"from collections import OrderedDict\n",
"\n",
"\n",
"class Anagram(object):\n",
"\n",
" def group_anagrams(self, items):\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,
2018-04-09 08:22:14 +08:00
"metadata": {},
2017-03-27 17:13:54 +08:00
"outputs": [],
"source": [
"# %load test_anagrams.py\n",
"from nose.tools import assert_equal, assert_raises\n",
"\n",
"\n",
"class TestAnagrams(object):\n",
"\n",
" def test_group_anagrams(self):\n",
" anagram = Anagram()\n",
" assert_raises(TypeError, anagram.group_anagrams, None)\n",
" data = ['ram', 'act', 'arm', 'bat', 'cat', 'tab']\n",
" expected = ['ram', 'arm', 'act', 'cat', 'bat', 'tab']\n",
" assert_equal(anagram.group_anagrams(data), expected)\n",
"\n",
" print('Success: test_group_anagrams')\n",
"\n",
"\n",
"def main():\n",
" test = TestAnagrams()\n",
" test.test_group_anagrams()\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",
2018-04-09 08:22:14 +08:00
"version": "3.6.4"
2017-03-27 17:13:54 +08:00
}
},
"nbformat": 4,
2018-04-09 08:22:14 +08:00
"nbformat_minor": 1
2017-03-27 17:13:54 +08:00
}