New answers tagged


Pip, 98 66 bytes -32 thanks to @DLosc! k:{[[z:a]]AL$AL({b:zc:b@<aAL_M(kb@>a)z:bc}M@>(,#a))}#(_QRV_FI(ka)) My first Pip answer!


Stax, score 21 (9 bytes) Æ₧ⁿ+Ü█>la Run and debug it the packed representation scores lesser, as shown in the tests. Despite the existence of f!f and {{ in the unpacked version, the number of characters simply doubles the score.


Jelly, score 3, 755962277730462996760664 bytes ...‘‘‘‘ṃØJV Try it online! -5 score and +tons of bytes thanks to @ovs's idea. ...‘‘‘‘ part contains exactly 755962277730462996760660 copies of ‘ character, whose length encodes the following program in base 256: Jelly, 10 bytes ɠŒṖŒḂ€€§¬S Try it online! The main code is a minor variation of Dude's answer (use ...


05AB1E, score 18 (9 bytes) .œεεÂÊ]PO Try it online or verify all test cases, including itself. Explanation: .œ # Get all partitions of the (implicit) input-string ε # Map over each partition: ε # Map over each part in this partition: # Check that it's NOT a palindrome by:  # Bifurcating it (short for Duplicate & ...


Vyxal, 25 bytes, score 46368 LṄvṖ⁽JḭUƛvɾ:?f$•;'ƛḂ≠;A;L Try it Online! -3 thanks to Aaron Miller. A big mess. Part of the code shamelessly stolen from Lyxal. L # Length ṄvṖ # All permutations of partitions ⁽Jḭ # Flatten by 1 level U # Uniquify ƛ ; ...


Jelly, score 14 12, 9 bytes ŒṖŒḂ€€§¬§ Try it online! I thought this would be more of a baseline contender, but any modification I make to it to try to make it more palindromy only increases it instead. So, this is just the straight forward implementation. -2 points thanks to xigoi How it works ŒṖŒḂ€€§¬§ - Main link. Takes a string S on the left ŒṖ - ...

Top 50 recent answers are included