AlgoLounge

Repeated DNA Sequences

medium

LeetCode 187. Repeated DNA Sequences

The DNA sequence is composed of a series of nucleotides abbreviated as 'A', 'C', 'G', and 'T'.

Given a string s that represents a DNA sequence, return all the 10-letter-long sequences (substrings) that occur more than once in a DNA molecule. You may return the answer in any order.

Examples

Example 1

Input:  s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"
Output: ["AAAAACCCCC", "CCCCCAAAAA"]

Example 2

Input:  s = "AAAAAAAAAAAAA"
Output: ["AAAAAAAAAA"]

Constraints

  • 1 <= s.length <= 10^5
  • s[i] is either 'A', 'C', 'G', or 'T'
TypeScript
Loading editor…
List of test cases (10)
Case 1
s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"
Case 2
s = "AAAAAAAAAAAAA"
Case 3
s = "ACGT"
Case 4
s = "AAAAAAAAAAA"
Case 5
s = "ACGTACGTACGTACGT"
Case 6
s = "GAGAGAGAGAGAGAGAGAGA"
Case 7
s = "AAAAAAAAAA"
Case 8
s = "TTTTTTTTTTTTTTTTTTTTTTTTT"
Case 9
s = "ACGTACGTACACGTACGTAC"
Case 10
s = "CCCCCCCCCCCCCCCCCCCCCCCCCCCCCC"