Thanks Bansal
Thanks Ashish!
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
Nice job buddy!!!
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
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 a lot for INTERVAL’s editorial!!!
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
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!!
Thanks dear! Got it.