Leetcode 118. Pascal's TriangleDescription: Pascal's Triangle is a mathematical concept that is represented as a triangular array of binomial coefficients. Each number in the triangle is the sum of the two directly above it. The first and last numbers in each row are always 1. Var...May 13, 2024 · 4 min readkoustavhazra.hashnode.dev
Leetcode 73. Set Matrix ZeroDescription: Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. You must do it in place. Example: Input: matrix = [[1,1,1],[1,0,1],[1,1,1]] Output: [[1,0,1],[0,0,0],[1,0,1]] Constraints: m == matrix.lengt...May 12, 2024 · 6 min readkoustavhazra.hashnode.dev