Count the number of vowels occurring in all the substrings of given string
Last Updated :
12 Dec, 2022
Given a string of length N of lowercase characters containing 0 or more vowels, the task is to find the count of vowels that occurred in all the substrings of the given string.
Examples:
Input: str = "abc"
Output: 3
The given string "abc" contains only one vowel = 'a'
Substrings of "abc" are = {"a", "b", "c", "ab", "bc, "abc"}
Hence, the sum of occurrences of the vowel in these strings = 3.('a' occurred 3 times)
Input: str = "daceh"
Output: 16
Naive Approach: Given a string of length N, the number of substrings that can be formed=N(N+1)/2. A simple solution is for each substring, we count the occurrences of the vowels and add them to get the result. The time complexity of this approach is O(N3) which is not suitable for large values of N.
Efficient Approach: The idea is to use a prefix sum array-based technique where we store the occurrences of each character in all the substrings concatenated.
no. of occurrences = no. of substrings starting with the first character = N.
- For each of the following characters, we store the
no. of substrings starting with that character + the number of substrings formed by the previous characters containing this character - the number of substrings formed by the previous characters only.
Below is the implementation of the above approach:
C++
// C++ implementation of the above approach
#include <bits/stdc++.h>
using namespace std;
// Returns the total sum of
// occurrences of all vowels
int vowel_calc(string s)
{
int n = s.length();
vector<int> arr;
for (int i = 0; i < n; i++) {
if (i == 0)
// No. of occurrences of 0th character
// in all the substrings
arr.push_back(n);
else
// No. of occurrences of the ith character
// in all the substrings
arr.push_back((n - i) + arr[i - 1] - i);
}
int sum = 0;
for (int i = 0; i < n; i++)
// Check if ith character is a vowel
if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i'
|| s[i] == 'o' || s[i] == 'u')
sum += arr[i];
// Return the total sum
// of occurrences of vowels
return sum;
}
// Driver code
int main()
{
string s = "daceh";
cout << vowel_calc(s) << endl;
return 0;
}
// Java implementation of the above approach
import java.io.*;
import java.util.*;
public class Gfg {
// Returns the total sum of
// occurrences of all vowels
static int vowel_calc(String s)
{
int n = s.length();
int arr[] = new int[n];
for (int i = 0; i < n; i++) {
if (i == 0)
// No. of occurrences of 0th character
// in all the substrings
arr[i] = n;
else
// No. of occurrences of ith character
// in all the substrings
arr[i] = (n - i) + arr[i - 1] - i;
}
int sum = 0;
for (int i = 0; i < n; i++) {
char ch = s.charAt(i);
// Check if ith character is a vowel
if (ch == 'a' || ch == 'e' || ch == 'i'
|| ch == 'o' || ch == 'u')
sum += arr[i];
}
// Return the total sum
// of occurrences of vowels
return sum;
}
// Driver Code
public static void main(String args[])
{
String s = "daceh";
System.out.println(vowel_calc(s));
}
}
# Python 3 implementation of
# a more efficient approach.
# return sum of all occurrences of all vowels
def sumVowel(string):
n = len(string)
sum = 0
string = string.lower()
# iterate through every character in the string
for i in range(0, n):
s = string[i]
# checks if the character is a vowel or not
if (s=="a" or s == "e" or s == "i" or s == "o" or s == "u"):
# uses below expression to calculate the count
# of all occurrences of character in substrings
# of the string
sum += ((n - i) * (i + 1))
# return the total sum of occurrence
return sum
#driver code
if __name__ == '__main__':
#input string here
string = "abhay"
#print returned sum
print(sumVowel(string))
# This code is contributed by
# Abhay Subramanian K
// C# implementation of the above approach
using System;
public class Gfg {
// Returns the total sum of
// occurrences of all vowels
static int vowel_calc(string s)
{
int n = s.Length;
int[] arr = new int[n];
for (int i = 0; i < n; i++) {
if (i == 0)
// No. of occurrences of 0th character
// in all the substrings
arr[i] = n;
else
// No. of occurrences of ith character
// in all the substrings
arr[i] = (n - i) + arr[i - 1] - i;
}
int sum = 0;
for (int i = 0; i < n; i++) {
char ch = s[i];
// Check if ith character is a vowel
if (ch == 'a' || ch == 'e' || ch == 'i'
|| ch == 'o' || ch == 'u')
sum += arr[i];
}
// Return the total sum
// of occurrences of vowels
return sum;
}
// Driver Code
public static void Main()
{
string s = "daceh";
Console.Write(vowel_calc(s));
}
}
<?php
// PHP implementation of the above approach
// Returns the total sum of
// occurrences of all vowels
function vowel_calc($s)
{
$n = strlen($s);
$arr = array();
for ($i = 0; $i < $n; $i++)
{
if ($i == 0)
// No. of occurrences of 0th character
// in all the substrings
$arr[$i] = $n;
else
// No. of occurrences of ith character
// in all the substrings
$arr[$i] = ($n - $i) + $arr[$i - 1] - $i;
}
$sum = 0;
for ($i = 0; $i < $n; $i++)
{
// Check if ith character is a vowel
if ($s[$i] == 'a' || $s[$i] == 'e' ||
$s[$i] == 'i' || $s[$i] == 'o' ||
$s[$i] == 'u')
$sum += $arr[$i];
}
// Return the total sum
// of occurrences of vowels
return $sum;
}
// Driver Code
$s = "daceh";
echo(vowel_calc($s));
// This code is contributed by Shivi_Aggarwal
?>
<script>
// Javascript implementation of the above approach
// Returns the total sum of
// occurrences of all vowels
function vowel_calc(s)
{
var n = s.length;
var arr = [];
for (var i = 0; i < n; i++) {
if (i == 0)
// No. of occurrences of 0th character
// in all the substrings
arr.push(n);
else
// No. of occurrences of the ith character
// in all the substrings
arr.push((n - i) + arr[i - 1] - i);
}
var sum = 0;
for (var i = 0; i < n; i++)
// Check if ith character is a vowel
if (s[i] == 'a' || s[i] == 'e' || s[i] == 'i'
|| s[i] == 'o' || s[i] == 'u')
sum += arr[i];
// Return the total sum
// of occurrences of vowels
return sum;
}
// Driver code
var s = "daceh";
document.write( vowel_calc(s));
// This code is contributed by importantly.
</script>
Time Complexity: O(N)
Auxiliary Space: O(N)
Another efficient approach without additional space:
The idea is based on the number of times a particular character can occur across all the substrings. If we know a particular character occurs x times in all the substrings, then we can just check if it is a vowel, and add the count to the sum.
A particular character A[i] can be part of substrings in the following two ways:
1. Substrings starting with A[i].
2. Substrings that contain character A[i] but do not start with A[i]
Observation:
Let's discuss this with an example:
s = "abcdefg"
Occurrences of character 'a':
- Substrings starting with 'a': "a", "ab", "abc" ... "abcdefg" => 7 Count.
- No Substrings has 'a' in the middle.
Total occurrences for a = 7 = 7 * 1
Occurrences of character 'b':
- Substrings starting with 'b': "b", "bc", ... "bcdefg" => 6 Count.
- Substrings containing 'b' within them:
'b' can also exist within substrings starting from a. Their count will be (7 - 1) = 6
e.g.: "ab", "abc" ... "abcdefg"
Total occurrences for b = 6 + 6 = 6 * 2
Occurrences of character 'c':
- Substrings starting with 'c': "c", "cd" ... "cdefg" => 5 Count.
- Substrings containing 'c' within them:
'c' can also exist within substrings starting from a. e.g. "abc", "abcd" ... "abcdefg" (except 'a' and 'ab') = (7 - 2) = 5
'c' can also exist within substrings starting from b. e.g. "bc", "bcd" ... "bcdefg" (except 'b') = (6 - 1) = 5
Total occurrences for c = 5 + 5 + 5 = 5 * 3
Here, a pattern in the number of occurrences can be observed, in which the total occurrences of the character will be equal to the product of the number of characters on the right side with the number of characters on the left side (including the character itself). So, whenever a vowel is encountered we can add the product of the count of right and left characters in the answer.
Below is the implementation of the above approach:
C++
// C++ Code to implement the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to return the total sum of
// occurrences of all vowels
int vowel_calc(string s)
{
int n = s.length();
// Variable to store the answer
int totalOccurrences = 0;
for (int i = 0; i < n; i++) {
// Count of total occurrences of
// current character
int totalOccurrenceForCharInAllSubstrings
= (i + 1) * (n - i);
char ch = s[i];
// if the current character is a vowel
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o'
|| ch == 'u') {
// Add the occurrences of current
// character to the answer
totalOccurrences
+= totalOccurrenceForCharInAllSubstrings;
}
}
// Return the total sum
// of occurrences of vowels
return totalOccurrences;
}
// Driver Code
int main()
{
string s = "abcde";
// Function Call
cout << vowel_calc(s);
}
// This code is contribute by Samim Hossain Mondal.
// JAVA Code to implement the above approach
import java.io.*;
import java.util.*;
public class Gfg {
// Function to return the total sum of
// occurrences of all vowels
static int vowel_calc(String s)
{
int n = s.length();
// Variable to store the answer
int totalOccurrences = 0;
for (int i = 0; i < n; i++) {
// Count of total occurrences of
// current character
int totalOccurrenceForCharInAllSubstrings
= (i + 1) * (n - i);
char ch = s.charAt(i);
// if the current character is a vowel
if (ch == 'a' || ch == 'e' || ch == 'i'
|| ch == 'o' || ch == 'u') {
// Add the occurrences of current
// character to the answer
totalOccurrences
+= totalOccurrenceForCharInAllSubstrings;
}
}
// Return the total sum
// of occurrences of vowels
return totalOccurrences;
}
// Driver Code
public static void main(String args[])
{
String s = "abcde";
// Function Call
System.out.println(vowel_calc(s));
}
}
# Python Code to implement the above approach
# Function to return the total sum of
# occurrences of all vowels
def vowel_calc(s):
n = len(s)
# Variable to store the answer
totalOccurrences = 0
for i in range(0, n):
# Count of total occurrences of
# current character
totalOccurrenceForCharInAllSubstrings = (i + 1) * (n - i)
ch = s[i]
# if the current character is a vowel
if (ch == 'a' or ch == 'e' or ch == 'i' or ch == 'o' or ch == 'u'):
# Add the occurrences of current
# character to the answer
totalOccurrences += totalOccurrenceForCharInAllSubstrings
# Return the total sum
# of occurrences of vowels
return totalOccurrences
# Driver Code
s = "abcde"
# Function Call
print(vowel_calc(s))
# This code is contribute by Samim Hossain Mondal.
// C# Code to implement the above approach
using System;
public class Gfg {
// Function to return the total sum of
// occurrences of all vowels
static int vowel_calc(String s)
{
int n = s.Length;
// Variable to store the answer
int totalOccurrences = 0;
for (int i = 0; i < n; i++) {
// Count of total occurrences of
// current character
int totalOccurrenceForCharInAllSubstrings
= (i + 1) * (n - i);
char ch = s[i];
// if the current character is a vowel
if (ch == 'a' || ch == 'e' || ch == 'i'
|| ch == 'o' || ch == 'u') {
// Add the occurrences of current
// character to the answer
totalOccurrences
+= totalOccurrenceForCharInAllSubstrings;
}
}
// Return the total sum
// of occurrences of vowels
return totalOccurrences;
}
// Driver Code
public static void Main(string[] args)
{
string s = "abcde";
// Function Call
Console.WriteLine(vowel_calc(s));
}
}
// This code is contribute by karandeep1234
// Javascript Code to implement the above approach
// Function to return the total sum of
// occurrences of all vowels
function vowel_calc(s)
{
let n = s.length;
// Variable to store the answer
let totalOccurrences = 0;
for (let i = 0; i < n; i++) {
// Count of total occurrences of
// current character
let totalOccurrenceForCharInAllSubstrings
= (i + 1) * (n - i);
let ch = s[i];
// if the current character is a vowel
if (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o'
|| ch == 'u') {
// Add the occurrences of current
// character to the answer
totalOccurrences
+= totalOccurrenceForCharInAllSubstrings;
}
}
// Return the total sum
// of occurrences of vowels
return totalOccurrences;
}
// Driver Code
let s = "abcde";
// Function Call
console.log(vowel_calc(s));
// This code is contribute by Samim Hossain Mondal.
Time complexity: O(N)
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem