<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:
    def invalidTransactions(self, transactions: List[str]) -> List[str]:
        '''def sortby(listy):
            for i in range(len(listy)):
                listy[i] = listy[i].split(",")
            
            print("st",listy)
            thesort = sorted(listy,key = lambda x: x[1])
            for i in range(len(listy))

        transactions = sortby(transactions)'''

        mapping = {}#name: (time,city)
        invalids = [] 
        invalidids = set()
        for i in range(len(transactions)):
            item = transactions[i]
            x = item.split(",")
            name,time,amount,city = x[0],int(x[1]),x[2],x[3]
            if int(amount) >= 1000:
                if name in mapping:
                    mapping[name].append((time,city,i))

                else:
                    mapping[name]= [(time,city,i)]
                print("Added",name,time,amount,city)
                invalidids.add(i)
            if name in mapping:
                #check against previous ones
                stuff = mapping[name]
                #list of tuples
                print(stuff,"Curr",item)
                for tup in stuff:
           
                    time2,city2,index = int(tup[0]),tup[1],tup[2]
                    if abs(time2-time) <= 60 and city2 != city:
                        invalidids.add(index)
                        invalidids.add(i)
                mapping[name].append((time,city,i))
            else:
                mapping[name] = [(time,city,i)]
        print(invalidids)
        for x in invalidids:
            invalids.append(transactions[x])
        return(invalids)
            


           
219