Algorithmic Training

Observation, Problem Solving, and Thinking Skills

The Paired Workshop Model

Rather than rushing theoretical intuition or cutting short hands-on problem solving, each topic spans a dedicated two-week cycle: Week 1 establishes formal theory, invariants, and algorithmic proofs, followed by Week 2 focused entirely on collaborative contest problem-solving, live implementation, and debugging common traps.

Week A // Session 1
Theory & Foundations

1.5 - 2.0 Hours Live

Rigorous exploration of theoretical principles, invariant tracking, proofs of correctness, and algorithmic intuition. Closes with a step-by-step live walkthrough of a foundational problem and the release of the curated Problem Sheet.

  • Algorithmic proofs & invariants
  • Complexity analysis & limits
  • Live foundational code walkthrough
  • Curated Problem Sheet distribution
Mid-Week // Asynchronous
Independent Practice

Self-Paced Mentorship

Students tackle the problem sheet independently at their own pace. Dedicated channels on Discord and GitHub provide asynchronous mentor guidance, progressive hints, and peer discussion prior to the application session.

  • Problem Sheet independent attempts
  • Asynchronous Discord & GitHub help
  • Algorithmic trade-off discussions
  • Edge-case & pitfall identification
Week B // Session 2
Application & Problem Solving

1.5 - 2.0 Hours Live

Dedicated entirely to collaborative problem solving and guided implementation. Workshop squads lead retrospective Q&A, dissect common traps, collaboratively solve 2–3 problems from the sheet, and assign take-home challenges.

  • Retrospective Q&A & traps review
  • Collaborative live coding sessions
  • Deep-dives into 2–3 selected problems
  • Take-home challenge problem release

Academic Year Curriculum

Eight focused workshop pairs across two semesters. Learn the idea, then solve with it.

Semester 1

Foundations, Traversals & Introduction to DP

  1. 01
    Mathematical Problem Solving

    logic // parity // invariants // heuristics

    Weeks 1 & 2
  2. 02
    Core Techniques

    prefix sums // two pointers // binary search

    Weeks 3 & 4
  3. 03
    Graph Theory I

    DFS // BFS // trees // connectivity // DSU

    Weeks 5 & 7
  4. 04
    Dynamic Programming I

    memoisation // tabulation // knapsack // grid DP

    Weeks 8 & 9
Semester 2

Number Theory, Advanced Topics & Range Queries

  1. 01
    Number Theory

    primes // GCD // fast powers // modular inverses

    Weeks 1 & 2
  2. 02
    Combinatorics

    permutations // combinations // PIE // stars and bars

    Weeks 3 & 4
  3. 03
    Graph Theory II

    Dijkstra // 0–1 BFS // state graphs // Kruskal

    Weeks 5 & 7
  4. 04
    Dynamic Programming II

    tree DP // bitmask DP // subset states // matching

    Weeks 8 & 9
Reading Week

No live session. Catch up, attempt challenges, and get mentor feedback online.

Problem Sets

Curated from CSES, Codeforces, and AtCoder with verified judges and editorials.

Advanced & Specialist Training

In addition to its paired workshop programme, KCPC delivers advanced and specialist training streams designed for elite competition preparation, focused research development, and collaborative instruction.

ICPC Open Cup & Regionals Preparation

Dedicated contest simulation and upsolving sessions for teams preparing for contests such as UKIEPC, ICPC, and related national and international events.

These programmes emphasise long-term preparation, coordinated team strategy, and contest-specific problem-solving depth.

Specialist Squads and Hackathon Training

KCPC forms specialist squads focused on advanced contest formats and hackathon-style problem solving.

Where appropriate, these squads are developed in coordination with the Orthant Research Group (ORG) ecosystem.

Workshop Fellows & Partnerships

KCPC collaborates with external specialists and partner institutions through its Workshop Fellow programme, delivering high-depth specialist instruction in focused technical domains.

Workshop Fellow lectures focus on specialised topics such as linear algebra, advanced combinatorics, or theoretical computer science, delivered in the context of IOI-style difficulty and reasoning. Fellows may deliver one-off lectures, short instructional series, or joint workshops co-designed with KCPC instructors and partner organisations.

Explore Our Global Network

Competitive Programmes Workshop Division Structure

Director

Competitive Programmes

Defines training strategyOversees curriculaEnsures progressionMentors coordinators

Workshop Squads

Instructional Delivery

2-person teaching unitsCo-design contentDeliver both tracksProvide support

Curriculum Review

Quality & Standards

Director signs offQuality assuranceCurriculum alignmentPedagogical clarity
Find Open Opportunities