class Solution {
    public List<Integer> largestDivisibleSubset(int[] nums) {
        ArrayList<Integer>[] dpList = new ArrayList[nums.length];
        List<Integer> ansList = new ArrayList<Integer>();
        for(int i = 0; i< nums.length; i++){
            ArrayList<Integer> intlist = new ArrayList<Integer>();
            intlist.add(nums[i]);
            dpList[i] = intlist;
            System.out.println(" i = "+ i + " and dpList["+ i + "] = "+ dpList[i]);
            for(int j = 0; j < i; j++){
                if((nums[i]%nums[j] == 0 || nums[j]%nums[i]==0) && dpList[i].size() <= dpList[j].size()){
                    System.out.println(" j = "+ j + " and dpList[j] = "+ dpList[j]);
                    ArrayList<Integer> tempList = new ArrayList<Integer>();
                    tempList = dpList[j];
                    tempList.add(nums[i]);
                    System.out.println("tempList "+tempList);
                    dpList[i] = tempList;
                }
                
            }
            
        }
        
        for(int i = 0; i< dpList.length; i++){
            System.out.println("-----> "+ i + " "+ dpList[i]);
            if(dpList[i].size()>ansList.size()){
                ansList = dpList[i];
            }
        }
        return ansList;
    }
}