I would like to add the 3-Partition Problem inside the Dynamic Programing folder.

[ritikverma2000]

Is your feature request related to a problem? Please describe.

3-partition problem: Given a set S of positive integers, determine if it can be partitioned into three disjoint subsets that all have the same sum, and they cover S.

Describe the solution you'd like

The 3–partition problem is a special case of the Partition Problem , which is related to the Subset Sum Problem which itself is a special case of the Knapsack Problem. The goal is to partition S into two subsets with an equal sum in the partition problem. In the 3–partition problem, the goal is to partition S into 3 subsets with an equal sum. For example,

S = { 7, 3, 2, 1, 5, 4, 8 }

We can partition S into three partitions, each having a sum of 10.

S1 = { 7, 3 } S2 = { 5, 4, 1 } S3 = { 8, 2 }

Note that there can be multiple solutions to a single set.

So can you pls assign me this issue under "hacktoberfest" label so that I can start working upon it.

[ritikverma2000]

Hi I am working on the issue thanks for assigning me this.

[github-actions[bot]]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[github-actions[bot]]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!