cleanup

Author: shreymehul

Diff for: 1235.JobScheduling.cs

@@ -30,6 +30,9 @@ public int JobScheduling(int[] startTime, int[] endTime, int[] profit)
         int n = profit.Length;
         maxProfit = new int[n];
 
+        // Initialize max profit array with -1 for memoization
+        Array.Fill(maxProfit, -1);
+
         // Create job tuples containing start, end times, and profit
         (int start, int end, int profit)[] jobs = new (int, int, int)[n];
         for (int i = 0; i < n; i++) 
@@ -40,9 +43,6 @@ public int JobScheduling(int[] startTime, int[] endTime, int[] profit)
         // Sort jobs by their start time to facilitate recursive exploration
         jobs = jobs.OrderBy(x => x.start).ToArray();
 
-        // Initialize max profit array with -1 for memoization
-        Array.Fill(maxProfit, -1);
-
         return Scheduling(jobs, 0, 0);
     }
 

Diff for: 236.LowestCommonAncestor.cs

@@ -47,9 +47,11 @@ public TreeNode LowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
         TreeNode left = LowestCommonAncestor(root.left, p, q);
         TreeNode right = LowestCommonAncestor(root.right, p, q);
 
+        //one node is in left and one in right
         if(left != null && right != null)
             return root;
 
+        //both the node are in one side of tree.
         return right ?? left;
     }
 }

Diff for: 239.MaxSlidingWindow.cs

@@ -13,7 +13,7 @@ public int[] MaxSlidingWindow(int[] nums, int k) {
         if (nums == null || nums.Length == 0) return new int[0];
 
         int n = nums.Length;
-        int[] res = new int[n - k + 1];
+        int[] res = new int[n - k + 1]; // steores result i.e. max of k wincow
         LinkedList<int> deque = new LinkedList<int>(); // Stores indices of elements
 
         for (int i = 0; i < nums.Length; i++) {

Diff for: 42.Trap.cs

@@ -6,7 +6,8 @@
 // Example :
 // Input: height = [0,1,0,2,1,0,1,3,2,1,2,1]
 // Output: 6
-// Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water (blue section) are being trapped.
+// Explanation: The above elevation map (black section) is represented by array [0,1,0,2,1,0,1,3,2,1,2,1]. In this case, 6 units of rain water 
+// (blue section) are being trapped.
 
 
 //Prefix Sum

Diff for: 524.FindLongestWord.cs

@@ -1,5 +1,7 @@
 // 524. Longest Word in Dictionary through Deleting
-// Given a string s and a string array dictionary, return the longest string in the dictionary that can be formed by deleting some of the given string characters. If there is more than one possible result, return the longest word with the smallest lexicographical order. If there is no possible result, return the empty string.
+// Given a string s and a string array dictionary, return the longest string in the dictionary that can be formed by deleting 
+// some of the given string characters. If there is more than one possible result, return the longest word with the smallest l
+// exicographical order. If there is no possible result, return the empty string.
 
 // Example 1:
 // Input: s = "abpcplea", dictionary = ["ale","apple","monkey","plea"]

Diff for: 64.MinPathSum.cs

@@ -29,15 +29,20 @@ public int MinPathSum(int[][] grid)
     }
     public int PathSum(int[][] grid, int i, int j)
     {
+        // already visited
         if (visited[i, j] > -1)
             return visited[i, j];
         int result;
+        // reached destination
         if (i == grid.Length - 1 && j == grid[0].Length - 1)
             result = grid[i][j];
+        //Last Row    
         else if (i == grid.Length - 1)
             result =  grid[i][j] + PathSum(grid, i, j + 1);
+        //Last Column
         else if (j == grid[0].Length - 1)
             result = grid[i][j] + PathSum(grid, i + 1, j);
+        //All others
         else
             result =  grid[i][j] + Math.Min(PathSum(grid, i+1, j), PathSum(grid, i, j + 1));
         visited[i,j] = result;

Diff for: Graph.DetectCycle.cs

@@ -1,4 +1,3 @@
-
 // DFS
 public class Solution {
     public void DetectCycle(int[][] edges, int n) {

Diff for: LargestTree.cs

@@ -31,6 +31,8 @@
 // Result Selection:
 
 // After merging, the tree with the largest size is selected. In case of ties, the smallest root ID is chosen.
+
+
 // Complexity Analysis:
 // Time Complexity: O(NlogN) due to efficient path compression and union operations.
 // Space Complexity: O(N) for the parent and size dictionaries.