interactive-coding-challenges/hacker-rank/maximizing-xor.ipynb

{
 "cells": [
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## Problem: Maximizing XOR\n",
    "\n",
    "From HackerRank: https://www.hackerrank.com/challenges/maximizing-xor\n",
    "\n",
    "* [Algorithm](#Algorithm)\n",
    "* [Code](#Code)"
   ]
  },
  {
   "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",
   "execution_count": null,
   "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",
    "    return result\n",
    "\n",
    "lower = int(raw_input());\n",
    "upper = int(raw_input());\n",
    "\n",
    "result = max_xor(lower, upper);\n",
    "print(result)"
   ]
  }
 ],
 "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.9"
  }
 },
 "nbformat": 4,
 "nbformat_minor": 0
}