100% beats runtime
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int diagonalSum(int[][] mat) {\n        int sum=0;\n        for(int i=0;i<mat.length;i++){\n            sum+= mat[i][i];\n            if(i != mat.length-i-1){\n            sum+= mat[i][mat.length-i-1];\n            }\n        }\n        return sum;\n    }\n}\n```
['Java']