Added Two GFG Programs!

List of Product of all elements.py

@@ -0,0 +1,13 @@
+# List of Product of all the Elements
+def arrProd(arr, n):
+    prod = 1
+    for i in range(n):
+        prod *= arr[i]
+    for i in range(n):
+        arr[i] = prod//arr[i]
+    print(arr)
+
+
+arr = [10, 3, 5, 6, 2]
+n = len(arr)
+arrProd(arr, n)

Second Maximum Value in a List.py

@@ -0,0 +1,21 @@
+# Find Second Maximum Value in a List
+
+# Optimal Approach
+# Time - O(n)
+# Space - O(1)
+
+def largest(arr, n):
+    lar_1 = lar_2 = -2147483648
+    if n < 2:
+        return "Error!"
+    for i in range(len(arr)):
+        if arr[i] > lar_1:
+            lar_2 = lar_1
+            lar_1 = arr[i]
+        elif arr[i] > lar_2 and arr[i] < lar_1:
+            lar_2 = arr[i]
+    return lar_2
+
+
+arr = [12, 35, 1, 10, 34, 1]
+print(largest(arr, len(arr)-1))