Create 368_Largest_Divisible_Subset.java

Author: vishwajeetmishra4

JAVA/368_Largest_Divisible_Subset.java

@@ -0,0 +1,40 @@
+// Problem Number: 368
+
+// Largest Divisible Subset.
+
+class Solution {
+  public List<Integer> largestDivisibleSubset(int[] nums) {
+    final int n = nums.length;
+    List<Integer> ans = new ArrayList<>();
+
+    int[] sizeEndsAt = new int[n];
+
+    int[] prevIndex = new int[n];
+    int maxSize = 0; 
+    int index = -1;  
+
+    Arrays.fill(sizeEndsAt, 1);
+    Arrays.fill(prevIndex, -1);
+    Arrays.sort(nums);
+
+    for (int i = 0; i < n; ++i) {
+      for (int j = i - 1; j >= 0; --j)
+        if (nums[i] % nums[j] == 0 && sizeEndsAt[i] < sizeEndsAt[j] + 1) {
+          sizeEndsAt[i] = sizeEndsAt[j] + 1;
+          prevIndex[i] = j;
+        }
+      
+      if (maxSize < sizeEndsAt[i]) {
+        maxSize = sizeEndsAt[i];
+        index = i; 
+      }
+    }
+
+    while (index != -1) {
+      ans.add(nums[index]);
+      index = prevIndex[index];
+    }
+
+    return ans;
+  }
+}