SyntaxPilot
Courses/Competitive Programming

Advanced · Free course

Competitive Programming

Contest techniques in C++ with stress tests and real constraints.

90 lessons32 videos so far6 h 27 min of videoNotes for every lesson

What you’ll learn

  • Fast I/O and complexity
  • Number theory and combinatorics
  • Graphs and trees for contests
  • Advanced DP and data structures
0 of 90 complete

Curriculum

  1. 1What competitive programming is: contests, judges, verdicts, ratingssoon
  2. 2C++ setup for contests: template, fast I/O, bits/stdc++soon
  3. 3Reading constraints: from n to the complexity you needsoon
  4. 4Verdicts explained: WA, TLE, MLE, RE and how to debug eachsoon
  5. 5Stress testing: brute force + random generator + checkersoon
  6. 6Contest strategy: reading order, time, penalties, upsolving10 min
  7. 7Prefix sums and difference arrays11 min
  8. 82D prefix sums and range updates10 min
  9. 9Coordinate compression11 min
  10. 10Two pointers on contest problems10 min
  11. 11Binary search on the answersoon
  12. 12Ternary search10 min
  13. 13Sorting tricks and custom comparators13 min
  14. 14Greedy with exchange-argument proofssoon
  15. 15Constructive problems: build any valid answer11 min
  16. 16Ad-hoc and observation problems12 min
  17. 17Bit tricks: XOR properties, masks, __builtin functions13 min
  18. 18Meet in the middle10 min
  19. 19Number theory 1: divisibility, GCD/LCM, the Euclidean algorithm14 min
  20. 20Number theory 2: sieve, smallest prime factor, factorisation12 min
  21. 21Modular arithmetic and fast exponentiation11 min
  22. 22Modular inverse and Fermat's little theorem13 min
  23. 23Combinatorics: nCr mod p with factorials15 min
  24. 24Inclusion-exclusion14 min
  25. 25Extended Euclid and linear Diophantine equations16 min
  26. 26Chinese remainder theorem15 min
  27. 27Euler's totient and divisor sums19 min
  28. 28Probability and expected value18 min
  29. 29Matrix exponentiation for linear recurrences13 min
  30. 30Game theory 1: winning and losing positions11 min
  31. 31Game theory 2: Nim and Sprague-Grundy11 min
  32. 32DP for contests 1: states and transitions11 min
  33. 33DP 2: knapsack variants12 min
  34. 34DP 3: DP on subsequences and strings11 min
  35. 35DP 4: interval DP10 min
  36. 36DP 5: bitmask DP10 min
  37. 37DP 6: digit DP10 min
  38. 38DP 7: DP on trees and rerooting10 min
  39. 39DP 8: SOS DP (sum over subsets)10 min
  40. 40DP 9: probability and expected-value DPsoon
  41. 41DP optimisation 1: monotonic queue and prefix-min trickssoon
  42. 42DP optimisation 2: convex hull tricksoon
  43. 43DP optimisation 3: divide and conquer DPsoon
  44. 44DP optimisation 4: Knuth optimisationsoon
  45. 45Graphs for contests: BFS/DFS templates, grids, 0-1 BFSsoon
  46. 46Shortest paths in contests: Dijkstra variants, multi-source, state graphssoon
  47. 47DSU with rollback and small-to-large mergingsoon
  48. 48Minimum spanning tree problemssoon
  49. 49Topological order and DP on DAGssoon
  50. 50Bridges, articulation points and 2-edge-connected componentssoon
  51. 51SCC and 2-SATsoon
  52. 52Trees: diameter, centre, subtree sizessoon
  53. 53LCA with binary liftingsoon
  54. 54Euler tour and subtree queriessoon
  55. 55Heavy-light decompositionsoon
  56. 56Centroid decompositionsoon
  57. 57Functional graphs and cycle findingsoon
  58. 58Max flow: Dinic's algorithmsoon
  59. 59Bipartite matching and König's theoremsoon
  60. 60Min-cost max-flowsoon
  61. 61Segment tree with lazy propagationsoon
  62. 62Segment tree beats and merging trickssoon
  63. 63Fenwick tree tricks: range update, order statisticssoon
  64. 64Sparse table and RMQ on contestssoon
  65. 65Sqrt decompositionsoon
  66. 66Mo's algorithmsoon
  67. 67Persistent segment treesoon
  68. 68Ordered set (policy-based data structures)soon
  69. 69Treap: split and mergesoon
  70. 70Monotonic stack and deque in contest problemssoon
  71. 71String hashing (and anti-hash tests)soon
  72. 72KMP and prefix-function problemssoon
  73. 73Z-function problemssoon
  74. 74Manacher's algorithmsoon
  75. 75Trie and XOR-maximisation problemssoon
  76. 76Aho-Corasicksoon
  77. 77Suffix array and LCPsoon
  78. 78Suffix automaton basicssoon
  79. 79Geometry 1: points, vectors, cross product, orientationsoon
  80. 80Geometry 2: convex hullsoon
  81. 81Geometry 3: line intersection and polygon areasoon
  82. 82FFT and polynomial multiplicationsoon
  83. 83NTT and counting with polynomialssoon
  84. 84Interactive problemssoon
  85. 85Random and hashing techniques in contestssoon
  86. 86Bitsets for speedsoon
  87. 87Contest walkthrough: a Div 2 A-C setsoon
  88. 88Contest walkthrough: a Div 2 D-E setsoon
  89. 89Contest walkthrough: a hard Div 1 setsoon
  90. 90The road from Pupil to Expert and beyond: practice plansoon