Leetcode with dani
Open in Telegram
Join us and let's tackle leet code questions together: improve your problem-solving skills Preparing for coding interviews learning new algorithms and data structures connect with other coding enthusiasts
Show more1 261
Subscribers
-224 hours
+27 days
+830 days
Posts Archive
1 261
n, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
bu = [0] * n
for i in range(len(arr) - 2, -1, -1):
bu[i] = abs(arr[i] - arr[i + 1]) + bu[i + 1]
for j in range(i + 2, min(i + k + 1, len(arr))):
bu[i] = min(abs(arr[i] - arr[j]) + bu[j], bu[i])
1 261
Mrbeast
Hi Me in 10 Yearsπ , what do u think u will be in 10 years from now , let's write down our plan and compare it after 10 years
Oct 5 /2025 -> Oct 5 /2035
1 261
i wrote a code and submitted it but when i looked at it, it always return True then i write this and submitted it and it works , i dont expect this answer for DP questionππ
