Class 1:  Analysis of Algorithm, Mathematics & Bit Manipulation

• Asymptotic Analysis 
  
• Time and Space Complexity
• Masters Theorem
• Bitwise Operators (Bitwise AND, Bitwise OR, Bitwise XOR, Left Shift, Right Shift, etc )
• Problems: GCD and LCM, Iterative Power, Generate Power Set, etc
  
  

Class 2:  Arrays

• Arrays - Introduction and Advantages
• Types of Arrays
• Operations of Arrays - Searching, Insertion, and Deletion
• Sliding Window Technique 
• Problems: Largest Element in an Array, Leaders in an Array Problem, Maximum Subarray Sum, etc

Class 1: Recursion and Backtracking

• Introduction to Recursion
• Writing Base Cases in Recursion
• Tail Recursion
• Introduction to Backtracking
• Problems: Print 1 to N Using Recursion, Rope Cutting Problem, Rat in a Maze, etc
  
  

Class 2: Searching

• Linear Search
• Binary Search - Iterative and Recursive Approach
• Analysis of Binary Search
• Two Pointer Approach
• Problems: Index of the first Occurrence in SortedArray, Count 1s in a Sorted Binary Array, Square root of a number, etc

Class 1: Sorting

• Overview of the Sorting Algorithm
• Sorting Algorithms e.g. Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort with Analysis
• Stability of Sorting Algorithms
• Problems: Minimum Difference in an Array, Chocolate Distribution Problem, etc
  
  

Class 2: Matrix and Hashing

• Multidimensional Array
• Passing 2D Arrays as an argument
• Hashing Introduction, applications, and analysis
• Collision Handling
• Hashing Function
• Problems: Transpose of a Matrix, Matrix in Snake Pattern, Count Distinct Elements, Frequencies of Array Elements, etc

Class 1: Strings

• String Introduction 
• Overview of Pattern Searching Algorithm
• Naive and Improved Naive Pattern Searching
• Rabin Karp Algorithm
• KMP Algorithm (Constructing LPS Array and Complete Algorithms)
• Problems: Palindrome Check, Reverse words in a string, Anagram Search, etc
  
  

Class 2: Linked List

• Introduction to Linked List
• Traversing a Linked List 
• Insertion and Deletion of Node in Linked List
• Doubly Linked List and Circular Linked List
• Problems: Middle of Linked List, Deleting a Node without accessing Head pointer of Linked List, etc