Skip to content LeetCode 3721 Explained: The Distinct Parity Trick
You’re given an integer array nums. A subarray is balanced if: #distinct even values in the subarray= #distinct odd values in the subarray Return the length of the longest balanced subarray. This “distinct” part is what makes the problem feel unfair at first: duplicates don’t increase the count, so a normal prefix-sum trick doesn’t work … Read more
