Skill

academic-algorithms-data-structures

Specializes in Advanced Algorithms, Data Structures, and Computation Theory building on CLRS, Sipser, Knuth, and Kopec. Covers Asymptotic Complexity (Big-O, Master Theorem, Akra-Bazzi), Balanced Trees and Spatial Indexing (AVL, Red-Black, B/B+ Trees, Segment Trees, Fenwick Trees, DSU with Union-by-Rank and Path Compression), Graph Algorithms (Dijkstra, A*, Bellman-Ford, Floyd-Warshall, Tarjan Strongly Connected Components, Kruskal/Prim Minimum Spanning Tree, Dinic/Edmonds-Karp Max Flow), Dynamic Programming and Combinatorial Optimization, the Chomsky Hierarchy, Finite Automata (DFA, NFA, Subset Construction, Pumping Lemmas), Pushdown Automata (PDA, Chomsky Normal Form, CYK Algorithm), Turing Machines, Decidability and Reducibility (Halting Problem via Cantor Diagonalization, Rice's Theorem), and Complexity Theory (P, NP, co-NP, NP-Complete via Cook-Levin, Karp Reductions, PSPACE).

Bundled with Coacus. Its trust score, security findings and other files are on the plugin page.

npx [email protected] add dandgabr/Coacus