Skip to content
geeksforgeeks
  • Courses
    • DSA to Development
    • Get IBM Certification
    • Newly Launched!
      • Master Django Framework
      • Become AWS Certified
    • For Working Professionals
      • Interview 101: DSA & System Design
      • Data Science Training Program
      • JAVA Backend Development (Live)
      • DevOps Engineering (LIVE)
      • Data Structures & Algorithms in Python
    • For Students
      • Placement Preparation Course
      • Data Science (Live)
      • Data Structure & Algorithm-Self Paced (C++/JAVA)
      • Master Competitive Programming (Live)
      • Full Stack Development with React & Node JS (Live)
    • Full Stack Development
    • Data Science Program
    • All Courses
  • Tutorials
    • Data Structures & Algorithms
    • ML & Data Science
    • Interview Corner
    • Programming Languages
    • Web Development
    • CS Subjects
    • DevOps And Linux
    • School Learning
  • Practice
    • Build your AI Agent
    • GfG 160
    • Problem of the Day
    • Practice Coding Problems
    • GfG SDE Sheet
  • Contests
    • Accenture Hackathon (Ending Soon!)
    • GfG Weekly [Rated Contest]
    • Job-A-Thon Hiring Challenge
    • All Contests and Events
  • DSA Tutorial
  • Data Structures
  • Algorithms
  • Array
  • Strings
  • Linked List
  • Stack
  • Queue
  • Tree
  • Graph
  • Searching
  • Sorting
  • Recursion
  • Dynamic Programming
  • Binary Tree
  • Binary Search Tree
  • Heap
  • Hashing
  • Divide & Conquer
  • Mathematical
  • Geometric
  • Bitwise
  • Greedy
  • Backtracking
  • Branch and Bound
  • Matrix
  • Pattern Searching
  • Randomized
Open In App
Next Article:
Searching Algorithms
Next article icon

Competitive Programming – A Complete Guide

Last Updated : 24 Nov, 2024
Comments
Improve
Suggest changes
Like Article
Like
Report

Competitive Programming is a mental sport that enables you to code a given problem under provided constraints. The purpose of this article is to guide every individual possessing a desire to excel in this sport. This article provides a detailed syllabus for Competitive Programming designed by industry experts to boost the preparation of the readers.

Competitive-Programming-A-Complete-Guide

Related Course

Competitive Programming Course

Get ready to level up your programming skills with this Competitive Programming – Self Paced Course. Learn the Fundamentals of programming, DSA, Mathematical algorithms, and much more. So, why wait? Dive into the world of Programming by enrolling in this course today!

Table of Content

  • What is Competitive Programming?
  • Basics of Competitive Programming
  • Basics Of Array , String, Greedy and Bit Manipulation
  • Number Theory and Combinatorics
  • Searching, Sorting and Basic Data Structures
  • Tree and Graphs
  • Recursion and Dynamic Programming
  • String Algorithms
  • Geometry and Game Theory
  • Advance Data Structures

What is Competitive Programming?

Competitive programming is a mind sport, where people compete against each other to solve some programming questions/logic with an efficient approach and within a time constraint. The goal of competitive programming is to write code to solve a problem within a given timeframe. 

For those aiming to dive into competitive programming, the GeeksforGeeks Practice Platform offers a wide variety of problems to help you build speed and accuracy.

Why Should You Do Competitive Programming?

Competitive programming is the best way to master your analytical thinking, and logical thinking and improve your coding skills. It is now being considered by many tech giants like Google and Facebook. Also, Facebook organizes the Meta Hacker Cup annually to promote all the Competitive Programmers around the world to compete against one another and earn a chance to get hired at Meta.

