Hello 3★ jarvis59632  Logout

PRACTICE COMPETE DISCUSS COMMUNITY HELP ABOUT

CodeChef Certified Data Structure & Algorithms Exam Date

Oct
Programme (CCDSAP) 2017 15
Enroll

Prepare

This sections lists out the syllabus, the learning resources and Mock Tests to help you prepare for
the Certification Test. The resources that we list here are references that we have collected over
the internet and some of them from our own website. While we do recommend these resources
based on the inputs of our user community, we do not claim that these are the most authoritative
Learning Resources about any topic. Please feel free to find out what suits best to you.

We have also prepared a Mock Test for each level. A Mock Test is an open assessment contest
that will help you assess yourself for the certification exam after you are ready with the topics. For
each level we have different Mock Tests. These contests will run forever. We strongly recommend
you to solve these problems in same duration of time as the duration of the exam before you take
the exam.
Candidates can expect problems from the following topics to come in the exam.

Foundation 
Syllabus:
The syllabus for each level is mentioned below:

1. Basic Data Structures: Arrays, Strings, Stacks, Queues

2. Asymptotic analysis (Big-O notation)
3. Basic math operations (addition, subtraction, multiplication, division, exponentiation)
4. Sqrt(n) primality testing
5. Euclid’s GCD Algorithm
6. Basic Recursion
7. Greedy Algorithms
8. Basic Dynamic Programming
9. Naive string searching
10. O(n logn) Sorting
11. Binary Searching

Learning Resources:
1. Asymptotic analysis (Big-O notation)

1. Basic

1. youtube.com - Time complexity of a computer program

2. youtube.com - Big-O notation in 5 minutes - The basics
3. youtube.com - Definition Of Big O Notation - Intro to Theoretical Computer Science
4. youtube.com - Algorithms Lecture 1 -- Introduction to asymptotic notations
5. iarcs.org.in - Measuring the efficiency of algorithms
6. interactivepython.org - Particularly for Big-O notation

2. Advanced

1. rob-bell.net - A beginner's guide to Big O notation

2 youtube com Big O Notation Gayle Laakman McDowell
 2. youtube.com - Big O Notation, Gayle Laakman McDowell
3. web.mit.edu - Big O notation
4. youtube.com - Time and space complexity analysis of recursive programs - using factorial
5. A very nice tutorial with examples

3. Practice Problems

1. You can see some problems with solutions here: Time complexity of an algorithm

2. Arrays

1. Resources

1. codechef.com - Data Structure Tutorial: Array

2. cs.cmu.edu - Arrays
3. geeksforgeeks.org - Arrays Data Structure

2. Practice Problems

1. codechef.com - LECANDY, editorial

2. codechef.com - CNOTE, editorial ;
3. codechef.com - SALARY, editorial
4. codechef.com - CHN15A, editorial
5. codechef.com - RAINBOWA, editorial
6. codechef.com - FRGTNLNG, editorial
7. codechef.com - COPS, editorial

3. Strings

1. Resources

1. tutorialspoint.com - C++ strings

2. guru99.com - Java strings
3. docs.python.org - Python strings
4. tutorialspoint.com - Python strings
5. Many questions on the string:
6. geeksforgeeks.org - String Data Structure

2. Practice Problems

1 codechef com - CSUB editorial

 1. codechef.com CSUB, editorial
2. codechef.com - LAPIN, editorial

4. Stack and Queue

1. Resources

1. geeksforgeeks.org - Stack Data Structure

2. geeksforgeeks.org - Introduction and Array Implementation
3. tutorialspoint.com - Data Structures Algorithms
4. cs.cmu.edu - Stacks
5. cs.cmu.edu - Stacks and Queues
6. cs.cmu.edu - Stacks and Queues

2. Practice Problems

1. spoj.com - JNEXT
2. spoj.com - STPAR
3. spoj.com - ONP
4. spoj.com - COMPILER
5. spoj.com - MMASS
6. spoj.com - HISTOGRA
7. codeforces.com - D. Maximum Xor Secondary
8. spoj.com - ANARC09A
9. codeforces.com - C. Minimal string
10. codeforces.com - B. Alternating Current
11. codeforces.com - C. Longest Regular Bracket Sequence

