How should I practice Count Length-Three Windows with Matching Ends?

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

Is Count Length-Three Windows with Matching Ends associated with Visa?

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

Count Length-Three Windows with Matching Ends

Visa● EasyFULLTIMEOA

Learn

Problem statement

You are given a string text.

Count the contiguous substrings of length exactly 3 whose first and last characters are equal. Windows may overlap. Return the count.

Function

countMatchingEndpointTriples(text: String) → int

Examples

Example 1

text = "abcxccc"return = 2

The matching windows are cxc and ccc.

Example 2

text = "aba"return = 1

The only length-three window begins and ends with a.

Example 3

text = "ab"return = 0

A string shorter than three characters contains no eligible window.

Constraints

0 <= text.length <= 2 * 10⁵
text contains printable ASCII characters.