Upload 313 files

.gitattributes

@@ -66,3 +66,5 @@ Enjoy[[:space:]]Python/18.[[:space:]]Python[[:space:]]libraries/1.[[:space:]]Int
 Enjoy[[:space:]]Python/7.[[:space:]]Databases[[:space:]]in[[:space:]]Python[[:space:]]_[[:space:]]Milestone[[:space:]]Project[[:space:]]2/9.[[:space:]]Using[[:space:]]SQLite[[:space:]]in[[:space:]]Python.mp4 filter=lfs diff=lfs merge=lfs -text
 Enjoy[[:space:]]Python/8.[[:space:]]Type[[:space:]]hinting[[:space:]]in[[:space:]]Python/1.[[:space:]]Introduction[[:space:]]to[[:space:]]this[[:space:]]section.mp4 filter=lfs diff=lfs merge=lfs -text
 Enjoy[[:space:]]Python/8.[[:space:]]Type[[:space:]]hinting[[:space:]]in[[:space:]]Python/4.[[:space:]]Conclusion[[:space:]]of[[:space:]]this[[:space:]]section.mp4 filter=lfs diff=lfs merge=lfs -text
+200[[:space:]]solved[[:space:]]problems[[:space:]]in[[:space:]]Python/pandas/06_Stats/US_Baby_Names/US_Baby_Names_right.csv filter=lfs diff=lfs merge=lfs -text
+200[[:space:]]solved[[:space:]]problems[[:space:]]in[[:space:]]Python/pandas/07_Visualization/Online_Retail/Online_Retail.csv filter=lfs diff=lfs merge=lfs -text

200 solved problems in Python/array/.ipynb_checkpoints/array_longest_non_repeat-checkpoint.ipynb

@@ -0,0 +1,49 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Challenge\n",
+    "# \n",
+    "# Given a string, find the length of the longest substring\n",
+    "# without repeating characters.\n",
+    "\n",
+    "# Examples:\n",
+    "\n",
+    "# Given \"abcabcbb\", the answer is \"abc\", which the length is 3.\n",
+    "# Given \"bbbbb\", the answer is \"b\", with the length of 1.\n",
+    "# Given \"pwwkew\", the answer is \"wke\", with the length of 3.\n",
+    "# ---------------------------------------------------------------"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/.ipynb_checkpoints/array_longest_non_repeat_solution-checkpoint.ipynb

