Learning | 3★ to 4★ | Syllabus : Part 1 | CodeChef

Courses

Practice Compete

Courses

Practice Compete

What you will learn

Level up From 3* to 4*

Standard Price:

₹2499/-

Price:

₹1249/-

Day 1

expand_more

What is a Graph?
Representation and terminologies
DFS/BFS

Basic level problems expand_circle_down

Centeroid

Problem Code: CENTREE

Even Edges

Problem Code: EVEDG

Day 2

expand_more

Special Graphs and Trees
Directed and Weighted Graphs
Applications of DFS/BFS

Basic & medium level problems expand_circle_down

Lost Graph

Problem Code: LSTGRPH

Maximum Size

Problem Code: RISK

Chef and Digit Jumps

Problem Code: DIGJUMP

Day 3

expand_more

Topological Ordering
Directed Graphs
Shortest Path
Applications of shortest path algorithms
Shortest path using BFS

Basic & medium level problems expand_circle_down

Chef and Roads

Problem Code: CL16BF

Doubly Increasing Path

Problem Code: DINCPATH

Ada King

Problem Code: ADAKNG

Day 4

expand_more

Priority Queue
Dijkstra’s Algorithm
Applications

Basic & medium level problems expand_circle_down

Save patient

Problem Code: PAC6

Minimum Cost Walk

Problem Code: MINWALK

Chef and Reversing

Problem Code: REVERSE

Day 5

expand_more

In-time/Out-time of Nodes

Cut Edges & Articulation Points

Basic & medium level problems expand_circle_down

Kingdom Unity

Problem Code: KINGCON

Tic Tac Toe

Problem Code: TCTCTOE

Fire Escape Routes

Problem Code: FIRESC

Day 6

expand_more

Bellman-Ford
Floyd Warshall
Negative weight cycle
Pros and cons of each of the algorithms

Medium level problems expand_circle_down

Short in Average

Problem Code: AVGSHORT

Delivery Boy

Problem Code: HOMDEL

Day 7

expand_more

Disjoint Set Union
Minimum Spanning Tree
Prim’s Algorithm
Kruskal’s Algorithm

Medium level problems expand_circle_down

Coal Scam

Problem Code: COALSCAM

MST Queries

Problem Code: MSTQS

Rooted Minimum Spanning Tree

Problem Code: ROOTMST

Day 8

expand_more

Connected Components
Kosaraju’s Algorithm

Medium level problems expand_circle_down

Chef and collection of stamps

Problem Code: CHSTAMP

Skiing

Problem Code: SKIING

Day 9

expand_more

Least Common Ancestor
Naive Approach
Binary Lifting
Distance between 2 nodes in a tree

Medium level problems expand_circle_down

Nuttela Path Unit

Problem Code: ENOC1

Dual Distance

Problem Code: DUALDIST

Lowest Common Ancestor

Problem Code: TALCA

Children Trips

Problem Code: TRIPS

Day 10

expand_more

Range Queries
Segment Trees

Medium level problems expand_circle_down

Trees and Queries

Problem Code: IITK1P10

Match Sticks

Problem Code: MSTICK

Level up From 3* to 4*

Standard Price:

₹2499/-

Price:

₹1249/-