Practice Expressive Words

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#809

LeetCode Problem

Expressive Words

Array Two Pointers String

Problem Statement

Sometimes people repeat letters to represent extra feeling. For example: In these strings like "heeellooo", we have groups of adjacent letters that are all the same: "h", "eee", "ll", "ooo". You are given a string s and an array of query strings words. A query word is stretchy if it can be made to be equal to s by any number of applications of the following extension operation: choose a group consisting of characters c, and add some number of characters c to the group so that the size of the group is three or more. Return the number of query strings that are stretchy.

Source: Expressive Words on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

s = "heeellooo", words = ["hello", "hi", "helo"]

Output

# Example 2

Input

s = "zzzzzyyyyy", words = ["zzyy","zy","zyy"]

Output

Constraints

1 <= s.length, words.length <= 100

1 <= words[i].length <= 100

s and words[i] consist of lowercase letters.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free