​ Competitive Programming

Tips & Strategy

❖ Algorithm ⇒ Intuition ⇒ Implementation ⇒ Complexity Analysis [Time & Space]

❖ Think [Maximum : 1 Hr.] ⇒ Code[Fast] ⇒ Learn
❖ Proper study,complexity analysis & elegant implementation of standard data
structures/algorithms/techniques/topics with examples and explanation
❖ Expertise in C/C++
❖ Topcoder, Codeforces, Codechef, SPOJ

Useful Links:
http://www.quora.com/Competitive-Programming/What-was-Anudeep-Nekkantis-Competitive-Pr
ogramming-strategy-to-become-35th-in-Global-ranking-in-just-6-7-months

http://www.quora.com/TopCoder/Why-has-there-been-no-new-red-coder-from-India-in-2012

http://www.quora.com/CodeChef/From-which-sources-did-Rudradev-Basak-Pradeep-George-M
athias-and-Nikhil-Garg-learn-algorithms

http://www.quora.com/Competitive-Programming/What-are-the-things-that-one-needs-to-take-ca
re-of-while-dealing-with-floating-point-calculations-in-competitive-programming-questions

http://www.quora.com/Competitive-Programming/What-are-ways-in-which-I-can-improve-my-yell
ow-level-rating

http://www.quora.com/ACM-ICPC-1/What-were-the-pointers-given-by-Ajay-Somani-to-Nikhil-Gar
g-regarding-preparation-for-ICPC

http://www.quora.com/Data-Structures/What-are-the-most-important-data-structures-needed-to-r
each-the-ACM-ICPC-World-Finals
Topics

Group - I
Segment Tree
Persistent Segment Tree
Binary Index Tree
Heavy Light Decomposition

Important Resource/Problem Links:

http://www.codechef.com/tags/problems/fenwick
http://www.codechef.com/tags/problems/heavy-light
http://www.codechef.com/tags/problems/segment-tree
http://blog.anudeep2011.com/heavy-light-decomposition/
http://kartikkukreja.wordpress.com/2013/12/02/range-updates-with-bit-fenwick-tree/
http://www.ahmed-aly.com/Category.jsp?ID=25
http://www.ahmed-aly.com/Category.jsp?ID=26
http://www.ahmed-aly.com/Category.jsp?ID=72
http://www.lightoj.com/volume_problemcategory.php?user_id=16872&category=Range%
20Minimum%20Query/Lowest%20Common%20Ancestor
http://www.lightoj.com/volume_problemcategory.php?user_id=16872&category=Segment
%20Tree/Interval%20Tree
http://letuskode.blogspot.in/2013/01/segtrees.html

Group - II
Suffix Array/Suffix Tree
Disjoint-Set Data Structures
Trie
Important Resource/Problem Links:

Group - III
Dynamic Programming
Probability And Expectation
Combinatorics
Important Resource/Problem Links:

Group - IV
Graphs
Matching/Flows
Important Resource/Problem Links:
Group - V
Matrix Exponentiation
Gaussian Elimination
Important Resource/Problem Links:

Group - VI
Number Theory
Important Resource/Problem Links:

Group - VII
Pattern Matching
Important Resource/Problem Links:

Group - V
Constructive Algorithm
Sliding Window
Pancake Sorting
IDA* Search
Parsing/Grammar
Greedy
Backtracking with Pruning/Branch and Bound
Divide & Conquer
Man In Middle
Important Resource/Problem Links:

Group - VIII
Game Theory
Important Resource/Problem Links:

Group - IX
Computational Geometry
Important Resource/Problem Links: