Notes

2d_prefix_sums.md

BIT_fenwick_tree.md

Fibonacci.md

RMQ_LCA_Flow_neal.md

ac_proof.md

adhoc.md

auxiliary_tree.md

bimatching.md

binary_search.md

bitset_bitmask.md

brackets.md

centroid_decomposition.md

readme.md

combinatorics.md

computational_geometry.md

constructive.md

convex_hull.md

convex_hull_trick.md

coordinate_compression.md

counting.md

cpp_shortcuts_tricks.md

deque_applications.md

disjoint_set_union_find_DSU.md

divide_and_conquer_static_range_queries.md

dynamic_connectivity.md

dynamic_programming.md

dynamic_programming_2.md

dynamic_programming_3.md

dynamic_programming_4_sos_dp.md

dynamic_programming_5.md

dynamic_programming_6_atcoder_tricks.md

dynamic_programming_on_trees.md

dynamic_programming_without_dp.md

euler_tour_technique.md

fft_and_ntt.md

functional_graph.md

game_theory.md

gcd.md

geometry.md

graph.md

graph_2.md

graph_3.md

greedy.md

hashing.md

heap_priority_queue.md

heavy_light_decomposition_hld.md

hopkroft_maching.md

interactive_problems.md

interview_problems.md

lca_rmq_sparse.md

linear_algebra_gaussian_elimination.md

link_cut_tree.md

math.md

matrix_exponentiation_generating_functions.md

max_flow_min_cut_problems.md

maxflow.md

maximum_flow_model_problems.md

maximum_flow_theory.md

median.md

meet_in_the_middle.md

mobius_function.md

modular_int_mint.md

nested_range.md

number_theory.md

observations.md

parallel_binary_search.md

persistent_segment_tree_and_data_structures.md

pollard-rho.md

probability.md

reachability_tree.md

recursion.md

rerooting_tree.md

resources.md

sack_dsu_on_tree.md

segment_tree.md

segment_tree_2d.md

segment_tree_beats.md

segment_tree_iterative.md

selecting_edges.md

sequences.md

sieve.md

splay_tree.md

sqrt_decompositio_mo.md

stack_applications.md

strings.md

todo_problems.md

treap.md

tree_data_structures.md

trie.md

two_pointers.md

xor_tree.md