IIT Gandhinagar · Computer Science

Getting Started with Competitive Programming

Prof. Neeldhara Misra · 2025 · 54 free video lectures

This is a course on algorithm design with a focus on issues of modeling and implementation. Each lecture will be focused entirely on one or two problems that reveal the use of a specific algorithmic technique. The techniques themselves are chosen to be in line with those covered in existing NPTEL…

▶ Play on Open Lecture HallCourse page ↗

Lectures

  1. Welcome and Initial Setup
  2. Reversort
  3. Engineering Reversort
  4. Number Game
  5. Will It Stop?
  6. Trouble Sort
  7. The Meeting Place Cannot Be Changed
  8. Magic Ship
  9. Simple Skewness
  10. Pancake Flipping
  11. Islands War
  12. Stable Marriage - I
  13. Stable Marriage - II
  14. When Greedy Does Not Work - Coin Change
  15. When Greedy Does Not Work - Guarding a Museum
  16. When Greedy Does Not Work - Traveling Salesman
  17. DSU - Definition and Motivation
  18. DSU via Union by Rank and Path Compression
  19. DSU - Implementation
  20. Destroying Array - I (Problem Statement and Solution)
  21. Destroying Array - II (Implementation)
  22. War - I (Problem Statement)
  23. War - II (Solution)
  24. War - III (Implementation)
  25. Graph Foundations
  26. BFS and DFS
  27. Mahmoud and Ehab and the bipartiteness
  28. Cover It!
  29. Diamond Inheritance
  30. SSSP - Overview BFS Revisited
  31. SSSP and Dijkstra's Algorithm
  32. Sending Email
  33. SSSP and Modified Dijkstra
  34. SSSP with Negative Cycles - Bellman-Ford
  35. Wormholes
  36. APSP and Floyd-Warshall
  37. Page Hopping
  38. Introduction to MSTs
  39. Prim's Algorithm
  40. Kruskal's Algorithm
  41. Cherries Mesh
  42. Heirarchy
  43. Island Hopping
  44. Introduction to MaxFlow
  45. Ford-Fulkerson for MaxFlow
  46. Implementing Edmonds-Karp
  47. Maximum Matching via MaxFlow
  48. Sport Elimination via MaxFlow
  49. Maxflow-Mincut Duality
  50. Police Chase
  51. Sam I AM and Vertex Covers
  52. Top-Down Dynamic Programming with Frog 1_Part A
  53. Top-Down Dynamic Programming with Frog 1_Part B
  54. Bottom-Up Dynamic Programming with Dice Combinations

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Gandhinagar.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights