Find number of ways to partition a set with N elements into K sets

[@memansi0007]

In DP solution , for second loop.. the termination condition should be j

[@RaviYadav-xg2hy]

yeah correct.... I was also thinking the same...thanks for pointing it out !!

[@shreyasingh1258]

inn the dp solution table is filled wrong,u have always took dp[i-1][j-1] as the upper element and not upper diagonal one, U may check it out! very helpful video it was

[@ajitshiva9193]

Yes. Same doubt thanks for clarifying.

[@aishwaryajaiswal4720]

Yes

[@randomclicks6466]

last output it will be 6 but it will be 3*1+3=6 also dp[4][2] will be 2*3+1=7

[@PriyankaGhoshDastidar]

yes exactly!

[@shyamfaguna485]

sir you have computed the last row wrong plzz do check.....overall good video helped a lot very nicely explained specially the part which i was confused the most of how the s(n,k) formula came got cleared

[@techdose4u]

Thanks for pointing out.... I will check it out.

[@mukeshchauhan2354]

I think 3*3+1 =10 will be in last box as per sir explanations.

[@aakashgoswami8895]

Not all heros wear cap.... Thanku sir. Continue with such great quality videos :).

[@techdose4u]

Welcome :)

[@arvindrawat3641]

dp[4][2]= 7 {the no. of times 2 sets can be made from 1,2,3,4} ie, {1, {2,3,4} }, {2, {1,3,4} }, {3,{1,2,4}}, {4, {1,2,3}}, {{1,2}, {3,4}}, {{1,3}, {2,4}}, {{1,4}, {2,3}} but u have writtern 5 . please clarify

[@swetajha2265]

Very nice explanation. Thanks..Keep making such videos. Very easy to understand.

[@techdose4u]

Welcome :)

[@stablesort]

Nice video. I wonder if there is direct formula that could calculate the answer without any need to construct the table? From the first glance, it looks like a variation of Pascal's triangle.

[@manojpandey7517]

Interviewer won't be pleased even if a direct formula exists.

[@harshmankodiya9397]

Wouldnt even nearly consider this as a good explanation...

[@kashifanwar9733]

so easy it becomes when u explain

[@techdose4u]

Thanks :)

[@MrThepratik]

thanks much , really appreciate your effort

[@techdose4u]

Thanks

[@tushargupta3236]

Great recursive formula explanation!

[@techdose4u]

:)

[@tarushiarora6887]

Thank u very much it was an amzing video

[@techdose4u]

Welcome :)

[@Mandeepsingh-jo5cf]

thank you sir

[@techdose4u]

Welcome

[@revarevanth1800]

Thank you so much

[@techdose4u]

Welcome :)

[@revarevanth1800]

@@techdose4u any plans to prepare for PayPal coding

[@mayanktripathi3915]

If n numbers will be same than what changes have to do

[@techdose4u]

N-1CK . Think about it and let me know. I am almost certain about it, though not 100%.

[@amulyareddyg9290]

@@techdose4u N-1 C K-1

[@anushikeswani297]

The table is not filled according to the formula..plz check....there are also some calculation mistakes...
Video was helpful though

[@anshuofficial166]

There is some mistake during filling table?

[@moelayo]

This is stirling numbers of the second kind.

[@dhanyaabharadwaj1376]

Thanks TECH DOSE

[@techdose4u]

Welcome

[@ravishasharma7]

Can you tell how to print all such partitions, not just count the number of ways?

[@techdose4u]

Save the partitions in array of list

[@rahulanand141]

The j in the solution should be up to k+1 not i+1 otherwise j will be out of the index.

[@abhisheksable622]

if we are introducing nth element than it will generate k possibilities so why we are myltiplying k instead of adding it

[@kriativt2794]

Why can not i just juse nCk formula to find no. Of ways k elements can be selected using n elements.

[@kakaninavin]

Sir in last condition you said S(4,3)=2*3+1=7 but you said that is 6 ?

[@techdose4u]

I must have said by mistake

[@fb_a]

Why not a combination?
==> C (n,k)
Why it is differ from combination.?
=>which case I am missing ?

[@techdose4u]

I am very busy right now and i forgot this video as well 😅 please find something yourself for the time being.

[@aravindravva3833]

is no of ways is n C k ?

[@sakshamnayyar6302]

what if all numbers in the array are the same ?

[@techdose4u]

N-1CK . Think about it and let me know. I am almost certain about it, though not 100%.

[@hrishikeshpanse4790]

this is wrong

[@naroe3657]

thank you so much