C++/Python #minimalizm
One-liner solutions for C++ and Python, not sure it can be done in Java...\n\nC++\ncpp\nint diagonalSum(vector<vector<int>>& m, int i = -1) {\n    return accumu
One-liner solutions for C++ and Python, not sure it can be done in Java...\n\n**C++**\n```cpp\nint diagonalSum(vector<vector<int>>& m, int i = -1) {\n    return accumulate(begin(m), end(m), 0, [&](int s, vector<int> &v){\n       return s + v[++i] + (i == v.size() - i - 1 ? 0 : v[v.size() - i - 1]);\n    });\n}\n```\n**Python**\n```python\ndef diagonalSum(self, m: List[List[int]]) -> int:\n\treturn sum(sum(r[j] for j in {i, len(r) - i - 1}) for i, r in enumerate(m))\n```
[]