es
Feedback
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 258
Suscriptores
Sin datos24 horas
+17 días
-730 días
Archivo de publicaciones
photo content

photo content

u can make some money by sharing to your friends

Check out this AI browser perplexity browser Discover a smarter way to browse! 🚀 Try the Perplexity Browser for lightning-fast answers, powerful AI tools, and next-level productivity. Perfect for work, study, and everyday browsing—share it with your friends and upgrade your internet experience today!

Repost from 「 Eyu core 」
Enjoy but don't get attached Give but dont expect Listen but dont judge Love but not depend and finally accept but dont settl
Enjoy but don't get attached Give but dont expect Listen but dont judge Love but not depend and finally accept but dont settle

photo content

photo content

if u had the chance to be immortal ,would u take it
Anonymous voting

photo content
+1

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🤣🤣