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

Sort by

recency

|

2486 Discussions

|

  • mkomilov6611
     + 0 comments
    function arrayManipulation(n, queries) {
    // Write your code here
    const arr = new Array(n).fill(0);
    let max = 0;
    
    for(let i = 0; i < queries.length; i++) {
        const [a,b,k] = queries[i];
        
        // -1 because arrays are indexed 0, but a & b constraints 1<=a<=b<=n
        for(let j = a - 1; j <= b - 1 ; j++) {
            arr[j] += k;

            max = Math.max(arr[j], max);
        }
    }
    
    return max;
}

  • sivaram_movva1
     + 1 comment

    public static long arrayManipulation(int n, List> queries) { long[] arr = new long[n]; long sum = 0; long max = 0;

        for(int i=0; i < queries.Count; i++)
    {
        int a = queries[i][0] - 1;
        int b = queries[i][1] - 1;
        int k = queries[i][2];

        for(int col=a;col<=b;col++)
        {
            arr[col] += k;
            max = Math.Max(max,arr[col]);
        }
    }

    return max;
}

  • sivaram_movva1
     + 0 comments

    public static long arrayManipulation(int n, List> queries) { long max=0; List> arr = new List>(); 

        List<long> ft = Enumerable.Repeat((long)0, n).ToList();        

    arr.Add(ft);

    for(int row=0;row<queries.Count;row++)
    {
        arr.Add(ft);

        for(int col=0;col<n;col++)
        {   
            var a=queries[row][0]-1;
            var b=queries[row][1]-1;
            var k=queries[row][2];

            if(col>=a && col<=b)
            {
                long calc=arr[row][col]+k;
                arr[row+1][col]=calc;
                max=calc>max?calc:max;
            }
            else{
                arr[row+1][col]=arr[row][col];
            }
        }

        Console.WriteLine(string.Join(" ",arr[row+1]));
    }

    return max;
}

    }

  • aminkhan84159
     + 0 comments

    Here's a solution in C#

    public static long arrayManipulation(int n, List<List<int>> queries)
    {       
        long[] arr = new long[n];
        long sum = 0;
        long max = 0;
        
        for(int i=0; i < queries.Count; i++){
            int a = queries[i][0] - 1;
            int b = queries[i][1] - 1;
            int k = queries[i][2];
            
            arr[a] += k;
            
            if(b+1 < n)
                arr[b+1] -= k;
                
        }
        
        for (int j = 0; j < arr.Length; j++){
            sum += arr[j];
            max = Math.Max(max,sum);
        }
        
        return max;
    }

  • aminkhan84159
     + 0 comments

    Here's a solution in c# , but it doesn't pass the Test Case 7-12 due to more executing time . It shows error "Time Limit Exceed"

    public static long arrayManipulation(int n, List<List<int>> queries)
    {       
        long[] arr = new long[n+1];
        
        for(int i=0; i < queries.Count; i++){
            int a = queries[i][0];
            int b = queries[i][1];
            int k = queries[i][2];
            
            for(int j = a; j <= b; j++){
                arr[j] += k;
            }
        }
        
        return arr.Max();
    }