search

rishabhgarg25699 / Competitive-Programming

This repository contains some useful codes, techniques, algorithms and problem solutions helpful in Competitive Coding. Join with me on telegram group https://t.me/joinchat/GL4Y8RREZbz-Cp78R869CQ
63 stars 121 forks source link

Subset Sum Problem #284

Closed rishabhgarg25699 closed 4 years ago

rishabhgarg25699 commented 4 years ago

Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.

Input: [1, 5, 11, 5]

Output: true

Explanation: The array can be partitioned as [1, 5, 5] and [11].

rishabhgarg25699 commented 4 years ago

@Aastha26-lab This is not for you. If you want, open the issue and I will assign you.

Aastha2602 commented 4 years ago

I got that

onbit-uchenik commented 4 years ago

Please allow me to solve this issue. :)

rishabhgarg25699 commented 4 years ago

@onbitSyn Assigned