Repeated DNA Sequences

Statement

Given a string, dna, that represents a DNA subsequence, and a number $k$, return all the contiguous subsequences (substrings) of length $k$ that occur more than once in the string. The order of the returned subsequences does not matter. If no repeated substring is found, the function should return an empty set.

The DNA sequence is composed of a series of nucleotides abbreviated as $A$, $C$, $G$, and $T$. For example, $ACGAATTCCG$ is a DNA sequence. When studying DNA, it is useful to identify repeated sequences in it.

Constraints:

• $1$ $\leq$ dna.length $\leq$ $10^3$
• dna[i] is either A, C, G, or T.

• $1 \leq k \leq 10$

Examples