@@ -0,0 +1,128 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 6,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "['a', 'b', 'c']\n",
+      "['b', 'c', 'a']\n",
+      "['c', 'a', 'b']\n",
+      "['a', 'b', 'c']\n",
+      "['b', 'c']\n",
+      "['c', 'b']\n",
+      "['b']\n",
+      "['b']\n"
+     ]
+    },
+    {
+     "data": {
+      "text/plain": [
+       "3"
+      ]
+     },
+     "execution_count": 6,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Challenge\n",
+    "# Given a string, find the length of the longest substring\n",
+    "# without repeating characters.\n",
+    "\n",
+    "# Examples:\n",
+    "# Given \"abcabcbb\", the answer is \"abc\", which the length is 3.\n",
+    "# Given \"bbbbb\", the answer is \"b\", with the length of 1.\n",
+    "# Given \"pwwkew\", the answer is \"wke\", with the length of 3.\n",
+    "# ---------------------------------------------------------------\n",
+    "# Algorithm\n",
+    "\n",
+    "# In summary : Form all posible sub_strings from original string, then return length of longest sub_string\n",
+    "\n",
+    "# - start from 1st character, form as long as posible sub string\n",
+    "\n",
+    "#             - Add first character to sub string\n",
+    "#             - Add second character to sub string if second character not exist in sub string\n",
+    "#             ...\n",
+    "#             - Repeate until got a character which already exist inside sub string or \n",
+    "    \n",
+    "    \n",
+    "# - start from 2nd character, form as long as posible sub string\n",
+    "\n",
+    "#             - Add first character to sub string\n",
+    "#             - Add second character to sub string if second character not exist in sub string\n",
+    "#             ...\n",
+    "#             - Repeate until got a character which already exist inside sub string\n",
+    "\n",
+    "\n",
+    "# ....\n",
+    "\n",
+    "\n",
+    "# - start from final character, form as long as posible sub string\n",
+    "#             - Add first character to sub string\n",
+    "#             - Add second character to sub string if second character not exist in sub string\n",
+    "#             ...\n",
+    "#             - Repeate until got a character which already exist inside sub string\n",
+    "# ---------------------------------------------------------------\n",
+    "\n",
+    "str = \"abcbb\"\n",
+    "\n",
+    "def longest_non_repeat(str):\n",
+    "    \n",
+    "    # init start position and max length     \n",
+    "    i=0\n",
+    "    max_length = 1\n",
+    "\n",
+    "    for i,c in enumerate(str):\n",
+    "\n",
+    "        # init counter and sub string value         \n",
+    "        start_at = i\n",
+    "        sub_str=[]\n",
+    "\n",
+    "        # continue increase sub string if did not repeat character         \n",
+    "        while (start_at < len(str)) and (str[start_at] not in sub_str):\n",
+    "            sub_str.append(str[start_at])\n",
+    "            start_at = start_at + 1\n",
+    "\n",
+    "        # update the max length   \n",
+    "        if len(sub_str) > max_length:\n",
+    "            max_length = len(sub_str)\n",
+    "\n",
+    "        print(sub_str)\n",
+    "        \n",
+    "    return max_length\n",
+    "\n",
+    "longest_non_repeat(str)\n"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/.ipynb_checkpoints/array_merge_intervals-checkpoint.ipynb

@@ -0,0 +1,42 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 5,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Given a collection of intervals which are already sorted by start number, merge all overlapping intervals.\n",
+    "# For example,\n",
+    "# Given [[1,3],[2,6],[5,10],[11,16],[15,18],[19,22]],\n",
+    "# return [[1, 10], [11, 18], [19, 22]]\n"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/.ipynb_checkpoints/array_merge_intervals_solution-checkpoint.ipynb

@@ -0,0 +1,64 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "[[1, 10], [11, 18], [19, 22]]\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "\n",
+    "\"\"\"\n",
+    "Given a collection of intervals which are already sorted by start number, merge all overlapping intervals.\n",
+    "For example,\n",
+    "Given [[1,3],[2,6],[5,10],[11,16],[15,18],[19,22]],\n",
+    "return [[1, 10], [11, 18], [19, 22]]\n",
+    "\"\"\"\n",
+    "\n",
+    "org_intervals = [[1,3],[2,6],[5,10],[11,16],[15,18],[19,22]]\n",
+    "\n",
+    "i = 0\n",
+    "\n",
+    "while i < len(org_intervals)-1:\n",
+    "#     print(org_intervals[i])\n",
+    "    if org_intervals[i+1][0] < org_intervals[i][1]:\n",
+    "        org_intervals[i][1]=org_intervals[i+1][1]\n",
+    "        del org_intervals[i+1]\n",
+    "        i = i - 1\n",
+    "    i = i + 1\n",
+    "\n",
+    "print(org_intervals)"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_longest_non_repeat.ipynb

@@ -0,0 +1,370 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 20,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Challenge\n",
+    "# \n",
+    "# Given a string, find the length of the longest substring\n",
+    "# without repeating characters.\n",
+    "\n",
+    "# Examples:\n",
+    "\n",
+    "# Given \"abcabcbb\", the answer is \"abc\", which the length is 3.\n",
+    "# Given \"bbbbb\", the answer is \"b\", with the length of 1.\n",
+    "# Given \"pwwkew\", the answer is \"wke\", with the length of 3.\n",
+    "# ---------------------------------------------------------------\n",
+    "\n",
+    "def mot(b):\n",
+    "    a=[]\n",
+    "    for i in range(len(b)-1):\n",
+    "        while b[i] not in a:\n",
+    "            a+=b[i]\n",
+    "            i=i+1\n",
+    "        else:\n",
+    "            break\n",
+    "    return a        \n",
+    "    "
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 21,
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/plain": [
+       "['k', 'j', 'h']"
+      ]
+     },
+     "execution_count": 21,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "mot('kjhj')"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 22,
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/plain": [
+       "['h', 'g', 'd', 'j', 'u']"
+      ]
+     },
+     "execution_count": 22,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "mot('hgdjuhg')"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 23,
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/plain": [
+       "['b']"
+      ]
+     },
+     "execution_count": 23,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "mot('bbbbbb')"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 24,
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/plain": [
+       "['a', 'b', 'c']"
+      ]
+     },
+     "execution_count": 24,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "mot('abcabcbb')"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 26,
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/plain": [
+       "['p', 'w']"
+      ]
+     },
+     "execution_count": 26,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "mot('pwwkew')"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 37,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "import numpy as np\n",
+    "def mot(b):\n",
+    "    a=np.zeros(len(b))\n",
+    "    for j in range(0,len(b)-2):\n",
+    "        for i in range(len(b)-1):\n",
+    "            while b[i] not in a:\n",
+    "                a[i,:]=b[i]\n",
+    "                i=i+1\n",
+    "            else:\n",
+    "                break\n",
+    "        j+=1        \n",
+    "        return a  "
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 38,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stderr",
+     "output_type": "stream",
+     "text": [
+      "F:\\Anaconda35\\lib\\site-packages\\ipykernel_launcher.py:6: FutureWarning: elementwise comparison failed; returning scalar instead, but in the future will perform elementwise comparison\n",
+      "  \n"
+     ]
+    },
+    {
+     "ename": "IndexError",
+     "evalue": "too many indices for array",
+     "output_type": "error",
+     "traceback": [
+      "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m",
+      "\u001b[1;31mIndexError\u001b[0m                                Traceback (most recent call last)",
+      "\u001b[1;32m<ipython-input-38-2d95b91d9eb4>\u001b[0m in \u001b[0;36m<module>\u001b[1;34m()\u001b[0m\n\u001b[1;32m----> 1\u001b[1;33m \u001b[0mmot\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;34m'fkqhcgs'\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m",
+      "\u001b[1;32m<ipython-input-37-7bb11ab14eba>\u001b[0m in \u001b[0;36mmot\u001b[1;34m(b)\u001b[0m\n\u001b[0;32m      5\u001b[0m         \u001b[1;32mfor\u001b[0m \u001b[0mi\u001b[0m \u001b[1;32min\u001b[0m \u001b[0mrange\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mlen\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mb\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m-\u001b[0m\u001b[1;36m1\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m      6\u001b[0m             \u001b[1;32mwhile\u001b[0m \u001b[0mb\u001b[0m\u001b[1;33m[\u001b[0m\u001b[0mi\u001b[0m\u001b[1;33m]\u001b[0m \u001b[1;32mnot\u001b[0m \u001b[1;32min\u001b[0m \u001b[0ma\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[1;32m----> 7\u001b[1;33m                 \u001b[0ma\u001b[0m\u001b[1;33m[\u001b[0m\u001b[0mi\u001b[0m\u001b[1;33m,\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m]\u001b[0m\u001b[1;33m=\u001b[0m\u001b[0mb\u001b[0m\u001b[1;33m[\u001b[0m\u001b[0mi\u001b[0m\u001b[1;33m]\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m\u001b[0;32m      8\u001b[0m                 \u001b[0mi\u001b[0m\u001b[1;33m=\u001b[0m\u001b[0mi\u001b[0m\u001b[1;33m+\u001b[0m\u001b[1;36m1\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m      9\u001b[0m             \u001b[1;32melse\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n",
+      "\u001b[1;31mIndexError\u001b[0m: too many indices for array"
+     ]
+    }
+   ],
+   "source": [
+    "mot('fkqhcgs')"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 44,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "a=np.mat(8)"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 45,
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/plain": [
+       "matrix([[8]])"
+      ]
+     },
+     "execution_count": 45,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "a"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 46,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "def matrice(i,j): return [[0 for q in range(0,j)] for p in range(0,i)]"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 48,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "r=matrice(7,7)"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 63,
+   "metadata": {},
+   "outputs": [
+    {
+     "data": {
+      "text/plain": [
+       "[0, 0, 0, 0, 0, 0, 0, '1', '1', '1']"
+      ]
+     },
+     "execution_count": 63,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "r[1]+='1'\n",
+    "r[1]"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 76,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "import numpy as np\n",
+    "def mot(b):\n",
+    "    v=[]\n",
+    "    a=matrice(len(b)-1,len(b)-1)\n",
+    "    for j in range(0,len(b)-1):\n",
+    "        for i in range(len(b)-2):\n",
+    "            while b[i] not in a:\n",
+    "                v+=b[i]\n",
+    "                i=i+1\n",
+    "            else:\n",
+    "                break\n",
+    "        j+=1        \n",
+    "    return v[i,j]  "
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 77,
+   "metadata": {},
+   "outputs": [
+    {
+     "ename": "IndexError",
+     "evalue": "string index out of range",
+     "output_type": "error",
+     "traceback": [
+      "\u001b[1;31m---------------------------------------------------------------------------\u001b[0m",
+      "\u001b[1;31mIndexError\u001b[0m                                Traceback (most recent call last)",
+      "\u001b[1;32m<ipython-input-77-376e875e577b>\u001b[0m in \u001b[0;36m<module>\u001b[1;34m()\u001b[0m\n\u001b[1;32m----> 1\u001b[1;33m \u001b[0mmot\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;34m'khjkh'\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m",
+      "\u001b[1;32m<ipython-input-76-c371b967fb65>\u001b[0m in \u001b[0;36mmot\u001b[1;34m(b)\u001b[0m\n\u001b[0;32m      5\u001b[0m     \u001b[1;32mfor\u001b[0m \u001b[0mj\u001b[0m \u001b[1;32min\u001b[0m \u001b[0mrange\u001b[0m\u001b[1;33m(\u001b[0m\u001b[1;36m0\u001b[0m\u001b[1;33m,\u001b[0m\u001b[0mlen\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mb\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m-\u001b[0m\u001b[1;36m1\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m      6\u001b[0m         \u001b[1;32mfor\u001b[0m \u001b[0mi\u001b[0m \u001b[1;32min\u001b[0m \u001b[0mrange\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mlen\u001b[0m\u001b[1;33m(\u001b[0m\u001b[0mb\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m-\u001b[0m\u001b[1;36m2\u001b[0m\u001b[1;33m)\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[1;32m----> 7\u001b[1;33m             \u001b[1;32mwhile\u001b[0m \u001b[0mb\u001b[0m\u001b[1;33m[\u001b[0m\u001b[0mi\u001b[0m\u001b[1;33m]\u001b[0m \u001b[1;32mnot\u001b[0m \u001b[1;32min\u001b[0m \u001b[0ma\u001b[0m\u001b[1;33m:\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0m\u001b[0;32m      8\u001b[0m                 \u001b[0mv\u001b[0m\u001b[1;33m+=\u001b[0m\u001b[0mb\u001b[0m\u001b[1;33m[\u001b[0m\u001b[0mi\u001b[0m\u001b[1;33m]\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n\u001b[0;32m      9\u001b[0m                 \u001b[0mi\u001b[0m\u001b[1;33m=\u001b[0m\u001b[0mi\u001b[0m\u001b[1;33m+\u001b[0m\u001b[1;36m1\u001b[0m\u001b[1;33m\u001b[0m\u001b[0m\n",
+      "\u001b[1;31mIndexError\u001b[0m: string index out of range"
+     ]
+    }
+   ],
+   "source": [
+    "mot('khjkh')"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 78,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Twinkle, twinkle, little star, \n",
+      "\tHow I wonder what you are! \n",
+      "\t\tUp above the world so high, \n",
+      "\t\tLike a diamond in the sky. \n",
+      "Twinkle, twinkle, little star, \n",
+      "\tHow I wonder what you are!\n"
+     ]
+    }
+   ],
+   "source": [
+    "print(\"Twinkle, twinkle, little star, \\n\\tHow I wonder what you are! \\n\\t\\tUp above the world so high, \\n\\t\\tLike a diamond in the sky. \\nTwinkle, twinkle, little star, \\n\\tHow I wonder what you are!\")"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 79,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "What is your name: Moad\n",
+      "How old are you: 23\n",
+      "Moad will be 100 years old in the year 2095\n"
+     ]
+    }
+   ],
+   "source": [
+    "name = input(\"What is your name: \")\n",
+    "age = int(input(\"How old are you: \"))\n",
+    "year = str((2018 - age)+100)\n",
+    "print(name + \" will be 100 years old in the year \" + year)"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {},
+   "outputs": [],
+   "source": []
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3 (ipykernel)",
+   "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",
+   "version": "3.9.7"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 4
+}

