{"id":13621750,"url":"https://github.com/BedirT/ACM-ICPC-Preparation","last_synced_at":"2025-04-15T01:33:50.457Z","repository":{"id":37851916,"uuid":"57855327","full_name":"BedirT/ACM-ICPC-Preparation","owner":"BedirT","description":"ACM-ICPC Preparation Guide","archived":false,"fork":false,"pushed_at":"2022-11-17T17:49:26.000Z","size":2263,"stargazers_count":2264,"open_issues_count":1,"forks_count":686,"subscribers_count":83,"default_branch":"master","last_synced_at":"2025-04-14T10:42:45.793Z","etag":null,"topics":["acm-icpc","algorithm","competitive-programming","curriculum","programming-language"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BedirT.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2016-05-01T22:57:08.000Z","updated_at":"2025-04-14T10:35:17.000Z","dependencies_parsed_at":"2023-01-20T22:36:16.937Z","dependency_job_id":null,"html_url":"https://github.com/BedirT/ACM-ICPC-Preparation","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BedirT%2FACM-ICPC-Preparation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BedirT%2FACM-ICPC-Preparation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BedirT%2FACM-ICPC-Preparation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BedirT%2FACM-ICPC-Preparation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BedirT","download_url":"https://codeload.github.com/BedirT/ACM-ICPC-Preparation/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248989486,"owners_count":21194595,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["acm-icpc","algorithm","competitive-programming","curriculum","programming-language"],"created_at":"2024-08-01T21:01:10.173Z","updated_at":"2025-04-15T01:33:50.450Z","avatar_url":"https://github.com/BedirT.png","language":"Python","funding_links":[],"categories":["Python"],"sub_categories":[],"readme":"![ACM-ICPC](https://github.com/NAU-ACM/ACM-ICPC-Preparation/blob/master/acm_icpc_prep.jpg \"ACM-ICPC\")\n\n# ACM-ICPC Preparation \n![](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)\n\nThis curriculum has been developed to learn Algorithms to use in Competitive Programming, **but can also be used for:**\n  - Practicing for Interviews\n  - Improving Algorithmic Thinking\n  - Practicing for College Classes\n\n**Prerequisites:** \n  - To know at least one programming language. (_You have to be able to use the language efficiently._)\n\nThe 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. \n\n**Estimated time required for a week is 6-7 hours.** (To complete the curriculum in the given time)\n\n**Basic usage guide:**\nUsing 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.:\n  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.\n  2. Without checking the source code, try to replicate the algorithm or data structure on your own.\n  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.\n  4. After you feel comfortable with the code, try to solve the given problems.\n  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.\n\n## Resources\n\nHere are some of the websites/tools that we use through this curriculum:\n\n  - [Leetcode](https://leetcode.com)\n  - [Spoj](http://www.spoj.com)\n  - [Hackerrank](https://www.hackerrank.com/domains)\n  - [Topcoder](https://www.topcoder.com)\n  - [Codeforces](http://codeforces.com)\n  - [Lightoj](http://www.lightoj.com)\n  - [ACM-Timus](http://acm.timus.ru)\n\n## Contribution\n\nIf 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.\n\n## Topics\n\nHere are the topics we currently include in the curriculum.\n\n### Data Structures\n  - Stacks\n  - Queues\n  - Priority queue\n  - Hashmap\n  - Linked List\n  - Trees\n  - Heaps\n  - Advanced Trees \n    - Tries\n    - Segment trees\n    - Fenwick tree or Binary indexed trees\n    - RMQ\n  - SQRT Decomposition\n  - Disjoint Data Structure\n  - C++ STL (optional)\n\n### Algorithms\n  - Number Theory \n    - Prime Numbers (Sieve of Eratosthenes)\n    - GCD and LCM Euclid’s Algorithm\n    - Modular Exponentiation\n    - Long arithmetic (Multi, Add)\n    - Efficient Prime Factorization\n\n  - Combinatorics (Probability-Combinations-Permutations-Matrix..)\n\n  - Computational Geometry\n    - Primitive Operations\n      - Intuition\n      - Polygon Inside, Outside\n      - Implementing CCW\n      - Immutable Point ADT\n    - Convex Hull\n    - Closest pair problem\n    - Line intersection\n\n  - Sort\n    - QuickSort\n    - Counting Sort\n    - Merge Sort\n\n  - Search\n    - Binary Search\n    - Ternary Search\n\n  - Graph Theory\n    - Depth First Search (DFS)\n    - Breadth First Search (BFS)\n    - Dijkstra’s Shortest Path\n    - Minimum Spanning Tree \n    - Ford Bellman\n    - Floyd Warshall\n    - LCA (Lowest Common Ancestor)\n    - Max Flow / Min Cut\n\n  - Dynamic Programming\n    - Knapsack\n    - Matrix chain multiplication\n    - Coin Change\n    - Kadane\n    - Longest increasing Subsequence (with RMQ)\n\n  - Strings\n    - Z algorithm\n    - Suffix Trees/Arrays\n    - Knuth-Morris-Pratt Algorithm (KMP)\n    - Rabin-Karp Algorithm\n    - Hash\n\n  - Bit Manipulation\n\n  - Game theory\n    - Nim game\n    - Grundy numbers\n    - Sprague-Grundy theorem\n\n  - **Optional Advanced Algorithms**\n    - AVL Trees\n    - Graph Coloring\n    - Mo's Algorithm\n    - Palindromic Tree\n    - Heavy Light Decomposition\n    - Dynamic Programming by Profile\n    - Rod Cutting\n    - Topological Sorting\n    - DP with Bitmask - Dynamic Programming\n    - Diobhantine Equation - Math\n    - Flood Fill - Graph\n\n\n## Curriculum\n|Week|Topics|Optional Topics|\n| --- | --- | --- |\n|[**Heads Up **](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week00)|\u003cul\u003e\u003cli\u003eBig O Notation\u003c/li\u003e\u003c/ul\u003e||\n|[**1.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week01)|\u003cul\u003e\u003cli\u003ePrime Numbers (Sieve of Eratosthenes)\u003c/li\u003e\u003cli\u003eEfficient Prime Factorization\u003c/li\u003e\u003cli\u003eModular Exponentiation\u003c/li\u003e\u003c/ul\u003e||\n|[**2.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week02)|\u003cul\u003e\u003cli\u003eGCD and LCM Euclid’s Algorithm\u003c/li\u003e\u003cli\u003eLong arithmetic (Multi, Sum, Div, Sub)\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eC++ STL:Vector\u003c/li\u003e\u003cli\u003eC++ STL:Pairs\u003c/li\u003e\u003cli\u003eC++ STL:Iterators\u003c/li\u003e\u003c/ul\u003e|\n|[**3.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week03)|\u003cul\u003e\u003cli\u003eQuickSort\u003c/li\u003e\u003cli\u003eCounting Sort\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eC++ STL:String\u003c/li\u003e\u003cli\u003eC++ STL:Set\u003c/li\u003e\u003cli\u003eC++ STL:Map\u003c/li\u003e\u003c/ul\u003e|\n|[**4.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week04)|\u003cul\u003e\u003cli\u003eMerge Sort\u003c/li\u003e\u003cli\u003eBinary Search\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eTernary Search\u003c/li\u003e\u003c/ul\u003e|\n|[**5.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week05)|\u003cul\u003e\u003cli\u003eQueue (DS)\u003c/li\u003e\u003cli\u003eStack (DS)\u003c/li\u003e\u003cli\u003eBreadth First Search\u003c/li\u003e\u003cli\u003eDepth First Search\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eC++ STL: Queue\u003c/li\u003e\u003cli\u003eC++ STL: Stack\u003c/li\u003e\u003c/ul\u003e|\n|[**6.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week06)|\u003cul\u003e\u003cli\u003eLinked List (DS)\u003c/li\u003e\u003cli\u003eDijkstra’s Shortest Path\u003c/li\u003e\u003cli\u003eMinimum Spanning Tree (MST)\u003c/li\u003e\u003cli\u003eFloyd Warshall\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eCycle Detection (Union Find)\u003c/li\u003e\u003c/ul\u003e|\n|[**7.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week07)|\u003cul\u003e\u003cli\u003eKnapsack\u003c/li\u003e\u003cli\u003eCoin Change\u003c/li\u003e\u003cli\u003eKadane\u003c/li\u003e\u003c/ul\u003e||\n|[**8.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week08)|**Questions from previous topics**||\n|[**9.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week09)|\u003cul\u003e\u003cli\u003eTrees (DS)\u003c/li\u003e\u003cli\u003eSegment Trees (DS)\u003c/li\u003e\u003cli\u003eRange Minimum Query (RMQ)\u003c/li\u003e\u003cli\u003eLowest Common Ancestor (LCA)\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eTopological Sorting\u003c/li\u003e\u003c/ul\u003e|\n|[**10.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week10)|\u003cul\u003e\u003cli\u003eFord Bellman\u003c/li\u003e\u003cli\u003eMax Flow / Min Cut\u003c/li\u003e\u003cli\u003eLongest increasing Subsequence (with RMQ)\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eHeavy Light Decomposition\u003c/li\u003e\u003c/ul\u003e|\n|[**11.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week11)|\u003cul\u003e\u003cli\u003ePrimitive Operations\u003cul\u003e\u003cli\u003eIntuition\u003c/li\u003e\u003cli\u003ePolygon Inside, Outside\u003c/li\u003e\u003cli\u003eImplementing CCW\u003c/li\u003e\u003cli\u003eImmutable Point ADT\u003c/li\u003e\u003c/ul\u003e\u003c/li\u003e\u003cli\u003eConvex Hull\u003c/li\u003e\u003cli\u003eClosest pair problem\u003c/li\u003e\u003cli\u003eLine intersection\u003c/li\u003e\u003c/ul\u003e||\n|[**12.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week12)|\u003cul\u003e\u003cli\u003eTries (DS)\u003c/li\u003e\u003cli\u003eSuffix Trees/Arrays (DS)\u003c/li\u003e\u003cli\u003eKnuth-Morris-Pratt Algorithm (KMP)\u003c/li\u003e\u003cli\u003eRabin-Karp Algorithm\u003c/li\u003e\u003c/ul\u003e||\n|[**13.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week13)|\u003cul\u003e\u003cli\u003eHeaps (DS)\u003c/li\u003e\u003cli\u003ePriority queue (DS)\u003c/li\u003e\u003cli\u003eCombinatorics\u003c/li\u003e\u003c/ul\u003e||\n|[**14.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week14)|\u003cul\u003e\u003cli\u003eZ algorithm\u003c/li\u003e\u003cli\u003eHash\u003c/li\u003e\u003cli\u003eDisjoint Data Structure (DS)\u003c/li\u003e\u003c/ul\u003e||\n|[**15.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week15)|\u003cul\u003e\u003cli\u003eMatrix chain multiplication\u003c/li\u003e\u003cli\u003eSQRT Decomposition (DS)\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eMo's Algorithm\u003c/li\u003e\u003cli\u003eRod Cutting\u003c/li\u003e\u003c/ul\u003e|\n|[**16.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week16)|**Questions from previous topics**||\n|[**17.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week17)|\u003cul\u003e\u003cli\u003eNim game\u003c/li\u003e\u003cli\u003eGrundy numbers\u003c/li\u003e\u003c/ul\u003e||\n|[**18.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week18)|\u003cul\u003e\u003cli\u003eSprague-Grundy theorem\u003c/li\u003e\u003cli\u003eFenwick tree or Binary indexed trees (DS)\u003c/li\u003e\u003c/ul\u003e||\n|[**19.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week19)|\u003cul\u003e\u003cli\u003eBit Manipulation\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003ePalindromic Tree\u003c/li\u003e\u003cli\u003eAVL Trees\u003c/li\u003e\u003c/ul\u003e|\n|[**20.Week**](https://github.com/NAU-ACM/ACM-ICPC-Preparation/tree/master/Week20)|\u003cul\u003e\u003cli\u003eHeavy Light Decomposition\u003c/li\u003e\u003cli\u003eDynamic Programming by Profile\u003c/li\u003e\u003c/ul\u003e|\u003cul\u003e\u003cli\u003eGraph Coloring\u003c/li\u003e\u003c/ul\u003e|\n\n### [Contributers](https://github.com/NAU-ACM/ACM-ICPC-Preparation/graphs/contributors)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FBedirT%2FACM-ICPC-Preparation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FBedirT%2FACM-ICPC-Preparation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FBedirT%2FACM-ICPC-Preparation/lists"}