Introduction: Asymptotic Analysis

• Time Complexities
• Space Complexities

Mathematics

• GCD
• Prime
• Factorial
• Sieve of Eratosthenes
• Computing Power

Arrays

• Types
• Operations on Arrays
• Sliding Window Technique
• Prefix Sum

Recursion

• Basic Recursion Concepts

Bit Magic

• Bit Operators
• Bit Manipulation Tricks

Matrix

• Matrix Operations
• Matrix Searching
• Insert, Delete, Rotate, Transpose

Searching

• Linear Search
• Binary Search
• Two Pointer Approach

Sorting

• Insertion Sort
• Merge Sort
• Quick Sort
• Cycle Sort
• Counting Sort
• Radix Sort
• Bucket Sort
• Custom Sort using STL

Hashing

• Hashing Techniques
• Collision Resolution

Strings

• Basic Operations
• Naive Pattern Search
• KMP Algorithm
• Rabin-Karp Algorithm

Linked Lists

• Introduction to LinkedList
• Singly Linked List
• Doubly Linked List
• Circular Linked List
• Skip List
• Questions

Stacks

• Stack Operations
• Questions

Queues

• Queue Operations
• Questions

Deque

• Deque Operations
• Questions

Tree

• Binary Tree
• Tree Traversals
• Questions

Binary Search Tree (BST)

• Search
• Insert
• Delete
• AVL Trees
• Self-Balancing Trees

Heaps

• Binary Heap (Min & Max)
• Priority Queue
• Heap Questions

Graphs

• Graph Implementation
• Graph Traversals
• Cycle Detection
• Bipartite Graph
• Minimum Spanning Tree
• Topological Sorting

Week 8

Greedy Algorithms

• Fractional Knapsack
• Activity Selection
• Job Sequencing

Dynamic Programming (DP)

• Top Down & Bottom Up Approaches
• Optimal Substructures
• Overlapping Subproblems
• Standard Problems (LIS, LCS, etc.)

Dynamic Programming Problems

• Variations of Standard Problems

Graph Algorithms

• Shortest Path Algorithms
• Connected Components
• Bridges

Tries

• Tries Basics

Segment Tree

• Segment Tree Operations

Disjoint Set Union

• Union & Find Operations
• Path Compression