PRIMEDST - Editorial

okay, I think I get it. Thanks :slight_smile:

My O(N^2) algo failed!! Someone is lying!

1 Like

You can try submit my code and check :slight_smile:

1 Like

dfs approach seems much easier than FFT…

even I used the same concept but got WA, missed some case somewhere I think. Onto it now. Nice exp btw :slight_smile:

Can anyone give a link to FFT tutorial, in english,short and clear ?