Improved task 3201

Author: javadev

src/main/java/g3201_3300/s3201_find_the_maximum_length_of_valid_subsequence_i/Solution.java

@@ -2,7 +2,7 @@
 
 // #Medium #Array #Dynamic_Programming #2024_07_04_Time_5_ms_(82.23%)_Space_61.7_MB_(91.46%)
 
-class Solution {
+public class Solution {
     public int maximumLength(int[] nums) {
         int n = nums.length;
         int alter = 1;

src/main/java/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees/Solution.java

@@ -18,7 +18,7 @@ public int minimumDiameterAfterMerge(int[][] edges1, int[][] edges2) {
         return ans;
     }
 
-    public static int[] diameter(int[][] g) {
+    private int[] diameter(int[][] g) {
         int n = g.length;
         int f0;
         int f1;
@@ -58,7 +58,7 @@ public static int[] diameter(int[][] g) {
         return new int[] {d01, f0, f1};
     }
 
-    public static int[][] packU(int n, int[][] ft) {
+    private int[][] packU(int n, int[][] ft) {
         int[][] g = new int[n][];
         int[] p = new int[n];
         for (int[] u : ft) {