Udemyintermediateen

Algorithms in Competitive Programming: Maths Puzzles II(1)

Learn algorithms for solving combinatorial game theory puzzles. Explore strategies and techniques to master these challenging problems.

4.3(5)
2,290students
53m
Keyi Huang
Keyi HuangStudent in Raffles Institution

Course Content

Algorithms in Competitive Programming: Maths Puzzles II(1) is an intermediate-level Udemy course taught by Keyi Huang. It runs 53m and is taught in English. Learners rate it 4.3 out of 5 from 5 reviews, with 2,290 students enrolled. It is free to enroll, first published July 2021.

Dive into the world of competitive programming with this series of courses focused on essential algorithms! Sharpen your problem-solving skills and master the art of writing efficient code to tackle challenging logical and mathematical problems.

What is Competitive Programming?

Competitive programming is a stimulating mental sport where you'll test your abilities in solving problems rooted in areas like combinatorics, number theory, graph theory, algorithmic game theory, computational geometry, string analysis, and data structures. A strong understanding of algorithms is crucial for crafting optimal solutions. The goal? To write computer programs that effectively address given problems.

Why Learn Algorithms for Competitive Programming?

This course goes beyond just implementation. We'll delve into the underlying mathematics that makes these algorithms work. Understanding the mathematical principles is essential for ensuring the correctness and efficiency of your code. Expect rigorous proofs of algorithms throughout this series.

Algorithms in Competitive Programming: Maths Puzzles II - Course Overview

This is the first installment in our Algorithms in Competitive Programming series, specifically focusing on combinatorial game theory. While a specialized area, it's arguably one of the most fascinating aspects of competitive programming, brimming with surprising mathematical logic.

Course Structure:

Each course follows a structured approach to maximize learning:

  • Problem Description: A clear explanation of the challenge.
  • Naive Approach: Exploring initial, less efficient solutions.
  • Algorithm Introduction: Introducing the core algorithm being used.
  • Mathematical Proof: A detailed mathematical proof demonstrating correctness and efficiency.
  • Sample Problem: Applying the algorithm to a practical example.
  • Short Quiz: Reinforcing key concepts.
  • Hands-on Practice: Developing your skills through exercises.

If you're captivated by the intricacies of competitive programming algorithms and want to deepen your understanding, stay tuned for future courses in this series! We'll be exploring even more advanced techniques and problem-solving strategies.

$ whoami — the devs behind tutorialsearch.io

Need a web app built? Hire the team behind TutorialSearch.io

We ship fast, production-grade full-stack apps (Next.js, React, edge infra) — the same stack that powers this site.

skillshare
5.0(609)
51m
intermediate
skillshare

PLC Programming

by Allen Mupandasekwa

5.0(44)
2h 50m
all
skillshare
5.0
1h 36m
beginner
pluralsight