CPMagical CP Library

Problem solution · Java

Maximum Product of Subsequences With an Alternating Sum Equal to K

Maximum Product of Subsequences With an Alternating Sum Equal to K: a Java solution using hash-based lookup. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Hash-based lookup
Source
walkccc LeetCode Solutions
Length
39 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Hash-based lookup

For Maximum Product of Subsequences With an Alternating Sum Equal to K, the implementation stores previously seen values or frequencies in a hash table for direct membership and lookup operations.

  1. Decide the key that represents the information needed later.
  2. Update its count or stored state while scanning the input.
  3. Use constant-time expected lookups to detect matches or assemble the result.

Code notes

  • 39 lines of Java from the credited upstream file 3509.java.
  • The implementation visibly relies on sequence storage, hash lookup, ordered lookup.
  • No explicit loop blocks detected.

Complexity

Expected hash operations are constant time, but the surrounding scan and the number of stored keys determine total work and memory.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeMaximum Product of Subsequences With an Alternating Sum Equal to K · JavaJava
Use this to learn the idea, then write your own version.
enum State {  FIRST,    // first element - add to sum and start product  SUBTRACT, // second element - subtract from sum and multiply product  ADD       // third element - add to sum and multiply product} class Solution {  public int maxProduct(int[] nums, int k, int limit) {    if (Math.abs(k) > Arrays.stream(nums).sum())      return -1;    final Map<String, Integer> mem = new HashMap<>();    final int ans = maxProduct(nums, 0, 1, State.FIRST, k, limit, mem);    return ans == MIN ? -1 : ans;  }   private static final int MIN = -5000;   private int maxProduct(int[] nums, int i, int product, State state, int k, int limit,                         Map<String, Integer> mem) {    if (i == nums.length)      return k == 0 && state != State.FIRST && product <= limit ? product : MIN;    final String key = i + "," + k + "," + product + "," + state.ordinal();    if (mem.containsKey(key))      return mem.get(key);    int res = maxProduct(nums, i + 1, product, state, k, limit, mem);    if (state == State.FIRST)      res =          Math.max(res, maxProduct(nums, i + 1, nums[i], State.SUBTRACT, k - nums[i], limit, mem));    if (state == State.SUBTRACT)      res = Math.max(res, maxProduct(nums, i + 1, Math.min(product * nums[i], limit + 1), State.ADD,                                     k + nums[i], limit, mem));    if (state == State.ADD)      res = Math.max(res, maxProduct(nums, i + 1, Math.min(product * nums[i], limit + 1),                                     State.SUBTRACT, k - nums[i], limit, mem));    mem.put(key, res);    return res;  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