<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>

#include <ranges>

struct Transaction {
    std::string_view name;
    int time;
    int amount;
    std::string_view city;
    
    std::string_view orig;
    
    Transaction(std::string_view transaction) : orig(transaction) {
        auto rng = transaction | std::views::split(',');
        auto const v = std::vector(rng.begin(), rng.end());
        name = std::string_view(v[0]);
        std::from_chars(v[1].begin(), v[1].end(), time);
        std::from_chars(v[2].begin(), v[2].end(), amount);
        city = std::string_view(v[3]);
    }
    
};
class Solution {
public:
    vector<string> invalidTransactions(vector<string>& transactions_) {
        
        auto transactions = std::vector<Transaction>{};
        std::ranges::transform(transactions_, std::back_inserter(transactions), [](std::string_view sv){ return Transaction(sv); });
        
        std::ranges::sort(transactions, {}, [&](auto const& t){ return t.time; });
        
        auto flagged = std::unordered_set<Transaction const*>{};
        
        auto mostRecent = std::deque<Transaction const*>{};
        
        for (auto const& transaction : transactions) {
            
            while (!mostRecent.empty() && transaction.time - mostRecent.front()->time > 60) {
                mostRecent.pop_front();
            }
            
            for (auto const& other : mostRecent) {
                if (other->name == transaction.name && other->city != transaction.city) {
                    flagged.insert(&transaction);
                    flagged.insert(other);
                }
            }
            
            if (transaction.amount > 1000) flagged.insert(&transaction);
            
            mostRecent.push_back(&transaction);
        }
        
        auto ret = std::vector<std::string>{};
        std::ranges::transform(flagged, std::back_inserter(ret), [](Transaction const* t) { return std::string(t->orig); });
        return ret;
    }
};
21100