commit

Author: Milan-Pro

Recursion_ProdofArray.py

@@ -0,0 +1,38 @@
+#Given an array of integers, Replace each element with the product of the rmaining elements.
+# input: {1,2,3,4,5}
+#output: {120,60,40,30,24}
+#Brute force approach
+
+def prod_array(arr):
+    result = []    
+    for i in range(len(arr)):
+        prod = 1
+        for j in range(len(arr)):
+            if i != j:
+                prod = prod * arr[j]
+        result += [prod]    
+    print (result)
+    return result
+
+arr = [1,2,3,4,5]
+prod_array(arr)
+
+
+def rec_Prodarr(arr, prodleft, index):
+    #Termination Condition
+    if index >= len(arr):
+        return 1
+    
+    currentValue = arr[index]
+    productTillcurrentIndex = currentValue * prodleft
+
+    productOfElementRightOfCurrentIndex = rec_Prodarr(arr, productTillcurrentIndex, index+1)
+
+    arr[index] = prodleft * productOfElementRightOfCurrentIndex
+
+    return currentValue * productOfElementRightOfCurrentIndex
+    print (productOfElementRightOfCurrentIndex)
+
+
+arr = [1,2,3,4,5]
+rec_Prodarr(arr, 1, 0)

longestCommonPrefix.py

@@ -0,0 +1,17 @@
+def longestCommonPrefix(self,strs: List[strs]) -> strs:
+    # end condition if we do not have char
+    if not strs:            
+        return ''
+    
+    # find min and max length word from string List
+    m, M = min(strs), max(strs)
+
+    #enumerate min word this will give index and letter(0:m,1:i,2:l,3:a)
+    for i, letters in enumerate(m):
+        if letter != M[i]  # Compare char with Max word char and if that is not equal then 
+            return m[:i] # return min strs word starting with 0 index to i index, 
+        return m
+    
+    
+
+