This repository belongs to ICPC Preparations for UWindsor students.

Contents:

• Modular Arithemitic
• Modular Exponentiation
• Greatest Common Divisor (GCD)
• Extended Euclidean Algorithm
• Modular Multiplicative Inverse

• Quick Sort

• Counting Sort

• Merge Sort

• Binary Search

• Ternary Search

• Stack

• Queue

• Linked List

• Heap

• Priority Queues

• Vectors

• Map, Set

• Stack

• Queue

• Use of bits/stdc++.h header file and other STL functions

• Bit Manipulation

• BFS

• DFS

• Shortest Path

• Minimum Spanning Tree

• Floyd Warshal

• Union Find

• Longest Common Sub-sequence

• 0-1 Knapsack

• Fractional Knapsack

• Coin Exchange

• Kadane Algorithm

• Subset Sub Problem

• Matrix Chain Multiplication

• BST

• AVL Tree

• Segment Trees

• BIT

• Range minimum Queries

• Longest Common Ancestor

• Max Cut Min Flow

• Bellman Ford

• Heavy Light Decomposition

• Detecting if point lie inside or outside of a Polygon

• Convex Hull Problem

• Closest Pair Problem

• Line intersection

• Tries

• Suffix Trees

• KMP

• Rabin Karp

• Nim Game

• Grundy Numbers

• Sprage Grundy Theorem

• Collision Detection in Hashing

• Heavy Light Decomposition

• Graph Coloring

• Mo’s Algorithm

• Practicing on CodeForces or Kattis or Google CodeJam

• Practicing Live Contest