Available question text
Find a non-empty subsequence (order preserved) whose alternating sum (+,-,+,...) equals k and whose product is maximized but does not exceed limit. The core challenge is a DP/knapsack-style search that tracks subsequence parity for alternating-sum constraints and feasible products (bounded by limit) to maximize the multiplicative objective.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3509. Maximum Product of Subsequences With an Alternating Sum Equal to K
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source