Dynamic Programming | Set 9 (Space-optimized Binomial Coefficient) | GeeksforGeeks

This video is contributed by Sephiri.

[uditkumar]

The voice quality is really excellent !!

[kakulapativenkatasesharohi]

while computing c(n, k) we do a small check if k > n/2, if k turns out greater than n/2 then instead of initializing an array of size k we can initialize an array of size (n-k ) as c(n, k) = c(n, n-k) . this will reduce the space complexity further. hope this is correct and it helps :)

[abhinpai]

One of the great tutorial to learn the actual working of an algorithm, Thnx for these kinds of videos, please do post some more viedos.

[rodionlatypov]

Come on guys who do not like the sound of the voice, you can use the volume up button. Otherwise, thanks for the videos: they are really helpful!

[bhavyajindal]

Yr tumhara throat thik nhi h ? Baki content was good 😃

[naveenojha]

it can also be done in o(n). algorithm.so why we use array .