Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

Given two strings, 'S' and 'T' with lengths 'M' and 'N', find the length of the 'Longest Common Subsequence'.

For a string 'str'(per se) of length K, the subsequences are the strings containing characters in the same relative order as they are present in 'str,' but not necessarily contiguous. Subsequences contain all the strings of length varying from 0 to K.

```
Subsequences of string "abc" are: ""(empty string), a, b, c, ab, bc, ac, abc.
```

Detailed explanation

```
0 <= M <= 10 ^ 3
0 <= N <= 10 ^ 3
Time Limit: 1 sec
```

```
adebc
dcadb
```

```
3
```

```
Both the strings contain a common subsequence 'adb', which is the longest common subsequence with length 3.
```

```
ab
defg
```

```
0
```

```
The only subsequence that is common to both the given strings is an empty string("") of length 0.
```