Colorful Number

For Given Number N find if its COLORFUL number or not

Return : 0/1

Note : Write a Program in any Language

COLORFUL number:

A number can be broken into different contiguous sub-subsequence parts.

Suppose, a number 3245 can be broken into parts like 3, 2, 4, 5, 32, 24, 45, 324, 245, 3245. And this number is a COLORFUL number, since product of every digit of a contiguous subsequence is different

Example 1:

N = 23

2, 3, 23

2 -> 2
3 -> 3
23 -> 6

this number 23 is a COLORFUL number since product of every digit of a sub-sequence are different.

Output : 1

Example 2:

N = 12345

1, 2, 3, 4, 5, 12, 23, 34, 45, 123, 234, 345, 1234, 2345, 12345

1 -> 1
2 -> 2
3 -> 3
4 -> 4
5 -> 5
12 -> 2
23 -> 6
34 -> 12
45 -> 20
123 -> 6
234 -> 24
345 -> 60
1234 -> 24
2345 -> 120
12345 -> 120

this number 12345 is not a COLORFUL number since product of every digit of a some sub-sequence are same.

Output : 0

Coding Challenge for U 1 - Colorful Number