OpenGenus/cosmos

Add Code to Generate All Possible Subset Sums

Open

#367 opened on Oct 3, 2017

View on GitHubContributor guide
 (7 comments) (0 reactions) (0 assignees)C++ (3,724 forks)batch import
Hacktoberfestadd codenew algorithm

Repository metrics

Stars
 (13,462 stars)
PR merge metrics
 (No merged PRs in 30d)

Description

Solution would use bitmasks to generate all sums which can be obtained by picking some subset of a given array and summing up the member elements.
Language: C++

Contributor guide

Research direction
Study the subset sum problem and bitmask technique. Implement a solution that iterates over all possible subsets using bitmasks and computes the sum for each subset.
Tech stack
cpp
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
2
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
1-3 hours
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
Active
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Clear
Prerequisites
C++Bit ManipulationGit
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
75