The Augmented Dev · Archive
Dynamics 365, Power Platform, AI, system design, and web development — filter by theme or search across every post.
Newsletter
One email per post. No spam, no tracking pixels, unsubscribe anytime.
11 of 325 articles tagged dynamic-programming
Fibonacci in costume — the recurrence-first discipline in miniature. Python solution and complexity analysis for the dynamic programming interview pattern.
Fewest coins to a target — and why greedy dies on [1, 3, 4]. Python solution and complexity analysis for the dynamic programming interview pattern.
Levenshtein distance — three operations, one table. Python solution and complexity analysis for the dynamic programming interview pattern.
Non-adjacent maximum sum — the two-variable rolling DP. Python solution and complexity analysis for the dynamic programming interview pattern.
Track the farthest reachable index — O(n) with one integer of state. Python solution and complexity analysis for the dynamic programming interview pattern.
Match extends the diagonal, mismatch takes the better drop. Python solution and complexity analysis for the dynamic programming interview pattern.
The tails array and patience sorting — binary search inside DP. Python solution and complexity analysis for the dynamic programming interview pattern.
Extend or restart — the ending-here state that makes it one pass. Python solution and complexity analysis for the dynamic programming interview pattern.
Equal-halves split — subset-sum with the backward loop. Python solution and complexity analysis for the dynamic programming interview pattern.
Paths through a lattice — 2D recurrence, 1D memory. Python solution and complexity analysis for the dynamic programming interview pattern.
Can the string be segmented? Prefix reachability with a set lookup. Python solution and complexity analysis for the dynamic programming interview pattern.
