dsa-templates Logo

Contents:

  • Stack
  • Queue and Deque
  • Generate all possible substructures of a given structure
  • Binary search
  • Binary Tree
  • Algos on graph
  • Trie
  • Dynamic Programming
  • Backtracking
  • Union Find (Disjoint Set)
  • Minimum Spanning Tree
  • Fenwick Tree
  • Segment Tree
  • Sparse Table
  • Sorted List
  • Interval Tree
  • Suffix Automaton
  • Rolling Hash
  • Bit Manipulation
  • Mo’s Algorithm
  • Heavy-Light Decomposition
  • Centroid Decomposition
  • Breadth-First Search
  • Depth-First Search
  • Dijkstra’s Algorithm
  • Topological Sort
  • MultiSet
  • Examples of One-liners
  • Math Utilities
dsa-templates
  • <no title>
  • View page source
Previous Next

© Copyright 2025, David Mikheev.

Built with Sphinx using a theme provided by Read the Docs.