Dynamic Programming

Maximum subsequence sum such that no three are consecutive

Part of the Final 450 DSA sheet. Solve it on one of the links below, then sign up to track your progress.