Skip to content

Practice Repeated DNA Sequences

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#187
LeetCode Problem

Repeated DNA Sequences

Problem Statement

The DNA sequence is composed of a series of nucleotides abbreviated as 'A', 'C', 'G', and 'T'. When studying DNA, it is useful to identify repeated sequences within the DNA. 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.

Source: Repeated DNA Sequences on LeetCode. Use the original task for its coding environment and submissions.

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

Related LeetCode Problems

Practice more problems similar to Repeated DNA Sequences.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.