← All problemsSign in

2760. Longest Even Odd Subarray With Threshold

LeetCodeArraySliding WindowOpen on judge ↗

You are given a 0-indexed integer array nums and an integer threshold. Find the length of the longest subarray of nums starting at index l and ending at index r (0 <= l <= r < nums.length) that satisfies the following conditions: - nums[l] % 2 == 0 - For all indices i in the range [l, r - 1], nums[i] % 2 != nums[i + 1] % 2 - For all indices i in the range [l, r], nums[i] <= threshold Return a

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

Sign in to chat with the tutor and save your progress.

Sign in to start