Added Meeting Rooms to Intervals

Author: SamsonPN

.ipynb_checkpoints/Intervals-checkpoint.ipynb

@@ -1,5 +1,77 @@
 {
  "cells": [
+  {
+   "cell_type": "markdown",
+   "id": "c379a5b5",
+   "metadata": {},
+   "source": [
+    "# Easy"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "id": "5bfb5f52",
+   "metadata": {},
+   "source": [
+    "## Meeting Rooms\n",
+    "\n",
+    "* https://www.lintcode.com/problem/920/\n",
+    "***\n",
+    "* Time Complexity: O(nlogn)\n",
+    "    - must sort intervals arr by start time: O(nlogn)\n",
+    "    - then traverse through intervals arr and find any overlaps O(n)\n",
+    "* Space Complexity: O(1)\n",
+    "    - only needs space for a couple of variables\n",
+    "***\n",
+    "* we sort intervals by start time so that it is easier to traverse the arr and determine if there is an overlap\n",
+    "    - we just see if int1[end] > int2[start]\n",
+    "    - if it is, we return false"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 4,
+   "id": "1c72f1a4",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "/**\n",
+    " * Definition of Interval:\n",
+    " * class Interval {\n",
+    " *   constructor(start, end) {\n",
+    " *     this.start = start;\n",
+    " *     this.end = end;\n",
+    " *   }\n",
+    " * }\n",
+    " */\n",
+    "\n",
+    "var Solution = class {\n",
+    "  /**\n",
+    "   * @param intervals: an array of meeting time intervals\n",
+    "   * @return: if a person could attend all meetings\n",
+    "   */\n",
+    "  canAttendMeetings(intervals) {\n",
+    "    const n = intervals.length;\n",
+    "\n",
+    "    if (n === 1) return true;\n",
+    "\n",
+    "    // sort it by start times\n",
+    "    intervals.sort((a, b) => a.start - b.start);\n",
+    "\n",
+    "    let newInterval = intervals[0];\n",
+    "    for (let i = 1; i < n; i++) {\n",
+    "      if (newInterval.end > intervals[i].start) {\n",
+    "        return false;\n",
+    "      }\n",
+    "\n",
+    "      newInterval = intervals[i];\n",
+    "    }\n",
+    "\n",
+    "    return true;\n",
+    "  }\n",
+    "}"
+   ]
+  },
   {
    "cell_type": "markdown",
    "id": "e59a494c",
@@ -148,7 +220,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "bf62193a",
+   "id": "2f905e1f",
    "metadata": {},
    "source": [
     "## Merge Intervals\n",
@@ -234,7 +306,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "6cbad747",
+   "id": "76c99826",
    "metadata": {},
    "source": [
     "## Non-overlapping Intervals\n",

Intervals.ipynb

@@ -1,5 +1,77 @@
 {
  "cells": [
+  {
+   "cell_type": "markdown",
+   "id": "c379a5b5",
+   "metadata": {},
+   "source": [
+    "# Easy"
+   ]
+  },
+  {
+   "cell_type": "markdown",
+   "id": "5bfb5f52",
+   "metadata": {},
+   "source": [
+    "## Meeting Rooms\n",
+    "\n",
+    "* https://www.lintcode.com/problem/920/\n",
+    "***\n",
+    "* Time Complexity: O(nlogn)\n",
+    "    - must sort intervals arr by start time: O(nlogn)\n",
+    "    - then traverse through intervals arr and find any overlaps O(n)\n",
+    "* Space Complexity: O(1)\n",
+    "    - only needs space for a couple of variables\n",
+    "***\n",
+    "* we sort intervals by start time so that it is easier to traverse the arr and determine if there is an overlap\n",
+    "    - we just see if int1[end] > int2[start]\n",
+    "    - if it is, we return false"
+   ]
+  },
+  {
+   "cell_type": "code",
+   "execution_count": 4,
+   "id": "1c72f1a4",
+   "metadata": {},
+   "outputs": [],
+   "source": [
+    "/**\n",
+    " * Definition of Interval:\n",
+    " * class Interval {\n",
+    " *   constructor(start, end) {\n",
+    " *     this.start = start;\n",
+    " *     this.end = end;\n",
+    " *   }\n",
+    " * }\n",
+    " */\n",
+    "\n",
+    "var Solution = class {\n",
+    "  /**\n",
+    "   * @param intervals: an array of meeting time intervals\n",
+    "   * @return: if a person could attend all meetings\n",
+    "   */\n",
+    "  canAttendMeetings(intervals) {\n",
+    "    const n = intervals.length;\n",
+    "\n",
+    "    if (n === 1) return true;\n",
+    "\n",
+    "    // sort it by start times\n",
+    "    intervals.sort((a, b) => a.start - b.start);\n",
+    "\n",
+    "    let newInterval = intervals[0];\n",
+    "    for (let i = 1; i < n; i++) {\n",
+    "      if (newInterval.end > intervals[i].start) {\n",
+    "        return false;\n",
+    "      }\n",
+    "\n",
+    "      newInterval = intervals[i];\n",
+    "    }\n",
+    "\n",
+    "    return true;\n",
+    "  }\n",
+    "}"
+   ]
+  },
   {
    "cell_type": "markdown",
    "id": "e59a494c",
@@ -148,7 +220,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "bf62193a",
+   "id": "2f905e1f",
    "metadata": {},
    "source": [
     "## Merge Intervals\n",
@@ -234,7 +306,7 @@
   },
   {
    "cell_type": "markdown",
-   "id": "6cbad747",
+   "id": "76c99826",
    "metadata": {},
    "source": [
     "## Non-overlapping Intervals\n",