2015-05-21 18:05:32 +08:00
{
"cells": [
2015-06-18 04:38:39 +08:00
{
"cell_type": "markdown",
"metadata": {},
"source": [
2015-07-02 17:54:59 +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/coding-challenges).</i></small>"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"# Solution Notebook"
2015-06-18 04:38:39 +08:00
]
},
2015-05-21 18:05:32 +08:00
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Problem: Maximizing XOR\n",
"\n",
2015-07-02 17:54:59 +08:00
"See the [HackerRank problem page](https://www.hackerrank.com/challenges/maximizing-xor).\n",
2015-05-21 18:05:32 +08:00
"\n",
2015-07-02 17:54:59 +08:00
"* [Constraints](#Constraints)\n",
"* [Test Cases](#Test-Cases)\n",
2015-05-21 18:05:32 +08:00
"* [Algorithm](#Algorithm)\n",
2015-07-02 17:54:59 +08:00
"* [Code](#Code)\n",
"* [Unit Test](#Unit-Test)"
]
},
{
"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/maximizing-xor)."
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Test Cases\n",
"\n",
"See the [HackerRank problem page](https://www.hackerrank.com/challenges/maximizing-xor)."
2015-05-21 18:05:32 +08:00
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Algorithm\n",
"\n",
"* Set max to 0\n",
"* For i in the range (lower, upper) inclusive\n",
" * For j in the range (lower, upper) inclusive\n",
" * Compare i ^ j with max, update max if needed\n",
"* return max\n",
"\n",
"Complexity:\n",
"* Time: O(n^2)\n",
"* Space: O(1)"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Code"
]
},
{
"cell_type": "code",
2015-07-02 17:54:59 +08:00
"execution_count": 1,
2015-05-21 18:05:32 +08:00
"metadata": {
"collapsed": false
},
"outputs": [],
"source": [
"def max_xor(lower, upper):\n",
" result = 0\n",
" for l in xrange(lower, upper + 1):\n",
" for u in xrange(lower, upper + 1):\n",
" curr = l ^ u\n",
" if result < curr:\n",
" result = curr\n",
2015-07-02 17:54:59 +08:00
" return result"
]
},
{
"cell_type": "markdown",
"metadata": {},
"source": [
"## Unit Test\n",
"\n"
]
},
{
"cell_type": "code",
"execution_count": 2,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"Overwriting test_maximizing_xor.py\n"
]
}
],
"source": [
"%%writefile test_maximizing_xor.py\n",
"from nose.tools import assert_equal\n",
2015-05-21 18:05:32 +08:00
"\n",
"\n",
2015-07-02 17:54:59 +08:00
"class TestMaximingXor(object):\n",
"\n",
" def test_maximizing_xor(self):\n",
" assert_equal(max_xor(10, 15), 7)\n",
" print('Success: test_maximizing_xor')\n",
"\n",
"def main():\n",
" test = TestMaximingXor()\n",
" test.test_maximizing_xor()\n",
"\n",
"if __name__ == '__main__':\n",
" main()"
]
},
{
"cell_type": "code",
"execution_count": 3,
"metadata": {
"collapsed": false
},
"outputs": [
{
"name": "stdout",
"output_type": "stream",
"text": [
"Success: test_maximizing_xor\n"
]
}
],
"source": [
"%run -i test_maximizing_xor.py"
2015-05-21 18:05:32 +08:00
]
}
],
"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",
2015-06-18 04:38:39 +08:00
"version": "2.7.10"
2015-05-21 18:05:32 +08:00
}
},
"nbformat": 4,
"nbformat_minor": 0
}