added pre-commit requirements

Author: Pooja Sharma

dynamic_programming/matrix_chain_multiplication.py

@@ -29,6 +29,7 @@
 arr = [40, 20, 30, 10, 30]
 output : 26000
 """
+import sys
 
 
 def matrix_chain_multiply(arr: list[int]) -> int:
@@ -57,7 +58,8 @@ def matrix_chain_multiply(arr: list[int]) -> int:
         return 0
     # initialising 2D dp matrix
     n = len(arr)
-    dp = [[float("inf") for j in range(n)] for i in range(n)]
+    int_max = sys.maxsize
+    dp = [[int_max for j in range(n)] for i in range(n)]
     # we want minimum cost of multiplication of matrices
     # of dimension (i*k) and (k*j). This cost is arr[i-1]*arr[k]*arr[j].
     for i in range(n - 1, 0, -1):
@@ -69,6 +71,7 @@ def matrix_chain_multiply(arr: list[int]) -> int:
                 dp[i][j] = min(
                     dp[i][j], dp[i][k] + dp[k + 1][j] + arr[i - 1] * arr[k] * arr[j]
                 )
+
     return dp[1][n - 1]