Code Golf: Two Palindromes
Started: 1575158400, F jS, Y g:i:s A
Ends: 1575763200, F jS, Y g:i:s A
Time Remaining: Ended!
Description
Write a function called ispals that takes in a string and returns a boolean for whether or not the string contains two palindromes connected together.
>>> ispals('abaxyx')
True
>>> ispals('racecar')
False
>>> ispals('tacocat')
False
>>> ispals('racecartacocat')
True
>>> ispals('racecar tacocat')
False
True
>>> ispals('racecar')
False
>>> ispals('tacocat')
False
>>> ispals('racecartacocat')
True
>>> ispals('racecar tacocat')
False
Palindromes are case sensitive and spaces and punctuation count as characters. e.g. "A man, a plan, a canal, panama." does not count as a single palindrome.
You must be logged in to submit an entry.
Submission Queue
Your best Python entry so far
No entries submitted for the current language.Current Ranking
Python
| #1 | Kylljoy | 34 bytes |
| #2 | Hydrogen | 34 bytes |
| #3 | evergreen | 34 bytes |
| #4 | fwip | 81 bytes |
| #5 | vicherlys | 87 bytes |
| #6 | Blake | 88 bytes |