2134. Minimum Swaps to Group All 1's Together II | sliding window | Leetcode Daily Challenge | DSA

[@ArnabBhadra02]

Apka explanation day by day achha hote ja rahe he

[@priyanshgarg1292]

agreed abh sir kafi acha samja rahe hai approach thought process wise

[@shashwat_tiwari_st]

like targer for this video is 100. Please do like if you have understood the explanation 😃😃

[@ryan7118]

TQ sir aapne bhut ache se samjhaya ❤

[@Krishnesh_Tiwari]

Kya explain kia sir dil khus ho gya 🙏🙏🙏🙏

[@ransh-sahu]

Nice One shashwat keep going

[@monalisha3251]

very nicely explained

[@ShubhUjala-pz4ku]

sir , i want to thank you your explaination is too good and very helpful for me as a beginner :)

[@CSEA_58ShayoriBhowmick]

Thank you ❤❤❤❤❤❤

[@iamdevil9485]

amzing explanation

[@priyanshgarg1292]

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?

[@mr.nishantawasthi4402]

Osm explain sir

[@RohitKumar-dz8dh]

Thanks 😊

[@amansahu1178]

bhaiya iska 1st question bhi krwa dete ....😅😅

[@GirjeshSharma-zv3xo]

Waiting for graph series😢

[@GirjeshSharma-zv3xo]

Dp par el series bna do please

[@mr.nishantawasthi4402]

Please sir upload graph lecture 🙏

[@ABsStudio-s1u]

💥🔥

[@PiyushSharma-we8yd]

😍😍

[@deadskull.18]

Sir nahi samjha

[@qulinxao]

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