<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> get_details(string curr){
        vector<string> ans;
        string curr_it="";
        for(int i=0;i<curr.length();i++){
            if(curr[i]==','){
                ans.push_back(curr_it);
                curr_it="";
            }
            else{
                curr_it+=curr[i];
            }
        }
        ans.push_back(curr_it);
        ans.push_back(curr);
        ans.push_back("0");
        return ans;
    }
    vector<string> invalidTransactions(vector<string>& transactions) {
        int n=transactions.size();
        unordered_map<string, vector<vector<string>>> mp;
        vector<string> ans;
        for(int i=0;i<n;i++){
            string curr_transact=transactions[i];
            vector<string> curr_details=get_details(curr_transact);
            int curr_time=stoi(curr_details[1]);
            string curr_city=curr_details[3];
            bool master_ins=false;
            if(stoi(curr_details[2])>1000){
                if(curr_details[0]=="alex") cout<<"a"<<" :"<<curr_details[4]<<endl;
                ans.push_back(curr_details[4]);
                master_ins=true;
                curr_details[5]="1";
                mp[curr_details[0]].push_back(curr_details);
            }
            // else
            // {
                bool insert=false;

                for(auto& past: mp[curr_details[0]]){
                    if(abs(stoi(past[1])-curr_time)<=60 && past[3]!=curr_city){
                        if(past[5]!="1"){
                            if(past[0]=="alex") cout<<"b"<<" :"<<past[4]<<","<<past[5]<<endl;
                            past[5]="1";
                            //if(past[0]=="alex") cout<<"b"<<" :"<<past[4]<<","<<past[5]<<endl;
                            ans.push_back(past[4]);
                        }
                        insert=true;
                    }
                }

                if(insert){
                    if(curr_details[0]=="alex") cout<<"c"<<" :"<<curr_details[4]<<endl;
                    if(!master_ins){
                        ans.push_back(curr_details[4]);
                        curr_details[5]="1";
                    }
                    
                }

                mp[curr_details[0]].push_back(curr_details);
            // }
        }

        cout<<"FINAL OUTPUTS"<<endl;

        for(auto &el: mp["alex"]) cout<<el[4]<<","<<el[5]<<endl;
        return ans;
    }
};
26200