Given a DNA string s composed of 'A','C','G','T', return the number of distinct 10-letter-long substrings that occur more than once in s.
Input: A quoted DNA string.
Output: Integer — count of repeated 10-mers.
Input: "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"
Output: 2
Explanation: Two 10-mers repeat.Input: "AAAAAAAAAAAAA"
Output: 1
Explanation: 'AAAAAAAAAA' repeats.Input: "ACGT"
Output: 0
Explanation: Too short.0<=s.length<=10^5s[i] in {A,C,G,T}