Beats 100% runtime and memory time
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public long countVowels(String word) {\n        long count=0;\n        int len=word.length();\n        for(int i=len-1;i>=0;i--){\n            if(vowelschck(word.charAt(i))){\n                count+=(long)(i+1)*(len-i);\n            }\n        }\n        \n        \n        return count;\n\n    }\n\n    boolean vowelschck(char c){\n        \n        if(c==\'a\' || c==\'e\' || c==\'i\' ||\n        c==\'o\' || c==\'u\'){\n            return true;\n        }\n        \n        return false;\n    }\n\n\n}\n```
['Java']