<p>You are given two <strong>sorted</strong> arrays of distinct integers <code>nums1</code> and <code>nums2</code>.</p>

<p>A <strong>valid<strong><em> </em></strong>path</strong> is defined as follows:</p>

<ul>
	<li>Choose array <code>nums1</code> or <code>nums2</code> to traverse (from index-0).</li>
	<li>Traverse the current array from left to right.</li>
	<li>If you are reading any value that is present in <code>nums1</code> and <code>nums2</code> you are allowed to change your path to the other array. (Only one repeated value is considered in the valid path).</li>
</ul>

<p>The <strong>score</strong> is defined as the sum of unique values in a valid path.</p>

<p>Return <em>the maximum score you can obtain of all possible <strong>valid paths</strong></em>. Since the answer may be too large, return it modulo <code>10<sup>9</sup> + 7</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2020/07/16/sample_1_1893.png" style="width: 500px; height: 151px;" />
<pre>
<strong>Input:</strong> nums1 = [2,4,5,8,10], nums2 = [4,6,8,9]
<strong>Output:</strong> 30
<strong>Explanation:</strong> Valid paths:
[2,4,5,8,10], [2,4,5,8,9], [2,4,6,8,9], [2,4,6,8,10],  (starting from nums1)
[4,6,8,9], [4,5,8,10], [4,5,8,9], [4,6,8,10]    (starting from nums2)
The maximum is obtained with the path in green <strong>[2,4,6,8,10]</strong>.
</pre>

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

<pre>
<strong>Input:</strong> nums1 = [1,3,5,7,9], nums2 = [3,5,100]
<strong>Output:</strong> 109
<strong>Explanation:</strong> Maximum sum is obtained with the path <strong>[1,3,5,100]</strong>.
</pre>

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

<pre>
<strong>Input:</strong> nums1 = [1,2,3,4,5], nums2 = [6,7,8,9,10]
<strong>Output:</strong> 40
<strong>Explanation:</strong> There are no common elements between nums1 and nums2.
Maximum sum is obtained with the path [6,7,8,9,10].
</pre>

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

<ul>
	<li><code>1 &lt;= nums1.length, nums2.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums1[i], nums2[i] &lt;= 10<sup>7</sup></code></li>
	<li><code>nums1</code> and <code>nums2</code> are strictly increasing.</li>
</ul>

#define ll long long
class Solution {
    ll dp[100002];
    const int N=1e9+7;
    ll f(int ind,vector<ll>& v1,vector<ll>& v2){
        int n=v1.size();
        int m=v2.size();
        if(ind>=n && ind>=m){
            return 0;
        }
        if(dp[ind]!=-1){
            return dp[ind];
        }
        ll pick1=0;
        if(ind<n){
            pick1=((v1[ind])+(f(ind+1,v1,v2)));
        }
        ll pick2=0;
        if(ind<m){
            pick2=((v2[ind])+(f(ind+1,v1,v2)));
        }
        return dp[ind]= max(pick1,pick2);
    }
public:
    int maxSum(vector<int>& nums1, vector<int>& nums2) {
        set<int> s1;
        set<int> s2;
        for(auto it:nums1){
            s1.insert(it);
        }
        for(auto it:nums2){
            s2.insert(it);
        }
        vector<ll> v1;
        vector<ll> v2;
        ll sum=0;
        for(int i=0;i<nums1.size();i++){
            sum=sum+nums1[i];
            if(s1.find(nums1[i])!=s1.end() && s2.find(nums1[i])!=s2.end()){
                v1.push_back(sum);
                sum=0;
            }
        }
        if(sum!=0){
            v1.push_back(sum);
        }
        sum=0;
        for(int i=0;i<nums2.size();i++){
            sum+=nums2[i];
            if(s1.find(nums2[i])!=s1.end() && s2.find(nums2[i])!=s2.end()){
                v2.push_back(sum);
                sum=0;
            }
        }
        if(sum!=0){
            v2.push_back(sum);
        }
        memset(dp,-1,sizeof(dp));
        ll ans= f(0,v1,v2)%N;
        return ans;

    }
};
97818