<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>

struct Transaction {
    string name, city;
    int time, amount;
};

class Solution {
public:
    
    vector<int> isInvalid(vector<int> &ids , vector<string> &transactions, string name, int currTime, string currCity) {
        vector<int> res {};
        for(int id: ids) {
            string transaction = transactions[id];
            stringstream ss(transaction);
            string city, stime, samt;
            getline(ss, stime, ',');
            getline(ss, stime, ',');
            getline(ss, samt, ',');
            getline(ss, city, ',');

            if(city == currCity)
                continue;
            
            int time, amt;
            time = stoi(stime);
            amt = stoi(samt);
            
            if(abs(time - currTime) <= 60)
                res.push_back(id);
        }
        
        return res;
    }

    vector<string> invalidTransactions(vector<string>& transactions) {
        int n = transactions.size();
        vector<Transaction> tarr(n); 

        for(int i=0; i<transactions.size(); i++) {
            string transaction = transactions[i];
            stringstream ss(transaction);
            string name, city, stime, samount;
            getline(ss, name, ',');
            getline(ss, stime, ',');
            getline(ss, samount, ',');
            getline(ss, city, ',');

            int time, amount;
            time = stoi(stime);
            amount = stoi(samount);
            
            tarr[i] = {name, city, time, amount};
        }
        
        vector<bool> toAdd(n, false);
        for(int i=0; i<n; i++) {
            if(tarr[i].amount > 1000) {
                toAdd[i] = true;
            }
            for(int j=i+1; j<n; j++) {

                if(tarr[i].name == tarr[j].name && tarr[i].city != tarr[j].city && abs(tarr[i].time - tarr[j].time) <= 60) {
                    toAdd[i] = true;
                    toAdd[j] = true;
                }
            }
        }
        
        vector<string> res {};
        for(int i=0; i<n; i++) {
            if(toAdd[i])
                res.push_back(transactions[i]);
        }
        
        return res;
    }
};
16500