200 solved problems in Python/array/array_longest_non_repeat_solution.ipynb

@@ -0,0 +1,128 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 6,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "['a', 'b', 'c']\n",
+      "['b', 'c', 'a']\n",
+      "['c', 'a', 'b']\n",
+      "['a', 'b', 'c']\n",
+      "['b', 'c']\n",
+      "['c', 'b']\n",
+      "['b']\n",
+      "['b']\n"
+     ]
+    },
+    {
+     "data": {
+      "text/plain": [
+       "3"
+      ]
+     },
+     "execution_count": 6,
+     "metadata": {},
+     "output_type": "execute_result"
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Challenge\n",
+    "# Given a string, find the length of the longest substring\n",
+    "# without repeating characters.\n",
+    "\n",
+    "# Examples:\n",
+    "# Given \"abcabcbb\", the answer is \"abc\", which the length is 3.\n",
+    "# Given \"bbbbb\", the answer is \"b\", with the length of 1.\n",
+    "# Given \"pwwkew\", the answer is \"wke\", with the length of 3.\n",
+    "# ---------------------------------------------------------------\n",
+    "# Algorithm\n",
+    "\n",
+    "# In summary : Form all posible sub_strings from original string, then return length of longest sub_string\n",
+    "\n",
+    "# - start from 1st character, form as long as posible sub string\n",
+    "\n",
+    "#             - Add first character to sub string\n",
+    "#             - Add second character to sub string if second character not exist in sub string\n",
+    "#             ...\n",
+    "#             - Repeate until got a character which already exist inside sub string or \n",
+    "    \n",
+    "    \n",
+    "# - start from 2nd character, form as long as posible sub string\n",
+    "\n",
+    "#             - Add first character to sub string\n",
+    "#             - Add second character to sub string if second character not exist in sub string\n",
+    "#             ...\n",
+    "#             - Repeate until got a character which already exist inside sub string\n",
+    "\n",
+    "\n",
+    "# ....\n",
+    "\n",
+    "\n",
+    "# - start from final character, form as long as posible sub string\n",
+    "#             - Add first character to sub string\n",
+    "#             - Add second character to sub string if second character not exist in sub string\n",
+    "#             ...\n",
+    "#             - Repeate until got a character which already exist inside sub string\n",
+    "# ---------------------------------------------------------------\n",
+    "\n",
+    "str = \"abcbb\"\n",
+    "\n",
+    "def longest_non_repeat(str):\n",
+    "    \n",
+    "    # init start position and max length     \n",
+    "    i=0\n",
+    "    max_length = 1\n",
+    "\n",
+    "    for i,c in enumerate(str):\n",
+    "\n",
+    "        # init counter and sub string value         \n",
+    "        start_at = i\n",
+    "        sub_str=[]\n",
+    "\n",
+    "        # continue increase sub string if did not repeat character         \n",
+    "        while (start_at < len(str)) and (str[start_at] not in sub_str):\n",
+    "            sub_str.append(str[start_at])\n",
+    "            start_at = start_at + 1\n",
+    "\n",
+    "        # update the max length   \n",
+    "        if len(sub_str) > max_length:\n",
+    "            max_length = len(sub_str)\n",
+    "\n",
+    "        print(sub_str)\n",
+    "        \n",
+    "    return max_length\n",
+    "\n",
+    "longest_non_repeat(str)\n"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3 (ipykernel)",
+   "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",
+   "version": "3.9.7"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 4
+}

