0 To 1 Path in Competitive Programming: Tathastu Roadmaps
0 To 1 Path in Competitive Programming: Tathastu Roadmaps
enabled by TwoWaits
0 to 1 Path in
Competitive Programming
By Achintya Gaumat
Founder and Chief Mentor, TwoWaits,
HBTU Kanpur 2016 CSE Alumni
Coding vs Competitive Programming
● Solving a problem by writing code is Coding while competition of
coding is Competitive Programming.
● Learn basic Data Structures like array, strings, stack etc and Algos like
searching, sorting, greedy algorithms, etc.
● You may learn some additional Data Structures like Trie, Segment
Tree, Fenwick Trees.
● Securing good rank in these contests will boost your confidence and
make you ready for more difficult contests.
● Don’t go after rating, try to solve as many questions you can, pass all
test cases and boundary conditions. Learn from editorials.
Stage 3 : Stepping up CP
● Now go for next level contests like ACM ICPC, IOI, IEEE Xtreme.
Continue participating in the regular contests of CodeForces.
● Google Kickstart, 8 rounds every year, if you get a good rank in that
you may get a call for interview. Hacker Cup by FB is another.
● If you are in 2nd/3rd year, you can get internships through these
contests, final year student may get direct interview call.
Stage 4 : Enhance CP Profile
● Your aim should be to get at least Expert on CodeForces and 5* on
CodeChef. Then focus on maintaining it.
● For higher rating don’t just participate in easy contests, it will give
you temporary higher rating. But participate in difficult as well.
● Each question have some rating. Let say, if you are comfortable with
700 rating question then try 800-1000 rating questions.
● Must visit editorials after contest, and try to solve one or two more
problems of that contest.
Resources :
● CP List : Striver’s CP Problems List (link).
● YT Channels : TakeUForward, Aditya Verma, Rachit Jain
● Books : Algorithms by Robert Sedgewick, Introduction to Algorithms
by Thomas H. Cormen, CP Handbook by Antti Laaksonen
● CodeForces Ladder : Practice for Codeforces, a2oj.com/ladders
● CP algorithms : Learn Advance Algorithms cp-algorithms.com
● Dynamic Programming : YT Playlist by Aditya Verma
Q&A
Let’s hear what you guys have to say or
Email us at [email protected]