Minor changes and fixes

Author: anubhavshrimal

Bit_Manipulation/Next_Number.py

@@ -17,7 +17,7 @@ def next_greater(num):
         right_pattern = (num ^ left_pattern) >> (right_one + 1)
 
         # OR both the patterns
-        # Ex. res = 0 bin = 1001
+        # Ex. res = 9 bin = 1001
         res = left_pattern | right_pattern
 
     return res

DynamicProgramming/TheMaximumSubarray.py

@@ -1,4 +1,4 @@
-#HackerRank problem Algorithms DP
+# HackerRank problem Algorithms DP
 
 
 def maxSubArray(a, size):

Graph/Boggle.py

@@ -55,12 +55,12 @@ def findWords(words, boggle):
 
 if __name__ == '__main__':
     words = {"GEEKS", "FOR", "QUIZ", "GO", "SEEK"}
-    boggle = [['G','I','Z'],
-              ['U','E','K'],
-              ['Q','S','E']]
+    boggle = [['G', 'I', 'Z'],
+              ['U', 'E', 'K'],
+              ['Q', 'S', 'E']]
 
     found = findWords(words, boggle)
 
     print("Words found in the boggle from the dictionary are:")
     for word in found:
-        print(word)
+        print(word)

Graph/DijkstraShortestPath.py

@@ -25,7 +25,7 @@ def find_min(self, dist, visited):
 
         return index
 
-    def dikstra(self, src):
+    def dijkstra(self, src):
         visited = {i: False for i in self.graph}
         dist = {i: float('inf') for i in self.graph}
         parent = {i: None for i in self.graph}
@@ -54,7 +54,7 @@ def printPath(self, parent, v):
         if parent[v] is None:
             return
         self.printPath(parent, parent[v])
-        print(v,end=' ')
+        print(v, end=' ')
 
     def printSolution(self, dist, parent, src):
         print('{}\t{}\t{}'.format('Vertex', 'Distance', 'Path'))
@@ -63,7 +63,7 @@ def printSolution(self, dist, parent, src):
             if i == src:
                 continue
             print('{} -> {}\t\t{}\t\t{}'.format(src, i, dist[i], src), end=' ')
-            self.printPath(parent,i)
+            self.printPath(parent, i)
             print()
 
 if __name__ == '__main__':
@@ -85,7 +85,7 @@ def printSolution(self, dist, parent, src):
     graph.addEdge(3, 5, 14)
     graph.addEdge(5, 4, 10)
 
-    parent, dist = graph.dikstra(0)
+    parent, dist = graph.dijkstra(0)
 
     graph.printSolution(dist, parent, 0)
 

Graph/Graph.py

@@ -40,7 +40,7 @@ def addVertex(self, key):
         node = Vertex(key)
         self.vertices[key] = node
         self.numberOfVertices += 1
-        return  node
+        return node
 
     def addEdge(self, frm, to, weight=0):
         if frm not in self.vertices:

Graph/KruskalMST.py

@@ -1,5 +1,4 @@
 # Kruskal’s Minimum Spanning Tree Algorithm
-from collections import defaultdict
 
 
 class Graph:
@@ -73,10 +72,6 @@ def kruskalMST(self):
         return g
 
 
-
-
-
-
 if __name__ == '__main__':
     # make an undirected graph
     graph = Graph()
@@ -91,4 +86,3 @@ def kruskalMST(self):
 
     for f, t, w in new_graph.edges:
         print(f, "--", t, "=", w)
-

Graph/TopologicalSort.py

@@ -25,7 +25,7 @@ def topoSortUtil(self, s, visited, sortList):
 
         sortList.insert(0, s)
 
-    def topologicalSort(self, s=None):
+    def topologicalSort(self):
         visited = {i: False for i in self.graph}
 
         sortList = []

Heaps/RunningMedian.py

