Learning the art of Competitive Programming

Learning the art of Competitive Programming

• How to begin with Competitive Programming?
• Top 10 Algorithms and Data Structures for Competitive Programming
• How to prepare for ACM – ICPC?
• How to prepare for Google Asia Pacific University (APAC) Test ?

Remaining Ahead in Competitive Programming:

• Master in competitive programming
• Tips and Tricks for Competitive Programmers
  •  Set 1 (For Beginners)
  • Set 2 (Language to be used for Competitive Programming)
• Competitive Programming: Conquering a given problem
• A Better Way To Approach Competitive Programming
• Some important shortcuts in Competitive Programming
• What to do at the time of Wrong Answer (WA)?
• How to overcome Time Limit Exceed(TLE)?

C++ Programming:

• Writing C/C++ code efficiently in Competitive programming
• Fast I/O for Competitive Programming
• Generating Test Cases (generate() and generate_n() in C++)
• getchar_unlocked() – faster input in C/C++ for Competitive Programming
• Bitwise Hacks for Competitive Programming
• Cin-Cout vs Scanf-Printf
• Useful Array algorithms in C++ STL
• Data Type Ranges and their macros in C++
• C++ Magicians – STL Algorithms
• C qsort() vs C++ sort()

Java:

• Quick ways to check for Prime and find next Prime in Java
• Fast I/O in Java in Competitive Programming
• Formatted output in Java

Advanced Data Structures:

• Sqrt (or Square Root) Decomposition Technique
  • Set 1 (Introduction)
  • Set 2 (LCA of Tree in O(sqrt(height)) time)
• Range Minimum Query (Square Root Decomposition and Sparse Table)
• Graph implementation using STL for competitive programming
  • Set 1 (DFS of Unweighted and Undirected)
  • Set 2 (Weighted graph)
• LCA for general or n-ary trees (Sparse Matrix DP approach < O(nlogn), O(logn)>)
• Querying the number of distinct colors in a subtree of a colored tree using BIT
• Test Case Generation:
  • Set 1 (Random Numbers, Arrays and Matrices)
  • Set 2 ( Random Characters, Strings and Arrays of Random Strings)
  • Set 3 (Unweighted and Weighted Trees)
  • Set 4 (Random directed / undirected weighted and unweighted Graphs)
  • Set 5 (Generating random Sorted Arrays and Palindromes)

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to review-team@geeksforgeeks.org.  See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above