## Find the element at the specified index of a Spirally Filled Matrix

Given two integers x and y representing the row and column number in a matrix respectively, the task is to find the integer at the… Read More »

- Largest Square in a Binary Matrix with at most K 1s for multiple Queries
- Real-time application of Data Structures
- Construct a Doubly linked linked list from 2D Matrix
- Flood Fill Algorithm
- Program to reverse the rows in a 2d Array
- Submatrix of given size with maximum 1's
- Check whether a Matrix is a Latin Square or not
- Puzzle | Connect 9 circles each arranged at center of a Matrix using 3 straight lines
- Maximum of all distances to the nearest 1 cell from any 0 cell in a Binary matrix
- Return an array of anti-diagonals of given N*N square matrix
- Find the count of mountains in a given Matrix
- Maximum size of square such that all submatrices of that size have sum less than K
- Find if there is a path between two vertices in a directed graph | Set 2
- Minimum number of Water to Land conversion to make two islands connected in a Grid
- Construct a Matrix of size NxN with values in range [1, N^2] as per given conditions
- Count of palindromic plus paths in a given Matrix
- Java Program to Add two Matrices
- Traverse a given Matrix using Recursion
- Maximum size square Sub-Matrix with sum less than or equals to K
- C program to implement Adjacency Matrix of a given Graph
- Encryption and Decryption of String according to given technique
- Sort the major diagonal of the matrix
- Leftmost Column with atleast one 1 in a row-wise sorted binary matrix
- Check if any King is unsafe on the Chessboard or not
- Minimize count of divisions by D to obtain at least K equal array elements
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- Java Program to Multiply two Matrices of any size
- Generalized Fibonacci Numbers
- Count all square sub-matrix with sum greater than the given number S
- Find the product of sum of two diagonals of a square Matrix

Given two integers x and y representing the row and column number in a matrix respectively, the task is to find the integer at the… Read More »

Prerequisites: Graph and its representations Given an adjacency matrix g[][] of a graph consisting of N vertices, the task is to modify the matrix after… Read More »

Given a 2D screen arr[][] where each arr[i][j] is an integer representing the colour of that pixel, also given the location of a pixel (X,… Read More »

Given an integer N and an array arr[] of positions which denotes the positions of already placed non-attacking rooks, the task is to find the… Read More »

Given a matrix m[][], the task is to check if the given matrix is Bitonic or not. If the given matrix is Bitonic, then print… Read More »

Given an integer N, the task is to construct a matrix of size N2 using positive and negative integers and excluding 0, such that the… Read More »

Given an array A[ ] of size N and two integers K and D, the task is to calculate the minimum possible number of operations… Read More »

Given an integer N, which denotes the size of the matrix that is N*N. There is a robot placed over the top-left corner of the… Read More »

Consider 9 circles each arranged at the center of cells of a 2-D matrix of shape 3*3. Draw 3 straight lines without removing pen from… Read More »

Given a matrix with N rows and M columns, the task is make all possible paths from the cell (N, M) to (1, 1) palindrome… Read More »

Given a 3D matrix mat[ ][ ][ ] of size X * Y * Z. The task is to convert this matrix into a fully… Read More »

Given a matrix mat[][] with N rows and M columns. The task is to find the minimum number of changes required in the matrix such… Read More »

Given a number N, the task is to create a square matrix of size N*N with values in range [1, N*N], such that the sum… Read More »

Given a squared matrix M[ ][ ] of N * N dimensions, the task is to find the Kth diagonal of the matrix, starting from… Read More »

We all know that Fibonacci numbers (Fn) is defined by the recurrence relation Fibonacci Numbers (Fn) = F(n-1) + F(n-2) with seed values F0 = 0 and… Read More »