|| UNBOUNDED KNAPSACK|| pattern
I observed that we can convert this problem in unbounded knapsack by converting [a,e,i,o,u] into [1,1,1,1,1] . Now it became standard subset sum problem we have
**I observed that we can convert this problem in unbounded knapsack by converting [a,e,i,o,u] into [1,1,1,1,1] . Now it became standard subset sum problem we have to find number of subset with subset sum=n and we can pick one element more than once**\n\n**this is my first post so please upvote if You like it**\n```\nint countVowelStrings(int n) {\n       vector<int>v(5,1);\n       int dp[6][n+1];\n       \n         for(int i=0;i<n+1;i++){\n            dp[0][i]=0;\n        }\n         \n        for(int i=0;i<6;i++){\n            dp[i][0]=1;\n        }\n        for(int i=1;i<6;i++){\n            for(int j=1;j<n+1;j++){\n                \n                if(v[i-1]<=j){\n                    dp[i][j]=dp[i][j-v[i-1]] +dp[i-1][j];\n                }\n                else dp[i][j]=dp[i-1][j];\n            }\n        }\n        return dp[5][n];\n    } \n```
['Dynamic Programming']