Upgrade to Pro

CCDSA Learn Data Structures & Algorithms

Submitted by harshitacodes on Fri, 01/28/2022 - 22:01

Prepare for Advanced Exam

Most top-tier companies want programmers good at Data Structures & Algorithms. Be what they’re looking for.

Become CodeChef Certified

Enroll Now

Resources

01

Heaps (priority queue)

02

Disjoint Set Union

03

Segment Trees

04

Binary Index Tree (Fenwick tree)

05

Trees (traversals)

06

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

07

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

08

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

09

Bellman Ford Algorithm

10

Minimum spanning tree (Prim and Kruskal algorithms)

11

Biconnectivity in undirected graphs (bridges, articulation points)

12

Strongly connected components in directed graphs

13

Topological Sorting

14

Euler path, tour/cycle.

15

Modular arithmetic including division, inverse

16

Amortized Analysis

17

Divide and Conquer

18

Advanced Dynamic Programming

19

Sieve of Eratosthenes

Mock Test

Practice on the exact problems which had appeared in a past CodeChef Contests -

More Resources

Past Advanced Exam

Practice on the exact problems which had appeared in a past Foundation level exam -

DSA Learning Series

This is a series which covers almost all topics.

  • Learn Data Structures and Algorithms - LEARNDSA

Practice from CodeChef Problem Lib

Practice from CodeChef huge collection of problems.

  • CodeChef Problems based on Difficulty Levels - Link
  • Problems with Tags - Link