Be Brave

LeetCode - Problems - Algorithms - 300. Longest Increasing SubsequenceProblem DescriptionGiven an integer array nums, return the length of the longest strictly increasing subsequence. Example: Constraints:My Solution (C#)public int LengthOfLIS(int[] nums){ int numsLength = nums.Length; int[] maxSubsequenceLengths = new int[numsLength]; Array.Fill(maxSubsequenceLengths, 1); //maxSubseq..

LeetCode - Problems - Algorithms - 733. Flood FillProblem DescriptionYou are given an image represented by an m x n grid of integers image, where image[i][j] represents the pixel value of the image. You are also given three integers sr, sc, and color. Your task is to perform a flood fill on the image starting from the pixel image[sr][sc]. To perform a flood fill: Begin with the starting pixel an..