added Links + Time & Space Complexity

python/minimum_score_of_a_path_between_two_cities.py

@@ -1,3 +1,7 @@
+# https://leetcode.com/problems/minimum-score-of-a-path-between-two-cities/
+# T: O(N + M) where N is the number of nodes and M is the number of edges
+# S: O(N + M) where N is the number of nodes and M is the number of edges
+
 from collections import deque
 
 class Solution:

python/number_of_zero_filled_subarrays.py

@@ -1,3 +1,7 @@
+# https://leetcode.com/problems/number-of-zero-filled-subarrays/
+# T: O(N) where N is the length of nums
+# S: O(1)
+
 class Solution:
     def zeroFilledSubarray(self, nums) -> int:
         count = 0

python/the_skyline_problem.py

@@ -1,3 +1,7 @@
+# https://leetcode.com/problems/the-skyline-problem/
+# T: O(NlogN) where N is the number of buildings
+# S: O(N) where N is the number of buildings
+
 import bisect
 
 class Solution:

python/trie.py

@@ -1,3 +1,7 @@
+# https://leetcode.com/problems/implement-trie-prefix-tree/
+# T: O(N) where N is the length of the word
+# S: O(MN) where M is the number of words, N is the maximum length of the word
+
 class TrieNode:
     def __init__(self):
         self.children = {}