2:30 PM – Intro To Competitive Programming – Gamas

Today We Did

1. We went over the tricks and hurdle of submitting problem in https://train.usaco.org/
2. We went over how using HashMap can be faster than using List.
3. We went over different recursion problems.
4. We started explaining about Big O notation.

Homework

1. Watch this Big O Notation youtube – https://www.youtube.com/watch?v=XMUe3zFhM5c