---
title: Competitive Programming Roadmap: 6-Month Plan for India
url: https://www.masaischool.com/resources/competitive-programming-roadmap
description: Competitive programming roadmap for India: platforms running in 2026, INOI, ICPC and CodeVita, a 6-month plan by rating band, and what it means for jobs.
updated: 2026-11-17
publisher: Masai (https://www.masaischool.com)
---

# Competitive Programming Roadmap: Platforms, the India Pathway and a 6-Month Plan by Rating Band

> **Short answer**
>
> Competitive programming is solving timed algorithm problems against other people on platforms such as Codeforces, AtCoder, CodeChef and LeetCode. Start with one language, work through the CSES problem set in order, enter one live contest a week and upsolve what you missed. It strengthens interview skills but is not a requirement for most software jobs.

This roadmap is for school and college students in India who want to start competitive programming (CP), or tried and stopped. Contest schedules, rules and dates were read from official pages and public contest lists on 11 November 2026, and each time-sensitive fact carries its date.

Two things changed that older guides miss: Google's coding competitions have closed, and the big platforms now restrict AI tools during contests. Both are covered below.

1. **Pick a language** - C++ or Python
2. **Learn the basics** - Complexity, sorting
3. **Practise by topic** - CSES, in order
4. **Enter live contests** - Weekly, then upsolve
5. **Add core topics** - DP, graphs, trees
6. **Choose a direction** - ICPC or interviews
The six stages of the plan below.

## What competitive programming is, and how it differs from interview prep

In a contest you get several problems, a clock and a judge that runs your program on hidden tests with strict time limits. Results go on a public scoreboard and, on rated platforms, move your rating. Interview preparation uses the same data structures and algorithms in a different setting.

|  | Competitive programming | Interview prep |
|---|---|---|
| Setting | Online contest with a public scoreboard | A conversation with an interviewer, or an online assessment |
| Time | 90 minutes to 3 hours for several problems | One or two problems per round; Amazon's loop uses 55-minute interviews, per the [SDE levels page](https://www.masaischool.com/resources/sde-full-form-and-sde-levels) |
| Problem style | Read input, print output, pass every hidden test in time | Often a function signature, and you explain your approach aloud |
| Language | C++ is the most common choice | Any mainstream language |
| Result | A rating that goes up and down | A hire or no-hire decision |

## Platforms in November 2026: what still runs

| Platform | Contest rhythm, read on 11 Nov 2026 | Good for |
|---|---|---|
| Codeforces | Several rated rounds a month. Next: Round 1134 (Div. 4) on Thu 12 Nov at 20:05 IST (Indian Standard Time), a Div. 2 round on Sun 15 Nov, and Div. 1 and Div. 2 rounds on Sat 21 Nov. 110 contests started in the 12 months before 11 Nov. | All levels. 11,511 problems, 11,194 of them rated 800 to 3500 |
| AtCoder | Beginner Contest (ABC) most Saturdays at 21:00 Japan time, which is 17:30 IST, 100 minutes, rated up to 1999. ABC 484 is on 14 Nov, ABC 485 on 21 Nov. | Clean, well-tested problems; ABC is the beginner track |
| CodeChef | Starters every Wednesday at 20:00 IST, 2 to 3 hours (264 on 11 Nov, 265 on 18 Nov), plus a rated Monday Munch DSA Challenge at 19:00 IST. Starters 263 listed 15,874 participants. | An Indian community, short contests, star ratings |
| LeetCode | Weekly Contest every Sunday at 08:00 IST (528 on 15 Nov) and a Biweekly Contest every other Saturday at 20:00 IST, 90 minutes each. | Interview-style problems under a clock |
| CSES Problem Set | No contests. 400 tasks grouped by topic. | Learning topics in a fixed order |
| Google Kick Start, Code Jam, Hash Code | Closed. Google ran final farewell rounds on 15 April 2023 and archived the problems on GitHub. | Old problems for practice only |

A common setup is Codeforces plus AtCoder or CodeChef, with CSES as your syllabus. On Codeforces, Div. 4 is for users rated below 1400 and Div. 3 for users below 1600, according to [Wikipedia](https://en.wikipedia.org/wiki/Codeforces).

### Rules on AI tools in contests

[Codeforces](https://codeforces.com/blog/entry/133941) allows statement translation and code completion for syntax and boilerplate in rated rounds, but not pasting a problem into an AI tool for a solution, or asking AI to debug a rejected submission. Outside rated rounds, AI is free for practice. [AtCoder](https://info.atcoder.jp/entry/llm-rules-en) generally prohibits generative AI during its Beginner, Regular and Grand Contests (ABC, ARC and AGC), except for translating the statement with a set prompt, and updated its rules on 14 October 2026. Read both before your first rated contest.

## The India pathway

### At school: ZIO and ZCO, INOI, then IOI

The Indian Computing Olympiad (ICO), run by IARCS (the Indian Association for Research in Computing Science), is open to school students up to Class 12 in 2026-27 from any board. Dates are from the [IARCS ICO page](https://www.iarcs.org.in/inoi/), last updated 3 Nov 2026.

| Stage | Date | Format |
|---|---|---|
| ZIO (Zonal Informatics Olympiad) | 21 Nov 2026 (registration ran till 6 Nov) | Written exam at centres |
| ZCO (Zonal Computing Olympiad) | 12 Dec 2026 (registration open till 1 Dec) | Programming exam in C++, Java or Python |
| INOI (Indian National Olympiad in Informatics) | Saturday 6 Feb 2027 | Programming, C++ only; qualify through ZIO or ZCO |
| IOITC (IOI Training Camp) | About 30 students chosen from INOI; the 2026 camp ran 1 to 12 June | Picks the four-student team for the International Olympiad in Informatics (IOI) |
| IOI | IOI 2026 was in Tashkent, 9 to 16 Aug 2026; IOI 2027 is in Germany | IARCS lists two medals for India at IOI 2026 |

IARCS also lists admission routes: Chennai Mathematical Institute admits INOI gold and silver medallists and IOITC selections directly, and IIIT Delhi, IIIT Hyderabad, IIT Gandhinagar and IIT Kanpur have special procedures. Check each institute for current rules.

### At college: ICPC and company contests

The ICPC (International Collegiate Programming Contest) is a team contest: under the [regional rules](https://icpc.global/regionals/rules), a team has three contestants enrolled at the same institution, plus a coach. In 2026-27, icpc.global lists four Indian regional sites: Amritapuri (Kollam, Bengaluru, Coimbatore and Mysuru, about 350 onsite slots), Chennai (onsite 11 to 12 Dec 2026), Kanpur (Kanpur, Gandhinagar and Pune, 22 to 23 Dec 2026) and Mathura (27 to 28 Dec 2026). They share one online preliminary, held on 3 Oct 2026, and a team registers and pays separately for each site, at most two.

Preliminary registration for 2026 has closed. Kanpur and Mathura list ₹1,500 per team for the preliminary and ₹4,500 per qualifying onsite team. Last cycle Kanpur registration ran from 5 Aug to 25 Sep, so form a team early and watch icpc.global each August. JetBrains and Jane Street are listed as sponsors.

**TCS CodeVita**, a contest by Tata Consultancy Services, is open to students expecting to finish a science or engineering course in 2027 to 2030. Its [official page](https://codevita.tcsapps.com/) says Season 14 rounds last 3 hours, allow C, C++, Java and Python, and give the top 3 coders USD 20,000 in total, and reports 669,000+ contestants in Season 13. We could not read the Season 14 round dates, so check the page.

## Choose a language and a template

C++ is the standard choice. The [Competitive Programmer's Handbook](https://cses.fi/book/index.php) (CPH) calls it nearly always available on contest systems, and reports that 79% of the best 3,000 Google Code Jam 2017 participants used C++, 16% Python and 8% Java, with some using several. INOI allows only C++. Python is allowed on most platforms and fine for learning, but slower, so a solution with the right complexity can still run out of time. This Python template reads all input at once and solves a small question in O(n):import sys from io import StringIO # On a judge you read real input with: data = sys.stdin.read().split() # Here we fake a tiny input so the block runs on its own: n, k, then n numbers. sys.stdin = StringIO("5 9\n2 7 11 15 4\n") data = sys.stdin.read().split() # one fast read, then parse n, k = int(data[0]), int(data[1]) a = list(map(int, data[2:2 + n])) def solve(): seen = set() # O(n) with a set, instead of O(n^2) with two loops for x in a: if k - x in seen: return "YES" seen.add(x) return "NO" print(solve())

Output: YES

The same solution in C++, compiled with clang++ -std=c++17 on 11 Nov 2026. It prints YES for the sample input 5 9 then 2 7 11 15 4:#include <iostream> #include <unordered_set> #include <vector> using namespace std; int main() { ios::sync_with_stdio(false); // faster input and output cin.tie(nullptr); int n; long long k; cin >> n >> k; vector<long long> a(n); for (auto &x : a) cin >> x; unordered_set<long long> seen; for (long long x : a) { if (seen.count(k - x)) { cout << "YES\n"; return 0; } seen.insert(x); } cout << "NO\n"; return 0; }

Estimate speed before you code. CPH says a modern computer performs some hundreds of millions of operations a second, which gives this guide for a 1-second limit:

| Input size n | Complexity you can afford |
|---|---|
| n up to 10 | O(n!) |
| n up to 20 | O(2^n) |
| n up to 500 | O(n^3) |
| n up to 5,000 | O(n^2) |
| n up to 1,000,000 | O(n log n) or O(n) |
| n is larger | O(1) or O(log n) |

## A 6-month plan, by rating band

### Where to start

Pick the row that matches your Codeforces rating. A new account is unrated, so start in the first row. Titles come from the Codeforces rating table. The problem ranges are a starting suggestion, not a rule.

| Rating and title | Enter these contests | Problems rated about | Topics to focus on |
|---|---|---|---|
| Unrated to 1199 (Newbie) | Div. 4, Div. 3, AtCoder ABC, CodeChef Starters | 800 to 1000 | Loops, arrays, strings, sorting, simple maths, brute force |
| 1200 to 1399 (Pupil) | Div. 3, Div. 2 | 900 to 1300 | Binary search, prefix sums, two pointers, greedy |
| 1400 to 1599 (Specialist) | Div. 2 | 1200 to 1500 | Dynamic programming (DP), BFS and DFS, shortest paths, Union-Find |
| 1600 to 1899 (Expert) | Div. 2, then combined Div. 1 and Div. 2 | 1500 to 1800 | Trees, Dijkstra, segment trees, number theory, bitmasks |

### Month by month

The plan assumes 8 to 10 hours a week. The goals are checkpoints, not predictions.

1. **Month 1, foundations.** Pick a language and write a template. Solve the CSES Introductory Problems. Enter every Div. 4 or Div. 3 round, live or virtual, and read the editorial after each.
2. **Month 2, sorting and searching.** Work through CSES Sorting and Searching. Learn binary search and prefix sums, and practise estimating complexity from the limits.
3. **Month 3, greedy, windows and first DP.** Add two pointers and sliding windows, then start CSES Dynamic Programming with the [dynamic programming](https://www.masaischool.com/resources/dynamic-programming-explained) page.
4. **Month 4, graphs.** Cover BFS, DFS, components, shortest paths and Union-Find through CSES Graph Algorithms, with [graph data structure explained](https://www.masaischool.com/resources/graph-data-structure-explained) as a reference.
5. **Month 5, trees and range queries.** Do CSES Tree Algorithms and Range Queries, plus some number theory, after the [tree data structure](https://www.masaischool.com/resources/tree-data-structure-explained) page. Start attempting Div. 2 C problems.
6. **Month 6, simulate and choose.** Run full virtual contests under real limits, review your log for weak topics, then decide: build an ICPC team, keep going in rated rounds, or move most hours to interview-style problems.

Each week: one or two live contests, then **upsolve** every problem you missed within two days. Add three or four CSES problems on the month's theme. Keep a log of the idea and the mistake for each problem. Try a problem for a fixed time, such as 45 to 60 minutes, before reading the editorial.

### Topics in order, with free places to learn

| Order | Topic | Practise on | Read |
|---|---|---|---|
| 1 | Complexity, implementation, brute force | CSES Introductory Problems | CPH chapters 1, 2, 5 |
| 2 | Sorting and binary search | CSES Sorting and Searching | CPH chapter 3 |
| 3 | Sets, maps, two pointers, prefix sums | CSES Sliding Window Problems | CPH chapters 4, 8; [hash maps](https://www.masaischool.com/resources/hashmap-explained) |
| 4 | Greedy | Codeforces tag: greedy | CPH chapter 6 |
| 5 | Dynamic programming | CSES Dynamic Programming | CPH chapter 7 |
| 6 | Graph traversal, shortest paths, Union-Find | CSES Graph Algorithms | CPH chapters 11 to 13, 15 |
| 7 | Trees | CSES Tree Algorithms | CPH chapters 14, 18 |
| 8 | Range queries | CSES Range Queries | CPH chapter 9 |
| 9 | Number theory | CSES Mathematics | CPH chapter 21 |
| 10 | Strings | CSES String Algorithms | CPH chapter 26 |

Free resources: the [CSES Problem Set](https://cses.fi/problemset/), the CPH as a free PDF (a 2018 draft, so some details are dated but the algorithms are not), [cp-algorithms.com](https://cp-algorithms.com/), the free [USACO Guide](https://usaco.guide/) and [Codeforces EDU](https://codeforces.com/edu/courses). For interview-style sites, see [coding practice websites](https://www.masaischool.com/resources/tools/coding-practice-websites).

## How much does it matter for jobs? An honest note

- **Published interview formats test topics, not ratings.** The [SDE levels page](https://www.masaischool.com/resources/sde-full-form-and-sde-levels) lists Amazon's online assessment with two coding questions and Microsoft's list of arrays, strings, queues, linked lists, trees, hash maps and graphs. Neither mentions a rating.
- **The skills transfer.** Choosing a complexity from the constraints and handling graphs and DP under time pressure help in any DSA interview.
- **Some doors open directly.** Olympiad results feed the admission routes above, TCS runs CodeVita as a student contest, and ICPC India pages list JetBrains and Jane Street as sponsors.
- **We found no survey** of how many Indian employers look at Codeforces or CodeChef ratings, so treat any percentage without a source with caution. A rating is a signal of skill, not an entry ticket.
- **Our advice:** if interviews are within about six months, spend most hours on interview-style problems (see the [MAANG companies guide](https://www.masaischool.com/resources/maang-companies-explained)) and use one contest a week as a speed drill. If you enjoy contests and have a year or more, going deeper builds fluency that pays off later.

Masai's blog has a [step-by-step guide to competitive programming](https://www.masaischool.com/blog/a-step-by-step-guide-to-competitive-programming/) and [12 must-know algorithms for programmers](https://www.masaischool.com/blog/12-must-know-algorithms-for-programmers/). For the full topic order, follow the [DSA learning path](https://www.masaischool.com/resources/data-structures-and-algorithms).

## Frequently asked questions

### What is competitive programming?

Solving algorithm and data-structure problems against a clock, usually in online contests where a judge runs your program on hidden tests. Rated platforms such as Codeforces, AtCoder and CodeChef turn your results into a rating.

### How do I start competitive programming from zero?

Pick one language, learn to estimate complexity from input limits, and solve the CSES Introductory Problems. Then enter Div. 4 or Div. 3 rounds on Codeforces, or AtCoder Beginner Contests, and read the editorial for every problem you could not solve.

### Which language is best for competitive programming?

C++ is the most common choice because it is fast and nearly always available, and INOI allows only C++. Python is allowed on most platforms and is fine for learning, but it is slower on hard problems.

### Is Google Kick Start still running?

No. Google ended Code Jam, Kick Start and Hash Code with final farewell rounds on 15 April 2023, and the problems are archived on GitHub. Use Codeforces, AtCoder, CodeChef or LeetCode instead.

### Is competitive programming useful for getting a job?

It trains the skills interviews test, but published interview formats ask for data-structure and algorithm skills, not contest ratings, and we found no survey showing how many Indian employers check ratings. It helps most if you enjoy it.

### How is INOI different from ICPC?

INOI is the school-level national olympiad run by IARCS, solo and C++ only, leading to the IOI. ICPC is a team contest for university students, in teams of three, with Indian regional sites and a path to the world finals.

## Sources checked

- [ICO stages, dates, eligibility, C++ only for INOI, admission incentives; last updated 3 Nov 2026](https://www.iarcs.org.in/inoi/)
- [ICPC Kanpur preliminary: shared prelim, 3 Oct 2026 contest day, fees, at most two sites](https://icpc.global/regionals/finder/KanPrelim)
- [Kanpur multi-site regional 22 to 23 Dec 2026; fees; sponsors JetBrains and Jane Street](https://icpc.global/regionals/finder/Asia-Kanpur-2027)
- [Mathura regional 27 to 28 Dec 2026; fees](https://icpc.global/regionals/finder/ICPC-Mathura)
- [Chennai regional 11 to 12 Dec 2026](https://icpc.global/regionals/finder/ICPC-Asia-Chennai)
- [Amritapuri multisite: Kollam, Bengaluru, Coimbatore, Mysuru; about 350 onsite slots](https://icpc.global/regionals/finder/Asia-Amritapuri-First-Round-2027)
- [ICPC team composition: three contestants from one degree-granting institution](https://icpc.global/regionals/rules)
- [Codeforces rule restricting the use of AI in rated rounds](https://codeforces.com/blog/entry/133941)
- [AtCoder generative AI rules version 20261014](https://info.atcoder.jp/entry/llm-rules-en)
- [AtCoder upcoming contests: ABC 484 on 14 Nov 2026 at 21:00 JST, 100 minutes, rated up to 1999](https://atcoder.jp/home?lang=en)
- [Codeforces upcoming rounds and the 110 contests started in the last 12 months](https://codeforces.com/api/contest.list)
- [11,511 problems, 11,194 rated 800 to 3500, read 11 Nov 2026](https://codeforces.com/api/problemset.problems)
- [CodeChef Starters Wednesday 20:00 IST and Monday Munch; Starters 263 participant count](https://www.codechef.com/contests)
- [LeetCode Weekly and Biweekly schedule and duration](https://leetcode.com/contest/)
- [CSES Problem Set: 400 tasks, section names](https://cses.fi/problemset/)
- [Google coding competitions closed; farewell rounds 15 April 2023; GitHub archive](https://developers.googleblog.com/en/celebrate-googles-coding-competitions-with-a-final-round-of-programming-fun/)
- [TCS CodeVita Season 14 eligibility, 3 hours, languages, USD 20,000, Season 13 size](https://codevita.tcsapps.com/)
- [Competitive Programmer's Handbook: language popularity, complexity estimation table, chapters](https://cses.fi/book/index.php)
- [Codeforces rating titles and division rules](https://en.wikipedia.org/wiki/Codeforces)
- [Existing Masai post (HTTP 200 on 11 Nov 2026)](https://www.masaischool.com/blog/a-step-by-step-guide-to-competitive-programming/)
