3686. Number of Stable Subsequences
You are given an integer array nums. A subsequence is stable if it does not contain three consecutive elements with the same parity when the subsequence is read in order (i.e., consecutive inside the subsequence). Return the number of stable subsequences. Since the answer may be too large, return it modulo 109 + 7. Example 1: Input: nums = [1,3,5] Output: 6 Explanation: - Stable subseque
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.
Sign in to chat with the tutor and save your progress.
Sign in to start