5. Basic math operations (addition, subtraction, multiplication, division, exponentiation)

1. codechef.com - A tutorial on Fast Modulo Multiplication

6. Euclid’s GCD Algorithm

1. Resources

1. youtube.com - Mycodeschool video

2. khanacademy.org - The Euclidean Algorithm
3. geeksforgeeks.org - Example program to find gcd in c++:
7. Prime Numbers, divisibility of numbers

1. Resources:

1. Only O(sqrt(n)) algorithm for finding whether a number is a prime, factorization of a number.
2. Finding prime factors by taking the square root

2. Practice Problems:

1. community.topcoder.com - DivisorInc
2. community.topcoder.com - Prime Polynom
3. community.topcoder.com - Prime Anagrams
4. community.topcoder.com - Refactoring

8. Basic Recursion

1. Resources

1. topcoder.com - An Introduction to Recursion, Part 1

2. topcoder.com - An Introduction to Recursion: Part 2
3. geeksforgeeks.org - Recursion ;(along with questions)
4. web.mit.edu - Recursion
5. csee.umbc.edu - Recursion ;(Examples with exercises)
6. loveforprogramming.quora.com - Backtracking, Memoization & Dynamic Programming

2. Practice Problems

1. codechef.com - NOKIA, editorial

2. codechef.com - TRISQ, editorial
3. codechef.com - LFSTACK, editorial
4. codechef.com - FICE, editorial

9. Greedy Algorithms

1. Resources

1. iarcs.org.in - Greedy Algorithms

2. iarcs.org.in - Greedy Algorithms
3. topcoder.com - Greedy Algorithms
4. Greedy Algorithms
 2. Practice Problems

1. codechef.com - TACHSTCK, editorial

2. codechef.com - CIELRCPT, editorial
3. codechef.com - MAXDIFF, editorial
4. codechef.com - CHEFST, editorial
5. codechef.com - CAKEDOOM, editorial
6. codechef.com - CLETAB, editorial
7. codechef.com - TADELIVE, editorial
8. codechef.com - MANYCHEF, editorial
9. codechef.com - MMPROD, editorial
10. codechef.com - CHEFTMA, editorial
11. codechef.com - STICKS, editorial
12. spoj.com - BAISED
13. spoj.com - BALIFE

 Overview 14. spoj.com - GCJ101BB

15. codechef.com - FGFS
Levels
16. codechef.com - KNPSK
17. codechef.com - LEMUSIC
 Details
18. codechef.com - ARRANGE
Schedule 19. codechef.com - FASHION

Prepare


10. Dynamic programming (Basic DP)

Foundation
1. Resources
Advanced
1. medium.freecodecamp.org - Demystifying Dynamic Programming
Expert 2. iarcs.org.in - Dynamic Programming - Tiling
3. topcoder.com - Dynamic Programming – From Novice to Advanced
 Examination
4. illinois.edu - Dynamic Programming ;(Exercises are recommended)
 FAQ 5. codechef.com - Dynamic Programming
Contact Us 6. geeksforgeeks.org - Dynamic Programming ;(Contains a lot of practice sessions)

2. Practice Problems
 1. codechef.com - ALTARAY, editorial
2. codechef.com - DELISH, editorial
3. codechef.com - DBOY, editorial
4. codechef.com - XORSUB, editorial
5. codechef.com - GRID, editorial
6. codechef.com - TADELIVE, editorial
7. codechef.com - FROGV, editorial
8. codechef.com - MATRIX2, editorial
9. codechef.com - AMSGAME2, editorial
10. spoj.com - MDOLLS
11. spoj.com - MSTICK
12. spoj.com - MCARDS
13. spoj.com - MIXTURES
14. spoj.com - SAMER08D
15. spoj.com - AIBOHP

11. Naive string searching

1. Resources

