GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing rulcode.com — Longest Common Subsequence Visualizer & Solution | Rulcode

Fetching algorithms...

Longest Common Subsequence Visualizer & Solution | Rulcode

Loading problem details...

32. Longest Common Subsequence

Medium

Topics

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: text1 = "abcde", text2 = "ace"

Output: 3

Explanation: The longest common subsequence is "ace", which has a length of 3.

Example 2:

Input: text1 = "abc", text2 = "abc"

Output: 3

Explanation: The longest common subsequence is "abc", which has a length of 3.

Example 3:

Input: text1 = "abc", text2 = "def"

Output: 0

Explanation: There is no common subsequence, so the length is 0.

Constraints:

Time Complexity

O(mn)

Space Complexity

O(mn)

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.