human
Count occurrences of substring X before every occurrence of substring Y in a given string | C ++ program for the above approach.
Function to count occurrences of the string Y in the string S for every occurrence of X in S.
Stores the count of occurrences of X.
Stores the lengths of the three strings.
Traverse the string S.
If the current substring is Y , then increment the value of count by 1.
If the current substring is X , then print the count.
Driver Code"
How can the above be solved in C++?

Give me a code to count occurrences of substring X before every occurrence of substring Y in a given string and the other steps required?
assistant
#Here is code to count occurrences of substring X before every occurrence of substring Y in a given string and the other steps required.
 #include <bits/stdc++.h>
using namespace std ; void countOccurrences ( string S , string X , string Y ) { int count = 0 ; int N = S . length ( ) , A = X . length ( ) ; int B = Y . length ( ) ; for ( int i = 0 ; i < N ; i ++ ) { if ( S . substr ( i , B ) == Y ) count ++ ; if ( S . substr ( i , A ) == X ) cout << count << " ▁ " ; } } int main ( ) { string S = " abcdefdefabc " ; string X = " abc " ; string Y = " def " ; countOccurrences ( S , X , Y ) ; return 0 ; }