Poor Test Case in Weekly Contest 449 Q4

[DecoderOP]

LeetCode Username

cocwarrior16112004

Problem Number, Title, and Link

3548. Equal Sum Grid Partition II https://leetcode.com/problems/equal-sum-grid-partition-ii/description/

Bug Category

Missing test case (Incorrect/Inefficient Code getting accepted because of missing test cases)

Bug Description

The Question state that if we discount a digit from either one side of the Partition, the discount should not make the section disconnected.
But the Leet Code Testcase are so inefficient, that they get accepted on just discounting only the 4 corners element.

Language Used for Code

Java

Code used for Submit/Run operation

class Solution {
    public boolean canPartitionGrid(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        long s = 0;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) s += grid[i][j];
        }

        // checking vertical cut
        long s1 = 0;
        for (int i = 0; i < n - 1; i++) {
            for (int j = 0; j < m; j++) {
                s1 += grid[j][i];
            }

            if (s1 == s - s1) {
                return true;
            }

            if (s1 - grid[0][0] == s - s1) {
                return true;
            }

            if (s1 - grid[0][i] == s - s1) {
                return true;
            }

            if (s1 - grid[m - 1][0] == s - s1) {
                return true;
            }

            if (s1 - grid[m - 1][i] == s - s1) {
                return true;
            }

            if (s1 == s - s1 - grid[0][n - 1]) {
                return true;
            }

            if (s1 == s - s1 - grid[0][i + 1]) {
                return true;
            }

            if (s1 == s - s1 - grid[m - 1][i + 1]) {
                return true;
            }

            if (s1 == s - s1 - grid[m - 1][n - 1]) {
                return true;
            }
        }

        // checking horizontal cut
        long s2 = 0;
        for (int i = 0; i < m - 1; i++) {
            for (int j = 0; j < n; j++) {
                s2 += grid[i][j];
            }

            if (s2 == s - s2) {
                return true;
            }

            if (s2 - grid[0][0] == s - s2) {
                return true;
            }

            if (s2 - grid[0][n - 1] == s - s2) {
                return true;
            }

            if (s2 - grid[i][0] == s - s2) {
                System.out.println(13);
                return true;
            }

            if (s2 - grid[i][n - 1] == s - s2) {
                return true;
            }

            if (s2 == s - s2 - grid[i + 1][0]) {
                return true;
            }

            if (s2 == s - s2 - grid[i + 1][n - 1]) {
                return true;
            }

            if (s2 == s - s2 - grid[m - 1][0]) {
                return true;
            }

            if (s2 == s - s2 - grid[m - 1][n - 1]) {
                return true;
            }
        }

        return false;
    }
}

Expected behavior

in this testcase , my solution is giving a False output , and the Leetcode solution is also giving False as output , But the ans should be TRUE.

Screenshots

No response

Additional context

No response

[wktang]

oj-leetcode commented: Hello,

Thank you for contributing to LeetCode and submitting a missing test case. Upon review, we found that your provided test case did not cause your solution code to fail and it was Accepted as before. This indicates that your test case may not address the specific edge case or scenario needed to highlight the issue in your solution.

Here are the test cases you submitted:

Test case #1:

[[8, 0, 8], [0, 5, 8], [8, 8, 5]]

Test case #2:

[[1,2,3],[4,5,6],[7,8,9]]

We encourage you to review your code and consider other potential edge cases that might reveal the underlying problem. If you identify any additional test cases or have further questions, please feel free to reply to this message or open a new issue with us.

We appreciate your engagement and efforts in helping us enhance our platform.

Best regards,
LeetCode Support Team

[DecoderOP]

The Test case : [[5, 2, 2], [7, 4, 5], [8, 6, 5]]

During contest , when I ran this test case , it gives False as output and got accepted by the Leetcode.
Where as When I ran the same test case on the code of the top rankers in the contest , There output was TRUE and it shows wrong answer as Leetcode says it as FALSE.

Both the code got accepted but still giving different result for this test case

[wktang]

Epiphania_Ekenimoh commented: Hello there,

The issue you reported has been resolved. Please feel free to verify and retry.

We apologize for any inconvenience this may have caused and appreciate your patience while we worked to resolve the issue. If you have any further questions or concerns, please do not hesitate to contact us.

Thank you,
LeetCode Support Team

[DecoderOP]

Thanks sir