Solved Leetcode Easy 0121. Best Time to Buy and sell question and also added Algorithms for Part 01 of the Array questions

Author: frankdavid-bp

problems/01. Arrays/Part 01/01. Leetcode Medium 0073. Set Matrix Zeroes/Algorithms.md

@@ -0,0 +1,14 @@
+### Using Additional Sets
+Algorithm: Use two sets to keep track of rows and columns that need to be zeroed. Iterate through the matrix to populate these sets, and then iterate again to set the appropriate rows and columns to 0.
+
+Time Complexity: O(m * n)
+
+Space Complexity: O(m + n)
+
+### Using First Row and Column as Markers (Optimal)
+Algorithm: Use the first row and first column to mark the rows and columns that need to be zeroed. Use separate variables to track whether the first row and first column should be zeroed. Iterate through the matrix to set markers, then update the matrix based on these markers.
+
+Time Complexity: O(m * n)
+
+Space Complexity: O(1)
+

problems/01. Arrays/Part 01/01. Leetcode Medium 0073. Set Matrix Zeroes/readme.md renamed to problems/01. Arrays/Part 01/01. Leetcode Medium 0073. Set Matrix Zeroes/Question.md

@@ -1,3 +1,4 @@
+Leetcode Medium 0073. Set Matrix Zeroes
 Question 
 Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's.  
 

problems/01. Arrays/Part 01/02. Leetcode Medium 0118. Pascal's Triangle/Algorithms.md

@@ -0,0 +1,8 @@
+### Brute Force Approach
+Algorithm: Use nested loops to generate each row of Pascal's Triangle. For each row, use an inner loop to compute the values based on the previous row.
+
+Time Complexity: O(n^2)
+
+Space Complexity: O(n^2)
+
+This problem has only brute force approach

problems/01. Arrays/Part 01/02. Leetcode Medium 0118. Pascal's Triangle/readme.md renamed to problems/01. Arrays/Part 01/02. Leetcode Medium 0118. Pascal's Triangle/Question.md

@@ -1,3 +1,4 @@
+Leetcode Medium 0118. Pascal's Triangle
 Given an integer numRows, return the first numRows of Pascal's triangle.  
 
 In Pascal's triangle, each number is the sum of the two numbers directly above it as shown:  

problems/01. Arrays/Part 01/03. Leetcode Medium 0031. Next Permutation/Algorithms.md

@@ -0,0 +1,8 @@
+
+### Linear Approach (Optimal)
+Time Complexity: O(n)
+Space Complexity: O(1)
+Algorithm: 
+1. Find the first decreasing element from the end. 
+2. Swap it with the smallest element larger than it from the end, 
+3. then reverse the elements after the original position of the first decreasing element.

problems/01. Arrays/Part 01/03. Leetcode Medium 0031. Next Permutation/readme.md renamed to problems/01. Arrays/Part 01/03. Leetcode Medium 0031. Next Permutation/Question.md

@@ -1,3 +1,4 @@
+Leetcode Medium 0031. Next Permutation
 A permutation of an array of integers is an arrangement of its members into a sequence or linear order.  
 
 For example, for arr = [1,2,3], the following are all the permutations of arr: [1,2,3], [1,3,2], [2, 1, 3], [2, 3, 1], [3,1,2], [3,2,1].  

problems/01. Arrays/Part 01/04. Leetcode Easy 0053. Maximum Subarray | Kadane's Algorithm/Algorithms.md

@@ -0,0 +1,14 @@
+### Brute Force Approach
+Algorithm: Instead of calculating the sum of each subarray from scratch, keep a running sum of the subarray.
+
+Time Complexity: O(n^2)
+
+Space Complexity: O(1)
+
+### Kadane’s Algorithm (Optimal)
+Algorithm: Iterate through the array while keeping track of the maximum subarray sum ending at the current position. Update the global maximum if the current subarray sum is higher.
+
+Time Complexity: O(n)
+
+Space Complexity: O(1)
+

problems/01. Arrays/Part 01/04. Leetcode Easy 0053. Maximum Subarray | Kadane's Algorithm/readme.md renamed to problems/01. Arrays/Part 01/04. Leetcode Easy 0053. Maximum Subarray | Kadane's Algorithm/Question.md

@@ -0,0 +1,13 @@
+### 1. Brute Force Approach
+Time Complexity: O(n^2)
+Space Complexity: O(1)
+Algorithm: Iterate through each pair of days, calculate the profit for each pair, and keep track of the maximum profit.
+
+### 2. One Pass Approach
+Time Complexity: O(n)
+Space Complexity: O(1)
+Algorithm: Track the minimum price as we iterate through the array. Calculate the profit for each day by subtracting the minimum price from the current price, and update the maximum profit if the current profit is higher.
+
+### 3. Divide and Conquer Approach
+Time Complexity: O(n log n)
+Space Complexity: O(log n)