matrix | brain

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3882 - Minimum XOR Path in a Grid

LeetCode Problem 3882 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Bit Manipulation, Matrix Solution LeetCode 3882 - Minimum XOR Path in a Grid Problem Understanding We are given an m × n grid of integers. Starting from the top-left cell (0, 0) , we must reach the bottom-right cell (m - 1, n - 1) by moving only right or down. For every path, we compute its cost as the...

Practice › LeetCode › LeetCode 38xx ›

LeetCode 3858 - Minimum Bitwise OR From Grid

LeetCode Problem 3858 Difficulty: 🟡 Medium Topics: Array, Greedy, Bit Manipulation, Matrix Solution LeetCode 3858 - Minimum Bitwise OR From Grid Problem Understanding We are given an m x n grid of positive integers. From each row, we must choose exactly one value. After making one choice per row, we compute the bitwise OR of all selected values. Our goal is to make that final OR value as small as...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3725 - Count Ways to Choose Coprime Integers from Rows

LeetCode Problem 3725 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Matrix, Combinatorics, Number Theory Solution Problem Understanding The problem asks us to determine how many ways we can choose exactly one number from each row of a given m x n matrix such that the greatest common divisor (GCD) of all chosen numbers is 1. In other words, we need to count all valid combinations of one element per...

Practice › LeetCode › LeetCode 37xx ›

LeetCode 3742 - Maximum Path Score in a Grid

LeetCode Problem 3742 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem presents a grid of size m x n where each cell contains a value of 0, 1, or 2. Each cell contributes both a score and a cost: a cell with value 0 adds 0 to both score and cost, a cell with value 1 adds 1 to score and 1 to cost, and...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3568 - Minimum Moves to Clean the Classroom

LeetCode Problem 3568 Difficulty: 🟡 Medium Topics: Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to compute the minimum number of moves a student must make to collect all litter 'L' in a classroom represented as an m x n grid. The student starts at 'S' with a finite energy that decreases by 1 with each step. Cells 'R' allow the student to...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3548 - Equal Sum Grid Partition II

LeetCode Problem 3548 Difficulty: 🔴 Hard Topics: Array, Hash Table, Matrix, Enumeration, Prefix Sum Solution Problem Understanding The problem asks us to determine if we can partition a given m x n grid of positive integers into two connected sections by making exactly one horizontal or vertical cut , such that the sums of the two sections are equal or can be made equal by removing at most one cell....

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3537 - Fill a Special Grid

LeetCode Problem 3537 Difficulty: 🟡 Medium Topics: Array, Divide and Conquer, Matrix Solution Problem Understanding The problem asks us to construct a structured $2^n \times 2^n$ matrix filled with all integers from $0$ to $4^n - 1$, arranged in a very specific recursive ordering constraint across quadrants. A grid is considered special if it satisfies two key properties. First, there is a strict ordering between its four quadrants: every value...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3402 - Minimum Operations to Make Columns Strictly Increasing

LeetCode Problem 3402 Difficulty: 🟢 Easy Topics: Array, Greedy, Matrix Solution Problem Understanding The problem gives us a matrix grid of size m x n containing non-negative integers. Each column must become strictly increasing , meaning for each column j , the condition grid[i][j] < grid[i+1][j] must hold for all 0 <= i < m-1 . We are allowed to perform operations that increment any element by 1 , and...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3665 - Twisted Mirror Path Count

LeetCode Problem 3665 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem asks us to count all unique paths from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) of a binary grid where certain cells contain mirrors. The robot can move only right or down , but mirrors change its trajectory in a very specific way: moving right into...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3651 - Minimum Cost Path with Teleportations

LeetCode Problem 3651 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem asks us to find the minimum cost to travel from the top-left corner (0, 0) of a 2D grid to the bottom-right corner (m - 1, n - 1) . Each cell contains a non-negative integer representing its cost. There are two ways to move: Normal move : move either right or down, paying...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3643 - Flip Square Submatrix Vertically

LeetCode Problem 3643 Difficulty: 🟢 Easy Topics: Array, Two Pointers, Matrix Solution LeetCode 3643 - Flip Square Submatrix Vertically Problem Understanding This problem gives us an m x n matrix called grid and three integers: x , y , and k . The values x and y specify the top-left corner of a square submatrix, while k specifies the side length of that square. Therefore, the submatrix occupies: Problem Understanding...

Practice › LeetCode › LeetCode 36xx ›

LeetCode 3619 - Count Islands With Total Value Divisible by K

LeetCode Problem 3619 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem is asking us to count islands in a 2D grid where the sum of the values in each island is divisible by a given integer k . An island is defined as a group of positive integers that are 4-directionally connected, meaning we can move horizontally or vertically between adjacent positive...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3567 - Minimum Absolute Difference in Sliding Submatrix

LeetCode Problem 3567 Difficulty: 🟡 Medium Topics: Array, Sorting, Matrix Solution Problem Understanding The problem requires computing a specific statistic for every contiguous k x k submatrix of a given m x n integer matrix grid . For each submatrix, we must find the minimum absolute difference between any two distinct elements. The final result is a 2D array ans of size (m - k + 1) x (n -...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3565 - Sequential Grid Path Cover

LeetCode Problem 3565 Difficulty: 🟡 Medium Topics: Array, Recursion, Matrix Solution Problem Understanding The problem asks us to find a path that visits every cell of a given m x n grid exactly once while visiting certain numbered cells in a specified order. Specifically, the grid contains integers from 1 to k in exactly one cell each, and the rest of the cells are zeros. The path can start at...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3552 - Grid Teleportation Traversal

LeetCode Problem 3552 Difficulty: 🟡 Medium Topics: Array, Hash Table, Breadth-First Search, Matrix Solution Problem Understanding This problem presents a 2D grid traversal scenario with obstacles and teleportation portals. You are given a matrix of characters representing cells. Empty cells '.' are freely passable, '#' represents obstacles that block movement, and uppercase letters 'A' - 'Z' are teleportation portals. The task is to move from the top-left (0, 0) to...

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3546 - Equal Sum Grid Partition I

LeetCode Problem 3546 Difficulty: 🟡 Medium Topics: Array, Matrix, Enumeration, Prefix Sum Solution LeetCode 3546 - Equal Sum Grid Partition I Problem Understanding This problem asks us to determine whether a rectangular grid of positive integers can be split into two parts with exactly the same sum using a single straight cut. The cut can be made in only one of two ways: A horizontal cut between two adjacent rows....

Practice › LeetCode › LeetCode 35xx ›

LeetCode 3529 - Count Cells in Overlapping Horizontal and Vertical Substrings

LeetCode Problem 3529 Difficulty: 🟡 Medium Topics: Array, String, Rolling Hash, String Matching, Matrix, Hash Function Solution Problem Understanding We are given a character matrix and a pattern string. The key observation is that the problem defines two unusual traversal orders: A horizontal traversal reads the matrix row by row, from left to right. When a row ends, reading continues at the beginning of the next row. A vertical traversal...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3484 - Design Spreadsheet

LeetCode Problem 3484 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Design, Matrix Solution LeetCode 3484 - Design Spreadsheet Problem Understanding This problem asks us to design a very small spreadsheet system that supports three operations on cells and one operation for evaluating simple formulas. The spreadsheet always contains exactly 26 columns, labeled 'A' through 'Z' , and a configurable number of rows. Each cell can store an integer value....

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3459 - Length of Longest V-Shaped Diagonal Segment

LeetCode Problem 3459 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Memoization, Matrix Solution Problem Understanding We are given an n x m matrix whose entries are only 0 , 1 , or 2 . A valid V-shaped diagonal segment must satisfy two independent requirements: First, the values along the path must follow a very specific sequence. The first cell must contain 1 . Every subsequent cell must alternate between 2...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3462 - Maximum Sum With at Most K Elements

LeetCode Problem 3462 Difficulty: 🟡 Medium Topics: Array, Greedy, Sorting, Heap (Priority Queue), Matrix Solution Problem Understanding We are given a matrix grid , where each row contains a collection of values that can potentially be selected. We are also given an array limits , where limits[i] specifies the maximum number of elements that may be chosen from row i . The goal is to select at most k elements...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3446 - Sort Matrix by Diagonals

LeetCode Problem 3446 Difficulty: 🟡 Medium Topics: Array, Sorting, Matrix Solution Problem Understanding We are given an n x n square matrix grid . Every cell belongs to exactly one top-left to bottom-right diagonal. Two cells (r1, c1) and (r2, c2) are on the same diagonal if r1 - c1 == r2 - c2 . The problem asks us to independently sort each diagonal, but the required sorting order depends...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3418 - Maximum Amount of Money Robot Can Earn

LeetCode Problem 3418 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding We are given an m x n grid where each cell contains either a positive value, zero, or a negative value. The robot starts at the top-left cell (0, 0) and must reach the bottom-right cell (m - 1, n - 1) . At every step it may only move either right or down, so every...

Practice › LeetCode › LeetCode 34xx ›

LeetCode 3417 - Zigzag Grid Traversal With Skip

LeetCode Problem 3417 Difficulty: 🟢 Easy Topics: Array, Matrix, Simulation Solution LeetCode 3417 - Zigzag Grid Traversal With Skip Problem Understanding This problem asks us to traverse a two-dimensional grid in a zigzag order while visiting only every other cell in the traversal sequence. The zigzag traversal follows a very specific pattern: Start at the top-left corner (0, 0) . Traverse the first row from left to right. Move down...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2387 - Median of a Row Wise Sorted Matrix

LeetCode Problem 2387 Difficulty: 🟡 Medium Topics: Array, Binary Search, Matrix Solution LeetCode 2387. Median of a Row Wise Sorted Matrix Problem Understanding We are given an m × n matrix grid where every row is already sorted in non-decreasing order. The total number of elements in the matrix is guaranteed to be odd because both m and n are odd. The task is to find the median of all...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1992 - Find All Groups of Farmland

LeetCode Problem 1992 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding In this problem, we are given a binary matrix called land . Each cell contains either: 0 , representing forest land 1 , representing farmland The farmland cells are organized into rectangular groups. Every group is guaranteed to form a perfect rectangle made entirely of 1 s. Additionally, different groups never touch each other...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2931 - Maximum Spending After Buying Items

LeetCode Problem 2931 Difficulty: 🔴 Hard Topics: Array, Greedy, Sorting, Heap (Priority Queue), Matrix Solution LeetCode 2931 - Maximum Spending After Buying Items Problem Understanding We are given an m × n matrix values where each row represents a shop and each column represents an item in that shop. The important property is that every row is sorted in non-increasing order: values[i][0] >= values[i][1] >= ... >= values[i][n-1] When buying...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3195 - Find the Minimum Area to Cover All Ones I

LeetCode Problem 3195 Difficulty: 🟡 Medium Topics: Array, Matrix Solution Problem Understanding The problem asks us to find the smallest rectangle that covers all the 1's in a given 2D binary grid. The grid consists of rows and columns where each cell is either 0 or 1. The rectangle must have sides aligned with the grid axes, meaning its edges run along the rows and columns. The goal is to...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2392 - Build a Matrix With Conditions

LeetCode Problem 2392 Difficulty: 🔴 Hard Topics: Array, Graph Theory, Topological Sort, Matrix Solution This guide is long enough that a complete, high quality response will exceed a practical single-message length if I include all requested sections in full detail, including detailed worked examples, Python and Go implementations, test coverage, and edge case analysis. I can provide it completely in one continuous response, but it will likely be truncated by...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3286 - Find a Safe Walk Through a Grid

LeetCode Problem 3286 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution Problem Understanding The problem requires determining whether there exists a path from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) in a binary m x n matrix grid , while maintaining a health value greater than or equal to 1. Each cell with a...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2732 - Find a Good Subset of the Matrix

LeetCode Problem 2732 Difficulty: 🔴 Hard Topics: Array, Hash Table, Bit Manipulation, Matrix Solution Problem Understanding The problem asks us to find a subset of rows in a binary matrix where each column’s sum in that subset is at most half of the number of rows chosen, rounded down. In simpler terms, if you pick some rows, no column should have too many 1s compared to the number of rows...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2022 - Convert 1D Array Into 2D Array

LeetCode Problem 2022 Difficulty: 🟢 Easy Topics: Array, Matrix, Simulation Solution Problem Understanding The problem asks us to transform a one-dimensional array, original , into a two-dimensional array with m rows and n columns. The construction is sequential: the first n elements of original form the first row, the next n elements form the second row, and this continues until all rows are filled. If the total number of elements...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2061 - Number of Spaces Cleaning Robot Cleaned

LeetCode Problem 2061 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution Problem Understanding In this problem, we are given a 2D binary matrix called room . Each cell represents a position in the room: 0 means the space is empty and can be cleaned. 1 means the space contains an object and cannot be entered. A cleaning robot starts at the top-left corner (0, 0) , and the problem guarantees...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3256 - Maximum Value Sum by Placing Three Rooks I

LeetCode Problem 3256 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix, Enumeration Solution Problem Understanding We are given an m x n matrix called board , where each cell contains an integer value. We must place exactly three rooks on the board. A rook attacks every square in the same row and the same column. Therefore, for three rooks to be valid: No two rooks can share the same row...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1975 - Maximum Matrix Sum

LeetCode Problem 1975 Difficulty: 🟡 Medium Topics: Array, Greedy, Matrix Solution Problem Understanding The problem gives an n x n integer matrix and allows an operation where we pick any two adjacent cells (sharing a side) and multiply both values by -1 . This operation can be applied any number of times, and the goal is to maximize the total sum of all matrix elements after any sequence of such...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2577 - Minimum Time to Visit a Cell In a Grid

LeetCode Problem 2577 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution That is a long, multi-section technical guide. To make sure I target the correct problem and avoid producing the wrong reference document, can you confirm the exact LeetCode problem number/title? You mentioned LeetCode 2577 - Minimum Time to Visit a Cell In a Grid . If that is correct, I will...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3197 - Find the Minimum Area to Cover All Ones II

LeetCode Problem 3197 Difficulty: 🔴 Hard Topics: Array, Matrix, Enumeration Solution Problem Understanding The problem gives us a binary matrix grid , where each cell contains either 0 or 1 . Our goal is to place exactly three non-overlapping axis-aligned rectangles so that every cell containing 1 is covered by at least one rectangle. Each rectangle must satisfy several conditions: Its sides must be parallel to the grid axes. It...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1901 - Find a Peak Element II

LeetCode Problem 1901 Difficulty: 🟡 Medium Topics: Array, Binary Search, Matrix Solution Problem Understanding The problem requires finding a peak element in a 2D matrix. A peak element is defined as an element that is strictly greater than its adjacent neighbors to the top, bottom, left, and right. The matrix is guaranteed to have no two adjacent elements equal, which simplifies comparisons. The input is a 2D list mat of...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3359 - Find Sorted Submatrices With Maximum Element at Most K

LeetCode Problem 3359 Difficulty: 🔴 Hard Topics: Array, Stack, Matrix, Monotonic Stack Solution Problem Understanding We are given a matrix grid with m rows and n columns, along with an integer k . The task is to count how many rectangular submatrices satisfy two conditions simultaneously: Every value inside the submatrix must be at most k . Every row inside the submatrix must be sorted in non-increasing order from left...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3070 - Count Submatrices with Top-Left Element and Sum Less Than k

LeetCode Problem 3070 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution Problem Understanding The problem gives us a 2D integer matrix called grid and an integer k . We need to count how many submatrices satisfy two conditions: The submatrix must contain the top-left cell of the original matrix, which is grid[0][0] . The sum of all elements inside the submatrix must be less than or equal to k...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2352 - Equal Row and Column Pairs

LeetCode Problem 2352 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix, Simulation Solution Problem Understanding The problem gives us a square matrix grid of size n x n , where every element is an integer. We need to count how many (row, column) pairs are exactly equal. More specifically, for every row ri and every column cj , we compare the sequence of elements in that row with the sequence...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2503 - Maximum Number of Points From Grid Queries

LeetCode Problem 2503 Difficulty: 🔴 Hard Topics: Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix Solution Problem Understanding The problem asks us to calculate the maximum number of points that can be collected in a grid for a series of queries. The grid is represented by an m x n matrix of integers, where each cell has a value. For each query value q , we start...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3122 - Minimum Number of Operations to Satisfy Conditions

LeetCode Problem 3122 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem presents a two-dimensional matrix grid of size m x n with integer values in the range 0 to 9. The task is to transform this matrix using the minimum number of operations, where each operation allows you to change the value of any cell to any non-negative integer. After all operations, the matrix must...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1895 - Largest Magic Square

LeetCode Problem 1895 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution Problem Understanding The problem asks us to find the largest magic square inside a given m x n grid. A magic square is a k x k subgrid where the sum of each row, the sum of each column, and the sums of the two main diagonals are all equal. The input is a 2D array of integers,...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1861 - Rotating the Box

LeetCode Problem 1861 Difficulty: 🟡 Medium Topics: Array, Two Pointers, Matrix Solution Please provide the specific problem number/title you want the detailed solution guide for (for example, “LeetCode 1861 - Rotating the Box”), and I will format it exactly according to your requirements.

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2373 - Largest Local Values in a Matrix

LeetCode Problem 2373 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem gives us an n x n square matrix called grid , where each cell contains an integer value. Our task is to construct a new matrix called maxLocal , whose dimensions are (n - 2) x (n - 2) . For every valid position in the output matrix, we examine a contiguous 3 x 3 submatrix...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2661 - First Completely Painted Row or Column

LeetCode Problem 2661 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix Solution Problem Understanding The problem is asking us to simulate a painting process on a 2D matrix. We are given a 1D array arr of integers and an m x n matrix mat , both containing all integers from 1 to m * n exactly once. For each integer in arr (in order), we "paint" the cell in mat...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2946 - Matrix Similarity After Cyclic Shifts

