Test your understanding of various coding challenges focusing on algorithm efficiency.

Central CIP Path

Challenge Yourself

#
## Statement

Given a string `s`, return the longest palindromic substring in `s`.

**Constraints**

* $1 \leq$ `s.length` $\leq 1000$

* `s` consist of only digits and English letters.

## Solution

So far, you’ve probably brainstormed some approaches and have an idea of how to solve this problem. Let’s explore some of these approaches and figure out which to follow based on considerations, such as time complexity and implementation constraints.

### Naive approach

Let’s solve the Longest Palindromic Substring problem using the Dynamic Programming pattern.

Solution: Longest Palindromic Substring

Statement▼

Solution

Naive approach

Solution: Longest Palindromic Substring

Statement▼

Solution

Naive approach