Introduction to Time Complexity – Understanding Big-O Notation (Best, Worst, Average Cases).

Basic Array Operations – Insertion, Deletion, Searching.

Multi-Dimensional Arrays – Matrix Operations & Rotations

Optimization Techniques – Prefix Sum & Array Rotation

Basic Searching – Linear Search & Binary Search

Advanced Searching – Searching in Rotated Sorted Arrays

Variants & Optimizations – Ternary Search, Exponential Search

Sorting Algorithms – Quick Sort, Merge Sort, Counting Sort

Merging Intervals – Overlapping Intervals, Sorting Intervals

Special Cases – Kth Largest Element, Arranging Numbers for Maximum Value

Introduction to Bitwise Operations – AND, OR, XOR, Left & Right Shifts

Mathematical Applications – Checking if a Number is a Power of 2

Unique Number Problems – Finding Single Occurring Elements

Optimized Searching & Pair Finding – Two Pointer Technique

Sliding Window for Subarrays – Maximum Sum Subarray

Length-based Problems – Longest Subarray Under Constraints

Stack Fundamentals – LIFO Principle, Balanced Parentheses

Queue Implementation – Using Stacks, Circular Queues

Stack Fundamentals – LIFO Principle, Balanced Parentheses

Cycle Detection & Intersection – Floyd’s Cycle Detection Algorithm

Manipulation & Operations – Reversing, Merging, Deletion

Binary Tree Basics – Traversals (Inorder, Preorder, Postorder)

BST Operations – Insertion, Deletion, Search

Introduction to DP – Recursion vs. DP (Memoization & Tabulation)

Classic Problems – Fibonacci Using DP, Longest Increasing Subsequence

Graph Basics – Representation & Adjacency Lists

Graph Traversals – BFS, DFS for Connected Components

Pathfinding Algorithms – Dijkstra’s Algorithm, Minimum Spanning Trees