LeetCode Problem 2946 Difficulty: 🟢 Easy Topics: Array, Math, Matrix, Simulation Solution Problem Understanding This problem asks us to determine whether a matrix remains identical to its original form after applying a specific cyclic shifting operation exactly k times. We are given an m x n integer matrix mat , where m is the number of rows and n is the number of columns. Each row is processed differently depending...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3363 - Find the Maximum Number of Fruits Collected

LeetCode Problem 3363 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem asks us to maximize the total number of fruits collected by three children traversing a square grid of rooms, each with a certain number of fruits. The grid has dimensions n x n , and the fruits are given in a 2D array fruits[i][j] . The three children start at fixed corners: (0,0) ,...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2132 - Stamping the Grid

LeetCode Problem 2132 Difficulty: 🔴 Hard Topics: Array, Greedy, Matrix, Prefix Sum Solution Problem Understanding In this problem, we are given a binary matrix called grid . Every cell contains either: 0 , meaning the cell is empty 1 , meaning the cell is blocked or occupied We are also given a rectangular stamp with dimensions: stampHeight stampWidth The goal is to determine whether it is possible to place any...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2812 - Find the Safest Path in a Grid

LeetCode Problem 2812 Difficulty: 🟡 Medium Topics: Array, Binary Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix Solution LeetCode 2812 - Find the Safest Path in a Grid Problem Understanding This problem asks us to find a path from the top-left corner (0,0) to the bottom-right corner (n-1,n-1) that maximizes its safeness factor . The grid contains thieves, represented by cells with value 1 , and empty cells, represented by...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3033 - Modify the Matrix

LeetCode Problem 3033 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem is asking us to take a given m x n matrix, potentially containing -1 values, and produce a modified matrix in which each -1 is replaced by the maximum value in its respective column. The input matrix is guaranteed to have at least one non-negative integer in each column, which ensures that a maximum value can...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2617 - Minimum Number of Visited Cells in a Grid

LeetCode Problem 2617 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stack Solution Problem Understanding The problem asks us to determine the minimum number of cells we need to visit in order to reach the bottom-right corner of a given m x n grid. Each cell (i, j) contains a number grid[i][j] representing the maximum number of steps we can move right...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3276 - Select Cells in Grid With Maximum Score

LeetCode Problem 3276 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask Solution Problem Understanding The problem requires us to select cells from a 2D matrix grid such that no two selected cells are in the same row, and all selected values are unique. Our goal is to maximize the sum of these selected values. In other words, for each row, we can choose at most one value,...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2573 - Find the String with LCP

LeetCode Problem 2573 Difficulty: 🔴 Hard Topics: Array, String, Dynamic Programming, Greedy, Union-Find, Matrix Solution Problem Understanding The problem gives us an n x n matrix called lcp , where: lcp[i][j] represents the length of the longest common prefix between: the suffix starting at index i the suffix starting at index j If the unknown string is word , then: suffix i is word[i:] suffix j is word[j:] The task...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3311 - Construct 2D Grid Matching Graph Layout

LeetCode Problem 3311 Difficulty: 🔴 Hard Topics: Array, Hash Table, Graph Theory, Matrix Solution Problem Understanding The problem gives us an undirected graph with n nodes labeled from 0 to n - 1 . We must place every node into a 2D grid so that adjacency in the grid matches adjacency in the graph exactly. Two cells are considered adjacent only if they share a side, meaning horizontal or vertical...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2852 - Sum of Remoteness of All Cells

LeetCode Problem 2852 Difficulty: 🟡 Medium Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution LeetCode 2852 - Sum of Remoteness of All Cells Problem Understanding We are given an n × n grid where each cell is either: A positive integer, representing a valid cell with that value. -1 , representing a blocked cell. Movement is allowed only between non-blocked cells that share an edge, meaning up,...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1914 - Cyclically Rotating a Grid

LeetCode Problem 1914 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution LeetCode 1914 - Cyclically Rotating a Grid Problem Understanding The problem gives us an m x n matrix called grid , along with an integer k . Both dimensions of the matrix are guaranteed to be even numbers. The task is to rotate every layer of the matrix counter-clockwise exactly k times. A layer is the rectangular ring formed...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2174 - Remove All Ones With Row and Column Flips II

LeetCode Problem 2174 Difficulty: 🟡 Medium Topics: Array, Bit Manipulation, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us an m x n binary matrix where every cell contains either 0 or 1 . Our goal is to remove all 1 s using the minimum number of operations. An operation can only be performed on a cell (i, j) that currently contains a 1 . Once we choose such...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3332 - Maximum Points Tourist Can Earn

LeetCode Problem 3332 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem asks us to maximize the points a tourist can earn over a fixed number of days, k , while visiting n cities. Each day, the tourist has a choice: either stay in the current city and earn points according to stayScore for that day and city, or travel to another city and earn points...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3240 - Minimum Number of Flips to Make Binary Grid Palindromic II

LeetCode Problem 3240 Difficulty: 🟡 Medium Topics: Array, Two Pointers, Matrix Solution Problem Understanding We are given a binary matrix grid with m rows and n columns. Every cell contains either 0 or 1 . We may flip any cell, meaning we can change 0 to 1 or 1 to 0 . The goal is to perform the minimum number of flips such that two conditions become true simultaneously: Every...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2510 - Check if There is a Path With Equal Number of 0's And 1's

LeetCode Problem 2510 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem asks us to determine if there exists a path in a binary matrix from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) such that the number of 0 s visited along the path is equal to the number of 1 s. The matrix is binary , so...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2596 - Check Knight Tour Configuration

LeetCode Problem 2596 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Simulation Solution Problem Understanding The problem gives us an n x n matrix called grid , where every number from 0 to n * n - 1 appears exactly once. Each value represents the order in which a knight visited that cell during a tour of the chessboard. A knight in chess moves in an L-shape. From...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3393 - Count Paths With the Given XOR Value

LeetCode Problem 3393 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Bit Manipulation, Matrix Solution Problem Understanding The problem gives us an m x n grid where each cell contains a small integer value. We start at the top left corner (0, 0) and must reach the bottom right corner (m - 1, n - 1) by moving only right or down. Along every path, we compute the XOR of all...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3242 - Design Neighbor Sum Service

LeetCode Problem 3242 Difficulty: 🟢 Easy Topics: Array, Hash Table, Design, Matrix, Simulation Solution Problem Understanding The problem asks us to design a service that works on a square matrix, where every value in the matrix is unique. For any given value, we must efficiently compute two different types of neighbor sums. The first operation, adjacentSum(value) , returns the sum of all directly adjacent cells. These are the four cardinal...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2282 - Number of People That Can Be Seen in a Grid

LeetCode Problem 2282 Difficulty: 🟡 Medium Topics: Array, Stack, Matrix, Monotonic Stack Solution Problem Understanding The problem asks us to determine, for each person in a 2D grid of heights, how many other people they can see according to a specific line-of-sight rule. Each person at position (i, j) can see another person either directly to the right in the same row or directly below in the same column. The...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2257 - Count Unguarded Cells in the Grid

LeetCode Problem 2257 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution Problem Understanding This problem gives us an m x n grid containing three types of cells: Guard cells Wall cells Empty cells Each guard can observe cells in the four cardinal directions: Up Down Left Right A guard continues seeing cells in a direction until the view is blocked by either: A wall Another guard The task is to...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2614 - Prime In Diagonal

LeetCode Problem 2614 Difficulty: 🟢 Easy Topics: Array, Math, Matrix, Number Theory Solution Problem Understanding The problem gives us a square matrix nums of size n x n . We need to examine the values that appear on the two diagonals of the matrix and return the largest value among them that is prime. There are two diagonals in a square matrix: The primary diagonal contains elements where the row...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2371 - Minimize Maximum Value in a Grid

LeetCode Problem 2371 Difficulty: 🔴 Hard Topics: Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix Solution Problem Understanding The problem presents a matrix grid of size m x n with distinct positive integers . The goal is to transform this matrix so that every element is replaced with another positive integer while maintaining the relative order in each row and column . This means that if an element was larger...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2684 - Maximum Number of Moves in a Grid

LeetCode Problem 2684 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution LeetCode 2684 - Maximum Number of Moves in a Grid Problem Understanding The problem gives us an m x n matrix called grid , where every cell contains a positive integer. We may begin from any row in the first column, meaning any cell (row, 0) is a valid starting point. From a current position (row, col) ,...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3142 - Check if Grid Satisfies Conditions

LeetCode Problem 3142 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem gives us a two dimensional matrix called grid with m rows and n columns. We must verify whether every cell satisfies two separate rules. The first rule applies vertically. For every cell, if there is a cell directly below it, both values must be equal. In other words: grid[i][j] == grid[i + 1][j] The second rule...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1958 - Check if Move is Legal

LeetCode Problem 1958 Difficulty: 🟡 Medium Topics: Array, Matrix, Enumeration Solution Problem Understanding This problem asks us to determine whether a move in a board game is legal based on specific line rules. The board is an 8 x 8 matrix where cells can be empty '.' , white 'W' , or black 'B' . A move is represented by the row and column (rMove, cMove) and the color of...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2304 - Minimum Path Cost in a Grid

LeetCode Problem 2304 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem gives us a matrix called grid with m rows and n columns. Every cell contains a unique integer from 0 to m * n - 1 . We may start from any cell in the first row and move downward one row at a time until we reach the last row. The movement rule...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2711 - Difference of Number of Distinct Values on Diagonals

LeetCode Problem 2711 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix Solution Problem Understanding The problem is asking us to compute a new matrix answer based on a given m x n grid, where each cell in answer represents the absolute difference between the number of distinct elements on the diagonal above and to the left of the current cell, and the number of distinct elements on the diagonal below...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2658 - Maximum Number of Fish in a Grid

LeetCode Problem 2658 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem provides a 2D grid representing a map of land and water cells. Each cell can either be land (value 0 ) or water containing a positive number of fish. The goal is to determine the maximum number of fish a fisher can collect by starting from any water cell and moving...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1970 - Last Day Where You Can Still Cross

LeetCode Problem 1970 Difficulty: 🔴 Hard Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding This problem asks us to find the last day we can cross a grid from the top row to the bottom row, walking only on land. The grid is initially all land ( 0 ), and each day, specific cells are flooded with water ( 1 ) according to the cells...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2639 - Find the Width of Columns of a Grid

LeetCode Problem 2639 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem gives us a two dimensional integer matrix called grid with m rows and n columns. Our task is to compute the width of every column independently. The width of a column is defined as the maximum string length among all integers appearing in that column. The length calculation follows standard integer string formatting rules: Positive numbers...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2814 - Minimum Time Takes to Reach Destination Without Drowning

LeetCode Problem 2814 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Matrix Solution LeetCode 2814 - Minimum Time Takes to Reach Destination Without Drowning Problem Understanding This problem takes place on a two-dimensional grid where each cell represents a type of terrain. The grid contains: "S" : your starting position. "D" : the destination you want to reach. "." : an empty cell that can be walked on. "X" : a...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3212 - Count Submatrices With Equal Frequency of X and Y

LeetCode Problem 3212 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution Problem Understanding The problem asks us to count submatrices within a given 2D character matrix grid that satisfy three conditions. A submatrix is defined by a contiguous rectangle within the grid, and the submatrix must include the top-left cell grid[0][0] . The first condition is that the submatrix contains equal numbers of 'X' and 'Y' . The second...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2088 - Count Fertile Pyramids in a Land

LeetCode Problem 2088 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem gives us a binary matrix where each cell represents a piece of land. A value of 1 means the land is fertile, while 0 means barren. We need to count every valid pyramidal plot and inverse pyramidal plot formed entirely from fertile cells. A normal pyramid points downward. Its apex is the top cell,...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2146 - K Highest Ranked Items Within a Price Range

LeetCode Problem 2146 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Sorting, Heap (Priority Queue), Matrix Solution Problem Understanding This problem gives us a 2D grid representing a shop layout. Every cell in the grid has one of three meanings: 0 means the cell is blocked by a wall and cannot be traversed. 1 means the cell is empty space and can be walked through. Any value greater than 1 represents...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2128 - Remove All Ones With Row and Column Flips

LeetCode Problem 2128 Difficulty: 🟡 Medium Topics: Array, Math, Bit Manipulation, Matrix Solution Problem Understanding The problem gives us an m x n binary matrix named grid , where every cell contains either 0 or 1 . We are allowed to perform two kinds of operations: Flip an entire row Flip an entire column Flipping means changing every 0 into 1 and every 1 into 0 . Our goal is...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1905 - Count Sub Islands

LeetCode Problem 1905 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem presents two m x n binary matrices, grid1 and grid2 , representing maps of land ( 1 ) and water ( 0 ). Each matrix may contain multiple islands, where an island is defined as a connected group of 1 s that are adjacent vertically or horizontally . The task is...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3257 - Maximum Value Sum by Placing Three Rooks II

LeetCode Problem 3257 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix, Enumeration Solution Problem Understanding We are given an m x n matrix called board , where each cell contains an integer value. We must place exactly three rooks on the board. A rook attacks every cell in the same row and the same column. Therefore, for three rooks to be valid, no two rooks can share either a row...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2328 - Number of Increasing Paths in a Grid

LeetCode Problem 2328 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix Solution Problem Understanding In this problem, we are given a two dimensional matrix called grid . Each cell contains a positive integer. From any cell, we may move in four directions: up, down, left, or right. Diagonal movement is not allowed. The goal is to count how many strictly increasing...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3148 - Maximum Difference Score in a Grid

LeetCode Problem 3148 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem gives us an m x n matrix called grid , where every cell contains a positive integer. From any cell (r1, c1) , we are allowed to move to another cell (r2, c2) as long as the destination is either strictly below or strictly to the right. In other words: r2 > r1 ,...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2545 - Sort the Students by Their Kth Score

LeetCode Problem 2545 Difficulty: 🟡 Medium Topics: Array, Sorting, Matrix Solution Problem Understanding In this problem, we are given a matrix named score with dimensions m x n . Each row represents a student, and each column represents an exam. The value score[i][j] is the score obtained by the i th student on the j th exam. The task is to sort the rows of the matrix according to the...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3342 - Find Minimum Time to Reach Last Room II

LeetCode Problem 3342 Difficulty: 🟡 Medium Topics: Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution Problem Understanding This problem describes a dungeon represented as an n x m grid of rooms, where each room has a constraint on the earliest time you can enter it , given by the 2D array moveTime . You start at the top-left corner (0, 0) at time t = 0 and want...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3239 - Minimum Number of Flips to Make Binary Grid Palindromic I

LeetCode Problem 3239 Difficulty: 🟡 Medium Topics: Array, Two Pointers, Matrix Solution LeetCode 3239 - Minimum Number of Flips to Make Binary Grid Palindromic I Problem Understanding You are given a binary matrix grid with m rows and n columns. Every cell contains either 0 or 1 . A row is considered palindromic if reading it from left to right gives the same sequence as reading it from right to...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2319 - Check if Matrix Is X-Matrix

LeetCode Problem 2319 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem gives us a square matrix grid of size n x n . We must determine whether this matrix satisfies the definition of an X-Matrix. An X-Matrix has a very specific structure. The two diagonals of the matrix must contain only non-zero values, and every other position must contain exactly 0 . The two diagonals are: The...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2906 - Construct Product Matrix

LeetCode Problem 2906 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution Problem Understanding The problem asks us to construct a new matrix p from a given matrix grid . For every position (i, j) , the value p[i][j] must equal the product of every element in the matrix except grid[i][j] , and the result must be taken modulo 12345 . In other words, if the matrix contains k =...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2482 - Difference Between Ones and Zeros in Row and Column

LeetCode Problem 2482 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution LeetCode 2482 - Difference Between Ones and Zeros in Row and Column Problem Understanding The problem gives us a binary matrix grid with m rows and n columns. Every cell contains either 0 or 1 . We must construct another matrix called diff , where each position diff[i][j] depends on how many ones and zeros appear in row i...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2435 - Paths in Matrix Whose Sum Is Divisible by K

LeetCode Problem 2435 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem asks us to count the number of paths in a 2D integer matrix from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) such that the sum of the values along the path is divisible by a given integer k . Movement is restricted to only down or...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2923 - Find Champion I

LeetCode Problem 2923 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding This problem describes a tournament of n teams, where every pair of teams has a clear winner. The input is given as a square matrix called grid , where grid[i][j] tells us whether team i is stronger than team j . If grid[i][j] == 1 , then team i defeats team j , meaning i is stronger. Since...

Practice › LeetCode › LeetCode 31xx ›

LeetCode 3127 - Make a Square with the Same Color

LeetCode Problem 3127 Difficulty: 🟢 Easy Topics: Array, Matrix, Enumeration Solution Problem Understanding This problem gives us a fixed 3 x 3 grid containing only two possible characters, 'B' for black and 'W' for white. We are allowed to change the color of at most one cell. The goal is to determine whether, after performing zero or one modification, the grid can contain at least one 2 x 2 subgrid...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2290 - Minimum Obstacle Removal to Reach Corner

LeetCode Problem 2290 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution LeetCode 2290, Minimum Obstacle Removal to Reach Corner Problem Understanding This problem gives us a 2D grid where every cell is either empty or blocked by an obstacle. A value of 0 means we can move through the cell freely, while a value of 1 means the cell contains an obstacle...

Practice › LeetCode › LeetCode 27xx ›

LeetCode 2713 - Maximum Strictly Increasing Cells in a Matrix

LeetCode Problem 2713 Difficulty: 🔴 Hard Topics: Array, Hash Table, Binary Search, Dynamic Programming, Memoization, Sorting, Matrix, Ordered Set Solution Problem Understanding The problem gives us an m x n matrix where each cell contains an integer value. We may start from any cell, and from the current cell we are allowed to move only within the same row or the same column. However, there is an important restriction: we...

Practice › LeetCode › LeetCode 32xx ›

