-
I would like to work on this issue under GSSoC. Can u please assign this issue to me?
-
```
Might be good for comparing phone numbers, for example.
```
Original issue reported on code.google.com by `lar...@gmail.com` on 12 Jan 2013 at 11:39
-
Here you need to find LCS of 3 strings using dynamic programming
-
Hi @TechVine , can you please assign this issue to me and add Hacktoberfest labels !!
-
⚠️**是 subsequence, 而不是 substring**
**这个问题之前研究过，但那时候是对着答案理解梳理的。本次独立进行一遍全部过程，遇到问题就克服，然后记下来，作为自己的薄弱环节。**
```
m = "abcliuxm"
n = "liuximin"
get_max_lcs_len(m, n) => 5
get_max_lcs_len(m, n*1000) …
-
The current solution could be spooked with 2 inputs : "ABCDFE" and "FOOBCDBCDE". The logic will create a map that will still end up having the last letter E in sequence.
According to [Wikipedia ](…
-
When I started toybox, I planned to build in some common-use algos, too. Stuff like:
- Longest Common Subsequence (LCS)
- Longest Increasing Subsequence (LIS)
- Prime Factors
- Sum of Arithmetic S…
-
- [x] [Climbing Stairs](https://algorithm.prettylog.com/daily-algorithms/study/problems/dynamic-programming/70.-climbing-stairs) - https://leetcode.com/problems/climbing-stairs/
- [x] [Coin Change](h…
-
## IDEA
- [15486번 퇴사2](https://www.acmicpc.net/problem/15486)
- 미래의 선택에 따른 이익을 현재에서 고려해야 하는 구조 => 뒤에서부터 탐색
## 다시 풀어볼 문제
- [x] [14501번 퇴사](https://www.acmicpc.net/problem/14501)
- [ ] [1256번 …
-
https://leetcode-cn.com/problems/longest-common-subsequence