@@ -227,7 +227,7 @@ def min(self):
 """
 Algorithm:
 *) Split the array stream in 2 halves, min heap(upper array) and max heap (lower array)
-*) This was the min and max of the heaps will help you get the median fast.
+*) This way the min and max of the heaps will help you get the median fast.
 *) Note that the elements should be inserted in the heaps in such a way that the elements 
 in lowerMaxHeap are all smaller than all the elements in the upperMinHeap 
 (i.e., as if the arrays were sorted and then split into two heaps)

Mathematics/Prime_factors.py

@@ -4,6 +4,7 @@
 
 from math import sqrt
 
+
 def prime_factors(num):
     # list to store the prime factors
     prime_factor_lis = []

Mathematics/Sieve_of_Eratosthenes.py

@@ -29,4 +29,4 @@ def find_primes_sieve(num):
 
 if __name__ == '__main__':
     primes = find_primes_sieve(30)
-    print(primes)
+    print(primes)

Matrix/SearchRowColumnSorted.py

@@ -1,6 +1,7 @@
 """Given an n x n matrix, where every row and column is sorted in increasing order.
 Given a number x, how to decide whether this x is in the matrix."""
 
+
 def search(mat, x):
     n = len(mat)
     i = 0

Matrix/SpiralPrint.py

@@ -38,4 +38,4 @@ def print_spiral(mat):
      [13, 14, 15, 16, 17, 18]
      ]
 
-print_spiral(a)
+print_spiral(a)

String_or_Array/K_Unique_Substring.py

@@ -11,7 +11,7 @@ def longest_k_unique(string, k):
             unique += 1
 
     if unique < k:
-        return -1
+        return -1, -1
 
     count = [0] * 26
     curr_end = curr_start = max_window_start = 0
@@ -43,8 +43,12 @@ def isValid(count, k):
 
 
 if __name__ == '__main__':
-    string = 'aabacbebebe'
+    string = 'aabaabab'
     k = 3
     max_start, max_len = longest_k_unique(string, k)
-    print('max string with {} unique characters is "'.format(k) + string[max_start: max_start + max_len] +
-          '" of length', max_len)
+
+    if max_len == -1:
+        print("K unique characters sub string does not exist.")
+    else:
+        print('max string with {} unique characters is "'.format(k) + string[max_start: max_start + max_len] +
+              '" of length', max_len)

String_or_Array/PairSum_is_X.py

@@ -36,6 +36,7 @@ def find_pair_unsorted(arr, x):
 Space Complexity: O(1)
 """
 
+
 def find_pair_sorted(arr, x):
     # initialize variables to the start and end of the array
     l = 0

String_or_Array/Sorting/K_Messed_Sort.py

@@ -3,6 +3,7 @@
 """
 import heapq
 
+
 def kHeapSort(arr, k):
     h = []
     n = len(arr)

Tree/BinaryTree/Lowest_Common_Ancestor.py

@@ -97,5 +97,3 @@ def findLCA(root, n1, n2):
     print("LCA(4,10) = ", lca.key)
 else:
     print("Keys are not present")
-
-    # This code is contributed by Nikhil Kumar Singh(nickzuck_007)

Tree/BinaryTree/Max_Path_Sum.py

@@ -22,7 +22,7 @@ def max_sum_path_util(root):
     right_sum = max_sum_path_util(root.right)
 
     # if current node is one of the nodes in the path above for max
-    # it can either be along, or with left sub tree or right sub tree
+    # it can either be alone, or with left sub tree or right sub tree
     max_single = max(max(left_sum, right_sum) + root.data, root.data)
 
     # if the current root itself is considered as top node of the max path

Tree/BinaryTree/Minimum_height.py

@@ -26,8 +26,8 @@ def get_min_depth(root):
         else:
             if node.left is not None:
                 queue.append((node.left, height + 1))
-        if node.right is not None:
-            queue.append((node.right, height + 1))
+            if node.right is not None:
+                queue.append((node.right, height + 1))
 
 
 if __name__ == '__main__':