<p>The <strong>DNA sequence</strong> is composed of a series of nucleotides abbreviated as <code>&#39;A&#39;</code>, <code>&#39;C&#39;</code>, <code>&#39;G&#39;</code>, and <code>&#39;T&#39;</code>.</p>

<ul>
	<li>For example, <code>&quot;ACGAATTCCG&quot;</code> is a <strong>DNA sequence</strong>.</li>
</ul>

<p>When studying <strong>DNA</strong>, it is useful to identify repeated sequences within the DNA.</p>

<p>Given a string <code>s</code> that represents a <strong>DNA sequence</strong>, return all the <strong><code>10</code>-letter-long</strong> sequences (substrings) that occur more than once in a DNA molecule. 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> s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"
<strong>Output:</strong> ["AAAAACCCCC","CCCCCAAAAA"]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "AAAAAAAAAAAAA"
<strong>Output:</strong> ["AAAAAAAAAA"]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s[i]</code> is either <code>&#39;A&#39;</code>, <code>&#39;C&#39;</code>, <code>&#39;G&#39;</code>, or <code>&#39;T&#39;</code>.</li>
</ul>

class Solution {
public:
    std::vector<std::string>
    findRepeatedDnaSequences(const std::string_view s) {
        if(s.size() < 10)
            return {};

        std::unordered_map<uint64_t, uint32_t> sequences;

        uint64_t code=
                (uint64_t(s[0] - 'A') <<  0u) |
                (uint64_t(s[1] - 'A') <<  5u) |
                (uint64_t(s[2] - 'A') << 10u) |
                (uint64_t(s[3] - 'A') << 15u) |
                (uint64_t(s[4] - 'A') << 20u) |
                (uint64_t(s[5] - 'A') << 25u) |
                (uint64_t(s[6] - 'A') << 30u) |
                (uint64_t(s[7] - 'A') << 35u) |
                (uint64_t(s[8] - 'A') << 40u) |
                (uint64_t(s[9] - 'A') << 45u);

        const uint64_t digits_mask= (uint64_t(1) << 50u) - 1u;
        for (size_t i = 10; i <= s.size(); ++i)
        {
            ++sequences[code];
            if(i < s.size())
                code= (code >> 5u) | (uint64_t(s[i] - 'A') << 45u);
        }
        std::vector<std::string> res;
        for (const auto& pair : sequences)
            if (pair.second > 1)
            {
                std::string sequence;
                sequence.resize(10);
                for(uint32_t i= 0 ;i < 10; ++i)
                    sequence[i]= 'A' + ((pair.first >> (i * 5u)) & 31u);
                res.emplace_back(sequence);
            }
        return res;
    }
};
17140