How should I practice Count Prefix Matches in a Sorted Array?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Count Prefix Matches in a Sorted Array associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Problem · String

Count Prefix Matches in a Sorted Array

● Medium

GoogleFULLTIMEONSITE INTERVIEW

See Google hiring insights

Problem statement

Given a lexicographically sorted array of lowercase strings words and a lowercase string prefix, return the number of array entries that begin with prefix.

Duplicate words count separately. For this exercise, assume all words and the prefix are non-empty and use ordinary lowercase lexicographic order.

The problem statement continues

Pro

Examples

Example 1

words = ["apple","apply","apt","banana"]prefix = "app"return = 2

Only apple and apply begin with app.

FastPrep Pro

Reported in 1 Google interview this week

Unlock this recently reported problem

FastPrep Pro gives you full access to interview problems reported within the last week.

Full problem statement and constraints
1 more worked example, explained
Guided hints and editorial
Run your code on real test cases

$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week