Longest Palindromic Substring

January 14, 2022 less than 1 minute read

Given a string s, return the length of the longest palindromic substring.

Constraints

n ≤ 1,000 where n is the length of s

https://binarysearch.com/problems/Longest-Palindromic-Substring

Examples

Example 1

Input

s = mactacocatbook

Output

answer = 7

Explanation

“tacocat” in the middle is the longest palindromic substring.

Solution

Share on

Twitter Facebook LinkedIn

Anagram Substrings

October 13, 2022 less than 1 minute read

Given two strings s0 and s1, return the number of substrings where s1 contains any anagram of s0.

Anagram Partitioning

September 27, 2022 1 minute read

You are given two non-empty strings a and b that are the same length. Partition them into substrings such that each pair of a and b’s substring is the same s...

String Equivalence Relations

September 25, 2022 2 minute read

You are given three lowercase alphabet strings a, b and target. Strings a and b have the same length and are defined to be equivalent: a[i] = b[i]. For examp...

Minimum Window Substring

August 31, 2022 less than 1 minute read

Given two lowercase alphabet strings a and b, return the length of a minimum substring in a that contains all the characters of b.

Xuanken Tay