1. geeksforgeeks.org - Naive Pattern Searching

12. Sorting

1. khanacademy.org
2. visualgo.net
3. iarcs.org.in
4. Merge sort

1. youtube.com - Merge sort algorithm

2. Practice Problems
codechef.com -MRGSRT

5. Quick sort

1. youtube.com - Quicksort algorithm

2. Practice Problems
 codechef.com -TSORT

6. Counting sort

1. geeksforgeeks.org - Counting Sort

2. Practice Problems

1. codechef.com - TACHSTCK, editorial

2. codechef.com - STICKS, editorial

13. Binary Search

1. Resources

1. topcoder.com (Try solving problems of Simple and Moderate level as mentioned in the end
of the link)
2. codechef.com
3. usfca.edu
4. khanacademy.org

2. Detailed Theoretical analysis

1. cmu.edu (A theoretical analysis)

3. Problems

1. geeksforgeeks.org - Binary Search (Contains some solved problems)

2. codechef.com - STRSUB, editorial
3. codechef.com - ASHIGIFT, editorial
4. codechef.com - STACKS, editorial
5. codechef.com - DIVSET, editorial
6. codechef.com - LOWSUM, editorial
7. codechef.com - SNTEMPLE, editorial
8. codechef.com - SNAKEEAT, editorial
9. codechef.com - SCHEDULE, editorial
10. codechef.com - RIGHTTRI, editorial
11. codechef.com - FORESTGA, editorial
12. codechef.com - CHEFHCK2,editorial
13. spoj.com - ABCDEF
 14. spoj.com - NOTATRI
15. spoj.com - SCALE
16. spoj.com - SUMFOUR
17. spoj.com - SUBSUMS
18. spoj.com - ANARC05B
19. spoj.com - RENT
20. spoj.com - PIE
21. spoj.com - MKUHAR
22. spoj.com - SVADA
23. spoj.com - SUBS

Mock Test:
1. Test 1 - codechef.com/FLMOCK01
2. Test 2 - codechef.com/FLMOCK02
3. Test 3 - codechef.com/FLMOCK03
4. Test 4 - codechef.com/FLMOCK04

Advanced 
This level is intended to test that the candidate has a very good grasp of algorithms and data
structures, and can solve most problems that arise in practice. Candidates can expect problems
from the following topics to come in the exam.

Syllabus:
Everything in the Foundation Level, along with:

1. Heaps (priority queue)

2. Disjoint Set Union
3. Segment Trees
4. Binary Index Tree (Fenwick tree)
 5. Trees (traversals, tree dynamic programming)
6. Finding Lowest Common Ancestors (O(log N) solution where N is number of nodes).
7. Graph Algorithms:

1. Finding connected components and transitive closures.

2. Shortest-path algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall)
3. Minimum spanning tree (Prim and Kruskal algorithms)
4. Biconnectivity in undirected graphs (bridges, articulation points)
5. Strongly connected components in directed graphs
6. Topological Sorting
7. Euler path, tour/cycle.

8. Modular arithmetic including division, inverse

9. Amortized Analysis
10. Divide and Conquer
11. Advanced Dynamic Programming problems (excluding the dp optimizations which are added in
expert level)
12. Sieve of Eratosthenes

Learning Resources:
1. Heaps (priority queue)

1. Resources

1. cs.cmu.edu
2. eecs.wsu.edu
3. geeksforgeeks.org
4. visualgo.net
5. iarcs.org.in

2. Practice Problems

1. codechef.com - IPCTRAIN, editorial

2. codechef.com - ANUMLA, editorial
3. codechef.com - KSUBSUM, editorial
4. codechef.com - RRATING, editorial
 5. codechef.com - TSECJ05, editorial
6. spoj.com - WEIRDFN
7. codechef.com - CAPIMOVE, editorial
8. spoj.com - RMID2
9. spoj.com - LAZYPROG
10. spoj.com - EXPEDI
11. acm.timus.ru
12. baylor.edu - Maze Checking and Visualization
13. codechef.com - MOSTDIST, editorial

