Array Matrix Breadth First Search Intermediate Implement the countSquareSubmatricesOnes method that counts square submatrices that contain only 1 values. Solved
Array Matrix Breadth First Search Intermediate Implement the wordSearchMatrixExists method that checks whether the word exists in the matrix path. Solved
Array Matrix Breadth First Search Intermediate Implement the minimumPathSumMatrix method that returns the minimum path sum through the matrix. Solved
Array Matrix Breadth First Search Intermediate Implement the maximalSquareMatrixArea method that returns the area of the largest square containing only 1 values. Solved
Array Matrix Breadth First Search Intermediate Implement the numberOfIslandsMatrix method that counts islands in a binary matrix. Solved
Array Matrix Breadth First Search Intermediate Implement the searchSortedMatrix method that checks whether the target exists in a sorted matrix. Solved
Array Matrix Breadth First Search Intermediate Implement the rotateImageClockwise method that returns the matrix after rotating it 90 degrees clockwise. Solved
Array Matrix Breadth First Search Intermediate Implement the spiralOrderTraversalLength method that returns the number of elements visited in spiral order. Solved
Array Matrix Breadth First Search Intermediate Implement the setMatrixZeroesCount method that counts cells affected after applying matrix zeroing rules. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Learner Implement the floodFillChangedCount method that returns how many cells are changed during flood fill. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Proficient Implement the dijkstraShortestPathSimple method that returns the shortest weighted path using Dijkstra-style logic. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the minimumSpanningTreeWeightSimple method that returns the total weight of a minimum spanning tree. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the bipartiteGraphCheck method that checks whether a graph can be divided into two valid groups. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the connectedComponentsCount method that counts connected components in an undirected graph. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the shortestPathUnweightedGraph method that returns the shortest distance between two nodes in an unweighted graph. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the detectCycleDirectedGraph method that checks whether a directed graph contains a cycle. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the courseSchedulePossible method that checks whether all courses can be completed from the prerequisites. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the cloneGraphNodeCount method that returns how many nodes are present after cloning a graph. Solved
Graph Breadth First Search Depth First Search Shortest Path Minimum Spanning Tree Intermediate Implement the numberOfIslandsDfsCount method that counts islands in a grid using depth-first search. Solved