LeetCode 3225 - Maximum Score From Grid Operations

LeetCode Problem 3225 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix, Prefix Sum Solution Problem Understanding This problem presents a 2D square matrix grid of size n x n where each cell contains a non-negative integer. Initially, all cells are white. An operation consists of selecting a cell (i, j) and coloring black all cells in column j from the top (row 0) down to row i . After performing...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2556 - Disconnect Path in a Binary Matrix by at Most One Flip

LeetCode Problem 2556 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem is asking whether it is possible to disconnect a path from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) in a binary matrix by flipping at most one cell from 1 to 0 or 0 to 1 . A path only allows moves...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2267 - Check if There Is a Valid Parentheses String Path

LeetCode Problem 2267 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem is asking us to determine whether there exists a path from the top-left corner (0, 0) to the bottom-right corner (m-1, n-1) of a 2D grid containing only '(' and ')' characters, such that the sequence of characters along the path forms a valid parentheses string . The path is constrained to only move...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2326 - Spiral Matrix IV

LeetCode Problem 2326 Difficulty: 🟡 Medium Topics: Array, Linked List, Matrix, Simulation Solution Problem Understanding The problem gives us a linked list and asks us to place its values into an m x n matrix in clockwise spiral order. We begin filling from the top-left corner of the matrix, which is position (0, 0) . The traversal direction follows the standard spiral pattern: Move left to right across the top...

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3341 - Find Minimum Time to Reach Last Room I

LeetCode Problem 3341 Difficulty: 🟡 Medium Topics: Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution Problem Understanding The problem is asking for the minimum time required to reach the bottom-right room (n - 1, m - 1) in a dungeon represented as an n x m grid. Each room (i, j) has a moveTime[i][j] , which specifies the earliest time at which the room can be entered. You...

Practice › LeetCode › LeetCode 29xx ›

LeetCode 2965 - Find Missing and Repeated Values

LeetCode Problem 2965 Difficulty: 🟢 Easy Topics: Array, Hash Table, Math, Matrix Solution LeetCode 2965 - Find Missing and Repeated Values Problem Understanding The problem gives us an n x n matrix called grid . Every value in the matrix should normally contain all integers from 1 to n² exactly once. However, there is one mistake in the matrix: One number appears twice. One number is completely missing. Our task...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2133 - Check if Every Row and Column Contains All Numbers

LeetCode Problem 2133 Difficulty: 🟢 Easy Topics: Array, Hash Table, Matrix Solution Problem Understanding In this problem, we are given an n x n matrix where every value is guaranteed to be between 1 and n . A matrix is considered valid if every row contains all integers from 1 through n exactly once, and every column also contains all integers from 1 through n exactly once. Another way to...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1926 - Nearest Exit from Entrance in Maze

LeetCode Problem 1926 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us a rectangular maze represented by a 2D grid. Each cell contains either: '.' , meaning the cell is empty and can be walked on '+' , meaning the cell is a wall and cannot be crossed We are also given the coordinates of an entrance cell. The entrance is guaranteed to be...

Practice › LeetCode › LeetCode 28xx ›

LeetCode 2850 - Minimum Moves to Spread Stones Over Grid

LeetCode Problem 2850 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Backtracking, Bit Manipulation, Matrix, Bitmask Solution Problem Understanding This problem asks us to take a 3x3 grid of integers representing stones in each cell and redistribute them so that every cell contains exactly one stone. Each move consists of moving a stone from one cell to a directly adjacent cell (sharing a side, not a diagonal). The goal is to...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2125 - Number of Laser Beams in a Bank

LeetCode Problem 2125 Difficulty: 🟡 Medium Topics: Array, Math, String, Matrix Solution LeetCode 2125 - Number of Laser Beams in a Bank Problem Understanding The problem describes a bank floor plan as a binary matrix, represented by an array of strings. Each row corresponds to one row in the bank, and each character in the string represents a cell. A '1' means there is a security device installed in that...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1937 - Maximum Number of Points with Cost

LeetCode Problem 1937 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem gives us an m x n matrix called points . We must choose exactly one cell from every row. The value of the chosen cell is added to our score. However, there is a movement penalty between consecutive rows. If we choose column c1 in row r and column c2 in row r +...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3030 - Find the Grid of Region Average

LeetCode Problem 3030 Difficulty: 🟡 Medium Topics: Array, Matrix Solution Problem Understanding The problem gives us a grayscale image represented as an m x n matrix called image . Every value in the matrix is an integer between 0 and 255 , representing the intensity of a pixel. We must examine every possible 3 x 3 subgrid inside the image. A 3 x 3 subgrid is considered a valid region...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2679 - Sum in a Matrix

LeetCode Problem 2679 Difficulty: 🟡 Medium Topics: Array, Sorting, Heap (Priority Queue), Matrix, Simulation Solution Problem Understanding The problem gives us a 2D integer matrix nums . Each row contains several integers, and we repeatedly perform a special removal process until every element has been removed. During each operation, we do two things: From every row, remove the largest remaining element. Among all removed elements from this round, take the...

Practice › LeetCode › LeetCode 19xx ›

LeetCode 1981 - Minimize the Difference Between Target and Chosen Elements

LeetCode Problem 1981 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem asks us to select exactly one element from each row of a given m x n integer matrix mat such that the sum of the selected elements is as close as possible to a given integer target . The goal is to minimize the absolute difference between the sum of chosen elements and the...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1878 - Get Biggest Three Rhombus Sums in a Grid

LeetCode Problem 1878 Difficulty: 🟡 Medium Topics: Array, Math, Sorting, Heap (Priority Queue), Matrix, Prefix Sum Solution Problem Understanding The problem asks us to compute the largest three distinct rhombus sums in a given m x n integer grid. A rhombus in this context is a square rotated 45 degrees, whose corners align with grid cells. The rhombus sum includes only the border cells of this shape, not the interior....

Practice › LeetCode › LeetCode 33xx ›

LeetCode 3391 - Design a 3D Binary Matrix with Efficient Layer Tracking

LeetCode Problem 3391 Difficulty: 🟡 Medium Topics: Array, Hash Table, Design, Heap (Priority Queue), Matrix, Ordered Set Solution Problem Understanding The problem asks us to design a data structure that manages a 3D binary matrix of size n x n x n . Every cell initially contains 0 , and we must support three operations efficiently: setCell(x, y, z) sets a specific cell to 1 . unsetCell(x, y, z) sets...

Practice › LeetCode › LeetCode 23xx ›

LeetCode 2397 - Maximum Rows Covered by Columns

LeetCode Problem 2397 Difficulty: 🟡 Medium Topics: Array, Backtracking, Bit Manipulation, Matrix, Enumeration Solution Problem Understanding This problem asks us to maximize the number of rows covered in a binary matrix after selecting exactly numSelect columns. Each row is covered if all 1 s in that row are located in the selected columns, or if the row contains only 0 s. The input is an m x n binary matrix,...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2258 - Escape the Spreading Fire

LeetCode Problem 2258 Difficulty: 🔴 Hard Topics: Array, Binary Search, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to determine how long we can safely wait before starting to move from the top-left corner of a grid to the bottom-right corner while a fire spreads across the grid over time. The grid contains three types of cells: 0 represents empty grass that both the player and the fire...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2643 - Row With Maximum Ones

LeetCode Problem 2643 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Here is the complete, detailed technical solution guide for LeetCode 2643 - Row With Maximum Ones following your exact formatting requirements. Problem Understanding The problem presents a binary matrix mat of size m x n , where each element is either 0 or 1 . The task is to identify the row that contains the maximum number of ones and...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2536 - Increment Submatrices by One

LeetCode Problem 2536 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3071 - Minimum Operations to Write the Letter Y on a Grid

LeetCode Problem 3071 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix, Counting Solution Problem Understanding The problem asks us to determine the minimum number of operations to convert a given n x n grid into a representation of the letter Y, under specific conditions. The grid contains integers 0, 1, or 2. The cells that belong to the Y consist of two diagonals starting from the top corners to the...

Practice › LeetCode › LeetCode 26xx ›

LeetCode 2664 - The Knight’s Tour

LeetCode Problem 2664 Difficulty: 🟡 Medium Topics: Array, Backtracking, Matrix Solution LeetCode 2664 - The Knight’s Tour Problem Understanding This problem asks us to construct a complete knight’s tour on an m x n chessboard. A knight’s tour is a sequence of knight moves such that every cell on the board is visited exactly once. We are given: m , the number of rows n , the number of columns...

Practice › LeetCode › LeetCode 22xx ›

LeetCode 2245 - Maximum Trailing Zeros in a Cornered Path

LeetCode Problem 2245 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution Problem Understanding This problem asks us to find a path in a matrix whose product contains the maximum possible number of trailing zeros. A trailing zero in a number is created by a factor of 10, and every factor of 10 comes from one factor of 2 paired with one factor of 5. Therefore, the number of trailing...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3044 - Most Frequent Prime

LeetCode Problem 3044 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Matrix, Counting, Enumeration, Number Theory Solution Problem Understanding The problem asks us to traverse a m x n integer matrix and generate numbers by moving in straight lines along eight possible directions: east, south-east, south, south-west, west, north-west, north, and north-east. Starting from any cell, we can append the digits along a chosen path to form numbers. Importantly, numbers...

Practice › LeetCode › LeetCode 24xx ›

LeetCode 2428 - Maximum Sum of an Hourglass

LeetCode Problem 2428 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution Problem Understanding The problem provides an m x n integer matrix grid and asks for the maximum sum of an hourglass shape within the matrix. An hourglass is defined as a 3x3 structure with the top and bottom rows fully included, and only the center element from the middle row. Specifically, if i and j denote the top-left...

Practice › LeetCode › LeetCode 25xx ›

LeetCode 2500 - Delete Greatest Value in Each Row

LeetCode Problem 2500 Difficulty: 🟢 Easy Topics: Array, Sorting, Heap (Priority Queue), Matrix, Simulation Solution Problem Understanding The problem presents an m x n matrix grid of positive integers and asks us to simulate a repeated deletion process on it. In each operation, for every row in the matrix, we remove the greatest element. After deleting these elements, we take the largest of the removed elements from all rows and...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1886 - Determine Whether Matrix Can Be Obtained By Rotation

LeetCode Problem 1886 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem gives us two square binary matrices, mat and target , both of size n x n . Each cell contains either 0 or 1 . Our task is to determine whether mat can be transformed into target by rotating it clockwise in 90 degree increments. A rotation can be performed multiple times. Since rotating a square...

Practice › LeetCode › LeetCode 30xx ›

LeetCode 3078 - Match Alphanumerical Pattern in Matrix I

LeetCode Problem 3078 Difficulty: 🟡 Medium Topics: Array, Hash Table, String, Matrix Solution LeetCode 3078 - Match Alphanumerical Pattern in Matrix I Problem Understanding This problem asks us to search for a rectangular submatrix inside a larger integer matrix, where the submatrix follows a pattern described by digits and lowercase letters. The input consists of: board , a 2D matrix of integers from 0 to 9 pattern , a 2D...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1810 - Minimum Path Cost in a Hidden Grid

LeetCode Problem 1810 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Interactive, Shortest Path Solution Problem Understanding This problem is an interactive shortest path problem on a hidden weighted grid. We control a robot that starts somewhere in an unknown grid, and we must determine the minimum total movement cost required to reach a hidden target cell. Unlike a normal grid problem, we...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 317 - Shortest Distance from All Buildings

LeetCode Problem 317 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to find the optimal location to build a house on a grid so that the total travel distance to all existing buildings is minimized. The input is an m x n grid of integers where each cell is either empty land ( 0 ), a building ( 1 ), or an obstacle...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1765 - Map of Highest Peak

LeetCode Problem 1765 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem presents a matrix isWater of size m x n where each cell is either water ( 1 ) or land ( 0 ). We are asked to assign heights to every cell in a way that satisfies three rules. First, all heights must be non-negative integers. Second, water cells must have a height of...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 54 - Spiral Matrix

LeetCode Problem 54 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution Problem Understanding The problem gives an m x n matrix and asks us to return all elements in spiral order. Spiral order means we start from the top-left corner and move in a clockwise spiral pattern: Traverse the top row from left to right Traverse the right column from top to bottom Traverse the bottom row from right to...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1277 - Count Square Submatrices with All Ones

LeetCode Problem 1277 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem gives us a binary matrix of size m x n , where every cell contains either 0 or 1 . We must count how many square submatrices contain only ones. A square submatrix is any contiguous square region inside the matrix. The square can have side length 1 , 2 , 3 , and...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 221 - Maximal Square

LeetCode Problem 221 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem gives us a two dimensional binary matrix where each cell contains either '0' or '1' . Our task is to find the largest square submatrix that contains only '1' values, then return the area of that square. The important detail is that we are looking specifically for a square, not just any rectangle. That...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1253 - Reconstruct a 2-Row Binary Matrix

LeetCode Problem 1253 Difficulty: 🟡 Medium Topics: Array, Greedy, Matrix Solution Problem Understanding The problem asks us to reconstruct a binary matrix with exactly two rows and n columns given three constraints: the sum of elements in the upper row ( upper ), the sum of elements in the lower row ( lower ), and the sum of elements in each column ( colsum ). Each element in the matrix...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 782 - Transform to Chessboard

LeetCode Problem 782 Difficulty: 🔴 Hard Topics: Array, Math, Bit Manipulation, Matrix Solution LeetCode 782 - Transform to Chessboard Problem Understanding This problem gives us an n x n binary matrix called board , where every cell contains either 0 or 1 . In one operation, we are allowed to swap any two rows or swap any two columns. The goal is to determine the minimum number of swaps required...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 766 - Toeplitz Matrix

LeetCode Problem 766 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem asks us to determine whether a given matrix satisfies the Toeplitz property. A matrix is considered Toeplitz if every diagonal running from the top-left corner toward the bottom-right corner contains identical values. More formally, for every valid position (row, col) in the matrix, the value at that position must match the value diagonally down and to...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 463 - Island Perimeter

LeetCode Problem 463 Difficulty: 🟢 Easy Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to calculate the perimeter of an island represented in a 2D grid. Each cell in the grid is either land ( 1 ) or water ( 0 ). The island consists of one or more connected land cells, where connectivity is strictly horizontal or vertical. The grid is completely surrounded...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1162 - As Far from Land as Possible

LeetCode Problem 1162 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Breadth-First Search, Matrix Solution Problem Understanding The problem requires finding the water cell in a given n x n grid that is farthest from any land cell, using Manhattan distance. The grid consists only of 0 s and 1 s, where 0 represents water and 1 represents land. The Manhattan distance between two cells (x0, y0) and (x1, y1) is...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 533 - Lonely Pixel II

LeetCode Problem 533 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix Solution Problem Understanding The problem gives us a matrix called picture , where each cell contains either 'B' for a black pixel or 'W' for a white pixel. We are also given an integer target . We need to count how many black pixels qualify as "lonely pixels" under two strict conditions. Suppose a black pixel is located at...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 832 - Flipping an Image

LeetCode Problem 832 Difficulty: 🟢 Easy Topics: Array, Two Pointers, Bit Manipulation, Matrix, Simulation Solution Problem Understanding The problem requires transforming an n x n binary matrix in two steps: first flipping it horizontally, then inverting it. Horizontally flipping a row means reversing the order of elements in that row, so the first element becomes last, the second becomes second-to-last, and so on. Inverting a row means changing all 0...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1728 - Cat and Mouse II

LeetCode Problem 1728 Difficulty: 🔴 Hard Topics: Array, Math, Dynamic Programming, Graph Theory, Topological Sort, Memoization, Matrix, Game Theory Solution Problem Understanding This problem describes a two-player perfect-information game played on a small grid. One player controls the mouse and the other controls the cat. Both players move optimally and alternate turns, with the mouse always moving first. The grid contains several kinds of cells: 'M' represents the mouse's starting...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1292 - Maximum Side Length of a Square with Sum Less than or Equal to Threshold

LeetCode Problem 1292 Difficulty: 🟡 Medium Topics: Array, Binary Search, Matrix, Prefix Sum Solution That is a very large, multi-section request covering a full detailed guide for LeetCode 1292 with comprehensive explanations, two language implementations, worked examples, test cases, and edge-case analysis. To keep quality high and avoid truncation, I should provide it in a structured long-form document. I can generate the complete reference-quality solution guide for LeetCode 1292 in...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 778 - Swim in Rising Water

LeetCode Problem 778 Difficulty: 🔴 Hard Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix Solution Problem Understanding In this problem, we are given an n x n grid where each cell contains a unique integer representing its elevation. Rain begins falling, and the water level rises over time. At any time t , you are allowed to stand on or move through any cell whose...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1260 - Shift 2D Grid

LeetCode Problem 1260 Difficulty: 🟢 Easy Topics: Array, Matrix, Simulation Solution LeetCode 1260 - Shift 2D Grid Problem Understanding This problem asks us to simulate repeated shift operations on a 2D matrix. We are given an m x n grid and an integer k , representing how many times the shift operation must be applied. A single shift operation moves every element one position forward in row-major order. This means:...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1730 - Shortest Path to Get Food

LeetCode Problem 1730 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to find the shortest path from a starting location to any food cell in a 2D grid. The grid consists of four types of cells: '*' indicating your starting position, '#' representing food, 'O' as free space you can move through, and 'X' as obstacles you cannot traverse. The output should be...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1706 - Where Will the Ball Fall

LeetCode Problem 1706 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution Problem Understanding This problem asks us to simulate the movement of balls dropped into a 2-D box represented by a grid. Each cell in the grid has a diagonal board that directs a ball either to the right ( 1 ) or to the left ( -1 ). We drop one ball into each column at the top of...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1074 - Number of Submatrices That Sum to Target

