Count the Number of Consistent Strings

Sizga ruxsat etilgan harflardan iborat allowed satri va words satrlar massivi berilgan.

Agar words dagi biror satr faqatgina allowed satrida mavjud bo'lgan harflardan tuzilgan bo'lsa, uni mos keluvchi (consistent) deb ataymiz.

Mos keluvchi satrlar sonini toping.

func solve(allowed string, words []string) int {
    // ...
}

Misollar

Input: allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
Output: 2
Tushuntirish: "aaab" va "baa" satrlari faqat 'a' va 'b' harflaridan tashkil topgan.

Input: allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
Output: 7

Input: allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
Output: 4

Maslahatlar

1. allowed satridagi harflarni tez tekshirish uchun 26 ta katakli boolean massiv (yoki set) tuzib oling.
2. Avval allowed harflarini belgilaydigan massiv tuzing, so'ngra har bir so'zning barcha harflari shu massivda true ekanligini tekshirib, mos kelgan so'zlarni sanang.