200 solved problems in Python/array/array_merge_intervals.ipynb

@@ -0,0 +1,42 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 5,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Given a collection of intervals which are already sorted by start number, merge all overlapping intervals.\n",
+    "# For example,\n",
+    "# Given [[1,3],[2,6],[5,10],[11,16],[15,18],[19,22]],\n",
+    "# return [[1, 10], [11, 18], [19, 22]]\n"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_merge_intervals_solution.ipynb

@@ -0,0 +1,64 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "[[1, 10], [11, 18], [19, 22]]\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "\"\"\"\n",
+    "Given a collection of intervals which are already sorted by start number, merge all overlapping intervals.\n",
+    "For example,\n",
+    "Given [[1,3],[2,6],[5,10],[11,16],[15,18],[19,22]],\n",
+    "return [[1, 10], [11, 18], [19, 22]]\n",
+    "\"\"\"\n",
+    "\n",
+    "org_intervals = [[1,3],[2,6],[5,10],[11,16],[15,18],[19,22]]\n",
+    "\n",
+    "i = 0\n",
+    "\n",
+    "while i < len(org_intervals)-1:\n",
+    "#     print(org_intervals[i])\n",
+    "    if org_intervals[i+1][0] < org_intervals[i][1]:\n",
+    "        org_intervals[i][1]=org_intervals[i+1][1]\n",
+    "        del org_intervals[i+1]\n",
+    "        i = i - 1\n",
+    "    i = i + 1\n",
+    "\n",
+    "print(org_intervals)"
+   ]
+  }
+ ],
+ "metadata": {
+  "kernelspec": {
+   "display_name": "Python 3 (ipykernel)",
+   "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",
+   "version": "3.9.7"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 4
+}

200 solved problems in Python/array/array_missing_element_challenge.ipynb

@@ -0,0 +1,43 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {
+    "scrolled": true
+   },
+   "outputs": [],
+   "source": [
+    "# Consider an array of non-negative integers.\n",
+    "# A second array is formed by shuffling the elements of the first array and deleting a random element. \n",
+    "# Given these two arrays, find which element is missing in the second array.\n",
+    "# Here is an example input, the first array is shuffled and the number 5 is removed to construct the second array.\n",
+    "# Input:\n",
+    "# finder([1,2,3,4,5,6,7],[3,7,2,1,4,6])\n",
+    "# Output:\n",
+    "# 5 is the missing number"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_missing_element_solution.ipynb

@@ -0,0 +1,67 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 25,
+   "metadata": {
+    "scrolled": true
+   },
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "5\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ----------------------------------------------------------------\n",
+    "# Consider an array of non-negative integers.\n",
+    "# A second array is formed by shuffling the elements of the first array and deleting a random element. \n",
+    "# Given these two arrays, find which element is missing in the second array.\n",
+    "# Here is an example input, the first array is shuffled and the number 5 is removed to construct the second array.\n",
+    "# Input:\n",
+    "# finder([1,2,3,4,5,6,7],[3,7,2,1,4,6])\n",
+    "# Output:\n",
+    "# 5 is the missing number\n",
+    "# ----------------------------------------------------------------\n",
+    "# Algorithm\n",
+    "# \n",
+    "# ----------------------------------------------------------------\n",
+    "\n",
+    "\n",
+    "first_array = [1,2,3,4,5,6,7]\n",
+    "second_array = [3,7,2,1,4,6]\n",
+    "\n",
+    "def finder(first_array, second_array):\n",
+    "    return(sum(first_array) - sum(second_array))\n",
+    "\n",
+    "missing_number = finder(first_array, second_array)\n",
+    "\n",
+    "print(missing_number)    "
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_rotate.ipynb

@@ -0,0 +1,39 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "# Rotate an array of n elements to the right by k steps.\n",
+    "# For example, with n = 7 and k = 3,\n",
+    "# the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].\n",
+    "# Note:\n",
+    "# Try to come up as many solutions as you can,\n",
+    "# there are at least 3 different ways to solve this problem."
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_rotate_solution.ipynb

@@ -0,0 +1,61 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "[5, 6, 7, 1, 2, 3, 4]\n"
+     ]
+    }
+   ],
+   "source": [
+    "\"\"\"\n",
+    "Rotate an array of n elements to the right by k steps.\n",
+    "For example, with n = 7 and k = 3,\n",
+    "the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].\n",
+    "Note:\n",
+    "Try to come up as many solutions as you can,\n",
+    "there are at least 3 different ways to solve this problem.\n",
+    "\"\"\"\n",
+    "\n",
+    "org = [1,2,3,4,5,6,7]\n",
+    "result = org[:]\n",
+    "steps = 3\n",
+    "\n",
+    "for idx,num in enumerate(org):\n",
+    "    if idx+steps < len(org):\n",
+    "        result[idx+steps] = org[idx]\n",
+    "    else:\n",
+    "        result[idx+steps-len(org)] = org[idx]\n",
+    "\n",
+    "print(result)"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_summary_ranges.ipynb

@@ -0,0 +1,36 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "# Given a sorted integer array without duplicates,\n",
+    "# return the summary of its ranges.\n",
+    "# For example, given [0,1,2,4,5,7], return [\"0->2\",\"4->5\",\"7\"]."
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_summary_ranges_solution.ipynb

@@ -0,0 +1,87 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "['0-->2']\n",
+      "['0-->2', '4-->5']\n",
+      "['0-->2', '4-->5', '7']\n",
+      "['0-->2', '4-->5', '7']\n"
+     ]
+    }
+   ],
+   "source": [
+    "\"\"\"\n",
+    "Given a sorted integer array without duplicates,\n",
+    "return the summary of its ranges.\n",
+    "For example, given [0,1,2,4,5,7], return [\"0->2\",\"4->5\",\"7\"].\n",
+    "\"\"\"\n",
+    "\n",
+    "input_array = [0,1,2,4,5,7]\n",
+    "# input_array = [1,2,3,6,9,11,12,13,14,19,20]\n",
+    "\n",
+    "start=0\n",
+    "result = []\n",
+    "\n",
+    "# i=0\n",
+    "# while i <= len(input_array)-1:\n",
+    "#     print(i, input_array[i])\n",
+    "#     i = i+1\n",
+    "\n",
+    "\n",
+    "while start < len(input_array):\n",
+    "    \n",
+    "    # initial end at start position     \n",
+    "    end = start\n",
+    "\n",
+    "    # continue to move the end pointer if the gap is 1 with beside number\n",
+    "    # only continue to move if index end+1 is inside array     \n",
+    "    while end+1<len(input_array) and ((input_array[end+1] - input_array[end]) == 1):\n",
+    "        end = end + 1\n",
+    "\n",
+    "    # add range to result after calculate     \n",
+    "    if end!=start:\n",
+    "        result.append(\"{0}-->{1}\".format(input_array[start], input_array[end]))\n",
+    "        print(result)\n",
+    "    else:\n",
+    "        result.append(\"{0}\".format(input_array[start]))\n",
+    "        print(result)\n",
+    "        \n",
+    "    # change to next range\n",
+    "    start = end+1\n",
+    "\n",
+    "print(result)\n",
+    "\n",
+    "\n",
+    "            "
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_two_sum.ipynb

@@ -0,0 +1,41 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 4,
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "# Given an array of integers, return indices of the two numbers\n",
+    "# such that they add up to a specific target.\n",
+    "# You may assume that each input would have exactly one solution\n",
+    "\n",
+    "# Example:\n",
+    "#     Given nums = [2, 7, 11, 15], target = 26,\n",
+    "#     Because nums[2] + nums[3] = 11 + 15 = 26,\n",
+    "#     return [2, 3]."
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/array/array_two_sum_solution.ipynb

@@ -0,0 +1,79 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "0 1\n",
+      "0 2\n",
+      "0 3\n",
+      "1 2\n",
+      "1 3\n",
+      "2 3\n"
+     ]
+    }
+   ],
+   "source": [
+    "\"\"\"\n",
+    "Given an array of integers, return indices of the two numbers\n",
+    "such that they add up to a specific target.\n",
+    "You may assume that each input would have exactly one solution,\n",
+    "and you may not use the same element twice.\n",
+    "Example:\n",
+    "    Given nums = [2, 7, 11, 15], target = 26,\n",
+    "    Because nums[0] + nums[1] = 11 + 15 = 26,\n",
+    "    return [2, 3].\n",
+    "\"\"\"\n",
+    "\n",
+    "# Solution 1\n",
+    "# Try all \n",
+    "\n",
+    "input_array = [2, 7, 11, 15]\n",
+    "target = 26\n",
+    "result = []\n",
+    "\n",
+    "for i, num in enumerate(input_array):\n",
+    "    for j in range(i+1, len(input_array)):\n",
+    "        print(i,j)\n"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Solution 2\n",
+    "\n"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/.ipynb_checkpoints/calculate_with_input-checkpoint.ipynb

@@ -0,0 +1,41 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program that accepts an integer (n) and computes the value of n+nn+nnn. Go to the editor\n",
+    "# Sample value of n is 5 \n",
+    "# Expected Result : 615"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/.ipynb_checkpoints/calculate_with_input_solution-checkpoint.ipynb

@@ -0,0 +1,54 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Input an integer : 5\n",
+      "615\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program that accepts an integer (n) and computes the value of n+nn+nnn. Go to the editor\n",
+    "# Sample value of n is 5 \n",
+    "# Expected Result : 615\n",
+    "\n",
+    "a = int(input(\"Input an integer : \"))\n",
+    "n1 = int( \"%s\" % a )\n",
+    "n2 = int( \"%s%s\" % (a,a) )\n",
+    "n3 = int( \"%s%s%s\" % (a,a,a) )\n",
+    "print (n1+n2+n3)"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/.ipynb_checkpoints/input_age-checkpoint.ipynb

@@ -0,0 +1,40 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Create a program that asks the user to enter their name and their age.\n",
+    "# Print out a message addressed to them that tells them the year that they will turn 100 years old."
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/.ipynb_checkpoints/input_age_solution-checkpoint.ipynb

@@ -0,0 +1,53 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "What is your name: Tan\n",
+      "How old are you: 34\n",
+      "Tan will be 100 years old in the year 2080\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Create a program that asks the user to enter their name and their age.\n",
+    "# Print out a message addressed to them that tells them the year that they will turn 100 years old.\n",
+    "\n",
+    "name = input(\"What is your name: \")\n",
+    "age = int(input(\"How old are you: \"))\n",
+    "year = str((2014 - age)+100)\n",
+    "print(name + \" will be 100 years old in the year \" + year)"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/.ipynb_checkpoints/print_string-checkpoint.ipynb

@@ -0,0 +1,50 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program to print the following string in a specific format (see the output). Go to the editor\n",
+    "\n",
+    "# Sample String : \"Twinkle, twinkle, little star, How I wonder what you are! Up above the world so high, Like a diamond in the sky. Twinkle, twinkle, little star, How I wonder what you are\" \n",
+    "\n",
+    "# Output :\n",
+    "\n",
+    "# Twinkle, twinkle, little star,\n",
+    "# \tHow I wonder what you are! \n",
+    "# \t\tUp above the world so high,\n",
+    "# \t\tLike a diamond in the sky. \n",
+    "# Twinkle, twinkle, little star, \n",
+    "# \tHow I wonder what you are"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/.ipynb_checkpoints/print_string_solution-checkpoint.ipynb

@@ -0,0 +1,69 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Twinkle, twinkle, little star, \n",
+      "\tHow I wonder what you are! \n",
+      "\t\tUp above the world so high, \n",
+      "\t\tLike a diamond in the sky. \n",
+      "Twinkle, twinkle, little star, \n",
+      "\tHow I wonder what you are!\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program to print the following string in a specific format (see the output). Go to the editor\n",
+    "\n",
+    "# Sample String : \"Twinkle, twinkle, little star, How I wonder what you are! Up above the world so high, Like a diamond in the sky. Twinkle, twinkle, little star, How I wonder what you are\" \n",
+    "\n",
+    "# Output :\n",
+    "\n",
+    "# Twinkle, twinkle, little star,\n",
+    "# \tHow I wonder what you are! \n",
+    "# \t\tUp above the world so high,\n",
+    "# \t\tLike a diamond in the sky. \n",
+    "# Twinkle, twinkle, little star, \n",
+    "# \tHow I wonder what you are\n",
+    "\n",
+    "# ----------------------------------------------------\n",
+    "\n",
+    "# Hints\n",
+    "# Using \\n (newline) and \\t (tab) to format the string\n",
+    "\n",
+    "print(\"Twinkle, twinkle, little star, \\n\\tHow I wonder what you are! \\n\\t\\tUp above the world so high, \\n\\t\\tLike a diamond in the sky. \\nTwinkle, twinkle, little star, \\n\\tHow I wonder what you are!\")\n",
+    "\n"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/calculate_with_input.ipynb

@@ -0,0 +1,41 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program that accepts an integer (n) and computes the value of n+nn+nnn. Go to the editor\n",
+    "# Sample value of n is 5 \n",
+    "# Expected Result : 615"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/calculate_with_input_solution.ipynb

@@ -0,0 +1,54 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Input an integer : 5\n",
+      "615\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program that accepts an integer (n) and computes the value of n+nn+nnn. Go to the editor\n",
+    "# Sample value of n is 5 \n",
+    "# Expected Result : 615\n",
+    "\n",
+    "a = int(input(\"Input an integer : \"))\n",
+    "n1 = int( \"%s\" % a )\n",
+    "n2 = int( \"%s%s\" % (a,a) )\n",
+    "n3 = int( \"%s%s%s\" % (a,a,a) )\n",
+    "print (n1+n2+n3)"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/input_age.ipynb

@@ -0,0 +1,40 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Create a program that asks the user to enter their name and their age.\n",
+    "# Print out a message addressed to them that tells them the year that they will turn 100 years old."
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/input_age_solution.ipynb

@@ -0,0 +1,53 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "What is your name: Tan\n",
+      "How old are you: 34\n",
+      "Tan will be 100 years old in the year 2080\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Create a program that asks the user to enter their name and their age.\n",
+    "# Print out a message addressed to them that tells them the year that they will turn 100 years old.\n",
+    "\n",
+    "name = input(\"What is your name: \")\n",
+    "age = int(input(\"How old are you: \"))\n",
+    "year = str((2014 - age)+100)\n",
+    "print(name + \" will be 100 years old in the year \" + year)"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/print_string.ipynb

@@ -0,0 +1,50 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program to print the following string in a specific format (see the output). Go to the editor\n",
+    "\n",
+    "# Sample String : \"Twinkle, twinkle, little star, How I wonder what you are! Up above the world so high, Like a diamond in the sky. Twinkle, twinkle, little star, How I wonder what you are\" \n",
+    "\n",
+    "# Output :\n",
+    "\n",
+    "# Twinkle, twinkle, little star,\n",
+    "# \tHow I wonder what you are! \n",
+    "# \t\tUp above the world so high,\n",
+    "# \t\tLike a diamond in the sky. \n",
+    "# Twinkle, twinkle, little star, \n",
+    "# \tHow I wonder what you are"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/basic/print_string_solution.ipynb

@@ -0,0 +1,69 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "Twinkle, twinkle, little star, \n",
+      "\tHow I wonder what you are! \n",
+      "\t\tUp above the world so high, \n",
+      "\t\tLike a diamond in the sky. \n",
+      "Twinkle, twinkle, little star, \n",
+      "\tHow I wonder what you are!\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program to print the following string in a specific format (see the output). Go to the editor\n",
+    "\n",
+    "# Sample String : \"Twinkle, twinkle, little star, How I wonder what you are! Up above the world so high, Like a diamond in the sky. Twinkle, twinkle, little star, How I wonder what you are\" \n",
+    "\n",
+    "# Output :\n",
+    "\n",
+    "# Twinkle, twinkle, little star,\n",
+    "# \tHow I wonder what you are! \n",
+    "# \t\tUp above the world so high,\n",
+    "# \t\tLike a diamond in the sky. \n",
+    "# Twinkle, twinkle, little star, \n",
+    "# \tHow I wonder what you are\n",
+    "\n",
+    "# ----------------------------------------------------\n",
+    "\n",
+    "# Hints\n",
+    "# Using \\n (newline) and \\t (tab) to format the string\n",
+    "\n",
+    "print(\"Twinkle, twinkle, little star, \\n\\tHow I wonder what you are! \\n\\t\\tUp above the world so high, \\n\\t\\tLike a diamond in the sky. \\nTwinkle, twinkle, little star, \\n\\tHow I wonder what you are!\")\n",
+    "\n"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/.ipynb_checkpoints/check_parentheses-checkpoint.ipynb

@@ -0,0 +1,41 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program to find validity of a string of parentheses, '(', ')', '{', '}', '[' and ']. \n",
+    "# These brackets must be close in the correct order, \n",
+    "# for example \"()\" and \"()[]{}\" are valid but \"[)\", \"({[)]\" and \"{{{\" are invalid."
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/.ipynb_checkpoints/check_parentheses_solution-checkpoint.ipynb

@@ -0,0 +1,63 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "True\n",
+      "False\n",
+      "True\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program to find validity of a string of parentheses, '(', ')', '{', '}', '[' and ']. \n",
+    "# These brackets must be close in the correct order, \n",
+    "# for example \"()\" and \"()[]{}\" are valid but \"[)\", \"({[)]\" and \"{{{\" are invalid.\n",
+    "\n",
+    "class py_solution:\n",
+    "   def is_valid_parenthese(self, str1):\n",
+    "        stack, pchar = [], {\"(\": \")\", \"{\": \"}\", \"[\": \"]\"}\n",
+    "        for parenthese in str1:\n",
+    "            if parenthese in pchar:\n",
+    "                stack.append(parenthese)\n",
+    "            elif len(stack) == 0 or pchar[stack.pop()] != parenthese:\n",
+    "                return False\n",
+    "        return len(stack) == 0\n",
+    "\n",
+    "print(py_solution().is_valid_parenthese(\"(){}[]\"))\n",
+    "print(py_solution().is_valid_parenthese(\"()[{)}\"))\n",
+    "print(py_solution().is_valid_parenthese(\"()\"))"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/.ipynb_checkpoints/revert_word-checkpoint.ipynb

@@ -0,0 +1,38 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python class to reverse a string word by word.\n",
+    "# Input \"hello world\"\n",
+    "# Output \"world hello\""
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/check_parentheses.ipynb

@@ -0,0 +1,41 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program to find validity of a string of parentheses, '(', ')', '{', '}', '[' and ']. \n",
+    "# These brackets must be close in the correct order, \n",
+    "# for example \"()\" and \"()[]{}\" are valid but \"[)\", \"({[)]\" and \"{{{\" are invalid."
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/check_parentheses_solution.ipynb

@@ -0,0 +1,63 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "True\n",
+      "False\n",
+      "True\n"
+     ]
+    }
+   ],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program to find validity of a string of parentheses, '(', ')', '{', '}', '[' and ']. \n",
+    "# These brackets must be close in the correct order, \n",
+    "# for example \"()\" and \"()[]{}\" are valid but \"[)\", \"({[)]\" and \"{{{\" are invalid.\n",
+    "\n",
+    "class py_solution:\n",
+    "   def is_valid_parenthese(self, str1):\n",
+    "        stack, pchar = [], {\"(\": \")\", \"{\": \"}\", \"[\": \"]\"}\n",
+    "        for parenthese in str1:\n",
+    "            if parenthese in pchar:\n",
+    "                stack.append(parenthese)\n",
+    "            elif len(stack) == 0 or pchar[stack.pop()] != parenthese:\n",
+    "                return False\n",
+    "        return len(stack) == 0\n",
+    "\n",
+    "print(py_solution().is_valid_parenthese(\"(){}[]\"))\n",
+    "print(py_solution().is_valid_parenthese(\"()[{)}\"))\n",
+    "print(py_solution().is_valid_parenthese(\"()\"))"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/circle.ipynb

