Jordan Competitive Programming

This repository is dedicated to collect all the efforts and videos of jordan competitive programming community and make a clear Roadmap for new trainee.

The content in this repository will be later exported to a website.

Main Goals:

• Videos should be in arabic (Language barrier).
• Centralize the effort from all jordan universities.
• Provide clear road map for beginners.
• The point is to not write new content as much as provide where is the resources.

Contributing:

Bug reports and pull requests are welcome on GitHub at https://github.com/Hiasat/JordanCP.

There is a template written on what the blog should provide, you can find it in template.md.

Progress

• General
  • Introduction to Competitive programming ✔️
  • Binary Search ✔️
  • Two Pointers ✔️
  • Complexity And BruteForce ✔️
  • Frequency Array ✔️
  • Prefix Sum ✔️
  • Standard Template Library (STL) ✔️
• Data Structure
  • Binary Indexed tree ✔️
  • Segment tree ✔️
  • Lazy propagation ✔️
  • Sparse table ❌
  • SQRT Decomposition ❌
• Dynamic Programming
  • Dynamic Programming Basic ✔️
• Graph Theory
  • Introduction to Graph theory ✔️
  • Breadth First Search ✔️
  • Depth First Search ✔️
  • Dijsktra ✔️
  • Disjoint sets ✔️
  • Maximum Matching ❌
  • Minimum/Maximum spanning tree ✔️
  • Topological sort ✔️
  • Lowest Common Ancestor ✔️
  • Max Flow ❌
  • DFS Numbering and Range Queries ✔️
  • Strongly Connected Components ✔️
  • Bridges and Articulation Points ✔️
• Strings
  • KMP ✔️
  • Trie ✔️
  • Suffix_Array ✔️
• Number Theory
  • Modular Arithmetic ❌
• Math
  • Gaussian Elimination ❌
• Game Theory
  • Nim Game ✔️
  • Grundy Numbers ❌
• Combinatorics
  • Rule of Sum and Product and Inclusion Exclusion ✔️
  • Permutation and combination ✔️
  • Stars and bars ✔️

License

The project is available as open source under the terms of the MIT License.