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

2D Array - DS

  • pa1v_kar + 2 comments

    could anyone identify the mistake

    int main(){
    int arr[6][6];
    for(int arr_i = 0; arr_i < 6; arr_i++){
       for(int arr_j = 0; arr_j < 6; arr_j++){
          
          scanf("%d",&arr[arr_i][arr_j]);
       }
    }
    int sum[30];
    int x=0;
    int arr_i,arr_j;
    int largest;
    
    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;
     }
     largest=sum[0];
    for(int i=1;i<=x;i++)
    {   
        if(largest<sum[i])
            largest=sum[i];
    }
    printf("%d",largest);
    return 0;
}
    • Nidheesh_P + 1 comment

      in for loop try i<4 instead of i<3

      • manny_capacidade + 1 comment

        Whats the reason behind i<4..Not able to get the reason.Can you explain please

        • fhasson91 + 0 comments

          there are 4 hourglasses vertically and 4 hourglasses horizontally

    • 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]