NeetCode #126LC-187MediumArrays & Hashing
← Back to All Problems#126 · #187 · Repeated DNA Sequences(重复的 DNA 序列)
📌 Problem Statement & Constraints
The DNA sequence is composed of
'A', 'C', 'G' and 'T'. Given a string s representing a DNA sequence, return all 10-letter-long substrings that occur more than once. Constraints: 1 <= s.length <= 10^5.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!