OT
This session has ended.
Session Details
About
I will be covering an introduction to the USA Computing Olympiad as well as competitive programming as a field.
In this session, I will primarily be taking questions/ideas from the audience. I will use your feedback to develop a full series on USACO/Competitive Programming for beginners. Some topics that might be covered in the final session include (but aren't limited too):
- Time Complexity (Big-O Notation)
- Basic Data Structures (Dynamic Arrays, Pairs, Tuples)
- Sorting & Searching Algorithms (e.g. Binary Search)
- Greedy Algorithms
- Graphs & Graph Traversal Algorithms (DFS, BFS, Floodfill, DSU, etc.)
- Prefix Sums
- Stacks, Queues, Deques, and Priority Queues
- Dynamic Programming
- Ad Hoc. Topics
Tutor Qualifications
I have competed in competitive programming contests like USA Computing Olympiad and CodeForces for the past four years. This experience has given me a solid foundation in algorithms and data structures.
Currently, I am working with an internationally recognized Olympiad/Data Structures & Algorithms coach to continue my USACO journey.