2559. Count Vowel Strings in Ranges | leetcode daily challenge | dsa | shashcode | java

[@shashwat_tiwari_st]

like target is 150, Please do like if you have understood the explanation as well as the code😄😄

[@VaibhavSingh_code]

bhaiya aaj ki video kab aa rahi hai

[@suryanshukumar6945]

sir hairstyle mast lag raha he. Jay jagannath🙏.

[@arvindarora285]

nice

[@shashwat_tiwari_st]

Thanks

[@kamleshmanibhairam507]

Sir You are the person that's why I am ready to fight with POTD 🙂🙂🙂
love you sir

[@shashwat_tiwari_st]

Thanks ❤

[@opkrchauhan_1]

class Solution {
public int[] vowelStrings(String[] words, int[][] queries) {
int n = queries.length;
Listres = new ArrayList();
for(int i=0;i

[@karthik-varma-1579]

Shash we do support you and can you please from today make sure to keep potds and all approaches and the concepts😅

[@GautamParmar-ug9ld]

Bhaiya Leetcode contest pr bhi solution explanation video banao please

[@nishantrathore5031]

class Solution {
public int[] vowelStrings(String[] words, int[][] queries) {
int n = words.length;
int [] prefix = new int[n];
prefix[0] = isVowel(words[0]);
for(int i=1;i

[@shashwat_tiwari_st]

How much % faster?

[@nishantrathore5031]

@shashwat_tiwari_st 59 %

[@shashwat_tiwari_st]

@@nishantrathore5031 🤘

[@kamleshmanibhairam507]

This is my solution I have alredy solved the question and come for the new Idea
class Solution {
public int[] vowelStrings(String[] words, int[][] queries) {
int [] prefWords = new int[words.length];
int [] resQueries = new int[queries.length];
// for storing the valid vowelStrings prefix sum.
if(isValid(words[0])) prefWords[0] += 1;
for(int i=1; i

[@Harsh-jc2bz]

i did this like this..similar like u it was 30% faster ......but why its slow? TC toh kaam hai
class Solution {
// using prefix sum approach
public int[] vowelStrings(String[] words, int[][] queries) {
Set set=new HashSet();
set.add('a');
set.add('e');
set.add('i');
set.add('o');
set.add('u');
int freq[]=new int[words.length+1]; // will store prefix (index will be +1)

for(int i=0;i

[@shashwat_tiwari_st]

Typical leetcode behavior, ignore 🙄