Missing Test Case - 1039. Minimum Score Triangulation of Polygon

[shaikh631]

LeetCode Username

ayan_9819

Problem Number, Title, and Link

https://leetcode.com/problems/minimum-score-triangulation-of-polygon/submissions/1786535938

Bug Category

Problem examples

Bug Description

Bottom up approach

Language Used for Code

Java

Code used for Submit/Run operation

class Solution {
    public int minScoreTriangulation(int[] values) {
        int n = values.length;
        int[][] dp = new int[n][n];
        for (int i = n - 1; i >= 0; --i) {
            for (int j = i + 1; j < n; ++j) {
                for (int k = i + 1; k < j; ++k) {
                    dp[i][j] = Math.min(dp[i][j] == 0 ? Integer.MAX_VALUE : dp[i][j],
                        dp[i][k] + values[i] * values[k] * values[j] + dp[k][j]);
                }
            }
        }
        return dp[0][n - 1];
    }
}

Expected behavior

6 ms
Beats 9.29%

Screenshots

No response

Additional context

No response

[exalate-issue-sync]

oj-leetcode commented: Thank you for reaching out to us with your concern about problem examples in the LeetCode problem you're working on. From the information provided, it seems like there's an issue you've encountered with utilizing a "bottom-up approach," but we need a bit more detail to better assist you. Could you please clarify the specific problem you are experiencing, such as discrepancies in expected vs. actual outputs, confusion over the problem explanation, or any errors appearing when you submit your code? Any additional information would be really helpful for us to determine the best way to support you. Please feel free to provide more context at your convenience.

Best regards,
LeetCode Support Team