dsa4 min read
GCD, LCM, and Extended Euclidean Algorithm
Master GCD/LCM with Euclidean algorithm O(log n) and the Extended Euclidean for modular inverse computation.
Read →
All Posts
1575 articles
dsa3 min read
Sieve of Eratosthenes: Find All Primes Efficiently
Generate all primes up to n in O(n log log n) with the Sieve of Eratosthenes. Includes segmented sieve and prime factorization variants.
Read →
dsa2 min read
Math & Number Theory for DSA: Complete Guide
Master mathematical algorithms for DSA: primes, GCD, modular arithmetic, combinatorics, and fast exponentiation with 5-language implementations.
Read →
dsa2 min read
Advanced Graphs — Complete Guide (MST, SCC, Bridges, Floyd-Warshall, A*)
Master advanced graph algorithms: Kruskal and Prim MST, Tarjan SCC, articulation points, bridges, Floyd-Warshall all-pairs shortest path, and A* search.
Read →
dsa2 min read
Kruskal's Algorithm — Minimum Spanning Tree with Union-Find
Find the minimum spanning tree of a weighted graph using Kruskal's algorithm. Sort edges by weight, use Union-Find to avoid cycles. O(E log E) time.
Read →
Page 286 of 315