Count of strings that does not contain any character of a given string
Last Updated :
22 Aug, 2023
Given an array arr containing N strings and a string str, the task is to find the number of strings that do not contain any character of string str.
Examples:
Input: arr[] = {"abcd", "hijk", "xyz", "ayt"}, str="apple"
Output: 2
Explanation: "hijk" and "xyz" are the strings that do not contain any character of str
Input: arr[] = {"apple", "banana", "pear"}, str="nil"
Output: 1
Approach: Follow the below steps to solve this problem:
- Create a set st and store each character of string str in this set.
- Create a variable ans to store the number of all the required strings.
- Now, start traversing on the array and for each string, check if any of its character is present in the set st or not. If it is, then this is not a required string.
- If it doesn't contain any character from the set, increase answer by 1.
- Return ans after the loop ends, as the answer to this problem.
Below is the implementation of the above approach:
C++
// C++ code for the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to count the number of strings
// that does not contain any character of string str
int allowedStrings(vector<string>& arr, string str)
{
int ans = 0;
unordered_set<char> st;
for (auto x : str) {
st.insert(x);
}
for (auto x : arr) {
bool allowed = 1;
for (auto y : x) {
// If the character is present in st
if (st.find(y) != st.end()) {
allowed = 0;
break;
}
}
// If the string doesn't
// have any character of st
if (allowed) {
ans += 1;
}
}
return ans;
}
// Driver Code
int main()
{
vector<string> arr
= { "abcd", "hijk", "xyz", "ayt" };
string str = "apple";
cout << allowedStrings(arr, str);
}
/*package whatever //do not write package name here */
import java.io.*;
import java.util.*;
class GFG {
// Function to count the number of strings
// that does not contain any character of string str
public static int allowedStrings(List<String> arr,
String str)
{
int ans = 0;
Set<Character> st = new HashSet<Character>();
char[] chararray = str.toCharArray();
for (Character x : chararray) {
st.add(x);
}
for (int i = 0; i < arr.size(); i++) {
String x = arr.get(i);
boolean allowed = true;
char[] chararray2 = x.toCharArray();
for (Character y : chararray2) {
// If the character is present in st
if (st.contains(y)) {
allowed = false;
break;
}
}
// If the string doesn't
// have any character of st
if (allowed) {
ans += 1;
}
}
return ans;
}
public static void main(String[] args)
{
List<String> arr = new ArrayList<String>();
arr.add("abcd");
arr.add("hijk");
arr.add("xyz");
arr.add("ayt");
String str = "apple";
System.out.println(allowedStrings(arr, str));
}
}
// This code is contributed by akashish__
# Python 3 code for the above approach
# Function to count the number of strings
# that does not contain any character of string str
def allowedStrings(arr, st):
ans = 0
st1 = set([])
for x in st:
st1.add(x)
for x in arr:
allowed = 1
for y in x:
# If the character is present in st1
if (y in st1):
allowed = 0
break
# If the string doesn't
# have any character of st
if (allowed):
ans += 1
return ans
# Driver Code
if __name__ == "__main__":
arr = ["abcd", "hijk", "xyz", "ayt"]
st = "apple"
print(allowedStrings(arr, st))
# This code is contributed by ukasp.
using System;
using System.Collections.Generic;
public class GFG{
// Function to count the number of strings
// that does not contain any character of string str
public static int allowedStrings(List<String> arr,
String str)
{
int ans = 0;
HashSet<char> st = new HashSet<char>();
for(int i=0;i<str.Length;i++)
{
st.Add(str[i]);
}
for (int i = 0; i < arr.Count; i++) {
String x = arr[i];
bool allowed = true;
for (int j=0;j<x.Length;j++) {
// If the character is present in st
if (st.Contains(x[j])) {
allowed = false;
break;
}
}
// If the string doesn't
// have any character of st
if (allowed==true) {
ans += 1;
}
}
return ans;
}
static public void Main (){
List<String> arr = new List<String>();
arr.Add("abcd");
arr.Add("hijk");
arr.Add("xyz");
arr.Add("ayt");
String str = "apple";
Console.WriteLine(allowedStrings(arr, str));
}
}
// This code is contributed by akashish__
<script>
// Javascript code for the above approach
// Function to count the number of strings
// that does not contain any character of string str
function allowedStrings(arr, str)
{
let ans = 0;
let st = new Set();
for (x of str) {
st.add(x);
}
for (x of arr) {
let allowed = 1;
for (y of x) {
// If the character is present in st
if (st.has(y)) {
allowed = 0;
break;
}
}
// If the string doesn't
// have any character of st
if (allowed) {
ans += 1;
}
}
return ans;
}
// Driver Code
let arr = ["abcd", "hijk", "xyz", "ayt"];
let str = "apple";
document.write(allowedStrings(arr, str));
// This code is contributed by gfgking.
</script>
Time Complexity: O(N*M), where N is the size of the array and M is the size of the longest string.
Auxiliary Space: O(N)
Approach:
To solve this problem is to iterate through each string in the given array and for each string, iterate through each character in the given string str. If a character in str is found in the current string, then we break the loop and move to the next string in the array. If none of the characters in str are found in the current string, then we increment a counter variable that keeps track of the number of strings that do not contain any character of str.
Implementation of the above approach:
C++
// C++ code for the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to count the number of strings
// that does not contain any character of string str
int allowedStrings(vector<string>& arr, string str)
{
int count = 0;
for (string s : arr) {
bool flag = true;
for (char c : str) {
if (s.find(c) != string::npos) {
flag = false;
break;
}
}
if (flag) {
count++;
}
}
return count;
}
// Driver Code
int main()
{
vector<string> arr
= { "abcd", "hijk", "xyz", "ayt" };
string str = "apple";
cout << allowedStrings(arr, str);
}
import java.util.*;
public class Main {
// Function to count the number of strings
// that does not contain any character of string str
public static int allowedStrings(List<String> arr, String str) {
int count = 0;
for (String s : arr) {
boolean flag = true;
for (char c : str.toCharArray()) {
if (s.indexOf(c) != -1) {
flag = false;
break;
}
}
if (flag) {
count++;
}
}
return count;
}
// Driver Code
public static void main(String[] args) {
List<String> arr = Arrays.asList("abcd", "hijk", "xyz", "ayt");
String str = "apple";
System.out.println(allowedStrings(arr, str));
}
}
# javascript code for the above approach
# Function to count the number of strings
# that does not contain any character of string str
def allowed_strings(arr, str):
count = 0
for s in arr:
flag = True
for c in str:
if c in s:
flag = False
break
if flag:
count += 1
return count
# Driver Code
if __name__ == "__main__":
arr = ["abcd", "hijk", "xyz", "ayt"]
str = "apple"
print(allowed_strings(arr, str))
using System;
using System.Collections.Generic;
public class MainClass
{
// Function to count the number of strings
// that does not contain any character of string str
public static int allowedStrings(List<string> arr, string str)
{
int count = 0;
foreach (string s in arr)
{
bool flag = true;
foreach (char c in str)
{
if (s.Contains(c))
{
flag = false;
break;
}
}
if (flag)
{
count++;
}
}
return count;
}
// Driver Code
public static void Main()
{
List<string> arr = new List<string> { "abcd", "hijk", "xyz", "ayt" };
string str = "apple";
Console.WriteLine(allowedStrings(arr, str));
}
}
// Function to count the number of strings
// that do not contain any character of string str
function allowedStrings(arr, str) {
let count = 0; // Initialize a variable to store the count of allowed strings
for (let s of arr) { // Loop through each string in the array arr
let flag = true; // Initialize a flag to true, assuming the current string is allowed
// Loop through each character in the string str
for (let c of str) {
// Check if the current character c exists in the current string s
// If it does, set the flag to false, indicating the string is not allowed
if (s.indexOf(c) !== -1) {
flag = false;
break;
}
}
// If the flag is still true after checking all characters in str,
// it means the current string s does not contain any character from str,
// so we increment the count of allowed strings.
if (flag) {
count++;
}
}
return count; // Return the final count of allowed strings.
}
// Driver Code
const arr = ["abcd", "hijk", "xyz", "ayt"]; // Input array of strings
const str = "apple"; // Input string
console.log(allowedStrings(arr, str)); // Call the function and log the result to the console.
Time Complexity: O(N*M)
Space Complexity: O(1)
Similar Reads
Count of sub-strings that do not consist of the given character Given a string str and a character c. The task is to find the number of sub-strings that do not consist of the character c. Examples: Input: str = "baa", c = 'b' Output: 3 The sub-strings are "a", "a" and "aa" Input: str = "ababaa", C = 'b' Output: 5 Approach: Initially take a counter that counts th
12 min read
Count binary Strings that does not contain given String as Subsequence Given a number N and string S, count the number of ways to create a binary string (containing only '0' and '1') of size N such that it does not contain S as a subsequence. Examples: Input: N = 3, S = "10".Output: 4Explanation: There are 8 strings possible to fill 3 positions with 0's or 1's. {"000",
15+ min read
Count of substrings containing only the given character Given a string S and a character C, the task is to count the number of substrings of S that contains only the character C.Examples: Input: S = "0110111", C = '1' Output: 9 Explanation: The substrings containing only '1' are: "1" — 5 times "11" — 3 times "111" — 1 time Hence, the count is 9. Input: S
6 min read
Count the sum of count of distinct characters present in all Substrings Given a string S consisting of lowercase English letters of size N where (1 <= N <= 105), the task is to print the sum of the count of distinct characters N where (1 <= N <= 105)in all the substrings. Examples: Input: str = "abbca"Output: 28Explanation: The following are the substrings o
8 min read
Total length of string from given Array of strings composed using given characters Given a list of characters and an array of strings, find the total length of all strings in the array of strings that can be composed using the given characters.Examples: Input: string = ["mouse", "me", "bat", "lion"], chars = "eusamotb" Output: 10 Explanation: The strings that can be formed using t
6 min read