48 docs tagged with "Matrix"

This is a solution to the 542. 01 Matrix problem on LeetCode.

Problem Description

Given an `m x n` board where each cell is a battleship 'X' or empty '.', count the number of battleships on the board.

This is a solution to the Check if Word Can Be Placed in Crossword problem on LeetCode.

Solution to the combine two tables problem of leetcode

This is a solution to the Convert 1D Array Into 2D Array problem on LeetCode.

The problem no. is 1351. The Problem is Count Negative Numbers in a Sorted Matrix.

This is a solution to the Diagonal Traverse problem on LeetCode.

Given a 2D array representing a dungeon, return the minimum initial health required for a knight to reach the bottom-right corner.

Calculate the m x n grid result, where result[i][j] is the average intensity of the regions to which image[i][j] belongs, rounded down to the nearest integer.

This is a solution to the Find the Minimum Area to Cover All Ones I problem on LeetCode.

Solution to Leetcode 2639. Find the Width of Columns of a Grid

This is a solution to the Island Perimeter problem on LeetCode.

Given an m x n picture consisting of black 'B' and white 'W' pixels, return the number of black lonely pixels.

This is a solution to the Longest Increasing Path in a Matrix problem on LeetCode.

This is a solution to making a large island problem on LeetCode.

This gives the solution for maximal Rectangle problem of leetcode

This document provides a solution where we find the largest square containing only 1's and return its area.

This is a solution to the Maximum Non Negative Product in a Matrix problem on LeetCode.

Problem Description

This document provides a solution where we return the minimum cost to connect the two groups.

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.

Solution to the Missing range problem of leetcode

Modify a matrix by replacing each element with the value -1 with the maximum element in its respective column.

This is a solution to the Nearest Exit from Entrance in Maze problem on LeetCode.

Given a 2D grid map of `m` rows and `n` columns initially filled with water, perform `addLand` operations that turn the water at specific positions into land. Return the number of islands after each operation. An island is surrounded by water and is formed by connecting adjacent lands horizontally or vertically.

This is a solution to the Path With Minimum Effort problem on LeetCode.

Solution to Leetcode 2614. Prime In Diagonal

given an 2D matrix which is representing an image, rotate the image by 90 degrees.

This is a solution to the Two Sum problem on LeetCode.

Solution to Leetcode 2643. Row With Maximum Ones

This document provides solutions for the Score After Flipping Matrix problem.

Problem

This is a solution to the Search a 2D Matrix II problem on LeetCode.

This is a solution to the Search a 2D Matrix II problem on LeetCode.

Problem Description

Given an image represented by a binary matrix where 0 is a white pixel and 1 is a black pixel, return the area of the smallest rectangle that encloses all black pixels. The black pixels are connected, and the rectangle must be axis-aligned.

This document covers methods to sort elements of a matrix in non-decreasing order in various programming languages.

This document provides a solution to the Spiral Matrix problem, where the goal is to traverse a matrix in spiral order.

This is a solution to the Spiral Matrix Search problem.

Problem Description

Problem Description

This tutorial covers the solution to the Transpose of Matrix problem from the GeeksforGeeks.

This is a solution to the Unique Paths problem on LeetCode.

There is a robot initially located at the top-left corner. The robot tries to move to the bottom-right corner. Return the number of possible unique paths that the robot can take to reach the bottom-right corner.

Problem Description

This document provides a solution to the Word Search II problem, where we need to return all words on the board, given an mXn board of characters and a list of strings words.

Given an m x n grid of characters board and a string word, return true if word exists in the grid.