Maximum moves to get the sum

Question

1.00/5 (1 vote)

See more:

You are given an array A consisting of N numbers. In one move you can delete either the
first two, the last two, or the first and last elements of A. No move can be performed if
the length of A is smaller than 2. The result of each move is the sum of the deleted
elements.
Write a function:
int solution (int A[], int N);
that, given an array A of N integers, returns the maximum number of moves that can be
performed on A, such that all performed moves have the same result.

What I have tried:

C++

int solution(int A[], int N) {
    if (N < 2) {
        return 0;
    }

    int max_moves = 0;
    int left = 0;
    int right = N - 1;
    int target_sum = 0;

    while (left < right) {
        int current_sum = A[left] + A[right];
        
        if (current_sum == target_sum) {
            max_moves++;
            left += 2;
            right -= 2;
        } else if (current_sum < target_sum) {
            left++;
        } else {
            right--;
        }
    }

    return max_moves;
}

Posted 3-Aug-23 20:38pm

Hamsavenu

Updated 3-Aug-23 21:22pm

CPallini

v2

Add a Solution

Comments

OriginalGriff 4-Aug-23 2:57am

And?
What does it do that you didn't expect, or not do that you did?
What have you tried to do to find out why?
Are there any error messages, and if so, where and when? What did you do to make them happen?

This is not a good question - we cannot work out from that little what you are trying to do.
Remember that we can't see your screen, access your HDD, or read your mind - we only get exactly what you type to work with.
Use the "Improve question" widget to edit your question and provide better information.

Patrice T 4-Aug-23 5:06am

An you have a question or a problem ?

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

CPallini · Answer 1 · 2023-08-03T21:22:00

Solution 1

You might try recursion.
In your function, iteratively try the allowed moves (computing the result). At each attempt recursively call the function itself (passing the result). You have the stop condition when no further move is available (because either the number of remaining items is less than 2, or none of the available moves could produce the same result of the 'parent move').

Posted 3-Aug-23 21:22pm

CPallini

Comments

Patrice T 4-Aug-23 5:04am

+5

CPallini 4-Aug-23 5:17am

Thank you.