Diagonal Difference of a 2D matrix












0












$begingroup$


How should I fix my code such that it will pass all corner cases not just some in HackerRank?



#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the diagonalDifference function below.
def diagonalDifference(arr):
sum_diag1 = 0
sum_diag2 = 0
arr_2d =
print(arr)

for i in range(len(arr)):
for j in range(len(arr)):
if i==j:
sum_diag1 += arr[i][j]
elif i+j == (len(arr)) - 1:
sum_diag2 += arr[i][j]
print(arr[i][j])


return abs(sum_diag1 - sum_diag2)

if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

n = int(input())

arr =

for _ in range(n):
arr.append(list(map(int, input().rstrip().split())))

result = diagonalDifference(arr)

fptr.write(str(result) + 'n')

fptr.close()









share|improve this question









$endgroup$












  • $begingroup$
    Do you feel your code doesn’t work in certain “corner cases”? If so, you shouldn’t post it here, because non-working code is not appropriate for Code Review.
    $endgroup$
    – AJNeufeld
    55 secs ago
















0












$begingroup$


How should I fix my code such that it will pass all corner cases not just some in HackerRank?



#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the diagonalDifference function below.
def diagonalDifference(arr):
sum_diag1 = 0
sum_diag2 = 0
arr_2d =
print(arr)

for i in range(len(arr)):
for j in range(len(arr)):
if i==j:
sum_diag1 += arr[i][j]
elif i+j == (len(arr)) - 1:
sum_diag2 += arr[i][j]
print(arr[i][j])


return abs(sum_diag1 - sum_diag2)

if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

n = int(input())

arr =

for _ in range(n):
arr.append(list(map(int, input().rstrip().split())))

result = diagonalDifference(arr)

fptr.write(str(result) + 'n')

fptr.close()









share|improve this question









$endgroup$












  • $begingroup$
    Do you feel your code doesn’t work in certain “corner cases”? If so, you shouldn’t post it here, because non-working code is not appropriate for Code Review.
    $endgroup$
    – AJNeufeld
    55 secs ago














0












0








0





$begingroup$


How should I fix my code such that it will pass all corner cases not just some in HackerRank?



#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the diagonalDifference function below.
def diagonalDifference(arr):
sum_diag1 = 0
sum_diag2 = 0
arr_2d =
print(arr)

for i in range(len(arr)):
for j in range(len(arr)):
if i==j:
sum_diag1 += arr[i][j]
elif i+j == (len(arr)) - 1:
sum_diag2 += arr[i][j]
print(arr[i][j])


return abs(sum_diag1 - sum_diag2)

if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

n = int(input())

arr =

for _ in range(n):
arr.append(list(map(int, input().rstrip().split())))

result = diagonalDifference(arr)

fptr.write(str(result) + 'n')

fptr.close()









share|improve this question









$endgroup$




How should I fix my code such that it will pass all corner cases not just some in HackerRank?



#!/bin/python3

import math
import os
import random
import re
import sys

# Complete the diagonalDifference function below.
def diagonalDifference(arr):
sum_diag1 = 0
sum_diag2 = 0
arr_2d =
print(arr)

for i in range(len(arr)):
for j in range(len(arr)):
if i==j:
sum_diag1 += arr[i][j]
elif i+j == (len(arr)) - 1:
sum_diag2 += arr[i][j]
print(arr[i][j])


return abs(sum_diag1 - sum_diag2)

if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')

n = int(input())

arr =

for _ in range(n):
arr.append(list(map(int, input().rstrip().split())))

result = diagonalDifference(arr)

fptr.write(str(result) + 'n')

fptr.close()






array matrix






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 10 mins ago









Mona JalalMona Jalal

412416




412416












  • $begingroup$
    Do you feel your code doesn’t work in certain “corner cases”? If so, you shouldn’t post it here, because non-working code is not appropriate for Code Review.
    $endgroup$
    – AJNeufeld
    55 secs ago


















  • $begingroup$
    Do you feel your code doesn’t work in certain “corner cases”? If so, you shouldn’t post it here, because non-working code is not appropriate for Code Review.
    $endgroup$
    – AJNeufeld
    55 secs ago
















$begingroup$
Do you feel your code doesn’t work in certain “corner cases”? If so, you shouldn’t post it here, because non-working code is not appropriate for Code Review.
$endgroup$
– AJNeufeld
55 secs ago




$begingroup$
Do you feel your code doesn’t work in certain “corner cases”? If so, you shouldn’t post it here, because non-working code is not appropriate for Code Review.
$endgroup$
– AJNeufeld
55 secs ago










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f214382%2fdiagonal-difference-of-a-2d-matrix%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Code Review Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f214382%2fdiagonal-difference-of-a-2d-matrix%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

Сан-Квентин

Алькесар

Josef Freinademetz