@@ -0,0 +1,37 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python class named Circle constructed by a radius and two methods which\n",
+    "# will compute the area and the perimeter of a circle."
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/circle_solution.ipynb

@@ -0,0 +1,58 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "200.96\n",
+      "50.24\n"
+     ]
+    }
+   ],
+   "source": [
+    "# Write a Python class named Circle constructed by a radius and two methods which\n",
+    "# will compute the area and the perimeter of a circle.\n",
+    "\n",
+    "class Circle():\n",
+    "    def __init__(self, r):\n",
+    "        self.radius = r\n",
+    "\n",
+    "    def area(self):\n",
+    "        return self.radius**2*3.14\n",
+    "    \n",
+    "    def perimeter(self):\n",
+    "        return 2*self.radius*3.14\n",
+    "\n",
+    "NewCircle = Circle(8)\n",
+    "print(NewCircle.area())\n",
+    "print(NewCircle.perimeter())"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/convert_to_int.ipynb

@@ -0,0 +1,46 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python class to convert a roman numeral to an integer\n",
+    "\n",
+    "# Sample input\n",
+    "# 'MMMCMLXXXVI'\n",
+    "# 'MMMM'\n",
+    "# 'C'\n",
+    "\n",
+    "# Sample output\n",
+    "# 3986                                                                                                          \n",
+    "# 4000                                                                                                          \n",
+    "# 100"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/convert_to_int_solution.ipynb

@@ -0,0 +1,61 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python class to convert a roman numeral to an integer\n",
+    "\n",
+    "# Sample input\n",
+    "# 'MMMCMLXXXVI'\n",
+    "# 'MMMM'\n",
+    "# 'C'\n",
+    "\n",
+    "# Sample output\n",
+    "# 3986                                                                                                          \n",
+    "# 4000                                                                                                          \n",
+    "# 100\n",
+    "\n",
+    "class py_solution:\n",
+    "    def roman_to_int(self, s):\n",
+    "        rom_val = {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}\n",
+    "        int_val = 0\n",
+    "        for i in range(len(s)):\n",
+    "            if i > 0 and rom_val[s[i]] > rom_val[s[i - 1]]:\n",
+    "                int_val += rom_val[s[i]] - 2 * rom_val[s[i - 1]]\n",
+    "            else:\n",
+    "                int_val += rom_val[s[i]]\n",
+    "        return int_val\n",
+    "\n",
+    "print(py_solution().roman_to_int('MMMCMLXXXVI'))\n",
+    "print(py_solution().roman_to_int('MMMM'))\n",
+    "print(py_solution().roman_to_int('C'))"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/convert_to_roman.ipynb

@@ -0,0 +1,38 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python program to convert an integer to a roman numeral.\n",
+    "# Input 1, 4000\n",
+    "# Output I, MMMM"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/convert_to_roman_solution.ipynb

@@ -0,0 +1,70 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "I\n",
+      "MMMM\n"
+     ]
+    }
+   ],
+   "source": [
+    "# Write a Python program to convert an integer to a roman numeral.\n",
+    "\n",
+    "class py_solution:\n",
+    "    def int_to_Roman(self, num):\n",
+    "        val = [\n",
+    "            1000, 900, 500, 400,\n",
+    "            100, 90, 50, 40,\n",
+    "            10, 9, 5, 4,\n",
+    "            1\n",
+    "            ]\n",
+    "        syb = [\n",
+    "            \"M\", \"CM\", \"D\", \"CD\",\n",
+    "            \"C\", \"XC\", \"L\", \"XL\",\n",
+    "            \"X\", \"IX\", \"V\", \"IV\",\n",
+    "            \"I\"\n",
+    "            ]\n",
+    "        roman_num = ''\n",
+    "        i = 0\n",
+    "        while  num > 0:\n",
+    "            for _ in range(num // val[i]):\n",
+    "                roman_num += syb[i]\n",
+    "                num -= val[i]\n",
+    "            i += 1\n",
+    "        return roman_num\n",
+    "\n",
+    "\n",
+    "print(py_solution().int_to_Roman(1))\n",
+    "print(py_solution().int_to_Roman(4000))"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/get_and_print.ipynb

@@ -0,0 +1,37 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python class which has two methods get_String and print_String. \n",
+    "# get_String accept a string from the user and print_String print the string in upper case."
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/get_and_print_solution.ipynb

@@ -0,0 +1,58 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "\n",
+      "\n"
+     ]
+    }
+   ],
+   "source": [
+    "# Write a Python class which has two methods get_String and print_String. \n",
+    "# get_String accept a string from the user and print_String print the string in upper case.\n",
+    "\n",
+    "class IOString():\n",
+    "    def __init__(self):\n",
+    "        self.str1 = \"\"\n",
+    "\n",
+    "    def get_String(self):\n",
+    "        self.str1 = input()\n",
+    "\n",
+    "    def print_String(self):\n",
+    "        print(self.str1.upper())\n",
+    "\n",
+    "str1 = IOString()\n",
+    "str1.get_String()\n",
+    "str1.print_String()\n"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/rectange.ipynb

@@ -0,0 +1,36 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python class named Rectangle constructed by a length and width and a method which will compute the area of a rectangle."
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/rectange_solution.ipynb

@@ -0,0 +1,54 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "120\n"
+     ]
+    }
+   ],
+   "source": [
+    "# Write a Python class named Rectangle constructed by a length and width and a method which will compute the area of a rectangle.\n",
+    "\n",
+    "class Rectangle():\n",
+    "    def __init__(self, l, w):\n",
+    "        self.length = l\n",
+    "        self.width  = w\n",
+    "\n",
+    "    def rectangle_area(self):\n",
+    "        return self.length*self.width\n",
+    "\n",
+    "newRectangle = Rectangle(12, 10)\n",
+    "\n",
+    "print(newRectangle.rectangle_area())"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/revert_word.ipynb

@@ -0,0 +1,38 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 3,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python class to reverse a string word by word.\n",
+    "# Input \"hello world\"\n",
+    "# Output \"world hello\""
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/revert_word_solution.ipynb

@@ -0,0 +1,51 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 2,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "world hello\n"
+     ]
+    }
+   ],
+   "source": [
+    "# Write a Python class to reverse a string word by word.\n",
+    "# Input \"hello world\"\n",
+    "# Output \"world hello\"\n",
+    "\n",
+    "class py_solution:\n",
+    "    def reverse_words(self, s):\n",
+    "        return ' '.join(reversed(s.split()))\n",
+    "\n",
+    "\n",
+    "print(py_solution().reverse_words('hello world'))\n"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/sum_zero.ipynb

@@ -0,0 +1,40 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# Write a Python program to find the three elements that sum to zero from a set (array) of n real numbers.\n",
+    "# Input\n",
+    "# [-25, -10, -7, -3, 2, 4, 8, 10]\n",
+    "# Output\n",
+    "# [[-10, 2, 8], [-7, -3, 10]] "
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/class/sum_zero_solution.ipynb

@@ -0,0 +1,70 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": 1,
+   "metadata": {},
+   "outputs": [
+    {
+     "name": "stdout",
+     "output_type": "stream",
+     "text": [
+      "[[-10, 2, 8], [-7, -3, 10]]\n"
+     ]
+    }
+   ],
+   "source": [
+    "# Write a Python program to find the three elements that sum to zero from a set (array) of n real numbers.\n",
+    "# Input\n",
+    "# [-25, -10, -7, -3, 2, 4, 8, 10]\n",
+    "# Output\n",
+    "# [[-10, 2, 8], [-7, -3, 10]]\n",
+    "\n",
+    "class py_solution:\n",
+    " def threeSum(self, nums):\n",
+    "        nums, result, i = sorted(nums), [], 0\n",
+    "        while i < len(nums) - 2:\n",
+    "            j, k = i + 1, len(nums) - 1\n",
+    "            while j < k:\n",
+    "                if nums[i] + nums[j] + nums[k] < 0:\n",
+    "                    j += 1\n",
+    "                elif nums[i] + nums[j] + nums[k] > 0:\n",
+    "                    k -= 1\n",
+    "                else:\n",
+    "                    result.append([nums[i], nums[j], nums[k]])\n",
+    "                    j, k = j + 1, k - 1\n",
+    "                    while j < k and nums[j] == nums[j - 1]:\n",
+    "                        j += 1\n",
+    "                    while j < k and nums[k] == nums[k + 1]:\n",
+    "                        k -= 1\n",
+    "            i += 1\n",
+    "            while i < len(nums) - 2 and nums[i] == nums[i - 1]:\n",
+    "                i += 1\n",
+    "        return result\n",
+    "\n",
+    "print(py_solution().threeSum([-25, -10, -7, -3, 2, 4, 8, 10]))"
+   ]
+  }
+ ],
+ "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",
+   "version": "3.6.1"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/condition and loop/.ipynb_checkpoints/2_dimensional_array-checkpoint.ipynb

