ByteStackOne logoByteStackOne
Beginner–Intermediate
12 weeks Python / Java / C++

DSA & Algorithms

A comprehensive course covering every data structure and algorithm pattern tested in competitive programming and technical interviews at top companies.

₹4,999
Enroll now

Curriculum

01

Arrays & Strings

  • Two-pointer technique
  • Sliding window
  • Prefix sums
  • Kadane's algorithm
02

Linked Lists & Stacks

  • Singly & doubly linked lists
  • Stack using arrays
  • Monotonic stack
  • LRU cache implementation
03

Trees & Graphs

  • BST operations
  • DFS / BFS traversals
  • Topological sort
  • Disjoint Set Union
04

Dynamic Programming

  • Memoization vs tabulation
  • 0/1 Knapsack
  • LCS / LIS
  • Interval DP
05

Heaps & Priority Queues

  • Min/max heap
  • Heap sort
  • Top-K problems
  • Merge K sorted lists
06

Sorting & Searching

  • Merge sort, Quick sort
  • Binary search variants
  • Dutch national flag
  • Search in rotated array
07

Greedy & Backtracking

  • Activity selection
  • Huffman coding
  • N-Queens
  • Sudoku solver
08

Tries & Advanced DS

  • Trie implementation
  • Segment trees
  • Fenwick tree
  • Sparse table

What you'll build

Build a LeetCode-style problem tracker with tag filtering

Implement a pathfinding visualiser (Dijkstra / A*) in the browser

FAQ