For this Question: Given a string. Find out the distinct alphabets and the number of times they occur.The input contains a single string S.

Constraints:-
1 <= |S| <= 100000

Note:- String will contain only lowercase characters and spaces.Print 26 space separated numbers that denote the number of occurrences of each character from 'a' to 'z'.Sample Input:-
newton school

Sample Output:-
0 0 1 0 1 0 0 1 0 0 0 1 0 2 3 0 0 0 1 1 0 0 1 0 0 0, I have written this Solution Code: #include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{

     string s;
     getline(cin,s);
     int a[26]={0};
     for(int i=0;i<s.length();i++){
        if(s[i]!=' '){
            a[s[i]-'a']++;
        }
     }
     for(int i=0;i<26;i++){
        cout<<a[i]<<" ";
     }
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?