3719. Longest Balanced Subarray I

LeetCodeArrayHash TableDivide and ConquerSegment TreePrefix SumOpen on judge ↗

You are given an integer array nums. A subarray is called balanced if the number of distinct even numbers in the subarray is equal to the number of distinct odd numbers. Return the length of the longest balanced subarray. Example 1: Input: nums = [2,5,4,3] Output: 4 Explanation: - The longest balanced subarray is [2, 5, 4, 3]. - It has 2 distinct even numbers [2, 4] and 2 distinct odd nu

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI