Computer Science Club

These are all of my weekly resources for the contest group of the CS club

---

Table of Contents

To easily navigate through all of the different sections

• Week1: Introduction to DMOJ and Sorting

  • Presentation
  • Solutions

• Week2: Prefix Sums and Difference Arrays

  • Presentation
  • Solutions

• Week3: Binary Search

  • Presentation
  • Solutions

• Week4: Modulos

  • Presentation
  • Solutions

• Week5: Stacks and Queues

  • Presentation
  • Solutions

• Week6: Recursion

  • Presentation
  • Solutions

• Week7: Introduction to Graph Theory and DFS

  • Presentation
  • Solutions

• Week8: Graph Theory Involving Grids

  • Presentation
  • Solutions

• Week9: Introduction to Trees

  • Presentation
  • Solutions

• Week10: Djikstra

  • Presentation
  • Solutions

• Week11: Preparation for CCC

  • Presentation
  • Solutions

• Week12: Dynamic Programming

  • Presentation
  • Solutions

• Week13: Segment Trees

  • Presentation
  • Solutions

• Week14: Bellman Ford and Floyd Warshall

  • Presentation
  • Solutions

• Week15: Combinatorics

  • Presentation
  • Solutions

• Week16: Introduction to Binary and Bitmasks

  • Presentation
  • Solutions

• Week17: Balanced Binary Trees

  • Presentation
  • Solutions

---

Description

These are all of the presentations, problems and solutions that I created as a senior executive of the contest group of my high school's computer science club. Me and two other contest executives were responsible for hosting weekly meetings that taught a different aspect of competitive programming.

Language

• Java

Platform

All questions and solutions are from the DMOJ platform.

Contributors

• Edwin Sun
• Darren Lo