n = len(grid) x = sum(max(grid[i][j] for i in range(n)) for j in range(n)) y = sum(max(grid[j][i] for i in range(n)) for j in range(n)) z = sum(grid[i][j] > 0 for i in range(n) for j in range(n)) return sum([x,y,z])

You are given an m x n matrix grid consisting of positive integers. You can move from a cell in the matrix to any other cell that is either to the bottom or to the right (not necessarily adjacent). The score of a move from a cell with the value c1 to a cell with the value c2 is c2 - c1.You can start at any cell, and you have to make at least one move.Return the maximum total score you can achieve. Example 1:Input: grid = [[9,5,7,3],[8,9,6,1],[6,7,14,3],[2,5,3,1]]Output: 9Explanation: We start at the cell (0, 1), and we perform the following moves:- Move from the cell (0, 1) to (2, 1) with a score of 7 - 5 = 2.- Move from the cell (2, 1) to (2, 2) with a score of 14 - 7 = 7.The total score is 2 + 7 = 9.Example 2:Input: grid = [[4,3,2],[3,2,1]]Output: -1Explanation: We start at the cell (0, 0), and we perform one move: (0, 0) to (0, 1). The score is 3 - 4 = -1. Constraints:m == grid.lengthn == grid[i].length2 <= m, n <= 10004 <= m * n <= 1051 <= grid[i][j] <= 105

Given a 2D Array, :1 1 1 0 0 00 1 0 0 0 01 1 1 0 0 00 0 0 0 0 00 0 0 0 0 00 0 0 0 0 0An hourglass in is a subset of values with indices falling in this pattern in 's graphical representation:a b c de f gThere are hourglasses in . An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in , then print the maximum hourglass sum. The array will always be .Example-9 -9 -9 1 1 1 0 -9 0 4 3 2-9 -9 -9 1 2 3 0 0 8 6 6 0 0 0 0 -2 0 0 0 0 1 2 4 0The hourglass sums are:-63, -34, -9, 12, -10, 0, 28, 23, -27, -11, -2, 10, 9, 17, 25, 18The highest hourglass sum is from the hourglass beginning at row , column :0 4 3 18 6 6Note: If you have already solved the Java domain's Java 2D Array challenge, you may wish to skip this challenge.Function DescriptionComplete the function hourglassSum in the editor below.hourglassSum has the following parameter(s):int arr[6][6]: an array of integersReturnsint: the maximum hourglass sumInput FormatEach of the lines of inputs contains space-separated integers .ConstraintsOutput FormatPrint the largest (maximum) hourglass sum found in .

Let's learn about list comprehensions! You are given three integers and representing the dimensions of a cuboid along with an integer . Print a list of all possible coordinates given by on a 3D grid where the sum of is not equal to . Here, . Please use list comprehensions rather than multiple loops, as a learning exercise.ExampleAll permutations of are:.Print an array of the elements that do not sum to .Input FormatFour integers and , each on a separate line.Constraints

Given a 2D matrix of size NxN, print the sum of the elements of all its diagonals.Input FormatThe first line of input contains T - the number of test cases. The first line of each test case contains the N - the size of the matrix. Each of the next N lines contains N integers - the elements of the matrix.Output FormatFor each test case, print the sum of the elements of all the diagonals, separated by a new line. Refer to samples for more clarity.Constraints1 <= T <= 1001 <= N <= 100-100 <= ar[i][j] <= 100ExampleInput43-5 0 42 8 -63 7 11-425 -2-4 16-2 -3 -6 -5 50 38 7 10 -5 -3 306 3 70 9 -20 -7-9 9 -6 7 3 2-1 7 7 6 -4 38 5 6 -9 40 8Output4 -6 4 9 3-4-2 6 -43 80 -15 -29 22 86 51 13 4 4 8ExplanationTest Case 1Sum of the elements of the 1st diagonal: 4Sum of the elements of the 2nd diagonal: 0 + -6 = -6Sum of the elements of the 3rd diagonal: -5 + 8 + 1 = 4Sum of the elements of the 4th diagonal: 2 + 7 = 9Sum of the elements of the 5th diagonal: 3Test Case 2Sum of the elements of the 1st and only diagonal: -4Test Case 3Sum of the elements of the 1st diagonal: -2Sum of the elements of the 2nd diagonal: 5 + 1 = 6Sum of the elements of the 3rd diagonal: -4

Maximum sumSend FeedbackGiven an N*N matrix. The task is to find the index of the column with the maximum sum. That is the column whose sum of elements is maximum.Input FormatNN*N matrix in comma separated form for each row.Input : 5 1, 2, 3, 4, 5 5, 3, 1, 4, 2 5, 6, 7, 8, 9 0, 6, 3, 4, 12 9, 7, 12, 4, 3Output: Column 5 has the max sum of 31.Input : 3 1, 2, 3 4, 2, 1 5, 6, 7Output: Column 3 has the max sum of 11.