dsa2 min read
Longest Path in DAG — Graph DP with Memoisation
Find the longest path in a directed acyclic graph using DFS with memoisation. Since cycles are absent, DFS never revisits nodes, making top-down DP straightforward.
Read →
All Posts
1575 articles
dsa2 min read
Network Flow Concepts — Max Flow and Min Cut Overview
Introduction to network flow: max flow problem, Ford-Fulkerson algorithm with BFS (Edmonds-Karp), max-flow min-cut theorem, and applications in matching and connectivity.
Read →
dsa3 min read
Advanced Graphs — Master Recap and Algorithm Selection Guide
Complete recap of all 20 advanced graph problems with algorithm selection guide, complexity comparison, and pattern recognition cues.
Read →
dsa2 min read
String Algorithms — Complete Guide (KMP, Z, Rolling Hash, Suffix Array)
Master advanced string algorithms: KMP failure function for O(n) pattern matching, Z-algorithm for all prefix matches, Rabin-Karp rolling hash, and suffix arrays for substring queries.
Read →
dsa2 min read
KMP Algorithm — O(n+m) Pattern Matching with Failure Function
Implement KMP string search: build the failure function (LPS array) in O(m) then search in O(n). Never re-examines matched characters unlike naive search.
Read →
Page 290 of 315