Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 3509. Maximum Product of Subsequences With an Alternating Sum Equal to K
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.