Now u have to say… "You might beat Tourist :P"
2 Likes
@bugkiller: please provide link to stanford video lecture for algorithms…
and definitely within a year or two,… I might beat tourist…
1 Like
Thank you so much for this nice post.
Really Good Post …Thanks
Thank you got motivated and very much appreciated for your time to make this post.
Thank you so much !!! I completely agreed with what you said specially the below two points:
Don’t think “let’s first study all the algorithms, then I will attempt the problems.”
Don’t think “let’s study this algorithm and do few problems related to it.”
I will always remember these tips…
Nice, it got me motivated 
Really good post
Agreed reading and on occasion re-reading Competitive Programming by Steven and Felix Halim and The Algorithm Design Manual by Steven Skiena helped me tremendously.
1 Like
do anyone have soft copy of this book?
1 Like
thnku…
There is an ongoing course on coursera offered by STANFORD on Design and Analysis, Just Enroll and grab all the video…
I need tips on how to solve problems on SPOJ… Like i am on 4-5th problem that PRIME number one where segmented sieve is used and i am unable to solve it…
In these situations what should i do? Should i read the algo and try to implement or should i try to figure how can i solve without searching it over internet or should i directly read the implementation and understand whats goin on… ?
Please Help!!
@rishabhprsd7 >> Yes, avoid taking a direct look on the implementation or code submitted by others. You can take google’s help though. Spend hours and days till you get it right, and then move on to next problem. It will only come with time, and that time will teach you a lot!
4 Likes
thanku…
Bhai konsa maal phuke ho
2 Likes
Yee sasta nasha ka effect lag rha hai . 
1 Like
