729. My Calendar I

Author: Partho Biswas

README.md

@@ -376,6 +376,7 @@ Check this [golden](https://tinyurl.com/ujopecz) post.
 |08| [145. Binary Tree Postorder Traversal](https://leetcode.com/problems/binary-tree-postorder-traversal/)| [Python](https://tinyurl.com/wu6rdaw/145_Binary_Tree_Postorder_Traversal.py)| --- | Hard | Fundamentals |
 |09| [108. Convert Sorted Array to Binary Search Tree](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/)| [Python](https://tinyurl.com/wu6rdaw/108_Convert_Sorted_Array_to_Binary_Search_Tree.py)| --- | Easy | Fundamentals |
 |10| [109. Convert Sorted List to Binary Search Tree](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/)| [Python](https://tinyurl.com/wu6rdaw/109_Convert_Sorted_List_to_Binary_Search_Tree.py)| --- | Medium | Classic problem. Very important |
+|11| **[729. My Calendar I](https://tinyurl.com/r3ew2lb)** | [Python](https://tinyurl.com/wu6rdaw/729_My_Calendar_I.py), [Swift](https://tinyurl.com/wuja3c4/729_My_Calendar_I.swift)| [Art 1](https://tinyurl.com/tbd2z7u) | Medium | Use self balancing BST for O(nlogn) solution |
 
 </p>
 </details>

leetcode.com/python/729_My_Calendar_I.py

@@ -0,0 +1,42 @@
+class TreeNode:
+    def __init__(self, start, end):
+        self.start = start
+        self.end = end
+        self.left = None
+        self.right = None
+
+class MyCalendar(object):
+
+    def __init__(self):
+        self.root = None
+
+    def bookHelper(self, start, end, node):
+        if start >= node.end:
+            if node.right:
+                return self.bookHelper(start, end, node.right)
+            else:
+                node.right = TreeNode(start, end)
+                return True
+        elif end <= node.start:
+            if node.left:
+                return self.bookHelper(start, end, node.left)
+            else:
+                node.left = TreeNode(start, end)
+                return True
+        else:
+            return False
+
+    def book(self, start, end):
+        """
+        :type start: int
+        :type end: int
+        :rtype: bool
+        """
+        if not self.root:
+            self.root = TreeNode(start, end)
+            return True
+        return self.bookHelper(start, end, self.root)
+
+# Your MyCalendar object will be instantiated and called as such:
+# obj = MyCalendar()
+# param_1 = obj.book(start,end)

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/362_Design_Hit_Counter.swift

@@ -28,7 +28,7 @@ class HitCounter {
         var hitCount = 0
         var startIdx = 0
         for i in stride(from: self.timestamps.count - 1, to: -1, by: -1) {
-            var startTime = self.timestamps[i]
+            let startTime = self.timestamps[i]
             if timestamp - startTime < 300 {
                 hitCount += self.timestampHitMap[startTime] ?? 0
                 startIdx = i

leetcode.com/swift/DS_ALGO_PRAC.playground/Sources/swift/729_My_Calendar_I.swift

@@ -0,0 +1,56 @@
+import Foundation
+
+class TreeNode {
+    let start: Int
+    let end: Int
+    var left: TreeNode?
+    var right: TreeNode?
+    
+    init(_ start: Int, _ end: Int) {
+        self.start = start
+        self.end = end
+    }
+}
+
+class MyCalendar {
+
+    var root: TreeNode?
+    
+    init() {
+        
+    }
+    
+    func bookHelper(_ start: Int, _ end: Int, _ node: inout TreeNode) -> Bool {
+        if start >= node.end {
+            if node.right != nil {
+                return self.bookHelper(start, end, &node.right!)
+            } else {
+                node.right = TreeNode(start, end)
+                return true
+            }
+        } else if end <= node.start {
+            if node.left != nil {
+                return self.bookHelper(start, end, &node.left!)
+            } else {
+                node.left = TreeNode(start, end)
+                return true
+            }
+        } else {
+            return false
+        }
+    }
+    
+    func book(_ start: Int, _ end: Int) -> Bool {
+        if let root = self.root {
+            return self.bookHelper(start, end, &self.root!)
+        }
+        self.root = TreeNode(start, end)
+        return true
+    }
+}
+
+/**
+ * Your MyCalendar object will be instantiated and called as such:
+ * let obj = MyCalendar()
+ * let ret_1: Bool = obj.book(start, end)
+ */