Skip to content

This repo contains the courses, exercises and solutions of the weekly trainings of our competitive programming student club.

Notifications You must be signed in to change notification settings

INSAlgo/trainings-2018

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

INSAlgo weekly trainings - 2018-2019

This repo contains the courses, exercises and solutions of the weekly trainings of our competitive programming student club.

Program of the trainings

  • Week 1 (October 8th - October 14th): exercises to introduce the students to Python and to the kind of problems they can meet in competitions. Material: Python Quick Start Guide
  • Week 2 (October 15th - October 21st): I/O course for beginners, harder problems for the others.
  • Week 3 (October 22nd - October 28th): course about complexity and evaluating algorithms. Material: Slides
  • Week 4: (November 5th - November 11th) warmup and Battle Dev (2-hour online programming contest)
  • Week 5: (November 12th - November 18th) stacks and queues. Material: Slides
  • Week 6: (November 19th - November 25th) brute force and bracktracking. Material: Slides
  • Week 7: (November 26th - December 1st) divide & conquer. Material: Slides
  • Week 8: (December 3rd - December 9th) more exercises about divide & conquer.
  • Week 9: (December 10th - December 16th) greedy algorithms. Material: Slides
  • Week 10: (December 17th - December 23rd) common data structures: under the hood, complexity, when to use them. Material: Slides
  • Week 11: (January 7th - January 13th) trees. Material: Slides
  • Week 12: (January 14th - January 20th) you can keep on working on exercises from the last weeks
  • Week 13: (January 21st - January 27th) Graph Theory 1: intro. Material: Slides
  • Week 14: (February 4th - February 10th) Graph Theory 2: Minimum Spanning Tree. Material: Slides
  • Week 15: (February 11th - February 17th) Graph Theory 3: Shortest Path. Material: Slides
  • Week 17: (February 25th - March 3rd): Warm up for the coding contest
  • Week 18: (March 4th - March 10th): Hard problem, split in a few steps
  • Week 19: (March 11th - March 17th): Exercises and follow up on the precedent week's problem
  • Week 20: (March 18th - March 24th): Dynamic programming. Material : Slides
  • Week 21: (April 1st - April 7th) : Follow up on dynamic programming
  • Week 22: (April 29th - May 4th) : Introduction to machine learning
  • Week 23: (May 05th - May 12th) : Tries data structure. Material : Slides
  • Week 24: (May 13th - May 19th) : Travelling Salesman Problem : Slides
  • Week 25: (May 20th - May 26th) : Practice week
  • Week 26: (May 27th - June 2nd) : Virtual contest for last session of the year

License

The code is made available under MIT license (you must credit INSAlgo). You can also use the pdf slides with attribution.

About

This repo contains the courses, exercises and solutions of the weekly trainings of our competitive programming student club.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 4

  •  
  •  
  •  
  •