TIME & SPACE COMPLEXITY
  • What is algorithm efficiency
  • Big O, Big Omega, Big Theta
  • Best, worst and average case
  • Analyzing loops and recursive calls
ARRAYS
  • Indexing and traversal
  • Insertion and deletion
  • Finding max and min
  • Reversing arrays
STRINGS
  • Character manipulation
  • Palindrome checking
  • Frequency counting
  • String reversal
BASIC MATH
  • Prime numbers
  • GCD and LCM
  • Digit manipulation
  • Number properties
RECURSION
  • Base and recursive case
  • Call stack
  • Factorial and Fibonacci
  • Recursive problem solving
SEARCHING
  • Linear search
  • Binary search
  • When to use which
  • Time complexity comparison
SORTING
  • Bubble sort
  • Selection sort
  • Insertion sort
  • Sorting logic
TWO POINTER TECHNIQUE
  • Left and right pointer
  • Optimized traversal
  • Array and string problems
  • Time optimization
STACK
  • LIFO principle
  • Push and pop
  • Valid parentheses
  • Reverse string
QUEUE
  • FIFO principle
  • Enqueue and dequeue
  • Circular queue
  • Real world use cases
LINKED LIST
  • Singly and doubly linked list
  • Insertion and deletion
  • Reversing a list
  • Cycle detection
HASHING
  • Hash maps and hash sets
  • Frequency counting
  • Finding duplicates
  • Optimized lookups
SLIDING WINDOW
  • Subarray problems
  • Maximum sum window
  • Optimized looping
  • Window expansion and shrink
BINARY TREES
  • Tree structure
  • Inorder, preorder, postorder
  • Height and depth
  • Level order traversal
GRAPHS
  • Nodes and edges
  • BFS and DFS
  • Connected components
  • Cycle detection
DYNAMIC PROGRAMMING
  • Memoization
  • Tabulation
  • Fibonacci and Knapsack
  • Optimized recursion
PRACTICE & PROJECTS
  • 300+ DSA practice problems
  • Interview pattern questions
  • Mock coding rounds
  • Final capstone problem set
← Go Back