We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I’m working on the “Build Longest Palindrome” problem and encountered an issue with Test Case 2.
My algorithm correctly constructs valid palindromes by combining substrings from a and b, and it passes all other cases. However, Test Case 2 expects a palindrome 'oozlzoo', which is not constructible from any combination of substrings from a and b — this violates the problem's core requirement.
I’ve verified this manually and through exhaustive debugging. Kindly review this test case for accuracy.
Thank you!
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Build a Palindrome
You are viewing a single comment's thread. Return to all comments →
Hi HackerRank team,
I’m working on the “Build Longest Palindrome” problem and encountered an issue with Test Case 2.
My algorithm correctly constructs valid palindromes by combining substrings from
aandb, and it passes all other cases. However, Test Case 2 expects a palindrome'oozlzoo', which is not constructible from any combination of substrings fromaandb— this violates the problem's core requirement.I’ve verified this manually and through exhaustive debugging. Kindly review this test case for accuracy.
Thank you!