Longest Common Substring

January 14, 2022 less than 1 minute read

Given two lowercase alphabet strings s0, and s1, return the length of their longest common substring.

Constraints

n, m ≤ 1000 where n and m are the lengths of s0 and s1

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

Examples

Example 1

Input

s0 = helloworld
s1 = worldpine

Output

answer = 5

Explanation

“world” is the longest common substring between the two strings.

Solution

Share on

Twitter Facebook LinkedIn

Longest Arithmetic Subsequence with Difference Constraint

October 8, 2022 1 minute read

Given a list of integers nums and an integer diff, return the length of the longest arithmetic subsequence where the difference between each consecutive numb...

Longest Increasing Path

September 29, 2022 less than 1 minute read

Given a two-dimensional integer matrix, find the length of the longest strictly increasing path. You can move up, down, left, or right.

Number of Palindromic Substrings

July 29, 2022 less than 1 minute read

Given a lowercase alphabet string s, return the number of palindromic substrings in s.

Edit Distance

July 24, 2022 1 minute read

Given two strings a and b, find the minimum edit distance between the two. One edit distance is defined as

Xuanken Tay