Simple and concise  C++ solution||With Explanation||100% faster
If you really found my solution helpful please upvote it, as it motivates me to post such kind of codes and help the coding community, if you have some queries 
**If you really found my solution helpful please upvote it, as it motivates me to post such kind of codes and help the coding community, if you have some queries or some improvements please feel free to comment and share your views.**\nTry to observe the pattern.\nNote: Here the element present at each index represents the number of combinations that can be formed by the using the vowels {\'a\',\'e\',\'i\',\'o\',\'u\'}\nfor n=1 dp[]={1,1,1,1,1}\nfor n=2 dp[]={5,4,3,2,1}\nfor n=3 dp[]={15,10,6,3,1}\n```\n int countVowelStrings(int n) {\n        vector<int> dp(5,1);\n        for(int i=1;i<n;i++)\n        {\n            for(int j=3;j>=0;j--)\n            {\n                dp[j]=dp[j+1]+dp[j];\n            }\n        }\n        int res=0;\n        for(int i=0;i<5;i++)\n        {\n            res+=dp[i];\n        }\n        return res;\n    }\n```\n
['Dynamic Programming', 'C', 'C++']