Articles in this series
BFS BFS (Breadth-First Search): Introduction: BFS explores nodes in layers, starting from the root node and moving level by level through adjacent...
Set Matrix zeros IDEA: To solve this problem, use the first row and column of the matrix to store markers indicating if a row or column should be set...
Leetcode Weekly Contest 387 3069. Distribute Elements Into Two Arrays I 3070. Count Submatrices with Top-Left Element and Sum Less Than k This is a...
DP problems related to squares involve finding the largest or maximal square or rectangle in a matrix or array. To solve these problems effectively,...
Problems that involve repeatedly placing partition between start and end indices · These problems can be formulated as increasing order of lengths...
DP Problems based on L.I.S Longest Increasing Subsequence (L.I.S) In above solution we notice that if we are concerned about only the `length` of LIS...
