NOTE

Longest Common Substring

A note for the longest common substring problem.

Data Structures & AlgorithmsCreated 03/01/2021Updated 03/01/20211 min readhistorical

This is a historical learning note and may contain outdated or incomplete understanding.

1. Problem Description

Given two strings str1 and str2, output their longest common substring. The problem guarantees that the longest common substring of str1 and str2 exists and is unique.

2. Approach

3. Implementation

4. References

Longest Common Substring _ NowCoder
From Optimization to Further Optimization: Longest Common Substring - Ider - cnblogs

Discussion

JavaScript is required to load comments.Open the discussion on GitHub