# Array Manipulation HackerRank

Problem Statement:

Starting with a 1-indexed array of zeros and a list of operations, for each operation add value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in your array.

For example, the length of your array of zeros. Your list of queries is as follows:

`a b k1 5 34 8 76 9 1`

a and b are the interval defined where k is increment.

Add the values of between the indices and inclusive:

`index->	 1 2 3  4  5 6 7 8 9 10	[0,0,0, 0, 0,0,0,0,0, 0]	[3,3,3, 3, 3,0,0,0,0, 0]	[3,3,3,10,10,7,7,7,0, 0]	[3,3,3,10,10,8,8,8,1, 0]`

The largest value is after all operations are performed.

Function Description

Complete the function arrayManipulation in the editor below. It must return an integer, the maximum value in the resulting array.

arrayManipulation has the following parameters:

• n — the number of elements in your array
• queries — a two-dimensional array of queries where each queries[i] contains three integers, a, b, and k.

Input Format

The first line contains two space-separated integers and, the size of the array and the number of operations.
Each of the next lines contains three space-separated integers, and, the left index, right index and summand.

Constraints

Output Format

Return the integer maximum value in the finished array.

Sample Input

`5 31 2 1002 5 1003 4 100`

Sample Output

`200`

Explanation

After the first update list will be `100 100 0 0 0`.
After the second update list will be `100 200 100 100 100`.
After the third update list will be `100 200 200 200 100`.

The problem can be found here.

Solution: Description will be published soon.

Here is my java implementation:

`package hackerrank;import java.io.BufferedWriter;import java.io.FileWriter;import java.io.IOException;import java.util.Scanner;public class ArrayManipulations {    static long arrayManipulation(int n, int[][] queries) {        long max = Integer.MIN_VALUE;        long[] D = new long[n + 1];        long[] A = new long[n];        D = A;        D[n] = 0L;        for (int i = 1; i < n; i++)            D[i] = A[i] - A[i - 1];        for (int i = 0; i < queries.length; i++) {            int[] q = queries[i];            int a = q;            int b = q;            int k = q;            update(D, a - 1, b - 1, k);        }        for (int i = 0; i < A.length; i++) {            if (i == 0)                A[i] = D[i];            else {                A[i] = D[i] + A[i - 1];                if (A[i] > max)                    max = A[i];            }        }        return max;    }    static void update(long D[], int l, int r, int x) {        D[l] += x;        D[r + 1] -= x;    }    private static final Scanner scanner = new Scanner(System.in);    public static void main(String[] args) throws IOException {        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));        String[] nm = scanner.nextLine().split(" ");        int n = Integer.parseInt(nm);        int m = Integer.parseInt(nm);        int[][] queries = new int[m];        for (int i = 0; i < m; i++) {            String[] queriesRowItems = scanner.nextLine().split(" ");            scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");            for (int j = 0; j < 3; j++) {                int queriesItem = Integer.parseInt(queriesRowItems[j]);                queries[i][j] = queriesItem;            }        }        long result = arrayManipulation(n, queries);        bufferedWriter.write(String.valueOf(result));        bufferedWriter.newLine();        bufferedWriter.close();        scanner.close();    }}`

Written by

## Omar Faroque

#### Enterprise Applications Architectecture | JAVA | Parallel & Distributed Programing | Node.js | IoT | Golang |Starter|Microservices

Welcome to a place where words matter. On Medium, smart voices and original ideas take center stage - with no ads in sight. Watch
Follow all the topics you care about, and we’ll deliver the best stories for you to your homepage and inbox. Explore
Get unlimited access to the best stories on Medium — and support writers while you’re at it. Just \$5/month. Upgrade