BestHub
Sign in
Tagged articles

maximum subarray

4 articles · Page 1 of 1
Java Captain
Java Captain
Sep 19, 2026 · Fundamentals

Dynamic Programming Mastery: 11 Classic Problems Solved with Recurrences & C Code

This article analyzes 11 classic dynamic programming problems including coin change, edit distance, LCS, LIS, maximum subarray, matrix chain multiplication, 0-1 knapsack, constrained shortest path, tiling with state compression, work allocation, and three-pass apple picking, providing recurrence relations, C implementations, and optimization techniques.

0-1 knapsackcoin changedynamic programming
0 likes · 34 min read
Dynamic Programming Mastery: 11 Classic Problems Solved with Recurrences & C Code
Nullbody Notes
Nullbody Notes
Nov 11, 2023 · Fundamentals

How to Solve LeetCode 53: Maximum Subarray Sum with Dynamic Programming

The article explains a dynamic‑programming approach to the classic “Maximum Subarray Sum” problem, defining dp[i] as the best sum ending at index i, deriving the recurrence dp[i]=max(dp[i‑1]+nums[i], nums[i]), initializing base cases, and providing complete Go code.

GoLeetCodealgorithm
0 likes · 4 min read
How to Solve LeetCode 53: Maximum Subarray Sum with Dynamic Programming