✅C++ || EASY DP Solution 🚀
Code\n\nclass Solution {\npublic:\n    int countVowelStrings(int n) {\n        vector<vector<int>>dp(n+1,vector<int>(5+1,0));\n        for(int i=1;i<=5;i++)dp[1
# Code\n```\nclass Solution {\npublic:\n    int countVowelStrings(int n) {\n        vector<vector<int>>dp(n+1,vector<int>(5+1,0));\n        for(int i=1;i<=5;i++)dp[1][i]=i;\n        for(int i=2;i<=n;i++){\n            for(int j=1;j<=5;j++){\n                dp[i][j]= dp[i-1][j] + dp[i][j-1];\n            }\n        }\n        return dp[n][5];\n    }\n};\n```\n![upvote (3).jpg](https://assets.leetcode.com/users/images/1113c2da-2b1c-4bef-8dc9-c2d00cef4bb0_1679470498.667343.jpeg)\n
['Dynamic Programming', 'C++']