2. Disjoint Set Union

1. Resources

1. topcoder.com
2. harvard.edu
3. ucdavis.edu
4. visualgo.net

2. Practice Problems

1. codechef.com - GALACTIK, editorial

2. codechef.com - DISHOWN, editorial
3. codechef.com - JABO, editorial
4. codechef.com - PARITREE, editorial
5. codechef.com - FILLMTR, editorial
6. B. Mike and Feet
7. D. Quantity of Strings
8. codechef.com - SETELE, editorial
9. codechef.com - MAZE, editorial
10. codechef.com - MAGICSTR, editorial
11. codechef.com - MTRWY, editorial
12. codechef.com - BIGOF01, editorial
13. codechef.com - FIRESC, editorial
3. Segment Trees

1. Resources

1. wcipeg.com
2. topcoder.com
3. kartikkukreja.wordpress.com
4. visualgo.net
5. iarcs.org.in

2. Practice Problems

1. spoj.com - GSS1
2. spoj.com - GSS2
3. codeforces.com - Classic Segment Tree (Expert Level)
4. spoj.com - IOPC1207
5. spoj.com - ORDERSET
6. spoj.com - HELPR2D2
7. spoj.com - ANDROUND
8. spoj.com - HEAPULM
9. spoj.com - NICEDAY
10. spoj.com - YODANESS
11. spoj.com - DQUERY
12. spoj.com - KQUERY
13. spoj.com - FREQUENT
14. spoj.com - GSS3
15. spoj.com - GSS4
16. spoj.com - GSS5
17. spoj.com - KGSS
18. spoj.com - HELPR2D2
19. spoj.com - BRCKTS
20. spoj.com - CTRICK
21. spoj.com - MATSUM
22 j RATING
 22. spoj.com - RATING
23. spoj.com - RRSCHED
24. spoj.com - SUPPER
25. spoj.com - ORDERS
26. codechef.com - LEBOBBLE
27. codechef.com - QUERY
28. spoj.com - TEMPLEQ
29. spoj.com - DISUBSTR
30. spoj.com - QTREE
31. spoj.com - QTREE2
32. spoj.com - QTREE3
33. spoj.com - QTREE4
34. spoj.com - QTREE5

3. Problems on segment tree with lazy propagation

1. spoj.com - HORRIBLE (must do basic lazy propagation problem)

2. spoj.com - LITE (a nice lazy propagation problem)
3. spoj.com - MULTQ3 (another nice lazy propagation problem)
4. codechef.com - CHEFD
5. codechef.com - FUNAGP (a difficult lazy propagation problem.)
6. RPAR (a difficult and nice lazy propagation)
7. codechef.com - ADDMUL
8. spoj.com - SEGSQRSS (a difficult lazy propagation problem)
9. spoj.com - KGSS
10. codeforces.com - C. Circular RMQ
11. codeforces.com - E. Lucky Queries (must do hard problem on lazy propagation)
12. codeforces.com - E. A Simple Task
13. codeforces.com - C. DZY Loves Fibonacci Numbers (important problem to do, introduces
some nice properties over lazy propagation)
14. codeforces.com - D. The Child and Sequence
15. codeforces.com - E. Lucky Array
4. Binary Index Tree (Fenwick tree)

1. Resources

1. topcoder.com
2. iarcs.org.in
3. visualgo.net

2. Practice Problems:
Please solve the problems mentioned in the above segment tree practice problems section. Note
that usually, it's difficult to do range updates in binary indexed trees. Mostly, it is used for for
range query and point update. However, you can check the following article for checking how
some simple specific kind of range updates can be peformed on binary indexed tree (http://petr-
mitrichev.blogspot.in/2013/05/fenwick-tree-range-updates.html). Note that range updates on BIT
is not a part of the syllabus.

1. spoj.com - INVCNT
2. spoj.com - TRIPINV

5. Trees (traversals)

1. Resources

1. slideshare.net
2. iarcs.org.in
3. berkeley.edu

