Skip to content

Practice Check if a String Is an Acronym of Words

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

Easy#2828
LeetCode Problem

Check if a String Is an Acronym of Words

Problem Statement

Given an array of strings words and a string s, determine if s is an acronym of words. The string s is considered an acronym of words if it can be formed by concatenating the first character of each string in words in order. For example, "ab" can be formed from ["apple", "banana"], but it can't be formed from ["bear", "aardvark"]. Return true if s is an acronym of words, and false otherwise.

Source: Check if a String Is an Acronym of Words on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
words = ["alice","bob","charlie"], s = "abc"
Output
true

# Example 2

Input
words = ["an","apple"], s = "a"
Output
false

# Example 3

Input
words = ["never","gonna","give","up","on","you"], s = "ngguoy"
Output
true

Constraints

1 <= words.length <= 100
1 <= words[i].length <= 10
1 <= s.length <= 100
words[i] and s consist of lowercase English letters.

Related LeetCode Problems

Practice more problems similar to Check if a String Is an Acronym of Words.

Review your practice with PhantomCodeAI

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