<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 Transaction {
    public:
    // name of the person making the transaction
    string personName;
    // time of the transaction in minutes
    int transactionTime; 
    // amount of the transaction
    int transactionAmount;
    // city of the transaction
    string transactionCity;
        
    // constructor for creating transaction object
    Transaction(string name, int time, int amount, string city)
    {
        this->personName = name;
        this->transactionTime = time;
        this->transactionAmount = amount;
        this->transactionCity = city;
    }
};

class Solution {
public:

    vector<string> invalidTransactions(vector<string>& transactions) {
        int numTransactions = transactions.size();
        vector<bool> isValid(numTransactions, true);
        vector<Transaction> inputTransactions;
        
        for(int i=0; i<numTransactions; i++)
        {
            string currTransaction = transactions[i];
            string name = "", time = "", amount = "", city = "";
            int j = 0;
            
            while(currTransaction[j] != ',')
            {
                name += currTransaction[j++];
            }
            j++;
            while(currTransaction[j] != ',')
            {
                time += currTransaction[j++];
            }
            j++;
            while(currTransaction[j] != ',')
            {
                amount += currTransaction[j++];
            }
            j++;
            while((j < currTransaction.size()) && (currTransaction[j] != ','))
            {
                city += currTransaction[j++];
            }
            
            Transaction newTransaction(name, stoi(time), stoi(amount), city);
            inputTransactions.push_back(newTransaction);
        }
        
        for(int i=0;i<inputTransactions.size(); i++)
        {
            if(inputTransactions[i].transactionAmount > 1000)
                isValid[i] = false;
        }
        
        for(int i=0;i<(inputTransactions.size()); i++)
        {
            for(int j=0; j<inputTransactions.size(); j++)
            {
                if(i == j)
                    continue;
                int timeDiff = abs(inputTransactions[j].transactionTime - inputTransactions[i].transactionTime);
            if(timeDiff <= 60)
            {
                if((inputTransactions[j].personName == inputTransactions[i].personName) && (inputTransactions[j].transactionCity != inputTransactions[i].transactionCity))
                {
                    isValid[i] = false;
                    isValid[j] = false;
                }
            }
        }
    }
    
    // Adding invalid transactions to the answer
    vector<string> invalidTransactions;
    for(int i=0;i<inputTransactions.size(); i++)
    {
        if(!isValid[i])
            invalidTransactions.push_back(transactions[i]);
    }
    
    return invalidTransactions;
}
};
16800