2. Practice Problems

1. spoj.com - TREEORD

6. Finding Lowest Common Ancestors (O(log N) solution where N is number of nodes)

1. Resources

1. topcoder.com

7. Depth First Search, Breadth First Search (Finding connected components and transitive
closures)

1. Resources

1. geeksforgeeks.org - Connected Components in an undirected graph

2. geeksforgeeks.org - Transitive closure of a graph
3. geeksforgeeks.org - Depth First Traversal or DFS for a Graph
 4. iarcs.org.in - Basic Graph Algorithms
5. visualgo.net - Graph Traversal
6. harvard.edu - Breadth-First Search

2. Practice Problems

1. codechef.com - FIRESC, editorial

2. spoj.com - BUGLIFE
3. spoj.com - CAM5
4. spoj.com - GCPC11J
5. spoj.com - KFSTB
6. spoj.com - PT07Y
7. spoj.com - PT07Z
8. spoj.com - LABYR1
9. spoj.com - PARADOX
10. spoj.com - PPATH ;(must do bfs problem)
11. spoj.com - ELEVTRBL (bfs)
12. spoj.com - QUEEN (bfs)
13. spoj.com - SSORT ;(cycles in a graph)
14. spoj.com - ROBOTGRI ;(bfs)

8. Shortest-path algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall)

1. Resources

1. geeksforgeeks.org - Dijkstra’s shortest path algorithm

2. Iarcs.org.in - Shortest paths
3. Visualgo.net - Single-Source Shortest Paths (SSSP)

2. Practice Problems

1. codechef.com - DIGJUMP, editorial

