Skip to content
Neeldhara’s courses

Competitive Programming

Notes to return to. Ideas to build on.

Start readingFind a course edition

Course notes

  1. Getting Started with Competitive Programming
  2. Lecture 0 · Welcome and Initial Setup
  3. Lecture 1 · Ad hoc and Implementation
  4. Lecture 2 · M 2 (Reversort Engineering)
  5. Lecture 3 · M 03 (Numbers Game)
  6. Lecture 4 · M 4 (Will It Stop?)
  7. Lecture 5 · M 1 (Trouble Sort)
  8. Lecture 6 · M 2 (The Meeting Place Cannot be
  9. Lecture 7 · M 3 (Magic Ship)
  10. Lecture 8 · M 4 (Simple Skewness)
  11. Lecture 9 · M 1 (Pancake Flipping)
  12. Lecture 10 · M 2 (Islands War)
  13. Lecture 11 · M 3 (Stable Marriage-I)
  14. Lecture 12 · M 3 (Stable Marriage-II)
  15. Lecture 13 · M 4 (When Greedy Does Not Work - Coin Change)
  16. Lecture 14 · M 4 (When Greedy Does Not Work - Guarding a Museum)
  17. Lecture 15 · M 4 (When Greedy Does Not Work - Traveling Salesman)
  18. Lecture 16 · M 1 (An Introduction)
  19. Lecture 17 · M 1 (An Introduction-Part II)
  20. Lecture 18 · M 1 (An Introduction-Part III)
  21. Lecture 19 · M 2 (Destroying Array-I)
  22. Lecture 20 · M 2 (Destroying Array-II)
  23. Lecture 21 · M 3 (War-I)
  24. Lecture 22 · M 3 (War-II)
  25. Lecture 23 · M 3 (War-III)
  26. Lecture 24 · M 1 (Graph Traversals)
  27. Lecture 25 · M 1 (BFS and DFS)
  28. Lecture 26 · M 2 (Mahmoud and Ehab and the bipartiteness)
  29. Lecture 27 · M 3 (Cover It!)
  30. Lecture 28 · M 4 (Diamond Inheritance)
  31. Lecture 29 · M 1 (Dijkstra’s Algorithm)
  32. Lecture 30 · M 1 (Dijkstra’s Algorithm)
  33. Lecture 31 · M 1 (Dijkstra’s Algorithm-Sending Email)
  34. Lecture 32 · M 1 (Modified Dijkstra)
  35. Lecture 33 · M 2 (Wormholes [Bellman-Ford | Negative
  36. Lecture 34 · M 2 (Wormholes [Bellman-Ford | Negative
  37. Lecture 35 · M 3 (APSP [Floyd-Warshall] | Page Hopping)
  38. Lecture 36 · M 3 (APSP [Floyd-Warshall] | Page Hopping)
  39. Lecture 37 · M 1 (Blingor’s Network | Foundations
  40. Lecture 38 · M 1 (Prim’s Algorithm)
  41. Lecture 39 · M 1 (Kruskal’s Algorithm)
  42. Lecture 40 · M 2 (Cherries Mesh)
  43. Lecture 41 · M 3 (Hierarchy)
  44. Lecture 42 · M 4 (Island Hopping)
  45. Lecture 43 · M 1 (Introduction)
  46. Lecture 44 · M 1 (Ford-Fulkerson for Max Flow)
  47. Lecture 45 · M 1 (Implementing Edmonds-Karp)
  48. Lecture 46 · M 2 (Maximum Matching via MaxFlow)
  49. Lecture 47 · Sport Elimination via MaxFlow
  50. Lecture 48 · MaxFlow-MinCut Duality
  51. Lecture 49 · Police Chase
  52. Lecture 50 · Minimum Vertex Cover via Max Flow | SAM I AM (UVA 11419)
  53. Lecture 51 · Memoization | Frogs 1 (AtCoder Educational DP Contest)
  54. Lecture 52 · Introduction | Frogs 1 (AtCoder Educational DP Contest)
  55. Lecture 53 · Bottom-Up DP | Dice Combinations (CSES Problem Set)

Resources