Repeated DNA Sequences - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
187. Repeated DNA Sequences
Medium
30 Points
Hash Table
String
Bit Manipulation
Sliding Window
Rolling Hash
Hash Function
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.
Examples
Example 1
Input: s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"
Output: ["AAAAACCCCC","CCCCCAAAAA"]
Example 2
Input: s = "AAAAAAAAAAAAA"
Output: ["AAAAAAAAAA"]
Constraints
1 <= s.length <= 105
s[i] is either 'A', 'C', 'G', or 'T'.
187. Repeated DNA Sequences
Medium
30 Points
Hash Table
String
Bit Manipulation
Sliding Window
Rolling Hash
Hash Function
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.
Examples
Example 1
Input: s = "AAAAACCCCCAAAAACCCCCCAAAAAGGGTTT"
Output: ["AAAAACCCCC","CCCCCAAAAA"]