2. codechef.com - AMR14B, editorial
3. codechef.com - INSQ15_F, editorial
4. codechef.com - SPSHORT, editorial (slightly difficult dijkstra's problem.)
5. codechef.com - RIVPILE, editorial
 6. spoj.com - SHPATH
7. spoj.com - TRAFFICN
8. spoj.com - SAMER08A
9. spoj.com - MICEMAZE
10. spoj.com - TRVCOST
11. codechef.com - PAIRCLST, editorial

9. Bellman Ford Algorithm

1. Resources

1. geeksforgeeks.org - Dynamic Programming - Bellman–Ford Algorithm

2. compprog.wordpress.com - ;One Source Shortest Path - Bellman-Ford Algorithm

2. Practice Problem

1. community.topcoder.com - PeopleYouMayKnow
2. codeforces.com - D. Robot Control
3. spoj.com - ARBITRAG - Arbitrage ;(Floyd Warshall)
4. community.topcoder.com - NetworkSecurity ;(Floyd Warshall)

10. Minimum spanning tree (Prim and Kruskal algorithms)

1. Resources

1. algs4.cs.princeton.edu - Minimum Spanning Trees

2. iarcs.org.in - Spanning trees
3. visualgo.net - Spanning Tree

2. Practice Problem

1. spoj.com - MST
2. spoj.com - NITTROAD
3. spoj.com - BLINNET
4. spoj.com - CSTREET
5. spoj.com - HIGHWAYS
6. spoj.com - IITWPC4I
7. codechef.com - MSTQS, editorial
 8. codechef.com - CHEFGAME, editorial
9. codechef.com - GALACTIK, editorial
10. codechef.com - GOOGOL03, editorial
11. spoj.com - KOICOST

11. Biconnectivity in undirected graphs (bridges, articulation points)

1. Resources

1. e-maxx-eng.appspot.com - Finding Bridges in a Graph

2. iarcs.org.in - Articulation Points
3. pisces.ck.tp.edu.tw - Articulation Points

2. Practice Problem

1. uva.onlinejudge.org - Network
2. icpcarchive.ecs.baylor.edu - Building Bridges
3. uva.onlinejudge.org - Tourist Guide
4. acm.tju.edu.cn - Network
5. spoj.com - EC_P - Critical Edges
6. spoj.com - SUBMERGE - Submerging Islands
7. spoj.com - POLQUERY - Police Query
8. codeforces.com - A. Cutting Figure

12. Strongly connected components in directed graphs

1. Resources

1. iarcs.org.in - Strongly connected components

2. theory.stanford.edu - Strongly Connected Components

2. Practice Problem

1. spoj.com - ANTTT
2. spoj.com - CAPCITY
3. spoj.com - SUBMERGE
4. codechef.com - MCO16405, editorial
5. spoj.com - BOTTOM
6. spoj.com - BREAK
 6. spoj.com BREAK
7. community.topcoder.com - Marble Collection Game

13. Topological Sorting

1. Resources

1. geeksforgeeks.org - Topological Sorting

2. Practice Problem

1. spoj.com - TOPOSORT ;
2. codeforces.com - C. Fox And Names ;
3. codechef.com - RRDAG, editorial
4. spoj.com - RPLA
5. codechef.com - CL16BF (topological sort with dp), editorial
6. spoj.com - MAKETREE

14. Euler path, tour/cycle.

1. Resources

1. math.ku.edu - Euler Paths and Euler Circuits

2. Practice Problem

1. spoj.com - WORDS1
2. codechef.com - CHEFPASS, editorial
3. codechef.com - TOURISTS, editorial
4. codeforces.com - D. New Year Santa Network
5. B. Strongly Connected City
6. codechef.com - PEOPLOVE
7. codeforces.com - D. Tanya and Password
8. codeforces.com - E. One-Way Reform
9. spoj.com - GCPC11C
10. spoj.com - MAKETREE

15. Modular arithmetic including division, inverse

1. Resources

1 codechef com Fast Modulo Multiplication (Exponential Squaring)

 1. codechef.com - Fast Modulo Multiplication (Exponential Squaring)
2. codechef.com - Best known algos for calculating nCr % M ;(only for expert level)

16. Amortized Analysis

1. Resources

1. ocw.mit.edu - Amortized Analysis

2. wikipedia.org - Amortized Analysis
3. iiitdm.ac.in - Amortized Analysis

17. Divide and Conquer

1. Resources

1. cs.cmu.edu - Divide-and-Conquer and Recurrences

2. geeksforgeeks.org - Divide-and-Conquer

2. Practice Problem

1. codechef.com - MRGSRT, editorial

2. spoj.com - HISTOGRA
3. codechef.com - TASTYD, editorial
4. codechef.com - RESTPERM, editorial
5. codechef.com - ACM14KP1, editorial

18. Advanced Dynamic Programming problems (excluding the dp optimizations which are added in
expert level, Please go through the basic DP resources and problems mentioned in foundation level
resource.)

1. Resources

1. apps.topcoder.com - Commonly used DP state domains

2. apps.topcoder.com - Introducing Dynamic Programming
3. apps.topcoder.com - Optimizing DP solution
4. codeforces.com - DP over Subsets and Paths

2. Problems for Advanced DP

1. spoj.com - HIST2 ;(dp bitmask)

2. spoj.com - LAZYCOWS ;(dp bitmask)
3. spoj.com - TRSTAGE ;(dp bitmask)
 4. spoj.com - MARTIAN
5. spoj.com - SQRBR
6. spoj.com - ACMAKER
7. spoj.com - AEROLITE
8. spoj.com - BACKPACK
9. spoj.com - COURIER
10. spoj.com - DP
11. spoj.com - EDIST
12. spoj.com - KRECT
13. spoj.com - GNY07H
14. spoj.com - LISA
15. spoj.com - MINUS
16. spoj.com - NAJKRACI
17. spoj.com - PHIDIAS
18. spoj.com - PIGBANK
19. spoj.com - PT07X
20. spoj.com - VOCV
21. spoj.com - TOURIST
22. spoj.com - MKBUDGET
23. spoj.com - MMAXPER
24. spoj.com - ANARC07G
25. spoj.com - MENU
26. spoj.com - RENT ;(dp with segment tree/BIT)
27. spoj.com - INCSEQ ;(dp with segment tree/BIT)
28. spoj.com - INCDSEQ ;(dp with segment tree/BIT)
29. You can solve some advanced problems from
30. codeforces.com - Dynamic Programming Type

19. Sieve of Eratosthenes

1. Resources:

1 codechef com Sieve Methods

 1. codechef.com - Sieve Methods

2. Practice Problems

1. spoj.com - TDKPRIME
2. spoj.com - TDPRIMES
3. spoj.com - ODDDIV ;(sieve + binary search)
4. spoj.com - NDIVPHI ;O(N) prime testing algorithm)
5. spoj.com - DIV ;(divisor sieve)
6. codechef.com - LEVY, editorial
7. codechef.com - PRETNUM, editorial
8. codechef.com - KPRIME, editorial
9. codechef.com - DIVMAC, editorial (segment tree with sieve)
10. codechef.com - PPERM, editorial ;(a bit advanced sieve application)

