Module 01 · 2 hrs
Start hereIntroduction to DSA
Understanding time and space complexity, Big O notation.
FoundationsIntermediate
Data Structures and Algorithms
Interview-ready DSA mastery
Build unshakeable problem-solving skills — complexity analysis, linked lists, stacks, queues, recursion, hashing, trees, heaps and graphs — tuned for placement interviews.
20 modules50-hr track80% hands-on2 projects
Curriculum
20 modules, 50 hrs of hands-on learning
Every module pairs a focused topic with a guided practical exercise — learn it, build it, then practice it on the Atom Code portal in the same session.
Module 02 · 2.5 hrs
Hands-on sessionMathematics for DSA
GCD, prime numbers, modular arithmetic, bitwise operations.
Module 03 · 2 hrs
Hands-on sessionSorting Algorithms
Implementing bubble sort, selection sort, insertion sort, merge sort, quick sort.
Module 04 · 3.5 hrs
Hands-on sessionArrays and Strings
Understanding 1D & 2D arrays, string manipulation techniques.
Module 05 · 2.5 hrs
Hands-on sessionSingly Linked List
Implementing singly linked list and its operations.
Module 06 · 2.5 hrs
Hands-on sessionDoubly Linked List
Implementing doubly linked list and its operations.
Module 07 · 2.5 hrs
Hands-on sessionCircular Linked List
Implementing circular linked list and its operations.
Module 08 · 2 hrs
Hands-on sessionStacks 1
Implementation of stacks, applications in real scenarios.
Module 09 · 2 hrs
Hands-on sessionStacks 2
Advanced stack problems and applications in real scenarios.
Module 10 · 2.5 hrs
Hands-on sessionQueues 1
Implementation of queues, applications in real scenarios.
Module 11 · 2.5 hrs
Hands-on sessionQueues 2
Advanced queue problems and applications in real scenarios.
Module 12 · 2.5 hrs
Hands-on sessionRecursion 1
Revisiting basic recursion.
Module 13 · 2.5 hrs
Hands-on sessionRecursion 2
Implementing permutations.
Module 14 · 2 hrs
Hands-on sessionHashing
Hash tables, hash functions, collision handling, problems using hashing.
Module 15 · 2.5 hrs
Hands-on sessionBinary Trees
Tree traversals, binary tree operations, depth-first and breadth-first traversal.
Module 16 · 3.5 hrs
Hands-on sessionBinary Search Tree (BST)
BST properties, insertion, deletion, searching in BST, balanced trees.
Module 17 · 2 hrs
Hands-on sessionOrdering
Compare inorder, postorder, preorder in tree traversal.
Module 18 · 3.5 hrs
Hands-on sessionHeap and Priority Queue
Overview of max-heap, min-heap, heap sort, priority queue operations.
Module 19 · 2.5 hrs
Hands-on sessionGraphs 1
Understanding graph representations (adjacency matrix, list).
Module 20 · 2.5 hrs
Hands-on sessionGraphs 2
Compare BFS and DFS in graphs.