Missing Test Case - 3698. Split Array With Minimum Difference

[hexawhale]

LeetCode Username

killer-whale

Problem Number, Title, and Link

3698. Split Array With Minimum Difference https://leetcode.com/problems/split-array-with-minimum-difference/description/

Bug Category

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

Bug Description

It is possible to submit code that gets accepted, but fails when given this custom test case: [5,10,10,10]
Output
5
Expected
-1

Language Used for Code

Python/Python3

Code used for Submit/Run operation

class Solution:
    def splitArray(self, nums: List[int]) -> int:
        changes, lengths = [], []
        for k, g in groupby(((a > b) - (a < b) for a, b in pairwise(nums))):
            changes.append(k)
            lengths.append(sum(1 for _ in g))

        if any(a > b for a, b in pairwise(changes)):
            return -1

        if len(lengths) == 1:
            return (min(abs(sum(nums[1:]) - nums[0]), abs(sum(nums[:-1]) - nums[-1])) 
                    if changes[0] != 0 or len(nums) < 3
                    else -1)

        midpoint = sum(lengths[:-1]) + (changes[-1] == 0)

        return min(
            abs(sum(nums[:midpoint]) - sum(nums[midpoint:])),
            abs(sum(nums[:midpoint + 1]) - sum(nums[midpoint + 1:]))
        )

Expected behavior

This code should not be accepted when you submit it.

Screenshots

No response

Additional context

No response

[exalate-issue-sync]

oj-leetcode commented: Hello,

Your reported issue has been relayed to our team for thorough investigation. We appreciate your patience as we work to address and resolve this matter. We will reach out to you when we have updates regarding the issue.

If you have any further questions or concerns in the meantime, please feel free to let us know.

Best regards,
LeetCode Support Team

[exalate-issue-sync]

Epiphania_Ekenimoh commented: Hello there,

Thanks for your patience!

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