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

Problem of the day

You have been given an array of 'N' Integers. Find the length of the longest subsequence such that each adjacent element of the subsequence has at least one digit in common.

```
A sequence 'A' is a subsequence of a sequence 'B' if 'A' can be obtained from 'B' by deletion of several (possibly, zero) elements. For example, [3,1] is a subsequence of [3,2,1] and [4,3,1], but not a subsequence of [1,3,3,7] and [3,10,4].
```

Detailed explanation

```
1 <= N <= 10 ^ 5
1 <= Arr[i] <= 10 ^ 9
Where Arr[i] is the i-th element in the array.
Time Limit: 1sec
```

```
7
11 122 77 92 55 69 98
```

```
5
```

```
The longest subsequence is: 11 122 92 69 98
```

```
6
21 32 65 34 83 95
```

```
4
```

```
The longest subsequence is: 21 32 34 83
```