OpenGenus/cosmos

Implement "no consec 1s" in python

Open

#2,291 opened on Oct 22, 2017

View on GitHubContributor guide
 (2 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

Details: Solves #2288

Added in new folder code/dynamic_programming/no_consec_ones.

Contributor guide

Research direction
Implement the dynamic programming solution for counting binary strings without consecutive 1s. The recurrence is dp[i][0] = dp[i 1][0] + dp[i 1][1]; dp[i][1] = dp[i 1][0]. Add file to code/dynamic programming/no consec ones/.
Tech stack
python
Domain
backend
Issue type
Feature
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
1
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Under 1 hour
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
PythonDynamic Programming
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.
90