We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Data Structures
  3. Arrays
  4. Array Manipulation
  5. Discussions

Array Manipulation

  • iibrahimkoc
     + 1 comment

    great solution. thank you.

    Same algorithm on C++ // Complete the arrayManipulation function below. long arrayManipulation(int n, vector> queries) {

    vector<long> v(n, 0);
for(vector<int> q: queries)
{
    v[q[0]-1] += q[2];
    v[q[1]] -= q[2];
}
long max = 0;
long sum = 0;
for(long l: v)
{
    sum += l;
    if(max < sum)
    {
        max = sum;
    }
}

return max;

    }

    • o_megia_santand1
       + 0 comments

      This code has a little bug. This is the code fixed:

      long arrayManipulation(int n, vector> queries) {
  vector<long> v(n, 0);
  for(vector<int> q: queries)
  {
    v[q[0]-1] += q[2];
    if (q[1] < v.size()) v[q[1]] -= q[2];
  }

  long max = 0;
  long sum = 0;

  for(long l: v)
  {
    sum += l;
    if(max < sum)
    {
        max = sum;
    }
  }

  return max;
}

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in