Welcome to DSA Templates!

Collection of data structures and algos implementations in Python 3 and Rust

Note

You can see code of all functions on this site by clicking on [source] as usual in tech docs. Maybe it is not the best approach to show implementations of algos and data structures and I should add more explicit code snippets. Hope this website will be useful for your journey in the world of algorithms and data structures.

Note

Rust examples are coming soon…

Indices and tables

• Index

• Module Index

• Search Page

Contents:

• Stack
  • Valid Parentheses
• Queue and Deque
  • Queue Implementation using Array
  • Max Sliding Window
• Generate all possible substructures of a given structure
  • generate_subsequences()
• Binary search
  • Basic Template
  • Binare search: Version 1
  • Binary search: Version 2
  • Binary search: Version 3
  • Binary Search on Answer
• Binary Tree
  • TreeNode
• Algos on graph
  • Construction of a graph from a list of edges
  • BFS
  • DFS
  • Dijkstra
• Trie
  • Trie
  • TrieNode
• Dynamic Programming
  • build()
  • dp()
  • kadane_recursive()
  • max_subarray_product()
  • max_subarray_sum()
  • max_subarray_sum_circular()
  • range_gcd_queries()
  • range_min_queries()
  • range_sum_queries()
• Backtracking
  • permutations()
  • combinationSum()
  • nCastles()
  • nQueens()
• Union Find (Disjoint Set)
  • Rust Implementation
  • Python Implementation
• Minimum Spanning Tree
  • Kruskal’s Algorithm
  • Prim’s Algorithm
• Fenwick Tree
  • FenwickTree
  • Rust Implementation
  • Applications
• Segment Tree
  • Rust Implementation
• Sorted List
• Topological Sort
  • top_sort()
• MultiSet
  • Rust Implementation
• Examples of One-liners
  • prefix_sums()
  • transpose()
  • merge_dicts()
  • power_set()
  • flatten()