HomeBlog

DSA Notes

Comprehensive notes in cp-algorithms style with deep explanations, ASCII visualizations, and C++ code.

Stacks & Queues

  • Monotonic Stack

  • Monotonic Queue & Deque

Data Structure Internals

  • HashMap Internals

  • Disjoint Set Union (Union-Find)

  • Heap Internals (Priority Queue)

Tree Data Structures

  • Trie (Prefix Tree + Bitwise Trie)

  • AVL Tree & Binary Indexed Tree

  • Segment Tree (with Lazy Propagation)

Fundamental Algorithms

  • All Sorting & Searching Algorithms

  • BFS vs DFS — When to Use Which

  • Tree Traversals (Inorder, Preorder, Postorder, Level Order)

Graph Algorithms

  • Shortest Path (Dijkstra, Bellman-Ford, Floyd-Warshall)

  • Minimum Spanning Tree (Kruskal, Prim)

String Algorithms

  • KMP & Z Algorithm

Problem-Solving Paradigms

  • Dynamic Programming (Bottom-Up)

  • Recursion & Backtracking

Theory & Mathematics

  • NP-Complete Problems (TSP, Knapsack, etc.)

  • Combinatorics & Probability

  • Discrete Math (Number Theory, Bit Manipulation)

Dharmveer Jakhar © 2026