InterviewDigestTechnical2026-08-12
Find the longest palindromic substring in a given string and write test cases to prove correctness.
AI-Expanded — inferred from the question title, not from the original candidate report
Given a string $s$, write a function to return the longest palindromic substring contained within it. After implementing your solution, provide a comprehensive suite of test cases, including edge cases like empty strings, single-character strings, and strings with multiple palindromes of the same length, to demonstrate the correctness and robustness of your algorithm.
Context & Summary
1:1 Algo/DS round with 1 easy and 1 medium-level question. Candidate was required to write test cases for the solutions.
💻 Coding practice works best on desktop.
Code editors are too cramped on mobile screens.
Loading editor...
AI can automatically infer and generate example test cases for this question based on standard algorithmic constraints.