Competitive Programming 1

Introduction to Competative Programming and Problem Solving using a computer

What do you need to solve problems using a computer:
- Introduction:
- Data Structures:
  - Intro:
  - Dynamic Array (a.k.a. vector, list):
  - Set:
  - Map (a.k.a. Associative Array):
  - Iterators:
  - Queue:
  - Stack:
  - Deque (Double Ended Queue):
  - Priority Queue:
  - Trees and graphs:
- Algorithms:
  - Intro:
  - Brute force search:
    - Generating all sets (or combinations) for the brute force search:
    - Generating all permutations for the brute force search:
  - Backtracking
    - Pruning the search space in backtracking
  - Meet in the middle
  - Greedy Algorithms
  - Tree Traversal Algorithms
    - Depth First Search using recursion
    - Depth First Search using a stack
    - Breath First Search (using a queue)
Canada Computing Competition:
- 2013 Junior Question 5:
- 2012 Junior Question 4:
- 2012 Junior Question 5:
- 2011 Junior Question 4:
- 2011 Junior Question 5:
Theory: (things that you need to know to do competetive programming)
- Competative Programming Handbook:
- External study Material:
- Data Structures:
  - Linear Data Structures
  - Non-linear Data Structures:
- Algorithms:
- Emory (M||E) Competetive Programming github page: