schedule.json

[
  {
    "number": 1,
    "start": "15/05/2019",
    "end": "22/05/2019",
    "sections": [
      "2.2: Linear Data Structures",
      "2.3: Non-Linear Data Structures"
    ]
  },
  {
    "number": 2,
    "start": "22/05/2019",
    "end": "29/05/2019",
    "sections": [
      "3.5: Dynamic Programming"
    ]
  },
  {
    "number": 3,
    "start": "29/05/2019",
    "end": "05/06/2019",
    "sections": [
      "2.4.1: Graph",
      "4.2.1: Depth-first search",
      "4.2.2: Breadth-first search",
      "4.2.6: Bipartite graph check"
    ]
  },
  {
    "number": 4,
    "start": "19/06/2019",
    "end": "26/06/2019",
    "sections": [
        "2.4.2: Union-Find Disjoint Sets",
        "4.2.4: Coloring connected components"
    ]
  },
  {
    "number": 5,
    "start": "26/06/2019",
    "end": "03/07/2019",
    "sections": [
        "5.4: Combinatorics"
    ]
  },
  {
    "number": 6,
    "start": "17/07/2019",
    "end": "04/08/2019",
    "sections": [
        "6: Strings"
    ]
  },
  {
    "number": 7,
    "start": "04/08/2019",
    "end": "18/08/2019",
    "sections": [
        "5.5: Number theory"
    ]
  },
  {
    "number": 8,
    "start": "18/08/2019",
    "end": "01/09/2019",
    "sections": [
        "4.3: Minimum spanning tree",
        "4.4: Single-source shortest paths",
        "4.5: All-pairs shortest paths",
        "4.6 Network Flow"
    ]
  }
]