Colorful Number

Asked in:
Epic systems

Problem Description

For Given Number A, find if it's a COLORFUL number or not.

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. 
And this number is a COLORFUL number, since product of every digit of a contiguous subsequence is different

Return 1 if A is a COLORFUL number, else return 0

Problem Constraints

0 <= A <= 10⁹

Input Format

The first argument is an integer A.

Output Format

Return 1 if A is a COLORFUL number, else return 0

Example Input

A = 23

Example Output

Example Explanation

A = 23
2 3 23
2 -> 2
3 -> 3
23 -> 6
this number is a COLORFUL number since the product of every digit of a sub-sequence is different.

Output: 1

NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.

Start solving Colorful Number on Interview Code Editor

Hints

Hint 1
Solution Approach
Complete Solution

Asked In:

Epic systems

Colorful Number

Discussion