<p>Given a set of <strong>distinct</strong> positive integers <code>nums</code>, return the largest subset <code>answer</code> such that every pair <code>(answer[i], answer[j])</code> of elements in this subset satisfies:</p>

<ul>
	<li><code>answer[i] % answer[j] == 0</code>, or</li>
	<li><code>answer[j] % answer[i] == 0</code></li>
</ul>

<p>If there are multiple solutions, return any of them.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3]
<strong>Output:</strong> [1,2]
<strong>Explanation:</strong> [1,3] is also accepted.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,4,8]
<strong>Output:</strong> [1,2,4,8]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 2 * 10<sup>9</sup></code></li>
	<li>All the integers in <code>nums</code> are <strong>unique</strong>.</li>
</ul>

class Solution {
public:
    void using_rec(vector<int>& nums,vector<int>&ans,vector<int>temp1,int temp,int prev){
        if(temp == nums.size()){
            if(temp1.size() > ans.size()){ans = temp1;}
            return;
        }
        if(prev == -1 || (nums[temp]%prev == 0)){
            temp1.push_back(nums[temp]);
            using_rec(nums,ans,temp1,temp+1,nums[temp]);
            temp1.pop_back();
        }
        using_rec(nums,ans,temp1,temp+1,prev);
    }
    void using_tabu(vector<int>& nums,vector<int>&ans){
        int n = nums.size();
        vector<int>freq(n,1);
        int lol1 = 0;
        int maxi = 0;
        map<int,int>routes;
        for(int i = 1;i < n;i++){
            for(int j = 0;j < i;j++){
                if(nums[i]%nums[j] == 0){
                    if(freq[j] +1 > freq[i]){
                        freq[i] = freq[j]+1;
                        routes[i] = j;
                        if(freq[i] >  maxi){
                            maxi = freq[i];
                            lol1 = i;
                        }
                    }
                }
            }
        }
        while(routes.find(lol1) != routes.end()){
            ans.push_back(nums[lol1]);
            lol1 = routes[lol1];
        }
        ans.push_back(nums[lol1]);

    }
    vector<int> largestDivisibleSubset(vector<int>& nums) {
        sort(nums.begin(),nums.end());
        vector<int>ans;
        //using_rec(nums,ans,{},0,-1);
        using_tabu(nums,ans);
        return ans;
    }
};
13700