Top Down Dp Runtime 1 ms Easy Solution
\nclass Solution {\n    public int countVowelStrings(int n) {\n    \n        int [][]dp=new int[5][n+1];\n        int i,j;\n       \n        for(i=0;i<5;i++)\n 
```\nclass Solution {\n    public int countVowelStrings(int n) {\n    \n        int [][]dp=new int[5][n+1];\n        int i,j;\n       \n        for(i=0;i<5;i++)\n        {\n            for(j=0;j<=n;j++)\n            {\n                     if(i==0)\n                     {\n                         dp[i][j]=1;\n                     }\n                    else if(j==0)\n                    {\n                         dp[i][j]=1;\n                    }\n                    else\n                    {\n                     dp[i][j]=dp[i-1][j]+dp[i][j-1];\n                    }\n                }\n        }\n        return dp[4][n];\n        }\n}\n```
[]