Another Casual Coder

This one was a straightforward DP, usually problems related to Min/Max with a constraint can be solved efficiently with DP. To make this post more interesting and to celebrate Mother's Day, here is a poem for all Mothers using Dynamic Programming (thanks to GAI):

Mom's Dynamic Love

Mom's love, like an algorithm refined,

Dynamic and recursive, forever entwined.

Her hugs are the base case, warm and secure,

While her laughter loops infinitely, that's for sure.

In the matrix of memories, she's the constant term,

Guiding us through life's loops, each twist and turn.

Her kisses, a recursive function, never-ending,

Adding joy to our hearts, forever ascending.

Mom's patience, an optimal solution we seek,

As we debug our lives, sometimes feeling weak.

She patches our errors with love's sweet embrace,

And her smile—oh, that's the perfect base case!

Her advice, a dynamic array of wisdom,

Growing with each iteration, never random.

She sorts out our troubles, like bubbles in a list,

And her warmth? Well, that's the ultimate gist.

So, here's to you, Mom, our dynamic queen,

Your love, an elegant proof we've ever seen.

Happy Mother's Day, with heartfelt recursion,

You're the best function in our life's equation! 🌸❤️

Code is down below, cheers, ACC.

Taking Maximum Energy From the Mystic Dungeon - LeetCode

public int MaximumEnergy(int[] energy, int k)
{
 int[] dp = new int[energy.Length];
 int retVal = Int32.MinValue;
 for (int i = 0; i < energy.Length; i++)
 {
 if (i - k < 0) dp[i] = energy[i];
 else dp[i] = Math.Max(energy[i], dp[i - k] + energy[i]);
 if (i + k >= energy.Length) retVal = Math.Max(retVal, dp[i]);
 }
 return retVal;
}