Search
⌘K
Get Premium
Leetcode 3475. DNA Pattern Recognition
Given a table of DNA sequences, produce four boolean flags per sample indicating whether the sequence starts with "ATG", ends with any of "TAA"/"TAG"/"TGA", contains the motif "ATAT", or has at least three consecutive "G"s, and return rows ordered by sample_id. This problem tests string/pattern-matching operations (prefix/suffix/substring/regex) to derive the flags.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.