> For the complete documentation index, see [llms.txt](https://code-snippets.hbamithkumara.com/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://code-snippets.hbamithkumara.com/leetcode/problems/1301-1400/construct-target-array-with-multiple-sums.md).

# 1354. Construct Target Array With Multiple Sums

### Description

Given an array of integers `target`. From a starting array, `A` consisting of all 1's, you may perform the following procedure :

* let `x` be the sum of all elements currently in your array.
* choose index `i`, such that `0 <= i < target.size` and set the value of `A` at index `i` to `x`.
* You may repeat this procedure as many times as needed.

Return True if it is possible to construct the `target` array from `A` otherwise return False.

### Constraints

* `N == target.length`
* `1 <= target.length <= 5 * 10^4`
* `1 <= target[i] <= 10^9`

### Approach

### Links

* GeeksforGeeks
* [Leetcode](https://leetcode.com/problems/construct-target-array-with-multiple-sums/)
* ProgramCreek
* YouTube

### **Examples**

{% tabs %}
{% tab title="Example 1" %}
**Input:** target = \[9,3,5]

**Output:** true

**Explanation:** Start with \[1, 1, 1]

\[1, 1, 1], sum = 3 choose index 1

\[1, 3, 1], sum = 5 choose index 2

\[1, 3, 5], sum = 9 choose index 0

\[9, 3, 5] Done
{% endtab %}

{% tab title="Example 2" %}
**Input:** target = \[1, 1, 1, 2]

**Output:** false

**Explanation:** Impossible to create target array from \[1, 1, 1, 1].
{% endtab %}

{% tab title="Example 3" %}
**Input:** target = \[8, 5]

**Output:** true
{% endtab %}
{% endtabs %}

### **Solutions**

{% tabs %}
{% tab title="Solution 1" %}

```java
/**
 * Time complexity : 
 * Space complexity : 
 */

class Solution {
    public boolean isPossible(int[] target) {
        if(target.length == 1) {
            return target[0] == 1;
        }
        
        PriorityQueue<Integer> pq = new PriorityQueue<>((a, b) -> b -a);
        
        int sum = 0;
        for(int n: target) {
            sum += n;
            pq.add(n);
        }
        
        while(pq.peek() != 1) {
            int num = pq.poll();
            sum -= num;
            if(sum < 1 || sum >= num) {
                return false;
            }
            num %= sum;
            sum += num;
            pq.add(num);
        }
        
        return true;
    }
}
```

{% endtab %}
{% endtabs %}

### **Follow up**

*


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://code-snippets.hbamithkumara.com/leetcode/problems/1301-1400/construct-target-array-with-multiple-sums.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.