Mock Test:
1. Test 1 - codechef.com/ALMOCK01
2. Test 2 - codechef.com/ALMOCK02
3. Test 3 - codechef.com/ALMOCK03
4. Test 4 - codechef.com/ALMOCK04

Expert 
This level is intended to test that the candidate is an expert in algorithms and data structures, and
has a deep understanding of the topics. Candidates can expect problems from the following topics
to come in the exam.

Syllabus:
The syllabus for Expert Level is open-ended. Everything in Advanced Level will be included, along
with:

1. Treaps
 2. Persistent Data Structures
3. HLD
4. Centroid Decomposition
5. Computational Geometry
6. Fast Fourier Transforms
7. Game Theory
8. Gaussian Elimination
9. Dynamic Programming Optimizations
10. Advanced String algorithms (Tries, KMP, Aho-Corasik, Suffix arrays, Suffix trees)
11. Flows (Max-Flow, Min Cost Max Flow)

Learning Resources:
1. Coming Soon

Mock Test:
1. Coming Soon

Note: These links have been curated to help in preparation for the exams, and also to help the community in general. But if you
own some of the material linked to, and you wouldn’t like them to be here, please contact us, and we will remove it.

CodeChef is a non-commercial competitive programming community

About CodeChef About Directi CEO's Corner C-Programming Programming Languages Contact Us

© 2009 Directi Group. All Rights Reserved. CodeChef uses SPOJ © by Sphere Research Labs
In order to report copyright violations of any kind, send in an email to copyright@codechef.com The time now is: 03:28:53 AM
Your IP: 14.139.226.10

CodeChef - A Platform for Aspiring Programmers

CodeChef was created as a platform to help programmers make it big in the world of algorithms, computer programming and programming contests. At CodeChef we work hard to
revive the geek in you by hosting a programming contest at the start of the month and another smaller programming challenge in the middle of the month. We also aim to have
training sessions and discussions related to algorithms, binary search, technicalities like array size and the likes. Apart from providing a platform for programming competitions,
CodeChef also has various algorithm tutorials and forum discussions to help those who are new to the world of computer programming.
Practice Section - A Place to hone your 'Computer Programming Skills'
Try your hand at one of our many practice problems and submit your solution in a language of your choice. Our programming contest judge accepts solutions in over 35+
programming languages. Preparing for coding contests were never this much fun! Receive points, and move up through the CodeChef ranks. Use our practice section to better
prepare yourself for the multiple programming challenges that take place through-out the month on CodeChef.
Compete - Monthly Programming Contests and Cook-offs
Here is where you can show off your computer programming skills. Take part in our 10 day long monthly coding contest and the shorter format Cook-off coding contest. Put
yourself up for recognition and win great prizes. Our programming contests have prizes worth up to INR 20,000 (for Indian Community), $700 (for Global Community) and lots more
CodeChef goodies up for grabs.

Programming Tools Practice Problems Initiatives

Online IDE Easy Go for Gold

Upcoming Coding Contests Medium CodeChef for Schools

Contest Hosting Hard Campus Chapters

Problem Setting Challenge

CodeChef Tutorials Peer

CodeChef Wiki School

FAQ's