Categorygithub.com/Elven9/my-leetcodeProblems1143
package
0.0.0-20241209140624-9fce2a725d55
Repository: https://github.com/elven9/my-leetcode.git
Documentation: pkg.go.dev
Overview
Dependencies
1
Dependents
0

# README

Longest Common Subsequence

Solution IdxTime ComplexitySpace ComplexityComment
1O(m*n)O(m*n)DP, Typical Solution, 50%
- (Not feasible)Uncomplete solution space considiration

Way to Improve ?

Just like walking the maze, maybe there are some redundant move on the map.

Naive solution

O(mn*(m+n))

Brute force and compare each character