70 - Matrix Chain Multiplication - Final DP solution in Java

@backstreetbrogrammer

Pseudo code:
int[][] dp = new int[N][N]; // N = arr.length
for (int len = 2; len is less than N; len++) {
for (int i = 0; i is less than (N - len); i++) {
int j = i + len;
dp[i][j] = Integer.MAX_VALUE;
for (int k = i + 1; k is less than j; k++) {
final int cost = dp[i][k] + dp[k][j] + (arr[i] * arr[k] * arr[j]);
if (cost is less than dp[i][j]) {
dp[i][j] = cost;
}
}
}
}

return dp[0][N - 1];


---------------
Coding Ninjas
---------------
https://www.codingninjas.com/codestudio/problems/matrix-chain-multiplication_975344

----------
Github
----------
https://github.com/backstreetbrogrammer/08_DynamicProgramming/blob/main/src/main/java/com/backstreetbrogrammer/dynamic/MatrixChainMultiplication.java
https://github.com/backstreetbrogrammer/08_DynamicProgramming/blob/main/src/main/resources/Day15_MatrixChainMultiplication.PNG


- Dynamic Programming Playlist: https://youtube.com/playlist?list=PLQDzPczdXrTilRgmNUQ632OrD-wfRLUR_
- Dynamic Programming Github: https://github.com/backstreetbrogrammer/08_DynamicProgramming

- Java Serialization Playlist: https://youtube.com/playlist?list=PLQDzPczdXrTjGLkI8kd2d0bfNHx0v7dTy
- Java Serialization Github: https://github.com/backstreetbrogrammer/05_Persistence

#java #javadevelopers #javaprogramming #algorithms #datastructuresandalgorithms #dynamicprogramming #onemonthofdynamicprogramming