Create 1160. Find Words That Can Be Formed by Characters

Chayandas07 · Dec 2, 2023 · 695ece0 · 695ece0
1 parent e009605
commit 695ece0
Showing 1 changed file with 24 additions and 0 deletions.
diff --git a/1160. Find Words That Can Be Formed by Characters b/1160. Find Words That Can Be Formed by Characters
@@ -0,0 +1,24 @@
+class Solution {
+public:
+    int countCharacters(vector<string>& words, string chars) {
+        int ans = 0;
+        map<char, int> ss;
+        for(int i = 0; i < chars.length(); i++)
+            ss[chars[i]]++;
+        for(int i = 0; i < words.size(); i++)
+        {
+            int count = 0;
+            map<char, int> mp = ss;
+            for(int j = 0; j < words[i].length(); j++)
+            {
+                if((mp.find(words[i][j]) != mp.end()) && mp[words[i][j]] != 0){
+                    mp[words[i][j]]--;
+                    count++;
+                }      
+            }
+            if(count == words[i].length())
+                ans += count;
+        }
+        return ans;
+    }
+};