@@ -0,0 +1,50 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program which takes two digits m (row) and n (column) as input and generates a two-dimensional array. \n",
+    "# The element value in the i-th row and j-th column of the array should be i*j.\n",
+    "# Note :\n",
+    "# i = 0,1.., m-1 \n",
+    "# j = 0,1, n-1.\n",
+    "\n",
+    "# Input\n",
+    "# Input number of rows: 3                                                                                       \n",
+    "# Input number of columns: 4  \n",
+    "\n",
+    "# Output\n",
+    "# [[0, 0, 0, 0], [0, 1, 2, 3], [0, 2, 4, 6]] "
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}

200 solved problems in Python/condition and loop/.ipynb_checkpoints/2_dimensional_array_solution-checkpoint.ipynb

@@ -0,0 +1,60 @@
+{
+ "cells": [
+  {
+   "cell_type": "code",
+   "execution_count": null,
+   "metadata": {
+    "collapsed": true
+   },
+   "outputs": [],
+   "source": [
+    "# ---------------------------------------------------------------\n",
+    "# python best courses https://courses.tanpham.org/\n",
+    "# ---------------------------------------------------------------\n",
+    "# Write a Python program which takes two digits m (row) and n (column) as input and generates a two-dimensional array. \n",
+    "# The element value in the i-th row and j-th column of the array should be i*j.\n",
+    "# Note :\n",
+    "# i = 0,1.., m-1 \n",
+    "# j = 0,1, n-1.\n",
+    "\n",
+    "# Input\n",
+    "# Input number of rows: 3                                                                                       \n",
+    "# Input number of columns: 4  \n",
+    "\n",
+    "# Output\n",
+    "# [[0, 0, 0, 0], [0, 1, 2, 3], [0, 2, 4, 6]]\n",
+    "\n",
+    "row_num = int(input(\"Input number of rows: \"))\n",
+    "col_num = int(input(\"Input number of columns: \"))\n",
+    "multi_list = [[0 for col in range(col_num)] for row in range(row_num)]\n",
+    "\n",
+    "for row in range(row_num):\n",
+    "    for col in range(col_num):\n",
+    "        multi_list[row][col]= row*col\n",
+    "\n",
+    "print(multi_list)"
+   ]
+  }
+ ],
+ "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.13"
+  }
+ },
+ "nbformat": 4,
+ "nbformat_minor": 2
+}