Here are some reasons about why you should start Competitive Programming:

  • Mental Agility and Quick Thinking: By practicing competitive programming, you start thinking quickly and within the given timeframe and this improves your mental agility and helps enhance your thinking ability.
  • Competitive Spirit: Competitive programming can be fun for those who enjoy the thrill of competition. Solving challenging problems that too within a timeframe boosts confidence and a sense of accomplishment.
  • Career Prospect: Competitive programming is very important when it comes to technical interviews for software engineering-related jobs. Many tech giants use competitive programming contests as a medium of recruitment. Companies like Google, ServiceNow, Atlassian, etc. have technical interviews based on competitive programming problems.
  • Learning Opportunity: In Competitive programming, we get a wide range of variety of problems and various arithmetic concepts. Competitive programming exposes various data structures and algorithms which help us better understand the complexity of problems.
  • Personal Growth as a Programmer: Competitive programming is one of the best ways to grow as a programmer. It helps you get a command over problem-solving, as you’ve to solve challenging problems within a time limit. 
  • Networking: Participating in various coding contests gives you a chance to be a part of communities with like-minded people. Here in these communities, you get various important resources and guidance from experts who can help you get so many opportunities like referrals, job-opening information, mentorship, etc. 

Basics of Competitive Programming:

  • What is Competitive Programming and How to Prepare for It?
  • Competitive Programming (CP) Handbook with Complete Roadmap
  • Fast I/O: CPP,  Java, Python
  • Useful libraries: CPP, Java, Python
  • Input/Output Files: Set 1, Set 2
  • Tips and Tricks: Set 1, Set 2
  • Input Methods: CPP, Java, Python
  • Template: CPP
  • Language: CPP, Java, Python
  • Time Complexity: Analysis 
  • Setting up Competitive Programming Environment: Sublime: CPP, Visual Studio: CPP and Python
  • CSES Problem Set

Basics Of Array , String, Greedy and Bit Manipulation

  • Reverse an array(Related Problems: Problem 1, Problem 2)
  • Sum of Digits
  • Program to Check if a Given String is Palindrome in C, Python (Related Problem)
  • Sum of array elements(Related Problem)
  • Maximum and Minimum element of array(Related Problem)
  • Counting frequencies of array elements(Related Problems: Problem 1, Problem 2)
  • Float and Precision: CPP, Java, Python
  • Prefix sum, 2D Prefix Sum, Difference Array | Range update query in O(1): (Related Problems: Problem 1, Problem 2)
  • Coordinate Compression: (Related Problem)
  • Kadane Algorithm: (Related Problem)
  • Activity Selection Problem: (Related Problem)
  • Job Sequencing Problem: (Related Problem)
  • Sliding Window: (Related Problem)
  • Logical Operators: CPP Set 1, Set 2, Java, Python
  • Bit Manipulation: Set 1, Set 2, Set 3(Related Problems: Problem 1, Problem 2, Problem 3)
  • Bitset CPP
  • Top 50 Array Coding Problems for Interviews
  • Top 50 String Coding Problems for Interviews

Number Theory and Combinatorics

  • Prime Number(Related Problem)
  • Sieve of Eratosthenes(Related Problem)
  • Segmented Sieve (Related Problem)
  • Find all divisors of a natural number (Related Problem)
  • Least prime factor of numbers upto N (Related Problem)
  • All prime factors of a number(Related Problem)
  • Prime Factorization using Sieve O(log n) for multiple queries
  • Sum of all factors of a number(Related Problem)
  • Gcd of Two numbers, Lcm of two numbers(Related Problem)
  • Linear Diophantine Equations
  • Euclidean algorithms (Basic and Extended)
  • Euler’s Totient Function(Related Problem)
  • Euler’s Totient function for all numbers smaller than or equal to n
  • Inclusion Exclusion Principle 
  • Pigeon Hole Principle
  • Modular Operations
  • Modular Inverse: (Related Problem 1, Problem 2)
  • Chinese Remainder Theorem: Set 1, Set 2
  • Power(x, y) in O( logN )
  • Power(x, y) % mod: (Related Problem 1, Problem 2)
  • Matrix Exponentiation: (Related Problem)
  • Permutation and Combination: Set 1, Set 2, Quiz 1, Quiz 2
  • nCr: Set 1, Set 2
  • nCr % mod: Set1, Set 2: (Related Problem)
  • nCr % mod for multiple queries: (Related Problem)
  • Catalan numbers: Applications and Related Problem
  • Gaussian Elimination