LeetCode Problem 1074 Difficulty: 🔴 Hard Topics: Array, Hash Table, Matrix, Prefix Sum Solution Problem Understanding The problem asks us to count how many non-empty rectangular submatrices inside a 2D matrix have a sum equal to a given target . A submatrix is any contiguous rectangular region within the matrix. If we choose two row boundaries and two column boundaries, every element inside that rectangle belongs to the submatrix. The...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1072 - Flip Columns For Maximum Number of Equal Rows

LeetCode Problem 1072 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix Solution LeetCode 1072 - Flip Columns For Maximum Number of Equal Rows Problem Understanding The problem gives us an m x n binary matrix, where every element is either 0 or 1 . We are allowed to choose any set of columns and flip them. Flipping a column means changing every 0 in that column to 1 , and...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 542 - 01 Matrix

LeetCode Problem 542 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Breadth-First Search, Matrix Solution Problem Understanding This problem gives us an m x n binary matrix where every cell contains either 0 or 1 . For every cell in the matrix, we must compute the distance to the nearest cell containing 0 . Distance is measured using Manhattan movement with four directions only: up, down, left, and right. Moving from...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 750 - Number Of Corner Rectangles

LeetCode Problem 750 Difficulty: 🟡 Medium Topics: Array, Math, Dynamic Programming, Matrix Solution Problem Understanding The problem asks us to count the number of corner rectangles in a binary m x n matrix grid . A corner rectangle is defined as a set of four 1 s in the grid that form the corners of an axis-aligned rectangle. Importantly, only the corners need to be 1 ; the interior cells...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1582 - Special Positions in a Binary Matrix

