Tagged articles

maximum subarray

3 articles · Page 1 of 1

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.

AlgorithmGoLeetCode

0 likes · 4 min read

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

Wu Shixiong's Large Model Academy

Oct 13, 2023 · Fundamentals

How to Maximize Subarray Sum with One Element Replacement (DP Solution)

The article presents a dynamic‑programming solution to compute the maximum sum of a contiguous subarray when you may replace at most one element with a given value, detailing problem constraints, input/output format, DP state definitions, transition formulas, reference Python code, and complexity analysis.

DPPythonmaximum subarray

0 likes · 6 min read

How to Maximize Subarray Sum with One Element Replacement (DP Solution)

IT Services Circle

Mar 10, 2022 · Fundamentals

Maximum Subarray Problem: Brute‑Force, Divide‑and‑Conquer, and Dynamic‑Programming Solutions in C++

This article explains the classic maximum subarray problem, presents a brute‑force O(n³) method, an improved O(n²) version, a divide‑and‑conquer O(N log N) algorithm, and a linear‑time O(N) dynamic‑programming solution, each with full C++ code and complexity analysis.

C++ComplexityDivide and Conquer

0 likes · 8 min read

Maximum Subarray Problem: Brute‑Force, Divide‑and‑Conquer, and Dynamic‑Programming Solutions in C++