Leetcode with dani
Открыть в 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
Больше1 240
Подписчики
Нет данных24 часа
-47 дней
-2230 дней
Архив постов
1 240
Don't ever save anything for a special occasion. Being alive is the special occasion.
— Mary Engelbreit
08 окт. 2025, 14:20
1 240
06 окт. 2025, 06:40
06 окт. 2025, ~06:41
1 240
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])05 окт. 2025, 10:14
1 240
this question freaks me out 🥵 i coundnt pass the time constraint
05 окт. 2025, 10:12
1 240
05 окт. 2025, 06:54
05 окт. 2025, ~06:54
1 240
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
05 окт. 2025, 06:28
1 240
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😂😂
30 сент. 2025, 09:38
