docs: fix typos in some files

algorithms/sort/cycle_sort.py

@@ -15,7 +15,7 @@ def cycle_sort(arr):
     for cur in range(len_arr - 1):
         item = arr[cur]
 
-        # Finding an indx to put items in.
+        # Finding an index to put items in.
         index = cur
         for i in range(cur + 1, len_arr):
             if arr[i] < item:

algorithms/streaming/misra_gries.py

@@ -7,7 +7,7 @@
 By default, k is set to 2, solving the majority problem.
 
 For the majority problem, this algorithm only guarantees that if there is
-an element that appears more than n/2 times, it will be outputed. If there
+an element that appears more than n/2 times, it will be outputted. If there
 is no such element, any arbitrary element is returned by the algorithm.
 Therefore, we need to iterate through again at the end. But since we have filtred
 out the suspects, the memory complexity is significantly lower than

algorithms/strings/delete_reoccurring.py

@@ -2,7 +2,7 @@
 QUESTION: Given a string as your input, delete any reoccurring 
 character, and return the new string.
 
-This is a Google warmup interview question that was asked duirng phone screening
+This is a Google warmup interview question that was asked during phone screening
 at my university. 
 """
 

algorithms/tree/same_tree.py

@@ -18,4 +18,4 @@ def is_same_tree(tree_p, tree_q):
 # where N and M are the number of nodes for the trees.
 
 # Space Complexity O(min(height1, height2))
-# levels of recursion is the mininum height between the two trees.
+# levels of recursion is the minimum height between the two trees.