Размер видео: 1280 X 720853 X 480640 X 360
Показать панель управления
Автовоспроизведение
Автоповтор
Apka explanation day by day achha hote ja rahe he
agreed abh sir kafi acha samja rahe hai approach thought process wise
like targer for this video is 100. Please do like if you have understood the explanation 😃😃
TQ sir aapne bhut ache se samjhaya ❤
Kya explain kia sir dil khus ho gya 🙏🙏🙏🙏
Nice One shashwat keep going
very nicely explained
sir , i want to thank you your explaination is too good and very helpful for me as a beginner :)
Thank you ❤❤❤❤❤❤
amzing explanation
bhaiya just want to ask an advice that is seeing through solution and than coding bad if we are mid level coder focusing on on campus?
Osm explain sir
Thanks 😊
bhaiya iska 1st question bhi krwa dete ....😅😅
Waiting for graph series😢
Dp par el series bna do please
Please sir upload graph lecture 🙏
💥🔥
😍😍
Sir nahi samjha
l,f=len(n),sum(n); o=t=sum(n[:f])for i,v in enumerate(n,f): o=max(o,t:=t+n[i%l]-v)return f-o
Apka explanation day by day achha hote ja rahe he
agreed abh sir kafi acha samja rahe hai approach thought process wise
like targer for this video is 100. Please do like if you have understood the explanation 😃😃
TQ sir aapne bhut ache se samjhaya ❤
Kya explain kia sir dil khus ho gya 🙏🙏🙏🙏
Nice One shashwat keep going
very nicely explained
sir , i want to thank you your explaination is too good and very helpful for me as a beginner :)
Thank you ❤❤❤❤❤❤
amzing explanation
bhaiya just want to ask an advice that is seeing through solution and than coding bad if we are mid level coder focusing on on campus?
Osm explain sir
Thanks 😊
bhaiya iska 1st question bhi krwa dete ....😅😅
Waiting for graph series😢
Dp par el series bna do please
Please sir upload graph lecture 🙏
💥🔥
😍😍
Sir nahi samjha
l,f=len(n),sum(n); o=t=sum(n[:f])
for i,v in enumerate(n,f): o=max(o,t:=t+n[i%l]-v)
return f-o