OpenGenus/cosmos

Backtracking - Subset Sum

Open

#319 opened on Oct 3, 2017

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

Repository metrics

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

Description

This issue does not include a description.

Contributor guide

Research direction
Implement the backtracking algorithm for the subset sum problem in C++. Study the existing backtracking examples in the repository to understand the code style and structure. Write a clear function that takes a set of integers and a target sum and returns whether a subset sums to the target, optionally returning the 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.
3
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++Recursion
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
70