Ongoing Project

This program developed to learn Algorithms for using in Competitive Prorgamming, but can be used for:

• Competitive Programming
• Practicing for Interviews
• Improving Algorithmic Thinking
• Practicing for College Class
• FUN

The course requires:

• To know at least one programming language well. (You have to be able to use the language efficiently.)
• You have to be familiarize with some of the basic Data Structures (Array, Stack, Queue, etc.) (Although if you don't know some of them, you may learn it when you come accross.)

In the program there is only guidence, so we did not add many content apart from that already exist. We just collected good sources to learn in one place, so that one can follow up and learn. The course includes Algorithms and a bit Data Structures. You need to follow the the curriculum week by week.

Basic fallowing guide would be to:

1. See the sources to study
2. Get the logic and try to code it without looking other codes
3. When you are stuck(you really should try first) or when you are done, look at the source codes, and compare it with yours so that you can see what would be the best approach for that Algorithm. You may not like others, or you may find some of them useful.
4. After feeling comfortable with the code itself, try to solve the questions.
5. When you are done with solving or are stuck(again ...) check other solutions and try to understand your mistake or if a better aproach exists.

In this course we will use some tools for the questions. As I mentioned above all of these questions already exists, we just highlight them so that you can reach better. Here are the websites/tools that we use through this course:

• Leetcode
• Spoj
• Hackerrank
• Topcoder
• Codeforces
• Lightoj
• ACM-Timus

I gave these tools name because you may not be able to submit your solution or display the question for some websites. It would be better if you just sign up. Although it is not neccesary...

Here are the topics we included in this curriculum.

• 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)

• 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

• Sorting

  • QuickSort
  • Counting Sort
  • Merge Sort

• Searching

  • 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

• Mustafa Bedir Tapkan . . . .
• Nadide Pasali . . . . . . . . . .
• Almaz Tukenov . . . . . . . . . .
• Inamullah Rasuna Muhammad . . . .