<p>A transaction is possibly invalid if:</p>

<ul>
	<li>the amount exceeds <code>$1000</code>, or;</li>
	<li>if it occurs within (and including) <code>60</code> minutes of another transaction with the <strong>same name</strong> in a <strong>different city</strong>.</li>
</ul>

<p>You are given an array of strings <code>transaction</code> where <code>transactions[i]</code> consists of comma-separated values representing the name, time (in minutes), amount, and city of the transaction.</p>

<p>Return a list of <code>transactions</code> that are possibly invalid. You may return the answer in <strong>any order</strong>.</p>

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

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;alice,50,100,beijing&quot;]
<strong>Output:</strong> [&quot;alice,20,800,mtv&quot;,&quot;alice,50,100,beijing&quot;]
<strong>Explanation:</strong> The first transaction is invalid because the second transaction occurs within a difference of 60 minutes, have the same name and is in a different city. Similarly the second one is invalid too.</pre>

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

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;alice,50,1200,mtv&quot;]
<strong>Output:</strong> [&quot;alice,50,1200,mtv&quot;]
</pre>

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

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;bob,50,1200,mtv&quot;]
<strong>Output:</strong> [&quot;bob,50,1200,mtv&quot;]
</pre>

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

<ul>
	<li><code>transactions.length &lt;= 1000</code></li>
	<li>Each <code>transactions[i]</code> takes the form <code>&quot;{name},{time},{amount},{city}&quot;</code></li>
	<li>Each <code>{name}</code> and <code>{city}</code> consist of lowercase English letters, and have lengths between <code>1</code> and <code>10</code>.</li>
	<li>Each <code>{time}</code> consist of digits, and represent an integer between <code>0</code> and <code>1000</code>.</li>
	<li>Each <code>{amount}</code> consist of digits, and represent an integer between <code>0</code> and <code>2000</code>.</li>
</ul>

class Solution {
public:
    vector<string> invalidTransactions(vector<string>& transactions) {
       int n=transactions.size();
        vector<vector<string>>arr;
        vector<int>vis(n,0);
        for(int i=0;i<n;i++)
        {
            int cnt=0;
            string str=transactions[i];
            string name,time,am,city;
            vector<string>ans;
            for(int j=0;j<str.size();j++)
            {
               while(str[j]!=',' && cnt==0)
               {
                   name+=str[j];
                   j++;
               }
                ans.push_back(name);
                cnt=1;
                j++;
                while(str[j]!=',' && cnt==1)
                {
                    time+=str[j];
                    j++;
                }
                 ans.push_back(time);
                cnt=2;
                j++;
                while(str[j]!=',' && cnt==2)
                {
                    am+=str[j];
                    j++;
                }
                 ans.push_back(am);
                j++;
                while(j<str.size() )
                {
                    city+=str[j];
                    j++;
                }
                 ans.push_back(city);
            }
            arr.push_back(ans);
            
            
        }
        vector<string>res;
      
        for(int i=0;i<arr.size();i++)
        {
            bool check=false;
            for(int j=i+1;j<arr.size();j++)
            {
                if(arr[i][0]==arr[j][0] && arr[i][3]!=arr[j][3])
                {
                    if(abs(stoi(arr[i][1])-stoi(arr[j][1]))<=60)
                    {
                        check=true;
                        string str=arr[j][0]+','+arr[j][1]+','+arr[j][2]+','+arr[j][3];
                        if(vis[j]==0)
                        {
                        res.push_back(str);
                           vis[j]=1;
                        }
                    }
                }
            }
            
            if(((stoi(arr[i][2])>1000 || check==true) && vis[i]==0) )
            {
                  string str=arr[i][0]+','+arr[i][1]+','+arr[i][2]+','+arr[i][3];
                res.push_back(str);
                vis[i]=1;
            }
        }
        return res;
        
    }
};
22800