Algo_ds_101: Partition Problem - DP

[Swarn10]

Submission Title
Partition Problem

Submission Type
Algorithm

Submission Description
Given a set of numbers, this algorithm determines if the given set can be partitioned into two subsets such that the sum of elements in both subsets is same. Let the sum of all elements of the set be s and the number of elements be n, then the time complexity of the algorithm will be O(s * n) and auxiliary space complexity will also be O(s * n).

Submission Directory
Algorithms => Dynamic_Programming => partition_problem.ext

Contributors

• [ ] C++ -
• [ ] C -
• [x] Python -
• [x] Java -
• [ ] JavaScript -
• [ ] TypeScript -
• [ ] Golang -
• [ ] Ruby -
• [x] php -
• [ ] Swift -
• [x] C# -

[github-actions[bot]]

👋 @Swarn10

Thanks for opening your first issue here! Be sure to follow the issue template!

Regards @ahampriyanshu :v:

[Swarn10]

@ahampriyanshu I want to work on this issue in C++. This algorithm is not currently present inside the repo. Please assign this issue to me. Will be happy to help.

[rebelfire888]

please assign it to me in c language

[Nirali0029]

please assign this to me for python

[YashJain2]

@ahampriyanshu please assign this problem to me for c++ for recursive approach

[PrakashAditya17]

I can do this partition in java. Please assign if required @ahampriyanshu .

[arjank]

Please assign this to me for PHP

[manishita24]

please assign me this for c#

[PrakashAditya17]

Please assign me for Java. I am ready to contribute.

[ahampriyanshu]

Perfect Code :+1:
Thanks @arjank
Happy Contributing :tada:

[ahampriyanshu]

thanks everyone :v: