Given an input string and a substring. Find the frequency of occurrences of a substring in the given string using pthreads.
Examples:
Input: string = "man"
substring = "dhimanman"
Output: 2
Input: string = "banana"
substring = "nn"
Output: 0
Note: It is advised to execute the program in Linux based system.
Compile in linux using following code:
g++ -pthread program_name.cpp
Program:
// C++ program to find the frequency // of occurrences of a substring // in the given string using pthread #include <iostream> #include <pthread.h> #include <stdlib.h> #include <sys/types.h> #include <time.h> #include <unistd.h> #define max 4 using namespace std; int count[max] = { 0 }; string str, sub; void* str_seq_count(void* args) { int value = *(int*)args; int i, j, k, l1, l2, flag; // calculating length of string 1 l1 = str.length(); // calculating length of substring l2 = sub.length(); for (i = 0 + value; i < l1; i = i + max) { flag = 0; k = i; for (j = 0; j < l2; j++) { // flag=0; if (sub[j] == str[k]) k++; else { flag = 1; break; } } if (flag == 0) count[value] += 1; } } // Driver code int main() { int sum = 0; int x[max]; for (int a = 0; a < max; a++) x[a] = a; str = "prrrogramisprrrogramming"; sub = "rr"; cout << "Enter the main string: " << str << endl; cout << "Enter the sequence to search: " << sub << endl; int i, l1; pthread_t tid[max]; for (i = 0; i < max; i++) { pthread_create(&tid[i], NULL, str_seq_count, (void*)&x[i]); } for (i = 0; i < max; i++) pthread_join(tid[i], NULL); for (i = 0; i < max; i++) sum = sum + count[i]; cout << "Frequency of substring: " << sum; return 0; } |
Output:
Enter the main string: prrrogramisprrrogramming Enter the sequence to search: rr Frequency of substring: 4
Related article: Frequency of a substring in a string
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Length of the largest substring which have character with frequency greater than or equal to half of the substring
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Frequency of a substring in a string
- Maximum length substring with highest frequency in a string
- Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
- Substring of length K having maximum frequency in the given string
- Find if a given string can be represented from a substring by iterating the substring “n” times
- Partition given string in such manner that i'th substring is sum of (i-1)'th and (i-2)'th substring
- Generate a number such that the frequency of each digit is digit times the frequency in given number
- Maximum length prefix such that frequency of each character is atmost number of characters with minimum frequency
- Count of Binary Strings of length N such that frequency of 1's exceeds frequency of 0's
- Substring with highest frequency length product
- Minimum length of substring whose rotation generates a palindromic substring
- Frequency of each character in a String using unordered_map in C++
- Find length of longest subsequence of one string which is substring of another string
- Minimum changes required to make first string substring of second string
- Queries to check if string B exists as substring in string A
- Check if the given string is shuffled substring of another string
- Check if given string is a substring of string formed by repeated concatenation of z to a
- Smallest String consisting of a String S exactly K times as a Substring
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
