es
Feedback

¡No caigas en manos de tramposos! Telemetrio encuentra y marca estos canales 👉 Si quieres ver la etiqueta, suscríbete

Leetcode with dani

Leetcode with dani

Ir al canal en 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

Mostrar más
1 240
Suscriptores
-324 horas
-47 días
-2230 días
Archivo de publicaciones
Don't ever save anything for a special occasion. Being alive is the special occasion. — Mary Engelbreit

🧠 TEASER

photo content
+2

the exact answer with c++ passed 😭
the exact answer with c++ passed 😭

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])

this question freaks me out 🥵 i coundnt pass the time constraint
this question freaks me out 🥵 i coundnt pass the time constraint

Comedy This guy is pure comedy🤣🤣

This guy is pure comedy🤣

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

photo content

Amazing 🥳
Amazing 🥳

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 work
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😂😂

😭
😭

new feature
new feature