You are given a 2D matrix grid of size m x n. You need to check if each cell grid[i][j] is:Equal to the cell below it, i.e. grid[i][j] == grid[i + 1][j] (if it exists).Different from the cell to its right, i.e. grid[i][j] != grid[i][j + 1] (if it exists).Return true if all the cells satisfy these conditions, otherwise, return false. Example 1:Input: grid = [[1,0,2],[1,0,2]]Output: trueExplanation:All the cells in the grid satisfy the conditions.Example 2:Input: grid = [[1,1,1],[0,0,0]]Output: falseExplanation:All cells in the first row are equal.Example 3:Input: grid = [[1],[2],[3]]Output: falseExplanation:Cells in the first column have different values. Constraints:1 <= n, m <= 100 <= grid[i][j] <= 9

You are given a matrix and an array. For each row of the given matrix, for each element of that row, check if it is present in the given array. Print the count of elements present for every row.Input FormatThe first line of input contains N, M - the size of the matrix. It is followed by N lines each containing M integers - elements of the matrix. The next line of the input contains the A - the size of the array. The next line of the input contains the array elements.Output FormatFor each row, print the count of the number of elements present, separated by a new line.Constraints1 <= N, M, A <= 100-100 <= mat[i][j], ar[i] <= 100ExampleInput3 45 9 -2 2-3 4 1 92 -2 1 -255 1 -2 2 6Output314ExplanationThe first row of the matrix is (5 9 -2 2), out of this, 3 elements (5 -2 2), except 9, are present in the given array (5 1 -2 2 6)The second row of the matrix is (-3 4 1 9), out of this, only 1 is present in the given array (5 1 -2 2 6)The third row of the matrix is (2 -2 1 -2), all the 4 elements are present in the given array (5 1 -2 2 6)

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

Find whether the given matrix is sparseinput:m-no.of rowsn-no.of columnmatrix= []output:True/False

If A is an m x n matrix then AT (Transpose of A) is an n x m matrix, such that rows of A become columns of AT and columns of A become rows of AT.Given a 2D array, you have to implement the given function,int** Transpose(int** matrix, int rowCount, int columnCount);Implement the function to find the transpose of the matrix and return the new matrix as output.Input:matrix:2 46 8Output:2 64 8Explanation: Values 2 and 4 in the first row become the first column in the returned matrix.Similarly, values 6 and 8 in the second row become the second column in the returned matrix.Sample inputmatrix:1 2 3 4 5 6Sample Output1 4 2 5 3 6

Given an m x n grid of characters board and a string word, return true if word exists in the grid.The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once.