Day Topic Name
Day 1 Linked List
Day 2 Linked List, Stacks
Day 3 Ques, Binary Tree & Binary Search Tr
Day 4 Binary Tree & Binary Search Tree
Day 5 Hashing, Heaps
Day 6 Heaps, Searching
Day 7 Sorting, String Algorithms
Day 8 String Algorithms
Day 9 Recursion, Backtracking
Day 10 Backtracking
Note: Each day consists of 3 hours
of teaching
Sub Topic Name
Print the Elements of a Linked List, Insert a Node at the Tail of a Linked
List,
Insert a node at the head of a linked list,Insert a node at a specific position in
a linked list,Delete a Node, Print in Reverse, Reverse a linked list
Compare two linked lists, Merge two sorted linked lists,
Linked List Implementation & Array Implementation, Function Calls -
Maximum Element, Balanced Brackets
Implementation of Queue, Queue using Two Stacks, Castle on the Grid,
BST - Insertion, Tree Traversals -Inorder, Preorder
Post order, Level order traversal,
Open hashing and Closed hashing, Min and Max heap
Applications of heaps, Linear, Binary, Ternary and Jump search
Bubble, Insertion, Selection sort, Quick and Merge, Naïve, KMP
Rabin-Karp, Z algorithm, Manachars algorithm
Staircase problem, optimal problem, Robot path, Rat in a maze
N queen problem, Flood fill algorithms, coloring problem