Video Editorial - FEB17 - GERMANDE

Thanks Bansal :smiley:

1 Like

Thanks Ashish!

1 Like

Thanks @brijwasi1995 !
The next editorial will involve DP, and I am going into detail explaining when we should use it. Should be able to post by tonight :slight_smile:

1 Like

Nice job buddy!!!

1 Like

Thanks @akki28 !

1 Like

Hi @foehadsidhu
There are some videos I have made on data structures which in which I picked a SPOJ or Codeforces problem as an example. You could have a look at this playlist:

Cheers :slight_smile:

1 Like

Thanks a ton, @chari407 !
A video on challenge problems will be fun to make. Should be able to get it done soon!

Thank you bro.

Thanks for the feedback @rishabh_vasani !
I will try to keep an eye on that too.

Thanks a lot for INTERVAL’s editorial!!! :slight_smile:

Thanks @ash_code!

Thanks @abdullah768! Will strive to stay that way :slight_smile:

Thanks @vijju123! :smiley:

1 Like

Hi @adhish_kapoor,
In your code, you need to modify these statements:

left[i]=i-1; --> left[i]=left[i-1];

and

right[i]=i+1; --> right[i]=right[i+1];

If there are further doubts, I will be happy to help :slight_smile:

1 Like

Thanks a lot for the clarification dear!! I got my mistake. I was using ans = ans + (.binary exponentiation…)

And I really appreciate how you told us the trick to overcome it in exponential time. (I was also thinking in linear fashion…got TLE in ALL test cases initially.)

Thanks a ton dear!!

1 Like

Thanks @vijju123 :slight_smile:

1 Like

Thanks dear! Got it. :slight_smile:

1 Like