018-maximum-path-sum-i.ipynb

{
 "cells": [
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "# Maximum path sum I\n",
    "## Problem 18 \n",
    "\n",
    "<div class=\"problem_content\" role=\"problem\">\n",
    "<p>By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.</p>\n",
    "<p style=\"text-align:center;font-family:'courier new';font-size:12pt;\"><span style=\"color:#ff0000;\"><b>3</b></span><br/><span style=\"color:#ff0000;\"><b>7</b></span> 4<br/>\n",
    "2 <span style=\"color:#ff0000;\"><b>4</b></span> 6<br/>\n",
    "8 5 <span style=\"color:#ff0000;\"><b>9</b></span> 3</p>\n",
    "<p>That is, 3 + 7 + 4 + 9 = 23.</p>\n",
    "<p>Find the maximum total from top to bottom of the triangle below:</p>\n",
    "<p style=\"text-align:center;font-family:'courier new';\">75<br/>\n",
    "95 64<br/>\n",
    "17 47 82<br/>\n",
    "18 35 87 10<br/>\n",
    "20 04 82 47 65<br/>\n",
    "19 01 23 75 03 34<br/>\n",
    "88 02 77 73 07 63 67<br/>\n",
    "99 65 04 28 06 16 70 92<br/>\n",
    "41 41 26 56 83 40 80 70 33<br/>\n",
    "41 48 72 33 47 32 37 16 94 29<br/>\n",
    "53 71 44 65 25 43 91 52 97 51 14<br/>\n",
    "70 11 33 28 77 73 17 78 39 68 17 57<br/>\n",
    "91 71 52 38 17 14 91 43 58 50 27 29 48<br/>\n",
    "63 66 04 68 89 53 67 30 73 16 69 87 40 31<br/>\n",
    "04 62 98 27 23 09 70 98 73 93 38 53 60 04 23</p>\n",
    "<p class=\"note\"><b>NOTE:</b> As there are only 16384 routes, it is possible to solve this problem by trying every route. However, <a href=\"problem=67\">Problem 67</a>, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)</p>\n",
    "</div>"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {},
   "outputs": [],
   "source": [
    "def solve():\n",
    "    # Your code here\n",
    "    \n"
   ]
  },
  {
   "cell_type": "markdown",
   "metadata": {},
   "source": [
    "## Solution"
   ]
  },
  {
   "cell_type": "code",
   "execution_count": null,
   "metadata": {},
   "outputs": [],
   "source": [
    "solve()"
   ]
  }
 ],
 "metadata": {},
 "nbformat": 4,
 "nbformat_minor": 2
}