Searching, Sorting and Basic Data Structures

  • Linear Search(Related Problems: Problem 1, Problem 2)
  • Binary Search, Unbounded Binary Search(Related Problems : Problem 1, Problem 2, Problem 3)
  • Inbuilt sorting O(logN): CPP, Java, Python(Related Problems: Problem 1, Problem 2, Problem 3, Problem 4)
  • Merge Sort(Related Problems: Problem 1, Problem 2)
  • Quick Sort(Related Problems: Problem)
  • Stack: Implementation in CPP, Java, Python(Related Problems: Problem 1, Problem 2, Problem 3)
  • Queue: Implementation in CPP, Java, Python(Related Problems: Problem 1, Problem 2 , Problem 3)
  • Deque: Implementation in CPP, Java, Python(Related Problems: Problem)
  • Priority Queue: Implementation in CPP, Java, Python(Related Problems: Problem 1, Problem 2, Problem 3)

Tree and Graphs

  • Tree BFS, Tree DFS (Related Problems: Problem 1, Problem 2, Problem 3)
  • Graph BFS, Graph BFS 2, Graph DFS (Related Problems: Problem 1, Problem 2)
  • Dijkstra’s Shortest Path Algorithm(Related Problems: Problem 1, Problem 2)
  • Bellman – Ford Algorithm(Related Problem)
  • Floyd Warshall Algorithm(Related Problem)
  • 0-1 BFS, Dial’s Algorithm
  • Detect cycle: Directed, Undirected(Related Problems: Problem 1, Problem 2)
  • Disjoint set(union-find): Set 1, Set 2, Set 3(Related Problem)
  • Topological Sorting, Kahn’s Algorithm(Related Problem)
  • Minimum Spanning Tree: Prim’s Algorithm, Kruskal Algorithm(Related Problem)
  • Bipartite or not, M-Coloring(Related Problems: Problem 1, Problem 2, Problem 3)
  • Strongly Connected Components: Tarjan, Kosaraju(Related Problems: Problem 1, Problem 2)
  • Euler Path: Undirected, Directed(Related Problem)
  • Flow Algorithms: Set 1, Set 2, Dinic’s Algorithm(Related Problems: Problem 1, Problem 2)
  • Diameter of Tree
  • Centroid Decomposition
  • Lowest Common Ancestor
  • Top 50 Tree Coding Problems for Interviews

Recursion and Dynamic Programming

  • Recursion:  Quiz 1, Quiz 2, Quiz 3, Quiz 4, Quiz 5, Quiz 6, Quiz 7 (Related Problems: Problem 1, Problem 2, Problem 3)
  • Backtracking: (Related Problems: Problem 1, Problem 2)
  • Dp Introduction: Set 1, Set 2, Set 3, Set 4, Set 5
  • Most useful Dynamic Programming questions
  • Additional DP Problems : Problem 1, Problem 2, Problem 3, Problem 4
  • Dp on Trees: Set 1, Set 2
  • Dp on Bit Masking: Set 1, Set 2, Set 3
  • Digit Dp
  • Top 50 Dynamic Programming Coding Problems for Interviews

String Algorithms

  • Suffix Tree: Set 1, Set 2
  • Z Algorithm
  • KMP Algorithm, Rabin-Karp Algorithm(Related Problem)
  • Manacher’s Algorithm: Set 1, Set 2, Set 3, Set 4
  • Suffix Automation: Set 1, Set 2

