dsa1 min read
Strange Printer — Interval DP
Minimum turns to print string where each turn prints a contiguous run of same char. Interval DP: dp[i][j] = min turns for s[i..j].
Read →
All Posts
1276 articles
dsa2 min read
2D Dynamic Programming — Master Recap & Cheatsheet
Complete 2D DP cheatsheet: 7 patterns, key transitions, stock state machine, interval DP template, and problem index.
Read →
dsa6 min read
BFS & DFS on Graphs and Grids — Complete Guide
Master BFS and DFS on graphs and grids: islands, flood fill, shortest paths, connected components, and multi-source BFS with 5-language implementations.
Read →
dsa2 min read
Number of Islands — DFS/BFS Flood Fill
Count connected land components in a binary grid using DFS flood fill or BFS. Classic easy problem, foundation for all island variants.
Read →
dsa2 min read
Flood Fill — DFS Color Replace
Implement the flood fill algorithm (like paint bucket tool): replace all cells of the same color reachable from a starting cell.
Read →
Page 43 of 256