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. Algorithms
  3. Warmup
  4. Diagonal Difference
  5. Discussions

Diagonal Difference

  • magedmakar + 3 comments

    Why complexity of nested loop? This is how I solved it:

    long sum1 = 0; long sum2 = 0;

            for (int i = 0; i < n ; i++)
        {
            sum1 += a[i][i];
            sum2 += a[i][n - 1 - i];
        }
        Console.WriteLine(Math.Abs(sum1 - sum2));
    • shreeharshas + 0 comments

      This is what I did too! Takes O(n) time. Cheers!

    • ypahalajani + 1 comment

      Did the same in Java [ O(n) time complexity ]:

          for(int i=0; i<n; i++){
        sum1+=arr[i][i];
        sum2+=arr[i][n-1-i];
    }
    System.out.println(Math.abs(sum1-sum2));
      • 15131A1284_meera + 1 comment

        why did keep + symbols infroont of sum1 and sum2..?

        • Shrazz_kotteda + 0 comments

          its like SUM=SUM+arr[i][i];

          The + indicated that ^

    • HarshitAgrawal95 + 0 comments

      Amazing Man!! The solution is just AMAZING !!