LeetCode Problem 1582 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Here is a complete, detailed technical solution guide for LeetCode 1582 - Special Positions in a Binary Matrix , following your formatting and content requirements precisely. Problem Understanding The problem provides an m x n binary matrix mat consisting only of 0 s and 1 s, and asks us to find the number of special positions . A position (i,...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 348 - Design Tic-Tac-Toe

LeetCode Problem 348 Difficulty: 🟡 Medium Topics: Array, Hash Table, Design, Matrix, Simulation Solution Problem Understanding The problem asks us to design a data structure that simulates an n x n Tic-Tac-Toe game between two players. We need to implement a class that supports two operations: Initializing a game board of size n Processing moves one at a time and immediately determining whether the current move causes a player to...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 749 - Contain Virus

LeetCode Problem 749 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Simulation Solution Problem Understanding This problem models the spread of a virus on a two-dimensional grid. Each cell is either infected ( 1 ) or uninfected ( 0 ). The virus spreads every night from infected cells to adjacent uninfected cells in the four cardinal directions: up, down, left, and right. We are allowed to build walls...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1572 - Matrix Diagonal Sum

LeetCode Problem 1572 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem gives us a square matrix mat of size n x n . A square matrix means the number of rows and columns are the same. We must calculate the sum of all elements that belong to either of the two diagonals. The primary diagonal contains elements where the row index and column index are equal: mat[i][i]...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1337 - The K Weakest Rows in a Matrix

LeetCode Problem 1337 Difficulty: 🟢 Easy Topics: Array, Binary Search, Sorting, Heap (Priority Queue), Matrix Solution Here is a comprehensive, detailed solution guide for LeetCode 1337 following your exact instructions. Problem Understanding The problem provides a binary m x n matrix mat , where each element is either 1 (representing a soldier) or 0 (representing a civilian). In each row, soldiers are always positioned before civilians, meaning all 1 s...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 675 - Cut Off Trees for Golf Event

LeetCode Problem 675 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Heap (Priority Queue), Matrix Solution Problem Understanding The problem gives us a two dimensional grid representing a forest. Every cell contains one of three possible values: 0 means the cell is blocked and cannot be entered. 1 means the cell is empty and can be walked through. Any value greater than 1 represents a tree, and the value itself is...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 498 - Diagonal Traverse

LeetCode Problem 498 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution Problem Understanding This problem asks us to traverse a matrix in a specific diagonal pattern and return all elements in the order they are visited. We are given an m x n matrix mat , where m represents the number of rows and n represents the number of columns. The goal is to return a one dimensional array containing...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1428 - Leftmost Column with at Least a One

LeetCode Problem 1428 Difficulty: 🟡 Medium Topics: Array, Binary Search, Matrix, Interactive Solution Problem Understanding This problem gives us access to a binary matrix where every row is sorted in non-decreasing order. That means every row looks like some number of 0 s followed by some number of 1 s. For example: [0, 0, 0, 1, 1] is valid, while: [0, 1, 0, 1] is not. The goal is to...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1020 - Number of Enclaves

LeetCode Problem 1020 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem gives us a binary matrix called grid , where: 0 represents water 1 represents land We can move only in four directions, up, down, left, and right. A land cell is considered an enclave if there is no possible path from that land cell to any boundary cell of the grid....

Practice › LeetCode › LeetCode 01xx ›

LeetCode 130 - Surrounded Regions

LeetCode Problem 130 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem gives us a two dimensional grid called board , where each cell contains either 'X' or 'O' . The goal is to modify the board in place by capturing every region of 'O' cells that is completely surrounded by 'X' . A region is formed by connecting adjacent 'O' cells horizontally...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 885 - Spiral Matrix III

LeetCode Problem 885 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution Problem Understanding The problem is asking us to generate the coordinates of cells in a 2D grid that we would visit if we started at a given cell (rStart, cStart) and walked in a clockwise spiral pattern. The grid has dimensions rows x cols , and the top-left corner is (0, 0) while the bottom-right corner is (rows -...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 934 - Shortest Bridge

LeetCode Problem 934 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us an n x n binary matrix called grid . Each cell contains either 1 or 0 . A value of 1 represents land, and a value of 0 represents water. Land cells that are connected vertically or horizontally form an island. The problem guarantees that there are exactly two separate...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 311 - Sparse Matrix Multiplication

LeetCode Problem 311 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix Solution Problem Understanding This problem asks us to multiply two matrices, but with an important detail: both matrices are sparse. A sparse matrix is a matrix where most entries are zero. The goal is to take advantage of this property so that we avoid unnecessary computation involving zero values. We are given: mat1 , an m x k matrix...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1439 - Find the Kth Smallest Sum of a Matrix With Sorted Rows

LeetCode Problem 1439 Difficulty: 🔴 Hard Topics: Array, Binary Search, Heap (Priority Queue), Matrix Solution Problem Understanding The problem requires finding the kth smallest sum obtainable by selecting exactly one element from each row of a matrix mat with sorted rows. Each row is sorted in non-decreasing order, and we must explore combinations of elements across rows to form sums. The input is a 2D matrix of dimensions m x...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 864 - Shortest Path to Get All Keys

LeetCode Problem 864 Difficulty: 🔴 Hard Topics: Array, Bit Manipulation, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to find the shortest path to collect all keys in a 2D grid maze. The grid contains walls, open spaces, keys, locks, and a starting point. You can move in the four cardinal directions but cannot move diagonally, through walls, or outside the grid. Each lock can only be passed...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1559 - Detect Cycles in 2D Grid

LeetCode Problem 1559 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem asks us to detect cycles in a 2D grid of characters where all cells in the cycle must contain the same character . A cycle is defined as a path that starts and ends at the same cell and has a length of four or more . Movement is allowed only...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1314 - Matrix Block Sum

LeetCode Problem 1314 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution Problem Understanding The problem requires computing a matrix block sum . Given a matrix mat of size m x n and an integer k , the task is to produce a new matrix answer of the same dimensions. Each element answer[i][j] is defined as the sum of all elements mat[r][c] that lie within a square block centered at...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1091 - Shortest Path in Binary Matrix

LeetCode Problem 1091 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to find the shortest path from the top-left corner (0, 0) to the bottom-right corner (n-1, n-1) of a given n x n binary matrix grid . A cell with a value of 0 is passable, while a cell with a value of 1 is blocked. The path can move in any...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 562 - Longest Line of Consecutive One in Matrix

LeetCode Problem 562 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem gives us a binary matrix mat of size m x n , where every cell contains either 0 or 1 . We need to find the length of the longest consecutive sequence of 1 s that appears in any of four directions: Horizontal, from left to right Vertical, from top to bottom Diagonal, from...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 378 - Kth Smallest Element in a Sorted Matrix

LeetCode Problem 378 Difficulty: 🟡 Medium Topics: Array, Binary Search, Sorting, Heap (Priority Queue), Matrix Solution Problem Understanding The problem gives us an n x n matrix where both rows and columns are sorted in ascending order. This means two ordering guarantees exist simultaneously: Every row is sorted from left to right. Every column is sorted from top to bottom. We are asked to return the kth smallest element across...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1778 - Shortest Path in a Hidden Grid

LeetCode Problem 1778 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Interactive Solution Problem Understanding This problem asks us to find the shortest path from a robot's unknown starting position to a hidden target inside a grid. The major challenge is that the grid itself is not directly accessible. Instead of receiving the matrix as input, we interact with the environment through a GridMaster API. The robot can...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 79 - Word Search

LeetCode Problem 79 Difficulty: 🟡 Medium Topics: Array, String, Backtracking, Depth-First Search, Matrix Solution Problem Understanding In this problem, we are given a two dimensional grid of characters called board and a target string called word . The task is to determine whether the word can be formed by traversing the grid under a strict set of movement rules. A valid word construction must satisfy the following conditions: You may...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 499 - The Maze III

LeetCode Problem 499 Difficulty: 🔴 Hard Topics: Array, String, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution LeetCode 499 - The Maze III Problem Understanding This problem extends the mechanics introduced in earlier Maze problems, but adds two important complications. First, we are no longer looking for a simple reachable or unreachable answer. Instead, we must find the shortest path by travel distance. Second, if...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 994 - Rotting Oranges

LeetCode Problem 994 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution LeetCode 994, Rotting Oranges Problem Statement You are given a 2D grid where each cell represents one of three possible states: 0 means the cell is empty. 1 means the cell contains a fresh orange. 2 means the cell contains a rotten orange. Every minute, any fresh orange that is directly adjacent to a rotten orange becomes rotten...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2017 - Grid Game

LeetCode Problem 2017 Difficulty: 🟡 Medium Topics: Array, Matrix, Prefix Sum Solution LeetCode 2017 - Grid Game Problem Understanding The problem gives us a 2 x n grid where each cell contains some number of points. Two robots move across this grid one after another. Both robots start at the top-left corner (0, 0) and must reach the bottom-right corner (1, n - 1) . The movement rules are very...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 48 - Rotate Image

LeetCode Problem 48 Difficulty: 🟡 Medium Topics: Array, Math, Matrix Solution Rotate Image Problem Understanding The problem gives us an n x n square matrix that represents an image. Each element in the matrix corresponds to a pixel or value in the image. Our task is to rotate the entire image by 90 degrees clockwise. The important requirement is that the rotation must happen in-place. This means we are not...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 566 - Reshape the Matrix

LeetCode Problem 566 Difficulty: 🟢 Easy Topics: Array, Matrix, Simulation Solution Problem Understanding The problem is asking us to take an existing m x n matrix and "reshape" it into a new matrix with r rows and c columns. Reshaping means rearranging the elements in the matrix in row-major order (left-to-right, top-to-bottom) without changing the order of the elements themselves. If the number of elements in the original matrix (...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 85 - Maximal Rectangle

LeetCode Problem 85 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Stack, Matrix, Monotonic Stack Solution Problem Understanding The problem asks us to find the area of the largest rectangle containing only 1 s in a binary matrix. The matrix consists of characters '0' and '1' , where '1' represents a valid cell that may belong to a rectangle and '0' represents a blocked cell that cannot be included. The key...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 980 - Unique Paths III

LeetCode Problem 980 Difficulty: 🔴 Hard Topics: Array, Backtracking, Bit Manipulation, Matrix Solution Problem Understanding This problem asks us to count the number of valid paths in a grid under very strict movement rules. We are given a matrix where each cell has a special meaning: 1 is the starting position 2 is the ending position 0 is an empty square we may walk on -1 is an obstacle that...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1594 - Maximum Non Negative Product in a Matrix

LeetCode Problem 1594 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem asks us to navigate a m x n integer matrix grid from the top-left corner (0, 0) to the bottom-right corner (m - 1, n - 1) , moving only right or down at each step. Along the path, we multiply all the integers we pass through, and our goal is to maximize the...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 361 - Bomb Enemy

LeetCode Problem 361 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem presents an m x n matrix called grid where each element is a character representing either a wall 'W' , an enemy 'E' , or an empty cell '0' . The task is to determine the maximum number of enemies that can be eliminated by placing a single bomb in an empty cell. The...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1210 - Minimum Moves to Reach Target with Rotations

LeetCode Problem 1210 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding This problem models a shortest path search on a grid, but the moving object is not a single cell. Instead, the object is a snake that occupies exactly two adjacent cells. The snake begins in a horizontal orientation at positions (0,0) and (0,1) , and the goal is to move it to the bottom-right corner so...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 568 - Maximum Vacation Days

LeetCode Problem 568 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem asks us to maximize the total number of vacation days over k weeks while traveling between n cities under specific flight constraints. We start in city 0 on the Monday morning of week 0 . Every Monday morning, we may either stay in the current city or take exactly one flight to another city...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1368 - Minimum Cost to Make at Least One Valid Path in a Grid

LeetCode Problem 1368 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution LeetCode 1368 - Minimum Cost to Make at Least One Valid Path in a Grid Problem Understanding This problem gives us a two dimensional grid where every cell contains a directional sign. The sign tells us which neighboring cell we should move to next. The four possible directions are: 1 means...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 803 - Bricks Falling When Hit

LeetCode Problem 803 Difficulty: 🔴 Hard Topics: Array, Union-Find, Matrix Solution Problem Understanding This problem asks us to simulate a sequence of brick removals in a 2D grid, while determining how many additional bricks become unstable and fall after each removal. The grid contains only 0 and 1 values: 1 represents a brick 0 represents an empty cell A brick is considered stable if it satisfies at least one of...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 531 - Lonely Pixel I

LeetCode Problem 531 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix Solution Problem Understanding The problem gives us a 2D grid called picture , where each cell contains either: 'B' , representing a black pixel 'W' , representing a white pixel We need to count how many lonely black pixels exist in the matrix. A black pixel is considered lonely if: It is black ( 'B' ) There are no...

Practice › LeetCode › LeetCode 01xx ›

LeetCode 174 - Dungeon Game

LeetCode Problem 174 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem asks us to determine the minimum initial health a knight needs in order to safely travel through a dungeon and rescue a princess. The dungeon is represented as a 2D grid where each cell contains an integer value: A negative value means the knight loses health because of demons. A positive value means the...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2018 - Check if Word Can Be Placed In Crossword

LeetCode Problem 2018 Difficulty: 🟡 Medium Topics: Array, Matrix, Enumeration Solution Problem Understanding This problem asks us to determine whether a given word can be legally placed into a crossword board while respecting crossword placement rules. The input consists of a 2D matrix called board , where each cell can contain one of three possible values: '#' , representing a blocked cell that cannot be used. ' ' , representing...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 64 - Minimum Path Sum

LeetCode Problem 64 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem gives us a two dimensional grid of size m x n , where each cell contains a non-negative integer. We begin at the top-left corner of the grid, specifically at position (0, 0) , and want to reach the bottom-right corner at position (m - 1, n - 1) . The objective is to...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1267 - Count Servers that Communicate

LeetCode Problem 1267 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix, Counting Solution Problem Understanding The problem gives us a two dimensional grid representing a server center. Each cell contains either: 1 , meaning there is a server in that position 0 , meaning the cell is empty A server can communicate with another server if both servers are located in the same row or the same...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1289 - Minimum Falling Path Sum II

LeetCode Problem 1289 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem asks us to compute the minimum sum of a falling path with non-zero shifts in a square n x n matrix. A falling path is formed by selecting exactly one element from each row, with the constraint that no two consecutive elements are from the same column. Essentially, as you move down the rows,...

Practice › LeetCode › LeetCode 21xx ›

LeetCode 2123 - Minimum Operations to Remove Adjacent Ones in Matrix

LeetCode Problem 2123 Difficulty: 🔴 Hard Topics: Array, Graph Theory, Matrix Solution Problem Understanding The problem presents a binary matrix where each element is either 0 or 1 . The goal is to transform this matrix into a well-isolated configuration, meaning that no 1 is 4-directionally connected to any other 1 . A 4-directional connection refers to adjacency in the up, down, left, or right directions, excluding diagonals. The input,...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 240 - Search a 2D Matrix II

LeetCode Problem 240 Difficulty: 🟡 Medium Topics: Array, Binary Search, Divide and Conquer, Matrix Solution Problem Understanding The problem asks us to determine whether a given integer target exists inside an m x n matrix. Unlike a completely unsorted matrix, this matrix has two important ordering guarantees: Each row is sorted in ascending order from left to right. Each column is sorted in ascending order from top to bottom. We...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1672 - Richest Customer Wealth

LeetCode Problem 1672 Difficulty: 🟢 Easy Topics: Array, Matrix Solution LeetCode 1672 - Richest Customer Wealth Problem Understanding This problem gives us a two dimensional integer array called accounts . Each row represents a customer, and each column represents one of that customer's bank accounts. The value accounts[i][j] represents how much money the i-th customer has in the j-th bank account. Our task is to compute the total wealth of...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 422 - Valid Word Square

LeetCode Problem 422 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem asks us to determine whether a given list of strings forms a valid word square . A word square is a special arrangement of words such that the kth row and the kth column contain the same sequence of letters for every valid index k . Essentially, if you read the words horizontally as rows and...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 289 - Game of Life

LeetCode Problem 289 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution Problem Understanding The problem asks us to simulate one iteration of Conway's Game of Life on a two-dimensional grid. Each cell in the grid is either alive, represented by 1 , or dead, represented by 0 . Every cell changes state simultaneously according to the number of live neighbors surrounding it. Each cell has up to eight neighbors, including...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1275 - Find Winner on a Tic Tac Toe Game

LeetCode Problem 1275 Difficulty: 🟢 Easy Topics: Array, Hash Table, Matrix, Simulation Solution Problem Understanding This problem asks us to simulate a game of Tic-Tac-Toe on a 3 x 3 grid given a sequence of moves. Each move specifies the row and column where the current player places their mark. Player A always plays first and uses 'X' , while player B uses 'O' . The goal is to determine...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1349 - Maximum Students Taking Exam

LeetCode Problem 1349 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask Solution LeetCode 1349 is long and detailed enough that a complete high quality guide with all required sections, full prose explanations, worked examples, corrected Python and Go implementations, exhaustive test cases, and edge case analysis will exceed a single response limit if done properly. I can provide the full reference-quality guide in consecutive parts , while...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1034 - Coloring A Border

LeetCode Problem 1034 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us a two dimensional grid where each cell contains an integer representing a color. We are also given a starting position, (row, col) , and a new color value. The cell at grid[row][col] belongs to some connected component. A connected component is formed by cells that: Have the same original color...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1293 - Shortest Path in a Grid with Obstacles Elimination

LeetCode Problem 1293 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to find the minimum number of steps required to move from the top-left corner of a grid to the bottom-right corner. The grid contains two kinds of cells: 0 , representing an empty cell that can be entered freely 1 , representing an obstacle Normally, obstacles block movement. However, we are allowed...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1254 - Number of Closed Islands

LeetCode Problem 1254 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding This problem provides a 2D grid representing a map of land and water. Cells with 0 represent land, and cells with 1 represent water. An island is any contiguous region of land connected horizontally or vertically (not diagonally). A closed island is an island that is entirely surrounded by water on all four...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 63 - Unique Paths II

LeetCode Problem 63 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding This problem asks us to count how many different valid paths exist for a robot moving through a grid while avoiding obstacles. The robot starts in the top-left corner of the grid at position (0, 0) and wants to reach the bottom-right corner at position (m - 1, n - 1) . The robot can only...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1219 - Path with Maximum Gold

LeetCode Problem 1219 Difficulty: 🟡 Medium Topics: Array, Backtracking, Matrix Solution Problem Understanding The problem gives us a two dimensional grid representing a gold mine. Each cell contains either a positive amount of gold or 0 , which means the cell is empty. We are allowed to start from any cell that contains gold and move through the grid collecting gold along the way. Movement is restricted to the four...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 733 - Flood Fill

LeetCode Problem 733 Difficulty: 🟢 Easy Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem is asking us to simulate a flood fill operation on a 2D grid that represents an image. Each cell in the grid contains an integer representing a pixel color. You are given a starting pixel (sr, sc) and a target color color . The goal is to change the color of the...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1568 - Minimum Number of Days to Disconnect Island

LeetCode Problem 1568 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Matrix, Strongly Connected Component Solution Problem Understanding The problem gives us a binary matrix where each cell is either land ( 1 ) or water ( 0 ). Land cells that touch vertically or horizontally belong to the same island. A grid is considered connected only when there is exactly one island in the entire grid. Every day,...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1284 - Minimum Number of Flips to Convert Binary Matrix to Zero Matrix

LeetCode Problem 1284 Difficulty: 🔴 Hard Topics: Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix Solution Problem Understanding The problem asks us to transform a given binary matrix mat into a zero matrix, where all elements are 0 . Each operation allows you to flip a cell and its four immediate neighbors (up, down, left, right). Flipping means changing a 1 to 0 or a 0 to 1 . The...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 329 - Longest Increasing Path in a Matrix

LeetCode Problem 329 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort, Memoization, Matrix Solution Problem Understanding The problem gives us a two-dimensional grid of integers called matrix . Each position in the grid contains a value, and we are asked to find the length of the longest strictly increasing path. A path starts from any cell and moves one step at a time...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1380 - Lucky Numbers in a Matrix

LeetCode Problem 1380 Difficulty: 🟢 Easy Topics: Array, Matrix Solution LeetCode 1380 - Lucky Numbers in a Matrix Problem Understanding This problem asks us to identify all lucky numbers in a given matrix. A lucky number is defined as a value that satisfies two conditions simultaneously : It must be the minimum value in its row It must be the maximum value in its column We are given an m...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 308 - Range Sum Query 2D - Mutable

LeetCode Problem 308 Difficulty: 🟡 Medium Topics: Array, Design, Binary Indexed Tree, Segment Tree, Matrix Solution Problem Understanding The problem asks us to design a mutable 2D range sum data structure. We are given a matrix of integers, and we must support two operations efficiently: Update the value at a specific cell. Compute the sum of all values inside a rectangular submatrix. The rectangle is defined by two corners: Upper-left...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 840 - Magic Squares In Grid

LeetCode Problem 840 Difficulty: 🟡 Medium Topics: Array, Hash Table, Math, Matrix Solution Problem Understanding The problem asks us to count the number of 3 x 3 magic squares inside a larger grid. A magic square is defined as a square where all numbers are distinct integers from 1 to 9 and the sum of each row, column, and the two diagonals is the same. The input is a 2D...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1329 - Sort the Matrix Diagonally

LeetCode Problem 1329 Difficulty: 🟡 Medium Topics: Array, Sorting, Matrix Solution Problem Understanding The problem asks us to sort every diagonal of a matrix independently in ascending order. A diagonal is defined as a sequence of cells that begins either from the first row or the first column, then continues by repeatedly moving one row down and one column to the right. For example, in a matrix: 1 2 34...

Practice › LeetCode › LeetCode 05xx ›

LeetCode 529 - Minesweeper

LeetCode Problem 529 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to simulate one move in the classic Minesweeper game. We are given a two dimensional grid representing the current game board, along with the coordinates of a user click. Our task is to update the board according to the rules of Minesweeper. Each cell on the board contains one of...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1263 - Minimum Moves to Move a Box to Their Target Location

LeetCode Problem 1263 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Heap (Priority Queue), Matrix Solution Problem Understanding The problem is a variant of the classic "Sokoban" puzzle. You are given a grid representing a warehouse, where a player 'S' must push a box 'B' to a target location 'T' . The player can move in four directions on free floor tiles '.' but cannot walk through walls '#' or the...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1632 - Rank Transform of a Matrix

LeetCode Problem 1632 Difficulty: 🔴 Hard Topics: Array, Union-Find, Graph Theory, Topological Sort, Sorting, Matrix Solution Problem Understanding The problem asks us to assign a rank to every element in a matrix while preserving ordering relationships inside rows and columns. For any two elements that share the same row or the same column: If one value is smaller, its rank must also be smaller. If two values are equal, their...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 867 - Transpose Matrix

LeetCode Problem 867 Difficulty: 🟢 Easy Topics: Array, Matrix, Simulation Solution LeetCode 867, Transpose Matrix Problem Understanding This problem asks us to compute the transpose of a given two dimensional matrix. A transpose operation flips a matrix across its main diagonal. In practical terms, every element at position (row, column) in the original matrix becomes the element at position (column, row) in the transposed matrix. If the input matrix has...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 711 - Number of Distinct Islands II

LeetCode Problem 711 Difficulty: 🔴 Hard Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Sorting, Matrix, Hash Function Solution Problem Understanding In this problem, we are given a binary matrix where each cell contains either 0 or 1 . A value of 1 represents land, while 0 represents water. An island is formed by connecting adjacent land cells in the four cardinal directions: up, down, left, and right. The...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 200 - Number of Islands

LeetCode Problem 200 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem gives us a two dimensional grid where each cell contains either '1' or '0' . A cell containing '1' represents land, while a cell containing '0' represents water. An island is defined as a group of connected land cells. Two land cells belong to the same island only if they are...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 723 - Candy Crush

LeetCode Problem 723 Difficulty: 🟡 Medium Topics: Array, Two Pointers, Matrix, Simulation Solution Problem Understanding This problem is essentially a simulation of the Candy Crush game, where we need to repeatedly crush candies in a grid until the board reaches a stable state. The input is an m x n matrix of integers representing different types of candies, and 0 represents empty cells. Each integer from 1 to 2000 represents...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 835 - Image Overlap

LeetCode Problem 835 Difficulty: 🟡 Medium Topics: Array, Matrix Solution Problem Understanding This problem asks us to determine the maximum overlap between two binary square matrices ( img1 and img2 ) when one matrix is translated over the other. Each matrix contains only 0 s and 1 s, where 1 represents a filled pixel and 0 represents an empty pixel. A translation means shifting all 1 s in one image...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1595 - Minimum Cost to Connect Two Groups of Points

LeetCode Problem 1595 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Bit Manipulation, Matrix, Bitmask Solution Problem Understanding The problem is asking us to find the minimum cost to connect two groups of points, where the first group has size1 points and the second group has size2 points. We are given a cost matrix cost of size size1 x size2 where cost[i][j] represents the cost of connecting the i -th point...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 296 - Best Meeting Point

LeetCode Problem 296 Difficulty: 🔴 Hard Topics: Array, Math, Sorting, Matrix Solution Problem Understanding The problem gives us a two-dimensional binary grid where each cell contains either 0 or 1 . A value of 1 represents the home location of a friend, while 0 represents an empty cell. We must choose a single meeting point somewhere in the grid such that the sum of all Manhattan distances from every friend's...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 999 - Available Captures for Rook

LeetCode Problem 999 Difficulty: 🟢 Easy Topics: Array, Matrix, Simulation Solution Problem Understanding The problem gives us an 8 x 8 chessboard represented as a matrix of characters. Each cell contains one of four possible values: 'R' represents the white rook 'p' represents a black pawn 'B' represents a white bishop '.' represents an empty square There is exactly one rook on the board. The task is to determine how...

Practice › LeetCode › LeetCode 12xx ›

LeetCode 1222 - Queens That Can Attack the King

LeetCode Problem 1222 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution Problem Understanding In this problem, we are given the positions of several black queens and exactly one white king on a standard 8 x 8 chessboard. The board uses 0-indexed coordinates, meaning every position is represented as [row, column] , where both values range from 0 to 7 . A queen in chess can attack along eight possible directions:...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 212 - Word Search II

LeetCode Problem 212 Difficulty: 🔴 Hard Topics: Array, String, Backtracking, Trie, Matrix Solution Problem Understanding LeetCode 212, LeetCode Word Search II, asks us to find every word from a given dictionary that can be formed inside a 2D character grid. Each word must be built by moving one cell at a time horizontally or vertically. Diagonal movement is not allowed, and a board cell cannot be reused within the same...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 931 - Minimum Falling Path Sum

LeetCode Problem 931 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding The problem asks for the minimum sum of any falling path through an n x n integer matrix. A falling path is defined as a sequence of elements starting from any element in the first row and moving row by row to the last row. At each step, the path may move straight down, diagonally left,...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 490 - The Maze

LeetCode Problem 490 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding This problem asks us to determine whether a rolling ball can stop exactly at a destination cell inside a maze. The maze is represented as a two-dimensional grid where: 0 represents an empty space the ball can roll through 1 represents a wall The important detail is that the ball does not move one...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 959 - Regions Cut By Slashes

LeetCode Problem 959 Difficulty: 🟡 Medium Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Let's dive into a full, detailed technical solution guide for LeetCode 959 - Regions Cut By Slashes following your formatting rules. Problem Understanding The problem gives us an n x n grid where each cell contains either a forward slash '/' , a backslash '\\' , or a blank space ' ' ....

Practice › LeetCode › LeetCode 08xx ›

LeetCode 827 - Making A Large Island

LeetCode Problem 827 Difficulty: 🔴 Hard Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding This problem asks us to find the largest possible island size in a binary grid after changing at most one 0 into 1 . The grid is an n x n matrix where: 1 represents land 0 represents water An island is formed by land cells connected in the four cardinal directions: up...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 883 - Projection Area of 3D Shapes

LeetCode Problem 883 Difficulty: 🟢 Easy Topics: Array, Math, Geometry, Matrix Solution Problem Understanding The problem gives us an n x n matrix called grid . Each cell grid[i][j] represents how many 1 x 1 x 1 cubes are stacked vertically at position (i, j) on a flat surface. We must calculate the total area of the projections of this 3D structure onto three planes: The xy plane, which is...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 302 - Smallest Rectangle Enclosing Black Pixels

LeetCode Problem 302 Difficulty: 🔴 Hard Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding This problem gives us a binary matrix where each cell contains either '0' or '1' . A '1' represents a black pixel, while a '0' represents a white pixel. All black pixels belong to exactly one connected component, meaning every black pixel can be reached from every other black pixel using only...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1463 - Cherry Pickup II

LeetCode Problem 1463 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Here is a complete, detailed technical solution guide for LeetCode 1463 - Cherry Pickup II following your formatting requirements. Problem Understanding The problem gives us a rows x cols grid representing a field of cherries. Each cell contains a non-negative integer indicating the number of cherries at that location. Two robots start at the top-left (0, 0) and...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 427 - Construct Quad Tree

LeetCode Problem 427 Difficulty: 🟡 Medium Topics: Array, Divide and Conquer, Tree, Matrix Solution Problem Understanding The problem asks us to convert a binary matrix into a Quad-Tree representation. A Quad-Tree is a recursive tree structure where every internal node has exactly four children, each representing one quadrant of the current square region. The input is an n x n matrix called grid , where every value is either 0...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 741 - Cherry Pickup

LeetCode Problem 741 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Cherry Pickup - LeetCode 741 Problem Understanding This problem asks us to collect the maximum possible number of cherries while making two trips across a square grid. The first trip starts at the top left corner (0, 0) and moves to the bottom right corner (n - 1, n - 1) using only right or down moves. After...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 892 - Surface Area of 3D Shapes

LeetCode Problem 892 Difficulty: 🟢 Easy Topics: Array, Math, Geometry, Matrix Solution Problem Understanding The problem gives us an n x n matrix called grid , where each cell contains a non-negative integer. The value grid[i][j] represents how many 1 x 1 x 1 cubes are stacked vertically at position (i, j) . Each cube contributes surface area through its exposed faces. A single cube has 6 faces, but when...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1536 - Minimum Swaps to Arrange a Binary Grid

LeetCode Problem 1536 Difficulty: 🟡 Medium Topics: Array, Greedy, Matrix Solution Problem Understanding The problem gives us an n x n binary matrix called grid . Each cell contains either 0 or 1 . We are allowed to perform operations where we swap two adjacent rows. The goal is to transform the matrix into a valid configuration using the minimum number of adjacent row swaps. A grid is considered valid...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 694 - Number of Distinct Islands

LeetCode Problem 694 Difficulty: 🟡 Medium Topics: Array, Hash Table, Depth-First Search, Breadth-First Search, Union-Find, Sorting, Matrix, Hash Function Solution Problem Understanding The problem gives us a binary matrix called grid , where each cell contains either 0 or 1 . A value of 1 represents land, and a value of 0 represents water. An island is formed by connecting adjacent land cells in the four cardinal directions: up, down,...

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1351 - Count Negative Numbers in a Sorted Matrix

LeetCode Problem 1351 Difficulty: 🟢 Easy Topics: Array, Binary Search, Matrix Solution Problem Understanding The problem asks us to count all the negative numbers in a 2D matrix grid where each row and column is sorted in non-increasing order . In other words, values decrease or stay the same as you move to the right in a row and downward in a column. The input is a matrix of integers,...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 36 - Valid Sudoku

LeetCode Problem 36 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix Solution Problem Understanding This problem asks us to validate whether a partially filled Sudoku board follows the core Sudoku rules. The board is always a fixed 9 x 9 grid, and each cell contains either a digit from '1' to '9' or the character '.' , which represents an empty cell. A valid Sudoku configuration must satisfy three independent...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 773 - Sliding Puzzle

LeetCode Problem 773 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Backtracking, Breadth-First Search, Memoization, Matrix Solution Problem Understanding The Sliding Puzzle problem presents a 2 x 3 board containing five numbered tiles from 1 to 5 and a blank space represented as 0 . The goal is to transform the board into a solved configuration [[1,2,3],[4,5,0]] using the fewest number of moves, where a move consists of swapping 0 with...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 419 - Battleships in a Board

LeetCode Problem 419 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Matrix Solution LeetCode 419 - Battleships in a Board Problem Understanding This problem gives us a two dimensional grid where each cell contains either 'X' or '.' . An 'X' represents part of a battleship, while '.' represents empty water. The important rule is that battleships are always placed in straight lines. A battleship can be: Horizontal, shaped like 1...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 37 - Sudoku Solver

LeetCode Problem 37 Difficulty: 🔴 Hard Topics: Array, Hash Table, Backtracking, Matrix Solution Problem Understanding The problem asks us to build a complete Sudoku solver. We are given a partially filled 9 x 9 grid where each cell contains either a digit from '1' to '9' or the character '.' , which represents an empty space. Our goal is to fill every empty cell so that the final board satisfies...

Practice › LeetCode › LeetCode 02xx ›

LeetCode 286 - Walls and Gates

LeetCode Problem 286 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us a 2D grid called rooms , where each cell represents one of three possible states. A value of -1 represents a wall or obstacle that cannot be passed through. A value of 0 represents a gate. A value of 2147483647 , which is referred to as INF , represents an empty room...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 417 - Pacific Atlantic Water Flow

LeetCode Problem 417 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Matrix Solution Problem Understanding The problem gives us a rectangular grid called heights , where each cell represents the elevation of a piece of land. Water can flow from one cell to another if the neighboring cell has a height less than or equal to the current cell. Movement is allowed only in the four cardinal directions: up,...

Practice › LeetCode › LeetCode 18xx ›

LeetCode 1820 - Maximum Number of Accepted Invitations

LeetCode Problem 1820 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Graph Theory, Matrix Solution Problem Understanding This problem asks us to maximize the number of successful invitations between boys and girls under a one-to-one matching constraint. We are given an m x n binary matrix called grid . grid[i][j] == 1 means boy i is willing or able to invite girl j grid[i][j] == 0 means boy i cannot invite...

Practice › LeetCode › LeetCode 07xx ›

LeetCode 794 - Valid Tic-Tac-Toe State

LeetCode Problem 794 Difficulty: 🟡 Medium Topics: Array, Matrix Solution Problem Understanding This problem asks us to determine whether a given Tic-Tac-Toe board configuration could occur during a real game that follows all official rules. The input is a 3 x 3 board represented as an array of three strings. Each character in the strings can be: 'X' , representing a move made by player X 'O' , representing a...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1476 - Subrectangle Queries

LeetCode Problem 1476 Difficulty: 🟡 Medium Topics: Array, Design, Matrix Solution Problem Understanding The problem asks us to design a class called SubrectangleQueries that operates on a two dimensional integer matrix, referred to as a rectangle. This class must support two operations efficiently: The first operation, updateSubrectangle(row1, col1, row2, col2, newValue) , modifies a rectangular region inside the matrix. Every element whose coordinates fall within the specified top left corner...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1504 - Count Submatrices With All Ones

LeetCode Problem 1504 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Stack, Matrix, Monotonic Stack Solution Problem Understanding The problem gives us an m x n binary matrix where each cell contains either 0 or 1 . We must count how many rectangular submatrices consist entirely of ones. A submatrix is any contiguous rectangular region inside the matrix. For every possible rectangle, we need to determine whether every element inside it...

Practice › LeetCode › LeetCode 09xx ›

LeetCode 909 - Snakes and Ladders

LeetCode Problem 909 Difficulty: 🟡 Medium Topics: Array, Breadth-First Search, Matrix Solution Problem Understanding The problem is asking us to simulate a modified game of Snakes and Ladders on an n x n board. The board is labeled from 1 to n² in a boustrophedon pattern, which means the numbering starts from the bottom-left, alternates direction every row, and ends at the top-right. You start at square 1 , and...

Practice › LeetCode › LeetCode 14xx ›

LeetCode 1444 - Number of Ways of Cutting a Pizza

LeetCode Problem 1444 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Memoization, Matrix, Prefix Sum Solution Edit LeetCode 1444 - Number of Ways of Cutting a Pizza Problem Understanding This problem asks us to count the number of valid ways to divide a rectangular pizza into exactly k pieces such that every piece contains at least one apple. The pizza is represented as a grid of characters where 'A' indicates an...

Practice › LeetCode › LeetCode 04xx ›

LeetCode 407 - Trapping Rain Water II

LeetCode Problem 407 Difficulty: 🔴 Hard Topics: Array, Breadth-First Search, Heap (Priority Queue), Matrix Solution LeetCode 407 - Trapping Rain Water II Problem Understanding This problem is the two dimensional version of the classic "Trapping Rain Water" problem. Instead of a one dimensional array of heights, we are given an m x n grid where each cell represents the elevation of a block in a terrain. The goal is to...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 695 - Max Area of Island

LeetCode Problem 695 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem is asking us to find the largest connected area of land in a 2D binary matrix. Each cell in the matrix represents either water ( 0 ) or land ( 1 ). A group of 1 s forms an island if the 1 s are connected 4-directionally (up, down, left, or...

Practice › LeetCode › LeetCode 15xx ›

LeetCode 1591 - Strange Printer II

LeetCode Problem 1591 Difficulty: 🔴 Hard Topics: Array, Graph Theory, Topological Sort, Matrix Solution Problem Understanding In this problem, we are given a final colored matrix called targetGrid . We need to determine whether a strange printer could have produced this grid under two unusual restrictions. The printer works as follows: First, during one operation it can print a solid rectangular region using only one color. Every cell inside that...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 861 - Score After Flipping Matrix

LeetCode Problem 861 Difficulty: 🟡 Medium Topics: Array, Greedy, Bit Manipulation, Matrix Solution Problem Understanding The problem provides an m x n binary matrix, grid , where each element is either 0 or 1 . You are allowed to perform a move , which consists of selecting any row or column and flipping all its values - turning every 0 into a 1 and every 1 into a 0 ....

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1301 - Number of Paths with Max Score

LeetCode Problem 1301 Difficulty: 🔴 Hard Topics: Array, Dynamic Programming, Matrix Solution Problem Understanding In this problem, we are given an n x n board where each cell contains one of four possible values: 'E' , the ending position located at the top-left corner 'S' , the starting position located at the bottom-right corner A digit character '1' through '9' , representing points that can be collected 'X' , representing...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1727 - Largest Submatrix With Rearrangements

LeetCode Problem 1727 Difficulty: 🟡 Medium Topics: Array, Greedy, Sorting, Matrix Solution Problem Understanding The problem gives us a binary matrix, meaning every cell contains either 0 or 1 . We are allowed to rearrange the columns of the matrix in any order we want. The rearrangement is global for the row configuration being considered, meaning we are effectively free to permute the columns to maximize the size of a...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 59 - Spiral Matrix II

LeetCode Problem 59 Difficulty: 🟡 Medium Topics: Array, Matrix, Simulation Solution LeetCode 59 - Spiral Matrix II Problem Understanding The problem asks us to generate an n x n matrix and fill it with numbers from 1 to n^2 in spiral order. A spiral order traversal means we begin at the top-left corner and move in a clockwise pattern: Move left to right across the top row Move top to...

Practice › LeetCode › LeetCode 17xx ›

LeetCode 1738 - Find Kth Largest XOR Coordinate Value

LeetCode Problem 1738 Difficulty: 🟡 Medium Topics: Array, Divide and Conquer, Bit Manipulation, Sorting, Heap (Priority Queue), Matrix, Prefix Sum, Quickselect Solution Problem Understanding The problem asks us to compute the XOR coordinate value for each element in a given 2D matrix and then find the kth largest among them. Specifically, for a coordinate (a, b) , the value is defined as the XOR of all elements in the submatrix...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1631 - Path With Minimum Effort

LeetCode Problem 1631 Difficulty: 🟡 Medium Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix Solution Problem Understanding The problem gives us a grid called heights , where each cell contains an integer representing elevation. We start at the top-left corner (0, 0) and want to reach the bottom-right corner (rows - 1, columns - 1) . At each step, we may move in one of...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 73 - Set Matrix Zeroes

LeetCode Problem 73 Difficulty: 🟡 Medium Topics: Array, Hash Table, Matrix Solution LeetCode 73, Set Matrix Zeroes Problem Understanding The problem gives us a two dimensional matrix of integers with m rows and n columns. We must modify the matrix in place so that whenever a cell contains 0 , every element in that cell's entire row and entire column also becomes 0 . The important detail is that the...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1198 - Find Smallest Common Element in All Rows

LeetCode Problem 1198 Difficulty: 🟡 Medium Topics: Array, Hash Table, Binary Search, Matrix, Counting Solution Problem Understanding The problem asks us to find the smallest element that appears in every row of a given m x n matrix mat , where each row is sorted in strictly increasing order. In other words, we need an element that is common to all rows and is the minimum among all such elements....

Practice › LeetCode › LeetCode 13xx ›

LeetCode 1391 - Check if There is a Valid Path in a Grid

LeetCode Problem 1391 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix Solution Problem Understanding The problem presents a grid where each cell represents a street segment with a specific orientation, denoted by a number from 1 to 6. Each number encodes which directions the street in that cell connects to neighboring cells. For example, 1 connects left and right, while 2 connects up and down, and the...

Practice › LeetCode › LeetCode 16xx ›

LeetCode 1605 - Find Valid Matrix Given Row and Column Sums

LeetCode Problem 1605 Difficulty: 🟡 Medium Topics: Array, Greedy, Matrix Solution Problem Understanding The problem gives us two arrays: rowSum , where rowSum[i] represents the total sum required for row i colSum , where colSum[j] represents the total sum required for column j Our task is to construct any matrix of non-negative integers such that: Every row adds up to its corresponding value in rowSum Every column adds up to...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 631 - Design Excel Sum Formula

LeetCode Problem 631 Difficulty: 🔴 Hard Topics: Array, Hash Table, String, Graph Theory, Design, Topological Sort, Matrix Solution Problem Understanding The problem asks us to design a miniature spreadsheet system similar to Microsoft Excel. The spreadsheet contains cells arranged in rows and columns, where rows are numbered starting from 1 and columns are labeled using uppercase letters such as A , B , C , and so on. Each cell...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 304 - Range Sum Query 2D - Immutable

LeetCode Problem 304 Difficulty: 🟡 Medium Topics: Array, Design, Matrix, Prefix Sum Solution Problem Understanding The problem asks us to design a data structure that can efficiently answer multiple rectangular sum queries on a fixed 2D matrix. We are given a matrix of integers, and each query specifies four coordinates: (row1, col1) represents the top-left corner of a rectangle (row2, col2) represents the bottom-right corner of the rectangle For every...

Practice › LeetCode › LeetCode 10xx ›

LeetCode 1030 - Matrix Cells in Distance Order

LeetCode Problem 1030 Difficulty: 🟢 Easy Topics: Array, Math, Geometry, Sorting, Matrix Solution Problem Understanding This problem asks us to return every cell in a matrix, ordered by its Manhattan distance from a given center cell. We are given four integers: rows , the number of rows in the matrix cols , the number of columns in the matrix rCenter , the row index of the reference cell cCenter ,...

Practice › LeetCode › LeetCode 20xx ›

LeetCode 2033 - Minimum Operations to Make a Uni-Value Grid

LeetCode Problem 2033 Difficulty: 🟡 Medium Topics: Array, Math, Sorting, Matrix Solution Problem Understanding The problem gives us a 2D integer matrix called grid and an integer x . In one operation, we may either add x to a cell or subtract x from a cell. Our goal is to make every value in the grid equal using the minimum number of operations. A key detail is that every operation...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1102 - Path With Maximum Minimum Value

LeetCode Problem 1102 Difficulty: 🟡 Medium Topics: Array, Binary Search, Depth-First Search, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix Solution Problem Understanding The problem asks us to find the maximum possible score of a path from the top-left corner (0, 0) to the bottom-right corner (m-1, n-1) of a 2D grid. Each cell in the grid contains an integer value, and the score of a path is defined as the...

Practice › LeetCode › LeetCode 00xx ›

LeetCode 74 - Search a 2D Matrix

LeetCode Problem 74 Difficulty: 🟡 Medium Topics: Array, Binary Search, Matrix Solution LeetCode 74 - Search a 2D Matrix Problem Understanding This problem gives us a two dimensional matrix with two very important ordering properties: Each row is sorted from left to right in non-decreasing order. The first element of every row is greater than the last element of the previous row. These two guarantees together mean the entire matrix...

Practice › LeetCode › LeetCode 08xx ›

LeetCode 807 - Max Increase to Keep City Skyline

LeetCode Problem 807 Difficulty: 🟡 Medium Topics: Array, Greedy, Matrix Solution Problem Understanding This problem gives us an n x n grid where each cell represents the height of a building in a city. The city can be viewed from four directions: north, south, east, and west. From these viewpoints, the skyline is determined by the tallest building visible in each row or column. When viewing the city from the...

Practice › LeetCode › LeetCode 11xx ›

LeetCode 1139 - Largest 1-Bordered Square

LeetCode Problem 1139 Difficulty: 🟡 Medium Topics: Array, Dynamic Programming, Matrix Solution That is a long, detailed reference document with multiple required sections, complete implementations, worked traces, and test coverage. I can provide the full guide in a single response. Before I start, one quick clarification: do you want the optimal solution based on dynamic programming with directional prefix counts (right/down or left/up consecutive ones) , which is the standard...

Practice › LeetCode › LeetCode 03xx ›

LeetCode 363 - Max Sum of Rectangle No Larger Than K

LeetCode Problem 363 Difficulty: 🔴 Hard Topics: Array, Binary Search, Matrix, Prefix Sum, Ordered Set Solution Problem Understanding The problem asks us to find the rectangular submatrix whose sum is as large as possible while still being less than or equal to a given integer k . A rectangle in a matrix is any contiguous block of cells formed by choosing a range of rows and a range of columns....

Practice › LeetCode › LeetCode 05xx ›

LeetCode 505 - The Maze II

LeetCode Problem 505 Difficulty: 🟡 Medium Topics: Array, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path Solution Problem Understanding This problem presents a maze represented as a 2D grid of size m x n where each cell is either an empty space ( 0 ) or a wall ( 1 ). A ball starts at a given position and can roll up, down, left, or right...

Practice › LeetCode › LeetCode 06xx ›

LeetCode 661 - Image Smoother

LeetCode Problem 661 Difficulty: 🟢 Easy Topics: Array, Matrix Solution Problem Understanding The problem is asking us to implement an image smoother , a filter that modifies each cell in a 2D grayscale image based on the average of itself and its surrounding cells in a 3 x 3 window. The key requirement is that we only consider the neighboring cells that exist; for edge or corner cells, the number...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1034: Coloring A Border

Problem Restatement We are given an m x n integer matrix grid and three integers row , col , and color . We need to color the border of the connected component that contains cell (row, col) with the given color . A border cell of a connected component is any cell that is either on the edge of the grid or has at least one neighbor that is not...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1091: Shortest Path in Binary Matrix

Problem Restatement We are given an n x n binary matrix grid . A clear path goes from (0, 0) to (n-1, n-1) using only cells with value 0 , moving in 8 directions. Return the length of the shortest clear path, or -1 if no such path exists. The path length counts the number of cells visited. The official constraints state that n == grid.length == grid[i].length , 1...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1020: Number of Enclaves

Problem Restatement We are given a binary matrix grid where 0 represents sea and 1 represents land. A move consists of walking from one land cell to an adjacent (4-directional) land cell. We need to return the number of land cells from which it is impossible to walk off the boundary of the grid. Land cells connected to the boundary are not counted. The official constraints state that m ==...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1074: Number of Submatrices That Sum to Target

Problem Restatement We are given an m x n matrix and an integer target . Return the number of non-empty submatrices that sum to target . The official constraints state that 1 <= m, n <= 100 and -1000 <= matrix[i][j] <= 1000 . Input and Output Item Meaning Input Matrix and integer target Output Number of submatrices summing to target Function shape: def numSubmatrixSumTarget(matrix: list[list[int]], target: int) -> int:...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1030: Matrix Cells in Distance Order

Problem Restatement We are given an rows x cols matrix and a center cell (rCenter, cCenter) . We need to return all cells of the matrix sorted by their distance from the center, where distance is defined as: abs(r - rCenter) + abs(c - cCenter) (Manhattan distance). Ties can be broken in any order. The official constraints state that 1 <= rows, cols <= 100 and 0 <= rCenter <...

Practice › LeetCode › LeetCode (archived) › LeetCode 10xx ›

LeetCode 1072: Flip Columns For Maximum Number of Equal Rows

Problem Restatement We are given an m x n binary matrix. In one operation, we choose any column and flip all values in it (0 → 1, 1 → 0). We want to maximize the number of rows that have all the same value (all-0 or all-1) after any number of column flips. The official constraints state that 1 <= m, n <= 300 . Input and Output Item Meaning...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 999: Available Captures for Rook

Problem Restatement We are given an 8 x 8 chessboard. Each cell contains one of four characters: Character Meaning "R" White rook "B" White bishop "p" Black pawn "." Empty square There is exactly one rook. The rook can move horizontally or vertically. It can capture a pawn if the pawn is the first piece in that direction. The rook cannot move through another piece. A bishop blocks the rook,...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 840: Magic Squares In Grid

Problem Restatement We are given a row x col grid of integers. We need to count how many contiguous 3 x 3 subgrids are magic squares. A 3 x 3 magic square must satisfy all of these rules: Rule Meaning Size The subgrid is exactly 3 x 3 Values It contains distinct numbers from 1 to 9 Rows Every row has the same sum Columns Every column has the same...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 944: Delete Columns to Make Sorted

Problem Restatement We are given an array of equal-length strings: strs Think of the strings as rows of a character matrix. We may delete some columns. A column is valid if its characters are in non-decreasing order from top to bottom. For a column c , we need: strs[0][c] <= strs[1][c] <= strs[2][c] <= ... Return the minimum number of columns that must be deleted so that every remaining column...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 994: Rotting Oranges

Problem Restatement We are given an m x n grid. Each cell can have one of three values: Value Meaning 0 Empty cell 1 Fresh orange 2 Rotten orange Every minute, any fresh orange that is 4-directionally adjacent to a rotten orange becomes rotten. The four directions are: up, down, left, right Diagonal cells do not count. We need to return the minimum number of minutes needed until no fresh...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 773: Sliding Puzzle

Problem Restatement We are given a 2 x 3 sliding puzzle board. The board contains the numbers 1 through 5 and one empty slot represented by 0 . A move consists of swapping 0 with one of its 4-directionally adjacent numbers. The goal state is: [[1, 2, 3], [4, 5, 0]] Return the least number of moves needed to reach the goal state. If it is impossible, return -1 ....

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 723: Candy Crush

Problem Restatement We are given an m x n board of candies. Each cell contains either: Value Meaning Positive integer A candy type 0 Empty cell The board represents the game state after a move. We need to repeatedly apply these rules until the board becomes stable: If three or more candies of the same type are adjacent horizontally or vertically, crush all of them at the same time. Crushed...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 750: Number Of Corner Rectangles

Problem Restatement We are given an m x n binary matrix grid . Each cell is either 0 or 1 . We need to count how many axis-aligned rectangles can be formed where all four corner cells are 1 . Only the corners need to be 1 . The cells inside the rectangle and along its edges may be either 0 or 1 . All four corner cells must be...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 749: Contain Virus

Problem Restatement We are given a 2D grid representing infected and uninfected cells. Each cell is one of: Value Meaning 0 Uninfected 1 Infected -1 Quarantined infected region Every night: Each infected region spreads to neighboring uninfected cells. We may choose exactly one infected region to quarantine. Quarantining a region requires building walls along its border. A quarantined region no longer spreads. We always quarantine the region that would infect...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 892: Surface Area of 3D Shapes

Problem Restatement We are given an n x n grid. Each value: grid[i][j] represents a tower of grid[i][j] unit cubes placed on cell (i, j) . After placing the cubes, directly adjacent cubes are glued together. We need to return the total exposed surface area of the resulting 3D shape. The bottom face counts as part of the surface area. LeetCode defines each cube as 1 x 1 x 1...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 867: Transpose Matrix

Problem Restatement We are given a 2D integer array matrix . We need to return its transpose. The transpose of a matrix is created by switching rows and columns. If an element is at: matrix[row][col] then in the transposed matrix it goes to: answer[col][row] So the value at row r , column c becomes the value at row c , column r . Input and Output Item Meaning Input A...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 794: Valid Tic-Tac-Toe State

Problem Restatement We are given a Tic-Tac-Toe board as a list of three strings. Each cell contains one of: Character Meaning "X" First player's mark "O" Second player's mark " " Empty square We need to return True if this board position could happen during a valid Tic-Tac-Toe game. The rules are: X always moves first. Players alternate turns. A move can only be placed in an empty square. The...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 48: Rotate Image

Problem Restatement We are given an n x n matrix representing an image. We need to rotate the matrix by 90 degrees clockwise. The rotation must be done in-place. That means we must modify the input matrix directly and must not allocate another matrix for the rotated result. The official problem states this in-place requirement directly. Example: matrix = [ [1, 2, 3], [4, 5, 6], [7, 8, 9], ]...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 766: Toeplitz Matrix

Problem Restatement We are given an m x n matrix. Return True if the matrix is Toeplitz. Otherwise, return False . A matrix is Toeplitz if every diagonal from top-left to bottom-right contains the same value. In other words, each cell should match the cell directly above-left from it. Input and Output Item Meaning Input An integer matrix matrix Output True if the matrix is Toeplitz, otherwise False Diagonal direction...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 741: Cherry Pickup

Problem Restatement We are given an n x n grid. Each cell contains one of three values: Value Meaning 1 A cell with one cherry 0 An empty cell -1 A thorn cell that cannot be passed We start at the top-left cell: (0, 0) We need to travel to the bottom-right cell: (n - 1, n - 1) using only: right down Then we return from the bottom-right cell...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 864: Shortest Path to Get All Keys

Problem Restatement We are given a 2D grid. Each cell contains one character: Character Meaning "." Empty cell "#" Wall "@" Starting position "a" to "f" Key "A" to "F" Lock We start at "@" . One move means walking one cell up, down, left, or right. We cannot walk outside the grid. We cannot walk through walls. When we step on a key, we pick it up. We cannot...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 764: Largest Plus Sign

Problem Restatement We are given an integer n . There is an n x n grid where every cell is initially 1 . Some cells are mines. Each mine is given as: [x, y] That means: grid[x][y] = 0 We need to find the largest axis-aligned plus sign made only of 1 s. A plus sign of order k has: one center cell an upward arm of length k -...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 959: Regions Cut By Slashes

Problem Restatement We are given an n x n grid. Each cell contains one of three characters: "/" "\\" " " A slash divides a square cell into smaller regions. A blank cell has no internal wall. We need to return how many connected regions exist in the whole grid. The official constraints are: Constraint Value n == grid.length == grid[i].length The grid is square 1 <= n <= 30...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 835: Image Overlap

Problem Restatement We are given two binary square matrices img1 and img2 , both of size n x n . Each cell is either: Value Meaning 0 Empty pixel 1 Filled pixel We may translate one image by sliding it left, right, up, or down by any number of units. Translation does not include rotation. After translation, some 1 cells may move outside the matrix border and disappear. The overlap...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 695: Max Area of Island

Problem Restatement We are given an m x n binary matrix grid . Value Meaning 1 Land 0 Water An island is a group of land cells connected horizontally or vertically. The area of an island is the number of cells in that connected component. We need to return the maximum island area in the grid. If there is no island, return 0 . The official statement defines islands using...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 861: Score After Flipping Matrix

Problem Restatement We are given a binary matrix grid . We may perform any number of operations. Each operation can: Flip one row Flip one column Flipping means changing: 0 -> 1 1 -> 0 After all operations, every row is interpreted as a binary number. The total score is the sum of those binary numbers. We need to return the largest possible score. Input and Output Item Meaning Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 675: Cut Off Trees for Golf Event

Problem Restatement We are given a forest represented as a 2D grid. Each cell has one of these meanings: Value Meaning 0 Obstacle, cannot be walked through 1 Empty ground, can be walked through > 1 Tree, can be walked through, value is the tree height We start at position (0, 0) . We must cut all trees in increasing order of height, from shortest to tallest. After a tree...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 694: Number of Distinct Islands

Problem Restatement We are given an m x n binary matrix grid . A cell with value 1 is land. A cell with value 0 is water. An island is a group of land cells connected horizontally or vertically. We need to count how many distinct island shapes exist in the grid. Two islands are considered the same if one can be translated to match the other. Translation means moving...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 935: Knight Dialer

Problem Restatement We place a chess knight on a phone keypad. The keypad is arranged like this: 1 2 3 4 5 6 7 8 9 0 The knight moves in the same L-shape as in chess. We may start on any digit from 0 to 9 . Each time the knight lands on a digit, that digit is pressed. Given an integer n , return how many distinct phone...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 885: Spiral Matrix III

Problem Restatement We are given a grid with rows rows and cols columns. We start at cell: (rStart, cStart) Initially, we face east. We walk in a clockwise spiral until every grid cell has been visited. The walk may go outside the grid boundary, but we only record coordinates that are inside the grid. Return the grid coordinates in the order we visit them. LeetCode defines the northwest corner as...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 934: Shortest Bridge

Problem Restatement We are given an n x n binary matrix grid . Each cell is either: 0 or: 1 A 1 represents land. A 0 represents water. An island is a group of 1 s connected in four directions: up down left right The grid contains exactly two islands. We may flip water cells from 0 to 1 . Return the smallest number of water cells we must flip...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 909: Snakes and Ladders

Problem Restatement We are given an n x n board for a Snakes and Ladders game. The squares are numbered from 1 to n^2 in a boustrophedon order. That means the numbering starts from the bottom-left square, goes left to right on one row, then right to left on the next row, alternating direction each row. From a square curr , one dice roll can move to any square from:...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 883: Projection Area of 3D Shapes

Problem Restatement We are given an n x n grid. Each cell: grid[r][c] contains a vertical stack of cubes. We want the total projection area of the 3D shape onto three planes: Projection Meaning Top view Looking down from above Front view Looking from the front Side view Looking from the side Return the sum of these three projection areas. The official problem defines each cube as a 1 x...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 832: Flipping an Image

Problem Restatement We are given an n x n binary matrix image . Each cell is either: Value Meaning 0 White pixel 1 Black pixel We need to do two operations: Flip the image horizontally. Invert the image. Flipping horizontally means reversing each row. For example: [1, 1, 0] -> [0, 1, 1] Inverting means changing every 0 to 1 and every 1 to 0 . For example: [0, 1,...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 733: Flood Fill

Problem Restatement We are given an image represented as a 2D grid of integers. Each integer is a pixel color. We are also given: sr sc color sr and sc describe the starting pixel: image[sr][sc] We need to perform a flood fill from that starting pixel. Flood fill changes the starting pixel and every pixel connected to it with the same original color. Connection is only 4-directional: up down left...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 782: Transform to Chessboard

Problem Restatement We are given an n x n binary board. Each cell is either 0 or 1 . In one move, we may do one of these operations: Move Meaning Swap two rows Exchange any two complete rows Swap two columns Exchange any two complete columns We need to return the minimum number of moves required to transform the board into a chessboard. A chessboard means no two 4-directionally...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 807: Max Increase to Keep City Skyline

Problem Restatement We are given an n x n grid. Each value grid[r][c] is the height of a building at row r and column c . We may increase the height of any number of buildings by any amount. We cannot decrease heights. After increasing buildings, the skyline from all four directions must stay the same as the original grid. The task is to return the maximum total increase possible....

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 931: Minimum Falling Path Sum

Problem Restatement We are given an n x n integer matrix. A falling path starts at any cell in the first row. From a cell (row, col) , the next cell must be in the next row and one of these columns: col - 1 col col + 1 So from (row, col) , we may move to: (row + 1, col - 1) (row + 1, col) (row +...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 980: Unique Paths III

Problem Restatement We are given an m x n grid. Each cell has one of four values: Value Meaning 1 Starting square 2 Ending square 0 Empty square we can walk over -1 Obstacle we cannot walk over There is exactly one starting square and exactly one ending square. We need to count how many 4-directional walks go from the start to the end while visiting every non-obstacle square exactly...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 631: Design Excel Sum Formula

Problem Restatement We need to design a simplified Excel spreadsheet. The spreadsheet has: Item Meaning height Number of rows width Last column letter, from A to Z Initial value Every cell starts as 0 We need to support three operations: Operation Meaning set(row, column, val) Set a cell to a fixed integer value get(row, column) Return the current value of a cell sum(row, column, numbers) Set a cell to a...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 661: Image Smoother

Problem Restatement We are given a grayscale image represented as a 2D integer matrix img . Each cell contains a pixel value. We must create a smoothed image. For every cell, compute the average of: The cell itself All valid neighboring cells Neighbors include all eight surrounding directions: top bottom left right top-left top-right bottom-left bottom-right The average is rounded down to the nearest integer. Cells outside the image boundaries...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 778: Swim in Rising Water

Problem Restatement We are given an n x n grid. Each cell grid[i][j] is the elevation of that square. Rain starts falling. At time t , the water level is also t . We can swim from one cell to a 4-directionally adjacent cell only if both cells have elevation at most t . We start at the top-left cell: (0, 0) We want to reach the bottom-right cell: (n...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 598: Range Addition II

Problem Restatement We are given an m x n matrix initialized with all zeroes. We are also given a list of operations ops . Each operation has the form: [a, b] This means we increment every cell (x, y) where: 0 <= x < a 0 <= y < b In other words, each operation increments a rectangle starting from the top-left corner. After performing all operations, return the number...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 519: Random Flip Matrix

Problem Restatement We are given a binary matrix with: m rows n columns Initially, every cell contains: 0 We need to design a data structure supporting two operations. Operations flip() Randomly choose one remaining cell containing 0 . Change it to: 1 Return its coordinates. Every remaining zero cell must have equal probability of being chosen. reset() Set all cells back to: 0 The official problem asks us to randomly...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 568: Maximum Vacation Days

Problem Restatement We are given two matrices: Matrix Meaning flights Whether we can fly from one city to another days How many vacation days we can take in each city during each week There are n cities, indexed from 0 to n - 1 . We start in city 0 on Monday morning before week 0 . Each week, we may either: Stay in the current city. Fly to another...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 542: 01 Matrix

Problem Restatement We are given an m x n binary matrix mat . Each cell contains either 0 or 1 . For every cell, we need to return the distance to the nearest cell containing 0 . The distance between two cells sharing an edge is 1 . So movement is allowed only in four directions: up, down, left, right Diagonal movement is not allowed. The problem guarantees that the...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 566: Reshape the Matrix

Problem Restatement We are given a matrix mat with m rows and n columns. We are also given two integers: Value Meaning r Desired number of rows c Desired number of columns We need to reshape the matrix into size r x c . The reshaped matrix must preserve the original row-traversing order. That means we read the original matrix from left to right, row by row, and place the...

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 655: Print Binary Tree

Problem Restatement We are given the root of a binary tree. We need to return a 2D string matrix that represents the tree in a formatted layout. The layout follows fixed rules: Rule Meaning Rows One row for each tree level Columns Enough columns to center every subtree Root placement The root goes in the middle of the first row Child placement Children are placed one row below their parent...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 505: The Maze II

Problem Restatement We are given a maze represented as a grid. Value Meaning 0 Empty space 1 Wall A ball starts at position start . The goal is to reach position destination . The ball does not move one cell at a time. Instead, once the ball starts moving in a direction, it keeps rolling until it hits a wall. Only then can it choose another direction. We need to...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 562: Longest Line of Consecutive One in Matrix

Problem Restatement We are given a binary matrix mat . Each cell contains either 0 or 1 . We need to find the length of the longest line of consecutive 1 values. The line may go in one of four directions: Direction Meaning Horizontal Left to right Vertical Top to bottom Diagonal Top-left to bottom-right Anti-diagonal Top-right to bottom-left Return the maximum length among all such lines. The original problem...

Practice › LeetCode › LeetCode (archived) › LeetCode 08xx ›

LeetCode 827: Making A Large Island

Problem Restatement We are given an n x n binary grid. Each cell is either: Value Meaning 0 Water 1 Land An island is a group of land cells connected in four directions: up, down, left, right We may change at most one 0 into 1 . Return the largest possible island size after doing this operation. If the grid is already all land, we return the size of the...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 533: Lonely Pixel II

Problem Restatement We are given an m x n picture. Each cell is either: Character Meaning "B" Black pixel "W" White pixel We are also given an integer target . We need to count black pixels located at some position (r, c) such that both rules are true: Row r contains exactly target black pixels, and column c also contains exactly target black pixels. Every row that has a black...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 531: Lonely Pixel I

Problem Restatement We are given an m x n picture. Each cell is either: Character Meaning "B" Black pixel "W" White pixel A black pixel is lonely if it is the only black pixel in its row and also the only black pixel in its column. We need to return the number of lonely black pixels. Input and Output Item Meaning Input A 2D character array picture Output The number...

Practice › LeetCode › LeetCode (archived) › LeetCode 05xx ›

LeetCode 529: Minesweeper

Problem Restatement We are given a Minesweeper board and a clicked cell. Each cell can contain one of these characters: Character Meaning "M" An unrevealed mine "E" An unrevealed empty square "B" A revealed blank square with no adjacent mines "1" to "8" A revealed square showing the number of adjacent mines "X" A revealed mine After the click, we must update the board according to the Minesweeper rules. If...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 499: The Maze III

Problem Restatement We are given a maze represented by a 2D grid. Value Meaning 0 Empty cell 1 Wall A ball starts at ball . There is also a hole at hole . The ball can roll in four directions: Letter Direction u Up d Down l Left r Right Once the ball starts rolling, it keeps moving in that direction until one of two things happens: It hits a...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 422: Valid Word Square

Problem Restatement We are given an array of strings: words Return True if the strings form a valid word square. A word square means: row k == column k for every valid index k . The words may have different lengths, so we must be careful with missing characters. The source statement defines a valid word square as a sequence where the k th row and k th column read...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 498: Diagonal Traverse

Problem Restatement We are given an m x n matrix mat . We need to return all elements of the matrix in diagonal order. The traversal starts at the top-left cell, then moves along diagonals in alternating directions. For this matrix: mat = [ [1, 2, 3], [4, 5, 6], [7, 8, 9], ] The diagonal order is: [1, 2, 4, 7, 5, 3, 6, 8, 9] The official problem...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 419: Battleships in a Board

Problem Restatement We are given a 2D board containing: Character Meaning "X" Part of a battleship "." Empty water Battleships follow these rules: Battleships are placed either horizontally or vertically. Battleships cannot touch each other horizontally, vertically, or diagonally. A battleship consists of one or more consecutive "X" cells. Return the total number of battleships on the board. The official follow-up asks whether we can solve the problem in one...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 417: Pacific Atlantic Water Flow

Problem Restatement We are given an m x n matrix heights . Each cell represents land height. Water can flow from one cell to another adjacent cell if the next cell has height less than or equal to the current cell. Adjacent means four directions only: up, down, left, right The Pacific Ocean touches the top and left edges. The Atlantic Ocean touches the bottom and right edges. Return all...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 348: Design Tic-Tac-Toe

Problem Restatement We need to design a Tic-Tac-Toe game played by two players on an n x n board. The class supports two operations: Method Meaning TicTacToe(n) Initializes an n x n board move(row, col, player) Places player at position (row, col) and returns the winner The rules are: Rule Meaning Valid move Every move is guaranteed to be placed on an empty cell Game state No moves are made...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 317: Shortest Distance from All Buildings

Problem Restatement We are given an m x n grid. Each cell has one of three values: Value Meaning 0 Empty land 1 Building 2 Obstacle We want to build a house on an empty land cell. The house must be able to reach every building by moving only up, down, left, and right. Buildings and obstacles cannot be passed through. Return the minimum total travel distance from one empty...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 296: Best Meeting Point

Problem Restatement We are given a 2D grid containing only 0 and 1 . Each 1 marks the home of one person. A group of people wants to meet at one grid cell while minimizing the total travel distance. Distance is measured by Manhattan distance: distance = abs(r1 - r2) + abs(c1 - c2) We need to return the minimum possible total distance. The source statement says there are two...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 490: The Maze

Problem Restatement We are given a maze represented by a 2D grid. Each cell has one of two values: Value Meaning 0 Empty space 1 Wall A ball starts at start . The ball can roll in four directions: Direction Up Down Left Right But the ball does not move one cell and stop. Once it starts rolling in a direction, it keeps rolling until it hits a wall. It...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 221: Maximal Square

Problem Restatement We are given an m x n binary matrix. Each cell contains either: "0" "1" We need to find the largest square that contains only "1" cells. Return the area of that square. The official statement says: given an m x n binary matrix filled with 0 s and 1 s, find the largest square containing only 1 s and return its area. Input and Output Item Meaning...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 289: Game of Life

Problem Restatement We are given an m x n board. Each cell is either: Value Meaning 0 Dead cell 1 Live cell Each cell has up to eight neighbors: horizontal vertical diagonal The next board state is computed using these rules: Current State Live Neighbors Next State Live Fewer than 2 Dead Live 2 or 3 Live Live More than 3 Dead Dead Exactly 3 Live All cells must update...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 240: Search a 2D Matrix II

Problem Restatement We are given an m x n integer matrix and an integer target . The matrix has two sorted properties: Each row is sorted in ascending order from left to right. Each column is sorted in ascending order from top to bottom. We need to return True if target exists in the matrix, and False otherwise. LeetCode examples include searching for 5 , which returns true , and...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 286: Walls and Gates

Problem Restatement We are given an m x n grid called rooms . Each cell has one of three values: Value Meaning -1 Wall or obstacle 0 Gate 2147483647 Empty room, also called INF We need to fill each empty room with the distance to its nearest gate. Distance is the number of steps needed to reach a gate by moving only up, down, left, or right. If an empty...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 174: Dungeon Game

Problem Restatement We are given a 2D grid: dungeon A knight starts at the top-left cell: (0, 0) and wants to rescue the princess at the bottom-right cell. The knight may move only: Direction Allowed Right Yes Down Yes Left No Up No Each cell changes the knight’s health: Cell value Effect Negative Lose health Positive Gain health Zero No change The knight dies immediately if health becomes: <= 0...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 74: Search a 2D Matrix

Problem Restatement We are given an m x n integer matrix and an integer target . The matrix has two important properties: Each row is sorted in non-decreasing order. The first integer of each row is greater than the last integer of the previous row. We need to return true if target exists in the matrix. Otherwise, return false . The required time complexity is O(log(m * n)) . The...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 73: Set Matrix Zeroes

Problem Restatement We are given an m x n integer matrix. If any cell contains 0 , we must set that cell's entire row and entire column to 0 . The update must be done in place. The official problem statement requires modifying the given matrix directly, rather than returning a new matrix. It also asks whether we can solve it using constant extra space. Input and Output Item Meaning...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 200: Number of Islands

Problem Restatement We are given an m x n grid. Each cell is one of two characters: Character Meaning "1" Land "0" Water We need to count how many islands exist in the grid. An island is a group of land cells connected horizontally or vertically. Diagonal connection does not count. The official problem asks for the number of islands in a binary grid of land and water. Input and...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 212: Word Search II

Problem Restatement We are given: board words board is an m x n grid of characters. words is a list of strings. We need to return all words from words that can be formed on the board. A word can be formed by moving from one cell to another adjacent cell. Allowed moves: up down left right Diagonal moves are not allowed. The same board cell cannot be used more...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 463: Island Perimeter

Problem Restatement We are given a rectangular grid. Each cell is either: 1 # land 0 # water The grid contains exactly one island. Land cells connect horizontally or vertically, not diagonally. The grid is surrounded by water, and the island has no lakes. We need to return the perimeter of the island. A land cell is a square with side length 1 . So one isolated land cell has...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 64: Minimum Path Sum

Problem Restatement We are given an m x n grid filled with non-negative integers. We start at the top-left cell and want to reach the bottom-right cell. At each step, we may move only: Right Down A path sum is the sum of all numbers on the path, including the starting cell and the ending cell. We need to return the minimum possible path sum. The official constraints are 1...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 363: Max Sum of Rectangle No Larger Than K

Problem Restatement We are given an m x n integer matrix and an integer k . We need to find the maximum sum of any rectangle in the matrix such that the sum is no larger than k . A rectangle means a contiguous block of rows and columns. The problem guarantees that at least one rectangle has sum less than or equal to k . The official example uses...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 63: Unique Paths II

Problem Restatement A robot starts at the top-left corner of a grid. The robot wants to reach the bottom-right corner. At each step, the robot may move only: Right Down Some cells contain obstacles. If a cell contains an obstacle, the robot cannot move onto that cell. The grid uses: 0 = empty cell 1 = obstacle We need to count how many unique valid paths exist. The official constraints...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 37: Sudoku Solver

Problem Restatement We are given a partially filled 9 x 9 Sudoku board. Empty cells are represented by: "." We must fill the empty cells so that the final board satisfies Sudoku rules: Rule Meaning Row rule Each digit 1 to 9 appears exactly once in every row Column rule Each digit 1 to 9 appears exactly once in every column Box rule Each digit 1 to 9 appears exactly...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 62: Unique Paths

Problem Restatement A robot starts at the top-left corner of an m x n grid. The robot wants to reach the bottom-right corner. At each step, the robot may move only: Right Down We need to count how many different paths exist. The official constraints are 1 <= m, n <= 100 , and the answer is guaranteed to fit in a 32-bit integer. Input and Output Item Meaning Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 85: Maximal Rectangle

Problem Restatement We are given a binary matrix filled with characters: "0" "1" We need to find the largest rectangle that contains only "1" cells and return its area. The rectangle must be axis-aligned. That means its sides follow the matrix rows and columns. The official problem states: given a rows x cols binary matrix filled with 0 s and 1 s, find the largest rectangle containing only 1 s...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 36: Valid Sudoku

Problem Restatement We are given a 9 x 9 Sudoku board. Each cell contains either: "." or a digit from: "1" to "9" The board does not need to be solved. We only need to check whether the filled cells obey Sudoku rules. A board is valid when: Rule Meaning Row rule Each digit 1 to 9 appears at most once in every row Column rule Each digit 1 to...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 311: Sparse Matrix Multiplication

Problem Restatement We are given two sparse matrices mat1 and mat2 . A sparse matrix contains many zero values. We need to return the matrix product: mat1 * mat2 If mat1 has size m x k , and mat2 has size k x n , then the result has size m x n . For each result cell: answer[i][j] we compute the dot product of row i from mat1 and...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 361: Bomb Enemy

Problem Restatement We are given an m x n grid. Each cell is one of three characters: Character Meaning "W" Wall "E" Enemy "0" Empty cell We may place exactly one bomb, but only on an empty cell. When the bomb explodes, it kills enemies in the same row and the same column. The explosion stops when it hits a wall. So a bomb can kill enemies: left until a...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 59: Spiral Matrix II

Problem Restatement We are given a positive integer n . We need to generate an n x n matrix filled with numbers from 1 to n^2 in spiral order. The spiral starts at the top-left cell and moves: Right Down Left Up Then it repeats inward until every cell is filled. The official constraint is 1 <= n <= 20 . Input and Output Item Meaning Input A positive integer...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 407: Trapping Rain Water II

Problem Restatement We are given an m x n matrix called heightMap . Each cell represents the height of one unit block in a 2D elevation map. After rain, water may be trapped in lower cells if surrounding boundaries prevent it from flowing out. Return the total amount of trapped water. Water can move through the four main directions: up, down, left, right Diagonal movement does not matter. Boundary cells...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 308: Range Sum Query 2D - Mutable

Problem Restatement We are given a 2D integer matrix. We need to implement a class called NumMatrix that supports two operations: Operation Meaning update(row, col, val) Change matrix[row][col] to val sumRegion(row1, col1, row2, col2) Return the sum of all cells inside the rectangle The rectangle is inclusive. Unlike LeetCode 304, the matrix can change after construction. So a fixed 2D prefix sum matrix is no longer enough. Input and Output...

Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 130: Surrounded Regions

Problem Restatement We are given an m x n board containing only two characters: Character Meaning "X" Wall or blocking cell "O" Open cell We need to capture every region of "O" cells that is completely surrounded by "X" cells. A region is connected 4-directionally, meaning cells connect through up, down, left, and right. Diagonal connection does not count. To capture a surrounded region, we flip every "O" in that...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 305: Number of Islands II

Problem Restatement We are given an empty m x n grid filled with water. Each operation turns one cell into land. After every operation, return the current number of islands. An island is a group of connected land cells connected horizontally or vertically. The official problem defines: Value Meaning 0 Water 1 Land The grid starts entirely with water. For each position in positions , we add land at that...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 304: Range Sum Query 2D - Immutable

Problem Restatement We are given a 2D integer matrix. We need to implement a class called NumMatrix that supports rectangle sum queries. The class supports two operations: Operation Meaning NumMatrix(matrix) Initialize the object sumRegion(row1, col1, row2, col2) Return the sum of all elements inside the rectangle The rectangle is inclusive, so all cells from: (row1, col1) through: (row2, col2) must be included. The matrix never changes after construction. The official...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 329: Longest Increasing Path in a Matrix

Problem Restatement We are given an m x n integer matrix. Return the length of the longest strictly increasing path in the matrix. From each cell, we may move in four directions: up, down, left, right We may not move diagonally, and we may not move outside the matrix boundary. The path must be strictly increasing, so every next cell must have a larger value than the current cell. Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 353: Design Snake Game

Problem Restatement We need to implement a simplified Snake game. The screen has size: height x width The snake starts at the top-left cell: (0, 0) Its initial length is 1 . We are given a list of food positions. Food appears one at a time. The second food appears only after the snake eats the first food. Each call to move(direction) moves the snake one cell in one of...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 378: Kth Smallest Element in a Sorted Matrix

Problem Restatement We are given an n x n matrix. Each row is sorted in non-decreasing order. Each column is also sorted in non-decreasing order. We need to return the k th smallest element in the whole matrix. Duplicates count separately, so this means the k th element in the fully sorted list, not the k th distinct value. The problem also asks for memory better than O(n^2) . Input...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 79: Word Search

Problem Restatement We are given an m x n grid of characters called board and a string called word . We need to return True if word can be formed by walking through the grid. The walk must follow these rules: Rule Meaning Sequential letters The first visited cell must match word[0] , the next must match word[1] , and so on Adjacent cells only We may move up, down,...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 54: Spiral Matrix

Problem Restatement We are given an m x n matrix. We need to return all elements of the matrix in spiral order. The spiral starts at the top-left cell. It moves: Right across the top row Down the right column Left across the bottom row Up the left column Then it repeats the same pattern on the inner part of the matrix. The official constraints are 1 <= m, n...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 427: Construct Quad Tree

Problem Restatement We are given an n x n grid containing only 0 and 1 . We need to build a quad tree that represents this grid. A quad tree is a tree where each internal node has exactly four children: Child Region topLeft upper-left quadrant topRight upper-right quadrant bottomLeft lower-left quadrant bottomRight lower-right quadrant Each node has two main fields: Field Meaning val True for 1 , False for...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 302: Smallest Rectangle Enclosing Black Pixels

Problem Restatement We are given an m x n binary matrix image . Each cell is either: Value Meaning "0" White pixel "1" Black pixel All black pixels form one connected component. Pixels are connected horizontally and vertically. We are also given coordinates (x, y) of one black pixel. Return the area of the smallest axis-aligned rectangle that encloses all black pixels. The required algorithm must run in less than...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 351: Android Unlock Patterns

Problem Restatement We have a 3 x 3 Android lock screen. The dots are numbered like this: 1 2 3 4 5 6 7 8 9 Given two integers m and n , count how many valid unlock patterns have length at least m and at most n . A pattern is a sequence of distinct dots. A move from one dot to another is valid if either: The line...

Wiki › Algorithms › 01. Searching and Sorting › 5. Selection and Order Statistics ›

Sorted Matrix Selection

Selection in Sorted Matrix Selection in Sorted Matrix finds the k-th smallest value in a matrix where every row and every column is sorted in nondecreasing order. The matrix ordering gives enough structure to count how many values are less than or equal to a candidate. This allows binary search over the value range. Problem Given an $m \times n$ matrix $A$ such that: $$ A[i][j] \le A[i][j + 1]...

Wiki › Algorithms › 01. Searching and Sorting › 2. Binary Search and Ordered Search ›

Sorted Matrix Search

Sorted Matrix Search Sorted matrix search finds a target in a matrix where each row and each column is sorted. Unlike saddleback search, this approach uses divide and conquer to recursively eliminate regions. Problem Given a matrix $A$ of size $n \times m$ such that: $$ A[i][j] \le A[i][j+1] $$ $$ A[i][j] \le A[i+1][j] $$ find a position $(i, j)$ such that: $$ A[i][j] = x $$ If no such...

Wiki › Algorithms › 01. Searching and Sorting › 2. Binary Search and Ordered Search ›

Saddleback Search

Saddleback Search Saddleback search finds a target in a matrix where each row and each column is sorted in nondecreasing order. It walks through the matrix along a monotone path, eliminating one row or one column at each step. Problem Given a matrix $A$ of size $n \times m$ such that: $$ A[i][j] \le A[i][j+1] \quad \text{(rows sorted)} $$ $$ A[i][j] \le A[i+1][j] \quad \text{(columns sorted)} $$ find a position...

Wiki › Algorithms › 01. Searching and Sorting › 2. Binary Search and Ordered Search ›

Matrix Binary Search

Matrix Binary Search Matrix binary search searches a sorted matrix by treating its entries as one virtual sorted array. It applies when the matrix is sorted in row-major order. For a matrix with $n$ rows and $m$ columns, row-major sorted means: each row is sorted the first value of each row is greater than the last value of the previous row This condition allows the matrix to be searched with...

#matrix

LeetCode 3882 - Minimum XOR Path in a Grid

LeetCode 3858 - Minimum Bitwise OR From Grid

LeetCode 3725 - Count Ways to Choose Coprime Integers from Rows

LeetCode 3742 - Maximum Path Score in a Grid

LeetCode 3568 - Minimum Moves to Clean the Classroom

LeetCode 3548 - Equal Sum Grid Partition II

LeetCode 3537 - Fill a Special Grid

LeetCode 3402 - Minimum Operations to Make Columns Strictly Increasing

LeetCode 3665 - Twisted Mirror Path Count

LeetCode 3651 - Minimum Cost Path with Teleportations

LeetCode 3643 - Flip Square Submatrix Vertically

LeetCode 3619 - Count Islands With Total Value Divisible by K

LeetCode 3567 - Minimum Absolute Difference in Sliding Submatrix

LeetCode 3565 - Sequential Grid Path Cover

LeetCode 3552 - Grid Teleportation Traversal

LeetCode 3546 - Equal Sum Grid Partition I

LeetCode 3529 - Count Cells in Overlapping Horizontal and Vertical Substrings

LeetCode 3484 - Design Spreadsheet

LeetCode 3459 - Length of Longest V-Shaped Diagonal Segment

LeetCode 3462 - Maximum Sum With at Most K Elements

LeetCode 3446 - Sort Matrix by Diagonals

LeetCode 3418 - Maximum Amount of Money Robot Can Earn

LeetCode 3417 - Zigzag Grid Traversal With Skip

LeetCode 2387 - Median of a Row Wise Sorted Matrix

LeetCode 1992 - Find All Groups of Farmland

LeetCode 2931 - Maximum Spending After Buying Items

LeetCode 3195 - Find the Minimum Area to Cover All Ones I

LeetCode 2392 - Build a Matrix With Conditions

LeetCode 3286 - Find a Safe Walk Through a Grid

LeetCode 2732 - Find a Good Subset of the Matrix

LeetCode 2022 - Convert 1D Array Into 2D Array

LeetCode 2061 - Number of Spaces Cleaning Robot Cleaned

LeetCode 3256 - Maximum Value Sum by Placing Three Rooks I

LeetCode 1975 - Maximum Matrix Sum

LeetCode 2577 - Minimum Time to Visit a Cell In a Grid

LeetCode 3197 - Find the Minimum Area to Cover All Ones II

LeetCode 1901 - Find a Peak Element II

LeetCode 3359 - Find Sorted Submatrices With Maximum Element at Most K

LeetCode 3070 - Count Submatrices with Top-Left Element and Sum Less Than k

LeetCode 2352 - Equal Row and Column Pairs

LeetCode 2503 - Maximum Number of Points From Grid Queries

LeetCode 3122 - Minimum Number of Operations to Satisfy Conditions

LeetCode 1895 - Largest Magic Square

LeetCode 1861 - Rotating the Box

LeetCode 2373 - Largest Local Values in a Matrix

LeetCode 2661 - First Completely Painted Row or Column

LeetCode 2946 - Matrix Similarity After Cyclic Shifts

LeetCode 3363 - Find the Maximum Number of Fruits Collected

LeetCode 2132 - Stamping the Grid

LeetCode 2812 - Find the Safest Path in a Grid

LeetCode 3033 - Modify the Matrix

LeetCode 2617 - Minimum Number of Visited Cells in a Grid

LeetCode 3276 - Select Cells in Grid With Maximum Score

LeetCode 2573 - Find the String with LCP

LeetCode 3311 - Construct 2D Grid Matching Graph Layout

LeetCode 2852 - Sum of Remoteness of All Cells

LeetCode 1914 - Cyclically Rotating a Grid

LeetCode 2174 - Remove All Ones With Row and Column Flips II

LeetCode 3332 - Maximum Points Tourist Can Earn

LeetCode 3240 - Minimum Number of Flips to Make Binary Grid Palindromic II

LeetCode 2510 - Check if There is a Path With Equal Number of 0's And 1's

LeetCode 2596 - Check Knight Tour Configuration

LeetCode 3393 - Count Paths With the Given XOR Value

LeetCode 3242 - Design Neighbor Sum Service

LeetCode 2282 - Number of People That Can Be Seen in a Grid

LeetCode 2257 - Count Unguarded Cells in the Grid

LeetCode 2614 - Prime In Diagonal

LeetCode 2371 - Minimize Maximum Value in a Grid

LeetCode 2684 - Maximum Number of Moves in a Grid

LeetCode 3142 - Check if Grid Satisfies Conditions

LeetCode 1958 - Check if Move is Legal

LeetCode 2304 - Minimum Path Cost in a Grid

LeetCode 2711 - Difference of Number of Distinct Values on Diagonals

LeetCode 2658 - Maximum Number of Fish in a Grid

LeetCode 1970 - Last Day Where You Can Still Cross

LeetCode 2639 - Find the Width of Columns of a Grid

LeetCode 2814 - Minimum Time Takes to Reach Destination Without Drowning

LeetCode 3212 - Count Submatrices With Equal Frequency of X and Y

LeetCode 2088 - Count Fertile Pyramids in a Land