← Computer Science
Longest palindrome
Problem-solvingStandardOxfordCambridgeImperial
How would you check whether a string is a palindrome? Now find the longest palindromic substring of a string of length n. How efficient is your method?
Practise this with the AI interviewer
Answer in your own words, by typing or speaking. The interviewer probes your reasoning, gives hints when you're stuck, and scores you at the end. Speak your answers to get feedback on your delivery too.
Sign in free to start