Find Words That Can Be Formed by Characters Tamil Tutorial C++ (LeetCode 1160 Easy)

Опубликовано: 23 Июль 2026
на канале: Akhil Chakravarthy - Tamil Coding Tutorials
480
8

Hey Guys! I teach competitive coding questions in Tamil:)
Any suggestions welcome:)
Thanks for watching :D

Follow me on Instagram (@code_chak): https://instagram.com/code_chak?igshi...
Follow me on LinkedIn:   / akhilchakravarthy  
Problem link: https://leetcode.com/problems/find-wo...
Problem Description:
You are given an array of strings words and a string chars.

A string is good if it can be formed by characters from chars (each character can only be used once).

Return the sum of lengths of all good strings in words.



Example 1:

Input: words = ["cat","bt","hat","tree"], chars = "atach"
Output: 6
Explanation:
The strings that can be formed are "cat" and "hat" so the answer is 3 + 3 = 6.
Example 2:

Input: words = ["hello","world","leetcode"], chars = "welldonehoneyr"
Output: 10
Explanation:
The strings that can be formed are "hello" and "world" so the answer is 5 + 5 = 10.