<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:
    static string getArgument(string str,int idx){
        int st=0;
        int en=0;
        int curr=-1;
        for(int i=0;i<str.size();i++){
            if(i>0&&str[i-1]==','){
                st=i;
            }
            if(str[i]==','){
                curr++;
            }
            if(curr==idx){
                break;
            }
            
            en=i;
        }
        return str.substr(st,en-st+1);
    }
    static int convertToInt(string str){
        return atoi(str.c_str());
    }
    enum{
        NAME,
        TIME,
        AMOUNT,
        CITY
    }Indexing;
    struct Transaction{
        int time;
        string name;
        string city;
        int amount;
        string str;
        bool isInvalid;
        Transaction(string str){
            this->amount = convertToInt(getArgument(str,AMOUNT));
            this->name = getArgument(str,NAME);
            this->time = convertToInt(getArgument(str,TIME));
            this->city = getArgument(str,CITY);
            this->str = str;
            isInvalid=0;
        }
    };
    vector<string> invalidTransactions(vector<string>& transactions) {
        unordered_map<string,vector<Transaction>>mp;
        vector<string>invalid;
        for(auto it:transactions){
            Transaction t(it);
            if(t.amount>1000){
                t.isInvalid=1;
            }
            for(auto &ij:mp[t.name]){  
                string lstTransCity = ij.city;
                int lstTransTime = ij.time;
                if(lstTransCity!=t.city&&abs(t.time-lstTransTime)<=60){
                    if(ij.isInvalid==0){
                        invalid.push_back(ij.str);
                        ij.isInvalid=1;
                    }
                    t.isInvalid=1;
                }
            }
            if(t.isInvalid)
                invalid.push_back(t.str);
            mp[t.name].push_back(t);
        }
        return invalid;
    }
};
22300