How should I practice Rotation with at Most Three Mismatches?

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

Is Rotation with at Most Three Mismatches associated with ZipRecruiter?

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

Rotation with at Most Three Mismatches

ZipRecruiter● MediumNEW GRADOA

Learn

Problem statement

Return whether second can be cyclically rotated so that it differs from first at no more than three positions.

The strings must have equal length. A rotation by zero positions is allowed.

Function

similarAfterRotation(first: String, second: String) → boolean

Examples

Example 1

first = "abcde"second = "cdeab"return = true

A cyclic shift produces an exact match.

Example 2

first = "abcdef"second = "xbcyez"return = true

The zero rotation differs at exactly three positions.

Constraints

0 <= first.length, second.length <= 2000
The strings contain lowercase English letters.