Search for a command to run...
Series
A central repo for the programming challenges i solve on a regular basis for practice purposes
BFS BFS (Breadth-First Search): Introduction: BFS explores nodes in layers, starting from the root node and moving level by level through adjacent nodes. Applications: Shortest path problems in unweighted graphs. In an unweighted undirected gra...
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 to 0's. this way we don't have to use any extra space Iterate through the matrix, and if an element...
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 dynamic programming problem 3071.Minimum Operations to write `Y` on grid We can clearly see via th...
DP problems related to squares involve finding the largest or maximal square or rectangle in a matrix or array. To solve these problems effectively, break them into subproblems, define state information , establish recurrence relations, initialize DP...
Problems that involve repeatedly placing partition between start and end indices
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 and not the actual LIS , we can use a different approach, which which further reduce our time compl...
