codezen || coding ninja solution of love characters

Love for Characters Send Feedback Ayush loves the characters ‘a’, ‘s’, and ‘p’. He got a string of lowercase letters and he wants to find out how many times characters ‘a’, ‘s’, and ‘p’ occurs in the string respectively. Help him find it out.

 

Input: First line contains an integer denoting length of the string. Next line contains the string. 

Constraints: 1<=n<=10^5 ‘a’<= each character of string <= ‘z’ 

Output: Three space separated integers denoting the occurrence of letters ‘a’, ‘s’ and ‘p’ respectively. 

Sample Input: 6 aabsas 

Sample output: 3 2 0

solution -->

#include<bits/stdc++.h>

using namespace std;

#include<unordered_map>

int main()

{ 

 int n;

 cin>>n;

 string s;

 cin>>s;

 int count =0,vount=0,bount=0;

 for(int i =0; i<=s.size(); i++)

 {

    if(s[i]=='a' )

    {

        count++;

    }

    else if( s[i]=='s')

    {

        vount++;

    }

    else if(s[i]=='p')

    {

        bount++;

    }

 }

cout<<count<<" "<<vount<<" "<<bount;

  

}