Number of substrings with each character occurring even times
Last Updated :
01 May, 2023
Given a string S consisting of N lowercase alphabets, the task is to count the number of substrings whose frequency of each character is even.
Examples:
Input: S = "abbaa"
Output: 4
Explanation:
The substrings having frequency of each character is even are {"abba", "aa", "bb", "bbaa"}.
Therefore, the count is 4.
Input: S = "geeksforgeeks"
Output: 2
BruteForce Approach :
We can traverse the nested for loops two times to find the ranges of the subarrays and one extra nested for loop for checking that all character is even or not. For more clarity follow the process.
Steps:
1.Run a for loop to traverse the input string.
2.Now we have to find all the ranges possible.For that traverse a nested for loop.
3.In each range for finding the occurrence of even number of character .
4. We can do that by doing xor operation among all the element.
5. If the xor is 0 then all character present in even number of times and increment the counting variable.
6. After traversing all possible rnages Output the cnt.
Implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
void findevenone(string s, int n)
{
int cnt = 0; // Counter variablr
// For loop for traversing all the rages for possible
// substring
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int xoro = 0;
for (int k = i; k <= j; k++) {
xoro ^= s[k];
}
if (xoro == 0)
cnt++;
}
}
cout << cnt << endl; // Output it
return;
}
signed main()
{
string str = "abbaa"; // Initialize the string
int size = str.size();
cout << "Number of substring with even number of characters is : ";
findevenone(str, size); // Calling the function
return 0;
}
import java.util.*;
public class Main {
public static void findevenone(String s, int n)
{
int cnt = 0; // Counter variable
// For loop for traversing all the ranges for
// possible substring
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int xoro = 0;
for (int k = i; k <= j; k++) {
xoro ^= s.charAt(k);
}
if (xoro == 0)
cnt++;
}
}
System.out.println(cnt); // Output it
return;
}
public static void main(String[] args)
{
String str = "abbaa"; // Initialize the string
int size = str.length();
System.out.print(
"Number of substring with even number of characters is : ");
findevenone(str, size); // Calling the function
}
}
def findevenone(s: str, n: int) -> None:
cnt = 0 # Counter variable
# For loop for traversing all the rages for possible
# substring
for i in range(n):
for j in range(i, n):
xoro = 0
for k in range(i, j + 1):
xoro ^= ord(s[k])
if xoro == 0:
cnt += 1
print(cnt) # Output it
str = "abbaa" # Initialize the string
size = len(str)
print("Number of substring with even number of characters is: ", end="")
findevenone(str, size) # Calling the function
using System;
class Program {
static void findevenone(string s, int n)
{
int cnt = 0; // Counter variable
// For loop for traversing all the rages for
// possible substring
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
int xoro = 0;
for (int k = i; k <= j; k++) {
xoro ^= s[k];
}
if (xoro == 0)
cnt++;
}
}
Console.WriteLine(cnt); // Output it
}
static void Main(string[] args)
{
string str = "abbaa"; // Initialize the string
int size = str.Length;
Console.Write(
"Number of substring with even number of characters is : ");
findevenone(str, size); // Calling the function
}
}
// Define a function to find the number of substrings with an even number of characters
function findevenone(s, n) {
let cnt = 0; // Counter variable
// Nested for loop for traversing all possible substrings
for (let i = 0; i < n; i++) {
for (let j = i; j < n; j++) {
let xoro = 0;
// For loop to XOR all characters in the current substring
for (let k = i; k <= j; k++) {
xoro ^= s.charCodeAt(k);
}
// Increment counter if the XOR of the substring is zero
if (xoro == 0) cnt++;
}
}
console.log("Number of substring with even number of characters is : " + cnt); // Output the result
}
// Main function
function main() {
let str = "abbaa"; // Initialize the string
let size = str.length;
findevenone(str, size); // Call the function to find the number of substrings with even number of characters
}
// Call the main function
main();
OutputNumber of substring with even number of characters is : 4
Time Complexity :O(N3)
Space Complexity: O(1)
Naive Approach: The simplest approach to solve the given problem is to generate all possible substrings of the given string and count those substrings having even frequency of every character. After checking for all substrings, print the total count obtained.
Below is the implementation of the above approach:
C++
// C++ program for the above approach
// Function to count substrings having
// even frequency of each character
#include<bits/stdc++.h>
using namespace std;
int subString(string s,int n)
{
// Stores the total
// count of substrings
int count = 0;
// Traverse the range [0, N]:
for(int i = 0; i < n; i++)
{
// Traverse the range [i + 1, N]
for(int len = 1; len <= (n-i); len++)
{
// Stores the substring over
// the range of indices [i, len]
string test_str = s.substr(i, len);
// Stores the frequency of characters
unordered_map<char,int>res;
// Count frequency of each character
for(auto keys : test_str) res[keys]++;
int flag = 0;
// Traverse the dictionary
for(auto key : res)
{
// If any of the keys
// have odd count
if (key.second % 2 != 0)
{
flag = 1;
break;
}
}
// Otherwise
if (flag == 0)
{
count ++;
}
}
}
// Return count
return count;
}
// Driver Code
int main()
{
string S = "abbaa";
int N = S.length();
cout<<subString(S,N)<<endl;
}
// This code is contributed by shinjanpatra
// Java program for the above approach
import java.io.*;
import java.lang.*;
import java.util.*;
public class GFG
{
// Function to count substrings having
// even frequency of each character
static int subString(String s, int n)
{
// Stores the total
// count of substrings
int count = 0;
// Traverse the range [0, N]:
for (int i = 0; i < n; i++) {
// Traverse the range [i + 1, N]
for (int len = i + 1; len <= n; len++) {
// Stores the substring over
// the range of indices [i, len]
String test_str = s.substring(i, len);
// Stores the frequency of characters
HashMap<Character, Integer> res
= new HashMap<>();
// Count frequency of each character
for (char keys : test_str.toCharArray()) {
res.put(keys,
res.getOrDefault(keys, 0) + 1);
}
int flag = 0;
// Traverse the dictionary
for (char keys : res.keySet()) {
// If any of the keys
// have odd count
if (res.get(keys) % 2 != 0) {
flag = 1;
break;
}
}
// Otherwise
if (flag == 0)
count += 1;
}
}
// Return count
return count;
}
// Driver Code
public static void main(String[] args)
{
String S = "abbaa";
int N = S.length();
System.out.println(subString(S, N));
}
}
// This code is contributed by Kingash.
# Python program for the above approach
# Function to count substrings having
# even frequency of each character
def subString(s, n):
# Stores the total
# count of substrings
count = 0
# Traverse the range [0, N]:
for i in range(n):
# Traverse the range [i + 1, N]
for len in range(i + 1, n + 1):
# Stores the substring over
# the range of indices [i, len]
test_str = (s[i: len])
# Stores the frequency of characters
res = {}
# Count frequency of each character
for keys in test_str:
res[keys] = res.get(keys, 0) + 1
flag = 0
# Traverse the dictionary
for keys in res:
# If any of the keys
# have odd count
if res[keys] % 2 != 0:
flag = 1
break
# Otherwise
if flag == 0:
count += 1
# Return count
return count
# Driver Code
S = "abbaa"
N = len(S)
print(subString(S, N))
// C# program for the above approach
using System;
using System.Collections.Generic;
public class GFG{
// Function to count substrings having
// even frequency of each character
static int subString(string s, int n)
{
// Stores the total
// count of substrings
int count = 0;
// Traverse the range [0, N]:
for (int i = 0; i < n; i++) {
// Traverse the range [i + 1, N]
for (int len = i + 1; len <= n; len++) {
// Stores the substring over
// the range of indices [i, len]
string test_str = s.Substring(i, len-i);
// Stores the frequency of characters
Dictionary<char,int> res
= new Dictionary<char,int>();
// Count frequency of each character
foreach (char keys in test_str.ToCharArray()) {
if(!res.ContainsKey(keys))
res.Add(keys,0);
res[keys]++;
}
int flag = 0;
// Traverse the dictionary
foreach (KeyValuePair<char,int> keys in res) {
// If any of the keys
// have odd count
if (keys.Value % 2 != 0) {
flag = 1;
break;
}
}
// Otherwise
if (flag == 0)
count += 1;
}
}
// Return count
return count;
}
// Driver Code
static public void Main (){
string S = "abbaa";
int N = S.Length;
Console.WriteLine(subString(S, N));
}
}
// This code is contributed by rag2127.
<script>
// JavaScript program for the above approach
// Function to count substrings having
// even frequency of each character
function subString(s, n)
{
// Stores the total
// count of substrings
var count = 0;
// Traverse the range [0, N]:
for(var i = 0; i < n; i++)
{
// Traverse the range [i + 1, N]
for(var len = i + 1; len <= n; len++)
{
// Stores the substring over
// the range of indices [i, len]
var test_str = s.substring(i, len);
// Stores the frequency of characters
var res = {};
// Count frequency of each character
var temp = test_str.split("");
for(const keys of temp)
{
res[keys] = (res[keys] ? res[keys] : 0) + 1;
}
var flag = 0;
// Traverse the dictionary
for(const [key, value] of Object.entries(res))
{
// If any of the keys
// have odd count
if (res[key] % 2 != 0)
{
flag = 1;
break;
}
}
// Otherwise
if (flag == 0) count += 1;
}
}
// Return count
return count;
}
// Driver Code
var S = "abbaa";
var N = S.length;
document.write(subString(S, N));
// This code is contributed by rdtank
</script>
Time Complexity: O(N2 * 26)
Auxiliary Space: O(N)
Efficient Approach: The above approach can be optimized by using the concept of Bitmasking and dictionary. Follow the below steps to solve the problem:
- Initialize a dictionary, say hash to store the count of a character.
- Initialize two variables, say count as 0 and pre as 0 to store the total count of substrings having an even count of each character and to store the mask of characters included in the substring.
- Traverse the given string and perform the following steps:
- Flip the (S[i] - 'a')th bit in the variable pre.
- Increment the count by hash[pre] and the count of pre in the hash.
- After completing the above steps, print the value of count as the result.
Below is the implementation of the above approach:
C++
// C ++ program for the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to count substrings having
// even frequency of each character
int subString(string s, int n)
{
// Stores the count of a character
map<int, int> hash;
hash[0] = 1;
// Stores bitmask
int pre = 0;
// Stores the count of substrings
// with even count of each character
int count = 0;
// Traverse the string S
for (int i = 0; i < n; i++) {
// Flip the ord(i)-97 bits in pre
pre ^= (1 << int(s[i]) - 97);
// Increment the count by hash[pre]
count += hash[pre];
// Increment count of pre in hash
hash[pre] = hash[pre] + 1;
}
// Return the total count obtained
return count;
}
// Driver Code
int main()
{
string S = "abbaa";
int N = S.length();
cout << (subString(S, N));
}
// THIS CODE IS CONTRIBUTED BY UKASP.
// Java program for the above approach
import java.util.*;
import java.lang.*;
class GFG{
// Function to count substrings having
// even frequency of each character
static int subString(String s, int n)
{
// Stores the count of a character
Map<Integer, Integer> hash = new HashMap<>();
hash.put(0, 1);
// Stores bitmask
int pre = 0;
// Stores the count of substrings
// with even count of each character
int count = 0;
// Traverse the string S
for(int i = 0; i < n; i++)
{
// Flip the ord(i)-97 bits in pre
pre ^= (1 << (int)(s.charAt(i) - 97));
// Increment the count by hash[pre]
count += hash.getOrDefault(pre, 0);
// Increment count of pre in hash
hash.put(pre, hash.getOrDefault(pre, 0) + 1);
}
// Return the total count obtained
return count;
}
// Driver code
public static void main(String[] args)
{
String S = "abbaa";
int N = S.length();
System.out.print(subString(S, N));
}
}
// This code is contributed by offbeat
# Python program for the above approach
# Function to count substrings having
# even frequency of each character
def subString(s, n):
# Stores the count of a character
hash = {0: 1}
# Stores bitmask
pre = 0
# Stores the count of substrings
# with even count of each character
count = 0
# Traverse the string S
for i in s:
# Flip the ord(i)-97 bits in pre
pre ^= (1 << ord(i) - 97)
# Increment the count by hash[pre]
count += hash.get(pre, 0)
# Increment count of pre in hash
hash[pre] = hash.get(pre, 0) + 1
# Return the total count obtained
return count
# Driver Code
S = "abbaa"
N = len(S)
print(subString(S, N))
// C# program for the above approach
using System.IO;
using System;
using System.Collections.Generic;
class GFG{
// Function to count substrings having
// even frequency of each character
static int subString(string s, int n)
{
// Stores the count of a character
Dictionary<int,
int> hash = new Dictionary<int,
int>();
hash[0] = 1;
// Stores bitmask
int pre = 0;
// Stores the count of substrings
// with even count of each character
int count = 0;
// Traverse the string S
for(int i = 0; i < n; i++)
{
// Flip the ord(i)-97 bits in pre
pre ^= (1 << (int)(s[i]) - 97);
// Increment the count by hash[pre]
if (hash.ContainsKey(pre))
count += hash[pre];
else
count += 0;
// Increment count of pre in hash
if (hash.ContainsKey(pre))
hash[pre] = hash[pre] + 1;
else
hash.Add(pre, 1);
}
// Return the total count obtained
return count;
}
// Driver code
static void Main()
{
String S = "abbaa";
int N = S.Length;
Console.WriteLine(subString(S, N));
}
}
// This code is contributed by sk944795
<script>
// JavaScript program for the above approach
// Function to count substrings having
// even frequency of each character
function subString(s,n)
{
// Stores the count of a character
let hash = new Map();
hash.set(0, 1);
// Stores bitmask
let pre = 0;
// Stores the count of substrings
// with even count of each character
let count = 0;
// Traverse the string S
for(let i = 0; i < n; i++)
{
// Flip the ord(i)-97 bits in pre
pre ^= (1 << s[i].charCodeAt(0) - 97);
if(!hash.has(pre))
hash.set(pre,0);
// Increment the count by hash[pre]
count += (hash.get(pre));
// Increment count of pre in hash
hash.set(pre, hash.get(pre)==null? 0 : hash.get(pre)+1);
}
// Return the total count obtained
return count;
}
// Driver code
let S = "abbaa";
let N = S.length;
document.write(subString(S, N));
// This code is contributed by avanitrachhadiya2155
</script>
Time Complexity: O(N)
Auxiliary Space: O(N)
Similar Reads
Count substrings with each character occurring at most k times
Given a string S. Count number of substrings in which each character occurs at most k times. Assume that the string consists of only lowercase English alphabets. Examples: Input : S = ab k = 1 Output : 3 All the substrings a, b, ab have individual character count less than 1. Input : S = aaabb k = 2
15+ min read
Number of substrings with count of each character as k
Given a string and an integer k, find the number of substrings in which all the different characters occur exactly k times. Examples: Input : s = "aabbcc" k = 2 Output : 6 The substrings are aa, bb, cc, aabb, bbcc and aabbcc. Input : s = "aabccc" k = 2 Output : 3 There are three substrings aa, cc an
15 min read
Find minimum number of Substrings with unique characters
Given string 's', the task is to divide a given string s into multiple substrings, with each substring containing only unique characters. This means that no character should be repeated within a single substring. The goal is to find the minimum number of such substrings required to satisfy this cond
12 min read
Count of substrings which contains a given character K times
Given a string consisting of numerical alphabets, a character C and an integer K, the task is to find the number of possible substrings which contains the character C exactly K times. Examples: Input : str = "212", c = '2', k = 1 Output : 4 Possible substrings are {"2", "21", "12", "2"} that contain
9 min read
Length of the longest substring with every character appearing even number of times
Content has been removed on Author’s request.
1 min read
Create a string with unique characters from the given N substrings
Given an array arr[] containing N substrings consisting of lowercase English letters, the task is to return the minimum length string that contains all given parts as a substring. All characters in this new answer string should be distinct. If there are multiple strings with the following property p
11 min read
Count Substrings with even frequency of each character and one exception
Given a string S ('a' ? S[i] ? 't') of length N (1 ? N ? 105), which consists of lowercase English alphabets, the task is to count all substrings such that the frequency of all characters should be even or all characters should occur an even number of times except any one character which might occur
6 min read
Lexicographically Largest Substring having each Characters even times
Given a string S of length N (1 ≤ N ≤ 105) that consists of lowercase English letters. The task is to find a substring such that rearranging the characters within a substring makes it lexicographically the largest valid substring. A substring is invalid if all characters occur an even number of time
8 min read
Count M-length substrings occurring exactly K times in a string
Given a string S of length N and two integers M and K, the task is to count the number of substrings of length M occurring exactly K times in the string S. Examples: Input: S = "abacaba", M = 3, K = 2Output: 1Explanation: All distinct substrings of length 3 are "aba", "bac", "aca", "cab".Out of all
15+ min read
Find the number of Substrings with even number of K
Given a string str of length N and an integer K, the task is to count the number of substrings with even numbers of K. It means the count of 'K' in each substring will be even and must not be zero. Examples: Input: N = 4, str = "2131", K = 1Output: 2 Explanation: There are two substrings "2131" and
8 min read