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.

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 on a 22-dimensional grid, where you start at (0,0)(0,0).You are given a binary string 𝑆S of length 44 where:𝑆1S 1​ refers to left direction;𝑆2S 2​ refers to right direction;𝑆3S 3​ refers to up direction;𝑆4S 4​ refers to down direction.𝑆𝑖=1S i​ =1 denotes that you are allowed to make a move in the respective direction and vice-versa.Find the number of cells (𝑥,𝑦)(x,y) you can possibly visit which satisfy −10≤𝑥,𝑦≤10−10≤x,y≤10.Note that:You always include the cell (0,0)(0,0) in your answer.If you can visit (𝐴1,𝐵1)(A 1​ ,B 1​ ) and (𝐴2,𝐵2)(A 2​ ,B 2​ ) individually, but not both at the same time, you will still include both of them in your answer.Moves are defined as:A move in left direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴−1,𝐵)(A−1,B).A move in right direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴+1,𝐵)(A+1,B).A move in up direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴,𝐵+1)(A,B+1).A move in down direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴,𝐵−1)(A,B−1).Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a binary string 𝑆S of length 44 - denoting the directions in which moves are allowed.Output FormatFor each test case, output on a new line, the number of cells you can visit as mentioned in statement.Constraints1≤𝑇≤151≤T≤15∣𝑆∣=4∣S∣=4𝑆𝑖∈{0,1}S i​ ∈{0,1}𝑆𝑖=1S i​ =1 for at least one 1≤𝑖≤41≤i≤4.Sample 1:InputOutput5001011000110111011111121121231441Explanation:Test case 11: The only allowed direction is up. Thus, you can only visit cells (0,0),(0,1),(0,2),…,(0,10)(0,0),(0,1),(0,2),…,(0,10); which are a total of 1111 cells.Test case 22: The allowed directions are left and right. Thus, you can visit cells (−10,0),(−9,0),…,(0,0),…,(9,0),(10,0)(−10,0),(−9,0),…,(0,0),…,(9,0),(10,0), which are a total of 2121 cells.Test case 33: The allowed directions are right and up. You can visit all cells (𝑥,𝑦)(x,y) such that 𝑥≥0x≥0 and 𝑦≥0y≥0, which are a total of 121121 cells.

Given a square grid of characters in the range ascii[a-z], rearrange elements of each row alphabetically, ascending. Determine if the columns are also in ascending alphabetical order, top to bottom. Return YES if they are or NO if they are not.Example:grid = [‘abc’, ‘ade’, ‘efg’]

We are given a two-dimensional board of size N × M (N rows and M columns). Each field of the board can be empty ('.'), may contain an obstacle ('X') or may have a character in it. The character might be either an assassin ('A') or a guard. Each guard stands still and looks straight ahead, in the direction they are facing.Every guard looks in one of four directions (up, down, left or right on the board) and is represented by one of four symbols. A guard denoted by '<' is looking to the left; by '>', to the right; '^', up; or 'v', down. The guards can see everything in a straight line in the direction in which they are facing, as far as the first obstacle ('X' or any other guard) or the edge of the board.The assassin can move from the current field to any other empty field with a shared edge. The assassin cannot move onto fields containing obstacles or enemies.Write a function:bool solution(vector<string> &B);that, given an array B consisting of N strings denoting rows of the array, returns true if is it possible for the assassin to sneak from their current location to the bottom-right cell of the board undetected, and false otherwise.Examples:1. Given B = ["X.....>", "..v..X.", ".>..X..", "A......"], your function should return false. All available paths lead through a field observed by a guard.2. Given B = ["...Xv", "AX..^", ".XX.."], your function should return true. The guard in the second row is blocking the other one from watching the bottom-right square.3. Given B = ["...", ">.A"], your function should return false, as the assassin gets spotted right at the start.4. Given B = ["A.v", ..."], your function should return false. It's not possible for the assassin to enter the bottom-right cell undetected, as the cell is observed.Write an efficient algorithm for the following assumptions:N is an integer within the range [1..500];all strings in B are of the same length M from range [1..500];there is exactly one assassin on the board;there is no guard or wall on B[N−1][M−1];every string in B consists only of the following characters '.', 'X', '<', '>', 'v', '^' and/or 'A'.

My First Geometry ProblemYou are on a 22-dimensional grid, where you start at (0,0)(0,0).You are given a binary string 𝑆S of length 44 where:𝑆1S 1​ refers to left direction;𝑆2S 2​ refers to right direction;𝑆3S 3​ refers to up direction;𝑆4S 4​ refers to down direction.𝑆𝑖=1S i​ =1 denotes that you are allowed to make a move in the respective direction and vice-versa.Find the number of cells (𝑥,𝑦)(x,y) you can possibly visit which satisfy −10≤𝑥,𝑦≤10−10≤x,y≤10.Note that:You always include the cell (0,0)(0,0) in your answer.If you can visit (𝐴1,𝐵1)(A 1​ ,B 1​ ) and (𝐴2,𝐵2)(A 2​ ,B 2​ ) individually, but not both at the same time, you will still include both of them in your answer.Moves are defined as:A move in left direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴−1,𝐵)(A−1,B).A move in right direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴+1,𝐵)(A+1,B).A move in up direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴,𝐵+1)(A,B+1).A move in down direction is a move from cell (𝐴,𝐵)(A,B) to (𝐴,𝐵−1)(A,B−1).Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a binary string 𝑆S of length 44 - denoting the directions in which moves are allowed.Output FormatFor each test case, output on a new line, the number of cells you can visit as mentioned in statement.Constraints1≤𝑇≤151≤T≤15∣𝑆∣=4∣S∣=4𝑆𝑖∈{0,1}S i​ ∈{0,1}𝑆𝑖=1S i​ =1 for at least one 1≤𝑖≤41≤i≤4.Sample 1:InputOutput5001011000110111011111121121231441Explanation:Test case 11: The only allowed direction is up. Thus, you can only visit cells (0,0),(0,1),(0,2),…,(0,10)(0,0),(0,1),(0,2),…,(0,10); which are a total of 1111 cells.Test case 22: The allowed directions are left and right. Thus, you can visit cells (−10,0),(−9,0),…,(0,0),…,(9,0),(10,0)(−10,0),(−9,0),…,(0,0),…,(9,0),(10,0), which are a total of 2121 cells.Test case 33: The allowed directions are right and up. You can visit all cells (𝑥,𝑦)(x,y) such that 𝑥≥0x≥0 and 𝑦≥0y≥0, which are a total of 121121 cells.Accepted195Submissions293