0
Given a string find all the sub strings that are pallondromes.
16 odpowiedzi
+ 1
Baptiste's solution is your answer. I'll throw my own because stuff like this is fun as heck to code on the fly:
https://code.sololearn.com/cBhO2IzKO3WU
0
explain clearly
0
You're given a string of characters display those sub strings which are pallindromes.
0
show me eg input and output
0
abaaa
This string has the following pallindromic substrings
a
b
aa
aaa
aba
0
hello
h
e
l
l
o
whether like this?
0
and ll is also a pallindromic substring
0
I couldn't get u clearly what ur trying to tell
0
hello
h
e
ll
o
like this??
0
You don't know what is a pallindrome?
0
I knew that
0
Yeah like that.
0
if letter repeated then it should be on same line right? then why do u tel palindrome?? ll is palindrome
0
Fine leave it.
0
Checks for palindrome words with at least 2 letters. Not what you wanted, but more fun to write:
https://code.sololearn.com/c4qk5RTml5B4/?ref=app
Często masz takie pytania?
Ucz się bardziej efektywnie, za darmo:
