fix typo

Author: sangheestyle

Python/intersection-of-two-arrays-ii.py

@@ -88,7 +88,7 @@ def binary_search(compare, nums, left, right, target):
 
 # If the given array is already sorted, and the memory is limited or m ~ n.
 # Time:  O(m + n)
-# Soace: O(1)
+# Space: O(1)
 # Two pointers solution.
 class Solution(object):
     def intersect(self, nums1, nums2):

Python/largest-component-size-by-common-factor.py

@@ -1,5 +1,5 @@
 # Time:  O(f * n), f is the max number of unique prime factors
-# Soace: O(p + n), p is the total number of unique primes
+# Space: O(p + n), p is the total number of unique primes
 
 import collections
 

Python/valid-palindrome-ii.py

@@ -1,5 +1,5 @@
 # Time:  O(n)
-# Soace: O(1)
+# Space: O(1)
 
 class Solution(object):
     def validPalindrome(self, s):