contains category wise problems(data structures, competitive) of popular platforms.
View the Project on GitHub mayankdutta/category-wise-problems
Auto-generated from the **Tags:** line of each note (254 tagged files). Do not edit by hand — regenerate with python3 scripts/gen_tags_index.py. See CONTRIBUTING.md for the controlled vocabulary.
binary-search (9)bit-manipulation (9)bst (7)dp (59)dsu (11)graph (29)greedy (18)heap (7)implementation (25)intervals (4)linked-list (17)math (2)number-theory (8)prefix-sum (22)range-queries (1)stack (9)strings (8)tree (33)trie (2)01-bfs (1)backtracking (3)bfs (24)binary-lifting (1)binary-search-on-answer (2)boyer-moore-voting (2)brute-force (14)catalan (1)combinatorics (8)constructive (16)counting-dp (9)custom-comparator (4)dag-dp (5)dfs (39)difference-array (2)dijkstra (5)divide-and-conquer (6)dp-optimization (3)edit-distance (1)factorization (3)fast-slow-pointers (3)fibonacci-dp (10)flood-fill (4)floyd-warshall (1)gcd-lcm (4)grid-dp (11)hashmap (28)interval-dp (5)inversion-count (2)kadane (6)knapsack (11)lca (2)lcs (4)linear-dp (3)lis (2)modular-arithmetic (6)monotonic-deque (2)monotonic-stack (7)morris-traversal (3)mst (1)multisource-bfs (2)offline-queries (1)ordered-set (4)probability-dp (1)shortest-path (5)sieve (3)sliding-window (15)sorting (18)state-compression (9)subset-sum (5)sweep-line (2)top-k (3)topological-sort (9)tree-dp (5)tree-traversal (4)two-pointers (24)two-sum (3)unbounded-knapsack (9)