OpenGenus/cosmos

Add palindrome partition solution

Open

#661 opened on Oct 6, 2017

View on GitHub
 (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

Add the code for palindrome partition problem.

The code should be added at code/dynamic_programming/palindrome_partition

Problem statement: Given a string s, determine the minimum number of cuts necessary to partition s in a set of palindromes. For example, for string aaabbba, minimum cuts needed is 1, making aa | abba. Expected time complexity: O(n^2), where n is the size of s

Contributor guide

Research direction
Tech stack
Domain
Issue type
DifficultyEstimated implementation difficulty for a new contributor, from 1 for very small changes to 5 for expert-level work.
Estimated timeA rough time range for an experienced contributor to investigate, implement, test, and prepare a pull request.
Activity statusHow available the issue appears right now: fresh, active, stale, blocked, or waiting on maintainer input.
ClarityHow clearly the issue explains the expected change, acceptance criteria, and next step.
Prerequisites
Newbie friendlinessA 1-100 score estimating how approachable this issue is for first-time contributors.