Search
⌘K

Leetcode 187. Repeated DNA Sequences

Find all distinct 10-letter substrings of a DNA string that occur more than once. This is typically solved by scanning with a sliding window and detecting repeats efficiently using hashing or compact 2-bit encoding to handle lengths up to 10^5.

Asked at:

Google

Google


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Late December, 2024

Google

Google

Principal

Your account is free and you can post anonymously if you choose.