Untitled

solve(i,j) {
    int maxCoins = 0;  
    for (int k = i; k <= j; k++) {
        int val = nums[i - 1] * nums[k] * nums[j + 1]
       + solve(i, k - 1, nums) + solve(k + 1, j, nums);
        maxi = Max(maxi  , val);
    }
    return maxi;
}