C++ code to find array from given array with conditions

Suppose we have an array A with n elements. There is another hidden array B of size n. The elements can be negative or positive. For each index i in range 1 to n, following operations will be performed −

• Set A[i] as 0 initially

• Then add B[i] to A[i], subtract B[i+1], then add B[i+2] and so on

We have to find the array B.

So, if the input is like A = [6, -4, 8, -2, 3], then the output will be [2, 4, 6, 1, 3]

Steps

To solve this, we will follow these steps −

for initialize i := 0, when i < size of A, update (increase i by 1),
do:
   print (A[i] + A[i + 1])

Example

Let us see the following implementation to get better understanding −

#include <bits/stdc++.h>
using namespace std;
void solve(vector<int> A){
   for (int i = 0; i < A.size(); i++)
      cout << A[i] + A[i + 1] << ", ";
}
int main(){
   vector<int> A = { 6, -4, 8, -2, 3 };
   solve(A);
}

Input

{ 6, -4, 8, -2, 3 }

Output

2, 4, 6, 1, 3,

Arnab Chakraborty

Updated on 29-Mar-2022 11:07:41

• Related Questions & Answers
• C++ code to find sorted array with non-divisibility conditions
• How to update array with multiple conditions in MongoDB
• C++ code to count local extrema of given array
• Find the Initial Array from given array after range sum queries in C++
• Find a pair from the given array with maximum nCr value in C++
• Find a pair from the given array with maximum nCr value in Python
• Count valid pairs in the array satisfying given conditions in C++
• Split the array into equal sum parts according to given conditions in C++
• Program to find array of length k from given array whose unfairness is minimum in python
• MongoDB query to find matching documents given an array with values?
• C++ code to find minimum correct string from given binary string
• C++ Program to find table plate ordering maintaining given conditions
• Find maximum height pyramid from the given array of objects in C++
• Program to find number of tasks can be finished with given conditions in Python
• C++ Program to find Number Whose XOR Sum with Given Array is a Given Number k