How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Technical Screen rounds at Pinterest.

What role is this question designed for?

This question is commonly asked for Software Engineer candidates at Pinterest during technical interviews.

Find First Prefix-Matching Word | Pinterest Interview Question

Q: Find First Prefix-Matching Word

This question evaluates proficiency in string processing and prefix-matching within arrays, testing the ability to identify the first occurrence and handle cases such as empty inputs or no matches.

Given an array of strings words and a prefix string prefix, return the smallest index i such that words[i] starts with prefix. If no word matches, return -1.

Example:

words = ["a", "apple", "appz", "b"]
prefix = "ap"
Output: 1

Explanation: "apple" is the first word in the array that starts with "ap".

Find First Prefix-Matching Word

Quick Overview

Comments (0)