{ "cells": [ { "cell_type": "markdown", "metadata": {}, "source": [ "This notebook was prepared by [Donne Martin](http://donnemartin.com). 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: Utopian Tree\n", "\n", "See the [HackerRank problem page](https://www.hackerrank.com/challenges/utopian-tree).\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", "*Problem statements are sometimes ambiguous. Identifying constraints and stating assumptions can help to ensure you code the intended solution.*\n", "\n", "See the [HackerRank problem page](https://www.hackerrank.com/challenges/utopian-tree)." ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "## Test Cases\n", "\n", "See the [HackerRank problem page](https://www.hackerrank.com/challenges/utopian-tree)." ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "## Algorithm\n", "\n", "Refer to the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/hackerrank_topcoder/utopian_tree/utopian_tree_solution.ipynb). 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": 4, "metadata": { "collapsed": false }, "outputs": [], "source": [ "# cycles = 0, print 1: base case\n", "# cycles = 1, print 2: i = 1: 1 * 2\n", "# cycles = 4, print 7: i = 1: 1 * 2, i = 2: 2 + 1, i = 3: 3 * 2, i = 4: 6 + 1\n", "def calc_utopian_tree_height(cycles):\n", " height = 1\n", " if cycles == 0:\n", " return height\n", " for i in xrange(1, cycles+1):\n", " if i % 2 == 1:\n", " height *= 2\n", " else:\n", " height += 1\n", " return height" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "## Unit Test\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": [ "# %load test_utopian_tree.py\n", "from nose.tools import assert_equal\n", "\n", "\n", "class TestUtopianTree(object):\n", "\n", " def test_utopian_tree(self):\n", " assert_equal(calc_utopian_tree_height(0), 1)\n", " assert_equal(calc_utopian_tree_height(1), 2)\n", " assert_equal(calc_utopian_tree_height(4), 7)\n", " print('Success: test_utopian_tree')\n", "\n", "def main():\n", " test = TestUtopianTree()\n", " test.test_utopian_tree()\n", "\n", "if __name__ == '__main__':\n", " main()" ] }, { "cell_type": "markdown", "metadata": {}, "source": [ "## Solution Notebook\n", "\n", "Review the [Solution Notebook](http://nbviewer.ipython.org/github/donnemartin/interactive-coding-challenges/blob/master/hackerrank_topcoder/utopian_tree/utopian_tree_solution.ipynb) for a discussion on algorithms and code solutions." ] } ], "metadata": { "kernelspec": { "display_name": "Python 2", "language": "python", "name": "python2" }, "language_info": { "codemirror_mode": { "name": "ipython", "version": 2 }, "file_extension": ".py", "mimetype": "text/x-python", "name": "python", "nbconvert_exporter": "python", "pygments_lexer": "ipython2", "version": "2.7.10" } }, "nbformat": 4, "nbformat_minor": 0 }