# Rise from 3 to 4 stars

• access_time8 PM to 10 PM
• event7th Feb to 12th Feb
• eventMon-Sun

Get mentored to Level up from 3 to 4 stars. Solve 3-5 problems per day with your CodeChef mentor, during the camp and improve your understanding of concepts. At the end of the camp, you will be able to level up in CodeChef.

## Pre Requisites

• This camp is for 3-star coders on CodeChef
• Learners should have participated in atleast 20 rated Contests on CodeChef
• You need to know C++ or Python to attend the camp.
• Please do attend the session via a laptop or desktop and solve problems with the educator. Solving and practicing problems is very crucial in building your skills.

## Day 1

• What is Graph?
• Graph terminologies.
• Special graphs: Bipartite, Trees, etc.
• DFS and its applications: bipartite checking, sum of subtree, etc.
• BFS and its applications: Shortest path in unweighted graph, etc.
• Problems:

## Day 2

• What does shortest path mean.
• Applications of shortest path.
• Dijkstra
• Bellman Ford
• Floyd warshall
• Pros and cons of each of the algorithms
• Problems.

## Day 3

• DSU
• What is an MST.
• Prims algorithm
• Kruskals algorithm
• Problems.

## Day 4

• Intro to tree dp with a problem
• What is LCA
• Calculating LCA in nlogn using tree dp (binary lifting)
• Problems.

## Day 5

• Primality check in sqrtn.
• Sieve and its applications (calculating any multiplicative function)
• Factorization using sieve
• Euler totient function
• Intro to modular arithmetic
• Modular inversion using fermats little theorem or Euler's theorem
• Euclid's algorithm for calculating GCD
• Problems.

## Day 6

• Some standard dp problems: LCS, LIS, Knapsack
• Problems