How do I approach Coding & Algorithms interview questions?

Coding & Algorithms questions require understanding of core concepts and practice. PracHub provides solutions with explanations to help you master coding & algorithms interviews.

What difficulty level is this interview question?

This is a medium difficulty Coding & Algorithms question, commonly asked during Onsite rounds at Meta.

What role is this question designed for?

This question is commonly asked for Machine Learning Engineer candidates at Meta during technical interviews.

Find longest palindromic substring | Meta Interview Question

Find longest palindromic substring

Last updated: Mar 29, 2026

Quick Overview

This question evaluates knowledge of string algorithms and pattern recognition, focusing on identifying palindromic substrings and reasoning about time and space complexity for contiguous substring problems.

Input

A single string s .

Output

A string representing the longest palindromic substring (if multiple answers exist, return any one).

Constraints

1 <= len(s) <= 2000 (or similar typical interview constraints)
s contains ASCII letters/digits.

Examples

s = "babad" → "bab" (or "aba" )
s = "cbbd" → "bb"

Comments (0)

Loading comments...

Browse More Questions

More Coding & Algorithms•More Meta•More Machine Learning Engineer•Meta Machine Learning Engineer•Meta Coding & Algorithms•Machine Learning Engineer Coding & Algorithms