Geometry and Game Theory

  • Closest Pair of Points
  • How to check if two given line segments intersect? (Related Problem)
  • How to check if a given point lies inside or outside a polygon?
  • Convex Hull: Set 1, Set 2(Related Problem)
  • Given n line segments, find if any two segments intersect
  • Check whether a given point lies inside a triangle or not
  • How to check if given four points form a square: (Related Problem)
  • Combinatorial Game Theory: Set 1 , Set 2, Set 3, Set 4
  • Minimax Algorithm in Game Theory: Set 1, Set 2, Set 3, Set 4, Set 5
  • Variation in Nim Game
  • Find the winner in nim-game
  • Optimal Strategy for a Game

Advance Data Structures

  • Trie: Set 1, Set 2, Set 3, (Related Problems: Problem 1, Problem 2, Problem 3, Problem 4, Problem 5)
  • Fenwick Tree: Set 1, Set 2, Set 3, Set 4, (Related Problem)
  • Segment Tree: Set 1, Set 2, Set 3 (Related Problem)
  • Sparse Table: Set 1, Set 2
  • Sqrt Decomposition: Set 1, Set 2
  • Heavy Light Decomposition: Set 1, Set 2
  • Meet in the Middle
  • MO’s Algorithm, Problem
  • Policy based Data Structure

You may also check Geeksforgeeks Online Courses to Learn Data Structures and Algorithms, well designed courses taught by Industry Experts.

GeeksforGeeks Courses

Competitive Programming – Self Paced Course

Get ready to take your programming skills to the next level? This Competitive Programming – Course will help you enhance your problem-solving skills to be a programmer for a top company and gain a competitive edge over other candidates in SDE interviews. Learn Basics of programming, Data structure and algorithms, Efficient implementation of mathematical algorithms and much more. Then, why wait? Take your first step towards becoming a better programmer, see you in the course!

DSA Self Paced

Master Data Structures and Algorithms, trusted by over 75,000 students! Prepare for the interviews with leading IT giants like Microsoft, Amazon, Adobe, etc. Built with years of experience by top industry experts and gives you a complete package of video lectures, practice problems, quizzes, discussion forums and contests. Learn and master DSA at the most affordable price possible with GeeksforGeeks DSA Self-Paced Course. Join Today!

Language Foundation Courses[C Programming / C++ / JAVA / Python]

Master any programming language from scratch and understand all its core fundamental concepts for a strong programming foundation at budget-friendly prices with help of GeeksforGeeks Language Foundation Courses – C Programming | Java Foundation | Python Foundation | C++ Foundation. These courses are for complete beginners who want to get started with programming and build their foundations. Start your coding journey today!.



Next Article
Searching Algorithms
author
kartik
Improve
Article Tags :
  • Competitive Programming
  • DSA

Similar Reads

  • DSA Tutorial - Learn Data Structures and Algorithms
    DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on
    7 min read
  • Array Data Structure Guide
    In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
    4 min read
  • String in Data Structure
    A string is a sequence of characters. The following facts make string an interesting data structure. Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immu
    3 min read
  • Matrix Data Structure
    Matrix Data Structure is a two-dimensional array arranged in rows and columns. It is commonly used to represent mathematical matrices and is fundamental in various fields like mathematics, computer graphics, and data processing. Matrices allow for efficient storage and manipulation of data in a stru
    2 min read
  • Searching Algorithms
    Searching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
    3 min read
  • Sorting Algorithms
    A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
    3 min read
  • Hashing in Data Structure
    Hashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
    3 min read
  • Two Pointers Technique
    Two pointers is really an easy and effective technique that is typically used for Two Sum in Sorted Arrays, Closest Two Sum, Three Sum, Four Sum, Trapping Rain Water and many other popular interview questions. Given a sorted array arr (sorted in ascending order) and a target, find if there exists an
    12 min read
  • Sliding Window Technique
    Sliding Window problems involve moving a fixed or variable-size window through a data structure, typically an array or string, to solve problems efficiently based on continuous subsets of elements. This technique is used when we need to find subarrays or substrings according to a given set of condit
    15+ min read
  • Prefix Sum Array - Implementation and Applications
    Given an array arr[] of size n, the task is to find the prefix sum of the array. A prefix sum array is another array prefixSum[] of the same size, such that prefixSum[i] is arr[0] + arr[1] + arr[2] . . . arr[i]. Examples: Input: arr[] = [10, 20, 10, 5, 15]Output: 10 30 40 45 60Explanation: For each
    8 min read
