Видео

🎉

14:00 Having an issue sir could you please help me to solve it as soon as possible in output

Yes he can do it too if the dishes are sorted, btw kaaju katli Is love ❤😅

8:54 yes dikkat aa rahi hai bhai

bhaiya please add hashmaps in the course !!!!

Ek baar m pura course access karwao bhai adha adha kar k content n mele.... 2025 batch

Bhaiya ek baar m sb Open karo 2025 batch ka hu 14 day ka wait nahi kr sakta hu dusre topic open hone ka 🙂

hashing is not covered ??

Permanent or time peroid bro ?

Bhaiya On campus placement ke liye to most of the companies python ko to allow hi nhi karti hai !

Payment gateway is not working

Course will taught in hindi or English?

Sorted array me bhi woh bata pata 😅

2024 khatam bye bye tata

Nik

bhaii ppt ka link bhi dedo pls

Bhai Video ko poora khatam to kr dete 🤔

I liked the code 👍🏻

thank u so much! I think you are the first who provided actual resources for DSA specifically for AI/ML/DS

Just find largest subarray with sum<=k , And required operation will be list size - subarray size

Thank you sir.

Thank you sir, maza aagaya

#chill with dsaa2z

AMAZING BHAI!!

amazing bhai

bhai complete the series psllsls

bhai you are legendary!!!

❤❤

bro speed jyada ho raha hai please thoda slow padhao

zombies, chori, profit ye kya chl rha😂😂

Is this called Djikstra's algorithm?

fails for: [-1,4,-4,5,-2,-1,-1,-2,-3]

english me bol bhai yeh kya -_-

bro please complete python dsa series

Your playlist seems to be incomplete

nice explanation underrated channel tha

sir, please upload video N*log(N) time complexity video

Thanos 😂

Best

num=int(input("enter the num:")) p=1 for i in range(1,num+1): p=i*p print('facotrial of',num,'is',p) this is the code which i created🙃

Bhaiya subscribe kar rha hun abhi 11th me hun cs se toh python me ye sab karne me maja ata hai bahut ❤❤

O(logn)

Needed a detailed explanation on this

nice nice

Because the sum can ve decrease when the negative elements encountered

Two pointer ?

n=5 for i in range(5): for j in range(n-1-i): print(" ",end="") for j in range(2*i+1): print("*",end="") print() for i in range(n): for j in range(i): print(" ",end="") for j in range(2*(n-1-i)+1): print("*",end="") print() h.w question

Xor 😊

It is 💯 relatable😢

True saurabh 💜