N = int(raw_input())
K = int(raw_input())
prices = map(int, raw_input().split())

dp = [0] * N
https://whatsapp.com/channel/0029VahiS3p2v1IyoS891Y1g
for j in range(N):
if j > 0:
dp[j] = dp[j - 1]
if j >= K:
dp[j] = max(dp[j], dp[j - K] + prices[j] - prices[j - K])

print(max(dp) if N else 0)

╔════════════════════════════╗
🔥 FREE OA CODE DROP 🔥
╚════════════════════════════╝

📌 Problem: Best Time to Buy & Sell Stock II

✅ Plagiarism-Free Solution
✅ Optimized & Submission Ready
✅ Suitable for OA & Coding Assessments

━━━━━━━━━━━━━━━━━━━━━━

📢 Don't keep it to yourself!

🔁 Forward this post to your friends and placement groups.
Helping one candidate today could help them land a job tomorrow. ❤️

📲 Join our FREE WhatsApp Channel
https://whatsapp.com/channel/0029VahiS3p2v1IyoS891Y1g

🚀 Daily OA Codes • Interview Questions • Placement Updates • Job Alerts

*🚨🔥 FULL PYTHON CODE RELEASED 🔥🚨*

💻 Problem: Length of Longest Sequences

✅ Optimized Dynamic Programming Solution
✅ Clean & Easy to Understand
✅ Placement OA Ready
✅ Python 3

https://whatsapp.com/channel/0029VahiS3p2v1IyoS891Y1g

import sys

input = sys.stdin.readline

def solve(N, target, nums):
dp = [[-1] * (target + 1) for _ in range(N + 5)]

for i in range(N + 5):
dp[i][0] = 0

for i in range(N - 1, -1, -1):
val = nums[i]
nxt = min(N, i + (val % 4) + 1)

for s in range(target + 1):
dp[i][s] = dp[i + 1][s]

if val <= s and dp[nxt][s - val] != -1:
dp[i][s] = max(dp[i][s], dp[nxt][s - val] + 1)

return dp[0][target]


if name == "main":
try:
N = int(input())
target = int(input())
nums = list(map(int, input().split()))
print(solve(N, target, nums))
except (EOFError, ValueError):
pass

📚 For More Coding Questions, OA Solutions, Interview Preparation & Placement Updates, Join Our WhatsApp Channel:
https://whatsapp.com/channel/0029VahiS3p2v1IyoS891Y1g

🚀 Daily Updates | OA Questions | Interview Help | Placement Support

https://whatsapp.com/channel/0029VahiS3p2v1IyoS891Y1g

📣 Knowledge grows when it's shared! 🚀

🔁 Forward this code to your friends, classmates, and placement groups.

💙 Your one share could be the reason someone clears their OA and gets placed. 🤝

Company name: Salesforce
Role: Software Engineer - AMTS
Batch Eligible: 2026 graduates
Location: Hyderabad/Bangalore, India
Expected CTC: INR 45 LPA

Community for Quick instant Jobs and Internships Updates
https://whatsapp.com/channel/0029VahiS3p2v1IyoS891Y1g

Apply Link: https://bit.ly/4hK83zt

Do share with your Friends too