How should I practice Unique DNA Sequences Under Circular Rotation?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Benchling online assessment problems in FastPrep.

Is Unique DNA Sequences Under Circular Rotation associated with Benchling?

FastPrep tags this as a Benchling online assessment coding practice problem when the problem catalog has that company and stage context.

Unique DNA Sequences Under Circular Rotation

Benchling● MediumFULLTIMEOA

Learn

Problem statement

Given DNA strings made of A, C, G, and T, count the distinct sequences when two strings are considered equal if one is a circular rotation of the other.

Function

countUniqueRotations(sequences: String[]) → int

Examples

Example 1

sequences = ["TGAAA","ATGAA","AATGA"]return = 1

All three strings belong to one rotation class.

Example 2

sequences = ["AAA","TAA","TAT","ATA"]return = 3

TAA, AAT, and ATA are rotations; AAA and TAT each form another class.

Constraints

1 <= sequences.length <= 1000.
All strings are non-empty, have the same length, and contain only A, C, G, and T.
Each string length is at most 200.