A Simple Doubt

Revision en4, by tshikhar_20, 2023-01-10 08:31:14

Given a string find any combination of concatenated palindromic substrings.

or

Given a string cut it into pieces such that all pieces are palindrome and concatenating them gives whole string. No rearrangement is possible.

1 more simple condition is there all palindromic substrings should have equal number of zeroes and ones.

if answer is possible provide where you made cuts.

Eg. 1001101101 if we split as (1001)(101101)

1001 split as (1001)

1100 Answer is no


(1)(0)(1)(0) these kind of splitting not possible

Bcz there is one more simple condition that in each palindromic substring no of zeroes and ones should be equal

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English tshikhar_20 2023-01-10 08:31:14 8
en3 English tshikhar_20 2023-01-10 08:30:20 196
en2 English tshikhar_20 2023-01-10 07:48:09 114
en1 English tshikhar_20 2023-01-10 07:44:54 385 Initial revision (published)