geeksforgeeks-footer-logo
Corporate & Communications Address:
A-143, 7th Floor, Sovereign Corporate Tower, Sector- 136, Noida, Uttar Pradesh (201305)
Registered Address:
K 061, Tower K, Gulshan Vivante Apartment, Sector 137, Noida, Gautam Buddh Nagar, Uttar Pradesh, 201305
GFG App on Play Store GFG App on App Store
Advertise with us
  • Company
  • About Us
  • Legal
  • Privacy Policy
  • In Media
  • Contact Us
  • Advertise with us
  • GFG Corporate Solution
  • Placement Training Program
  • Languages
  • Python
  • Java
  • C++
  • PHP
  • GoLang
  • SQL
  • R Language
  • Android Tutorial
  • Tutorials Archive
  • DSA
  • Data Structures
  • Algorithms
  • DSA for Beginners
  • Basic DSA Problems
  • DSA Roadmap
  • Top 100 DSA Interview Problems
  • DSA Roadmap by Sandeep Jain
  • All Cheat Sheets
  • Data Science & ML
  • Data Science With Python
  • Data Science For Beginner
  • Machine Learning
  • ML Maths
  • Data Visualisation
  • Pandas
  • NumPy
  • NLP
  • Deep Learning
  • Web Technologies
  • HTML
  • CSS
  • JavaScript
  • TypeScript
  • ReactJS
  • NextJS
  • Bootstrap
  • Web Design
  • Python Tutorial
  • Python Programming Examples
  • Python Projects
  • Python Tkinter
  • Python Web Scraping
  • OpenCV Tutorial
  • Python Interview Question
  • Django
  • Computer Science
  • Operating Systems
  • Computer Network
  • Database Management System
  • Software Engineering
  • Digital Logic Design
  • Engineering Maths
  • Software Development
  • Software Testing
  • DevOps
  • Git
  • Linux
  • AWS
  • Docker
  • Kubernetes
  • Azure
  • GCP
  • DevOps Roadmap
  • System Design
  • High Level Design
  • Low Level Design
  • UML Diagrams
  • Interview Guide
  • Design Patterns
  • OOAD
  • System Design Bootcamp
  • Interview Questions
  • Inteview Preparation
  • Competitive Programming
  • Top DS or Algo for CP
  • Company-Wise Recruitment Process
  • Company-Wise Preparation
  • Aptitude Preparation
  • Puzzles
  • School Subjects
  • Mathematics
  • Physics
  • Chemistry
  • Biology
  • Social Science
  • English Grammar
  • Commerce
  • World GK
  • GeeksforGeeks Videos
  • DSA
  • Python
  • Java
  • C++
  • Web Development
  • Data Science
  • CS Subjects
@GeeksforGeeks, Sanchhaya Education Private Limited, All rights reserved
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy
Lightbox
Improvement
Suggest Changes
Help us improve. Share your suggestions to enhance the article. Contribute your expertise and make a difference in the GeeksforGeeks portal.
geeksforgeeks-suggest-icon
Create Improvement
Enhance the article with your expertise. Contribute to the GeeksforGeeks community and help create better learning resources for all.
geeksforgeeks-improvement-icon
Suggest Changes
min 4 words, max Words Limit:1000

Thank You!

Your suggestions are valuable to us.

What kind of Experience do you want to share?

Interview Experiences
Admission Experiences
Career Journeys
Work Experiences
Campus Experiences
Competitive Exam Experiences