Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/bedirt/acm-icpc-preparation

ACM-ICPC Preparation Guide
https://github.com/bedirt/acm-icpc-preparation

acm-icpc algorithm competitive-programming curriculum programming-language

Last synced: about 1 month ago
JSON representation

ACM-ICPC Preparation Guide

Awesome Lists containing this project

README 

        
![ACM-ICPC](https://github.com/NAU-ACM/ACM-ICPC-Preparation/blob/master/acm_icpc_prep.jpg "ACM-ICPC")



# ACM-ICPC Preparation 

![](https://img.shields.io/badge/licence-MIT-green.svg) ![](https://img.shields.io/badge/Weeks%20Completed-8%2F20-orange.svg) ![](https://img.shields.io/badge/Revisions-4%2F20-red.svg)



This curriculum has been developed to learn Algorithms to use in Competitive Programming, **but can also be used for:**

  - Practicing for Interviews

  - Improving Algorithmic Thinking

  - Practicing for College Classes



**Prerequisites:** 

  - To know at least one programming language. (_You have to be able to use the language efficiently._)



The concept of this repository is to have well-structured content divided into parts that one can follow even if they are busy. Here we collected sources we find well prepared to learn the proposed topics. The curriculum has different data structures and algorithms. 



**Estimated time required for a week is 6-7 hours.** (To complete the curriculum in the given time)



**Basic usage guide:**

Using this repository depends on what the user wants to do with it. Here we are suggesting the following for people who want to slowly gain knowledge of the topics while continuing their studies etc.:

  1. Check out the written or video sources provided for a given topic depending on the preference. Go over as many as needed to gain a good understanding of the topic.

  2. Without checking the source code, try to replicate the algorithm or data structure on your own.

  3. When stuck or when done, look at the source codes provided, and compare them with yours to see what might be your mistake. Try to fix it.

  4. After you feel comfortable with the code, try to solve the given problems.

  5. When you are done with solving or are stuck at some point, check given solutions and try to understand your mistake or see if a better approach exists.



## Resources



Here are some of the websites/tools that we use through this curriculum:



  - [Leetcode](https://leetcode.com)

  - [Spoj](http://www.spoj.com)

  - [Hackerrank](https://www.hackerrank.com/domains)

  - [Topcoder](https://www.topcoder.com)

  - [Codeforces](http://codeforces.com)

  - [Lightoj](http://www.lightoj.com)

  - [ACM-Timus](http://acm.timus.ru)



## Contribution



If you have anything to add, do not hesitate to offer! You can check [Code of Conduct](CODE_OF_CONDUCT.md). You can submit a PR or an issue; I will try to personally review all.



## Topics



Here are the topics we currently include in the curriculum.



### Data Structures

  - Stacks

  - Queues

  - Priority queue

  - Hashmap

  - Linked List

  - Trees

  - Heaps

  - Advanced Trees 

    - Tries

    - Segment trees

    - Fenwick tree or Binary indexed trees

    - RMQ

  - SQRT Decomposition

  - Disjoint Data Structure

  - C++ STL (optional)



### Algorithms

  - Number Theory 

    - Prime Numbers (Sieve of Eratosthenes)

    - GCD and LCM Euclid’s Algorithm

    - Modular Exponentiation

    - Long arithmetic (Multi, Add)

    - Efficient Prime Factorization



  - Combinatorics (Probability-Combinations-Permutations-Matrix..)



  - Computational Geometry

    - Primitive Operations

      - Intuition

      - Polygon Inside, Outside

      - Implementing CCW

      - Immutable Point ADT

    - Convex Hull

    - Closest pair problem

    - Line intersection



  - Sort

    - QuickSort

    - Counting Sort

    - Merge Sort



  - Search

    - Binary Search

    - Ternary Search



  - Graph Theory

    - Depth First Search (DFS)

    - Breadth First Search (BFS)

    - Dijkstra’s Shortest Path

    - Minimum Spanning Tree 

    - Ford Bellman

    - Floyd Warshall

    - LCA (Lowest Common Ancestor)

    - Max Flow / Min Cut



  - Dynamic Programming

    - Knapsack

    - Matrix chain multiplication

    - Coin Change

    - Kadane

    - Longest increasing Subsequence (with RMQ)



  - Strings

    - Z algorithm

    - Suffix Trees/Arrays

    - Knuth-Morris-Pratt Algorithm (KMP)

    - Rabin-Karp Algorithm

    - Hash



  - Bit Manipulation



  - Game theory

    - Nim game

    - Grundy numbers

    - Sprague-Grundy theorem



  - **Optional Advanced Algorithms**

    - AVL Trees

    - Graph Coloring

    - Mo's Algorithm

    - Palindromic Tree

    - Heavy Light Decomposition

    - Dynamic Programming by Profile

    - Rod Cutting

    - Topological Sorting

    - DP with Bitmask - Dynamic Programming

    - Diobhantine Equation - Math

    - Flood Fill - Graph



## Curriculum

|Week|Topics|Optional Topics|

| --- | --- | --- |

|[**Heads Up **](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week00)|
  • Big O Notation
||

|[**1.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week01)|
    

  • Prime Numbers (Sieve of Eratosthenes)
    • 

  • Efficient Prime Factorization
    • 

  • Modular Exponentiation
    • 

||

|[**2.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week02)|
    

  • GCD and LCM Euclid’s Algorithm
    • 

  • Long arithmetic (Multi, Sum, Div, Sub)
    • 

|
    

  • C++ STL:Vector
    • 

  • C++ STL:Pairs
    • 

  • C++ STL:Iterators
    • 

|

|[**3.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week03)|
    

  • QuickSort
    • 

  • Counting Sort
    • 

|
    

  • C++ STL:String
    • 

  • C++ STL:Set
    • 

  • C++ STL:Map
    • 

|

|[**4.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week04)|
    

  • Merge Sort
    • 

  • Binary Search
    • 

|
  • Ternary Search
|

|[**5.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week05)|
    

  • Queue (DS)
    • 

  • Stack (DS)
    • 

  • Breadth First Search
    • 

  • Depth First Search
    • 

|
    

  • C++ STL: Queue
    • 

  • C++ STL: Stack
    • 

|

|[**6.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week06)|
    

  • Linked List (DS)
    • 

  • Dijkstra’s Shortest Path
    • 

  • Minimum Spanning Tree (MST)
    • 

  • Floyd Warshall
    • 

|
  • Cycle Detection (Union Find)
|

|[**7.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week07)|
    

  • Knapsack
    • 

  • Coin Change
    • 

  • Kadane
    • 

||

|[**8.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week08)|**Questions from previous topics**||

|[**9.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week09)|
    

  • Trees (DS)
    • 

  • Segment Trees (DS)
    • 

  • Range Minimum Query (RMQ)
    • 

  • Lowest Common Ancestor (LCA)
    • 

|
  • Topological Sorting
|

|[**10.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week10)|
    

  • Ford Bellman
    • 

  • Max Flow / Min Cut
    • 

  • Longest increasing Subsequence (with RMQ)
    • 

|
  • Heavy Light Decomposition
|

|[**11.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week11)|
    

  • Primitive Operations
      

    • Intuition
      • 

    • Polygon Inside, Outside
      • 

    • Implementing CCW
      • 

    • Immutable Point ADT
      • 

    

    • 

  • Convex Hull
    • 

  • Closest pair problem
    • 

  • Line intersection
    • 

||

|[**12.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week12)|
    

  • Tries (DS)
    • 

  • Suffix Trees/Arrays (DS)
    • 

  • Knuth-Morris-Pratt Algorithm (KMP)
    • 

  • Rabin-Karp Algorithm
    • 

||

|[**13.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week13)|
    

  • Heaps (DS)
    • 

  • Priority queue (DS)
    • 

  • Combinatorics
    • 

||

|[**14.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week14)|
    

  • Z algorithm
    • 

  • Hash
    • 

  • Disjoint Data Structure (DS)
    • 

||

|[**15.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week15)|
    

  • Matrix chain multiplication
    • 

  • SQRT Decomposition (DS)
    • 

|
    

  • Mo's Algorithm
    • 

  • Rod Cutting
    • 

|

|[**16.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week16)|**Questions from previous topics**||

|[**17.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week17)|
    

  • Nim game
    • 

  • Grundy numbers
    • 

||

|[**18.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week18)|
    

  • Sprague-Grundy theorem
    • 

  • Fenwick tree or Binary indexed trees (DS)
    • 

||

|[**19.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week19)|
  • Bit Manipulation
|
    

  • Palindromic Tree
    • 

  • AVL Trees
    • 

|

|[**20.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week20)|
    

  • Heavy Light Decomposition
    • 

  • Dynamic Programming by Profile
    • 

|
  • Graph Coloring
|



### [Contributers](https://github.com/NAU-ACM/ACM-ICPC-Preparation/graphs/contributors)