Limited Time Offer:Up to 25% off Hello Interview Premium

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Low Level Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Tutor

Get Premium

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

Question Timeline

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

Company

Level

Region

Late December, 2024

Google

Principal

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 187. Repeated DNA Sequences

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact