My Calendar I LeetCode solution in JavaScript

1
// Brute Force => T.C: O(n^2) | S.C: O(n);
2
var MyCalendar = function () {
3
  this.val = [];
4
};
5

6
MyCalendar.prototype.book = function (start, end) {
7
  for (let book of this.val) {
8
    if (end > book[0] && start < book[1]) return false;
9
  }
10
  this.val.push([start, end]);
11
  return true;
12
};