dsa-templates
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
Sorted List
Topological Sort
MultiSet
Examples of One-liners
dsa-templates
Index
Index
A
|
B
|
C
|
D
|
F
|
G
|
I
|
K
|
L
|
M
|
N
|
P
|
Q
|
R
|
S
|
T
|
U
A
all_subs.all_subs
module
are_connected() (UnionFind method)
(UnionFindSimple method)
B
bfs() (in module bfs.bfs)
bfs_matrix() (in module bfs.bfs)
bisect_1() (in module binary_search.binary_search)
build() (in module dynam_prog.dynam_prog)
build_tree() (TreeNode method)
C
combinationSum() (in module backtrack.backtrack)
D
dfs.dfs
module
dijkstra.dijkstra
module
dp() (in module dynam_prog.dynam_prog)
dynam_prog.dynam_prog
module
F
fenwick.fenwick
module
FenwickTree (class in fenwick.fenwick)
find() (UnionFind method)
(UnionFindSimple method)
findCircleNum() (in module dfs.dfs)
flatten() (in module one_line.one_line)
G
generate_subsequences() (in module all_subs.all_subs)
I
inorder() (TreeNode method)
insert() (Trie method)
is_valid() (in module stack.stack)
K
kadane_recursive() (in module dynam_prog.dynam_prog)
L
level_order() (TreeNode method)
M
max_subarray_product() (in module dynam_prog.dynam_prog)
max_subarray_sum() (in module dynam_prog.dynam_prog)
max_subarray_sum_circular() (in module dynam_prog.dynam_prog)
maxSlidingWindow() (in module _queue_._queue_)
merge_dicts() (in module one_line.one_line)
minimizeMax() (in module binary_search.binary_search)
minimumCost() (in module min_span_tree.min_span_tree)
module
all_subs.all_subs
dfs.dfs
dijkstra.dijkstra
dynam_prog.dynam_prog
fenwick.fenwick
top_sort.top_sort
tree.tree
trie.trie
union_find.union_find
N
nCastles() (in module backtrack.backtrack)
nQueens() (in module backtrack.backtrack)
numEnclaves() (in module dfs.dfs)
P
permutations() (in module backtrack.backtrack)
postorder() (TreeNode method)
power_set() (in module one_line.one_line)
pref() (FenwickTree method)
prefix_sums() (in module one_line.one_line)
preorder() (TreeNode method)
Q
Queue (class in _queue_._queue_)
R
range_gcd_queries() (in module dynam_prog.dynam_prog)
range_min_queries() (in module dynam_prog.dynam_prog)
range_sum_queries() (in module dynam_prog.dynam_prog)
S
search() (Trie method)
shortestPath() (in module dijkstra.dijkstra)
startsWith() (Trie method)
sumRange() (FenwickTree method)
T
top_sort() (in module top_sort.top_sort)
top_sort.top_sort
module
transpose() (in module one_line.one_line)
tree.tree
module
TreeNode (class in tree.tree)
Trie (class in trie.trie)
trie.trie
module
TrieNode (class in trie.trie)
U
union() (UnionFind method)
(UnionFindSimple method)
union_find.union_find
module
UnionFind (class in union_find.union_find)
UnionFindSimple (class in union_find.union_find)
update() (FenwickTree method)