3509. Maximum Product of Subsequences With an Alternating Sum Equal to K

LeetCodeArrayHash TableDynamic ProgrammingOpen on judge ↗

You are given an integer array nums and two integers, k and limit. Your task is to find a non-empty subsequence of nums that: - Has an alternating sum equal to k. - Maximizes the product of all its numbers without the product exceeding limit. Return the product of the numbers in such a subsequence. If no subsequence satisfies the requirements, return -1. The alternating sum of a 0-indexed arra

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