Resources of Certification Program

Asymptotic analysis (Big-O notation):

Basic

Advanced

Practice Problems


Arrays:

Resources

Practice Problems


Strings:

Practice Problems


Stack and Queue:

Practice Problems


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


Euclid’s GCD Algorithm


– Prime Numbers, divisibility of numbers

Basic

  • Only O(sqrt(n)) algorithm for finding whether a number is a prime, factorization of a number.

Advanced

  • Sieve algorithms also included.

Practice Problems
Basic

Advanced Level problems

  • Problems based on sieve.

Basic Recursion

Practice Problems


Greedy Algorithms:

Practice Problems


Dynamic programming (DP)

Note that dp optimizations are not included in the syllabus (the ones given here - http://codeforces.com/blog/entry/8219)

Basic

Advanced Dynamic programming

Problems for Basic DP

Problems for Advanced DP


Naive string searching


Sorting

Merge sort

Practice Problems

Quick sort

Practice Problems

  • TSORT codechef

Counting sort

Practice Problems


Binary Search

Detailed Theoretical anaylysis

Problems

====

Expert Users:

The syllabus is not defined. You can see some outline and guidelines about the possible syllabus at https://discuss.codechef.com/questions/48877/data-structures-and-algorithms

//