Log in
SOLVE
LATER
Description
You are given an array A of length N. You need to find maximum length of subsequence of A which contains any one digit common in all the elements of that subsequence. You are not allowed to count leading zeroes.
Input Format:
First line of input contains N, denoting number of elements.
Second line of input contains N space separated integers, denoting array elements.
Output Format:
Single integer representing maximum length of subsequence containing one digit common.
Input Constraints:
\(1 \le N \le 10^5\)
\(1 \le A_i \le 10^9\)
Maximum length subsequence with one digit common is [ 12 11 ].
