Doubt in leetcode problem, code not working

#1

Please help. I am sharing my solution, feel free to ask if you need me to explain my approach.

#2
#3
#4

Hey @anshufirefox

                if(allowed.find(words[i][j])!=std::string::npos)

if string is not found then it returns that

#5

Thanks, it works fine now. Btw, can I optimize my solution from O(n^2) to a better time complexity? Even in terms of memory

#6

Hey @anshufirefox
your code is O(nmx) where n is list size and m is max word size and x is allowed string size
It can be optimized further to O(nm) by creating a freq map for allowed string
Then it cant be optimized further

#7

Can you please share the code of the freq map approach?

#8

Here

#9

Thank you, understood it :slight_smile:

1 Like
#10

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.