SUPER EASY SOLUTION
Code\n\nclass Solution {\npublic:\n    int numberOfSubstrings(string s) {\n        int left=0, right=0, count=0, n= s.size()-1 ,work=1;\n        unordered_map<c
# Code\n```\nclass Solution {\npublic:\n    int numberOfSubstrings(string s) {\n        int left=0, right=0, count=0, n= s.size()-1 ,work=1;\n        unordered_map<char, int> mpp ;\n        \n        for(right=0;right<n+1;right++){\n            mpp[s[right]]++ ;\n            \n            while(mpp[\'a\']  &&  mpp[\'b\']  &&  mpp[\'c\']){\n                count += 1+ (n - right) ;\n                \n                mpp[s[left]]-- ;\n                left++ ;\n                cout<<right<<" ";\n            }\n            \n            \n        }\n        \n        return count ;\n    }\n};\n```
['C++']