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. Practice
  2. Data Structures
  3. Arrays
  4. 2D Array - DS
  5. Discussions

2D Array - DS

  • uniquechhetrii + 2 comments
    for(arr_i=0;arr_i<3;arr_i++)
    {
        sum[x]=0;
        int count=0;
        for(arr_j=arr_i;count<3;arr_j++)
        {
            if(count==0)
            {
                  sum[x]+=arr[arr_i+1][arr_j+1];
            }
            sum[x]+=arr[arr_i][arr_j];
            sum[x]+=arr[arr_i+2][arr_j];
            
            ++count;
        }
          
        ++x;

    I didnt understand this part. Can somebody help me out in this?

    • chadams + 0 comments

      His algorithm is getting the middle element of the hourglass on the first pass through and then incrementing the top and bottom rows of the hourglass. He increments count to track the amount of loops needed to read a hourglass and increments x to correspond to the position in the hourglass; 0,1,2 respectively.

    • vigneshiyer66661 + 0 comments
      [deleted]