<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]:
        
        if transactions is None or len(transactions) == 0:
            return []
        
        name_trans_map = defaultdict(list)
        for idx in range(len(transactions)):
            name_trans_map[transactions[idx][0]].append(idx)
            
        print(name_trans_map)
        resList = []
        visited = [False for _ in range(len(transactions))]
        for i_name, idxList in name_trans_map.items():
            for i in range(len(idxList)):
                i_trans = transactions[idxList[i]].split(',')
                if int(i_trans[2]) > 1000:
                    if visited[idxList[i]] == False:
                        resList.append(transactions[idxList[i]])
                        visited[idxList[i]] = True
                for j in range(i + 1, len(idxList)):
                    j_trans = transactions[idxList[j]].split(',')
                    if int(j_trans[2]) > 1000:
                        if visited[idxList[j]] == False:
                            resList.append(transactions[idxList[j]])
                            visited[idxList[j]] = True
                    # print(i_trans, j_trans)
                    if i_trans[3] == j_trans[3] or abs(int(i_trans[1]) - int(j_trans[1])) > 60:
                        continue
                    if visited[idxList[i]] == False:
                        resList.append(transactions[idxList[i]])
                        visited[idxList[i]] = True
                    if visited[idxList[j]] == False:
                        resList.append(transactions[idxList[j]])
                        visited[idxList[j]] = True
                    
        return resList
189