InterviewBit Problems   Colorful Number : Solved

About the Colorful Number : Solved category (1)
Better solution than O(n^2) , time complexiy O(n) and space O(n) using map (1)
Simple and sweet. Self explanatory (4)
Solution in Java 8 (1)
C++ O(n)*log(n) solution (1)
Eazy pezy solution in python (1)
O(n^2) soln where n is number of digits in A using prefix product array (1)
Any better solution than O(n^2) (3)
If no of digits in n = k then time = O(k*k) (1)
Solution w explanation C++ (1)
Used list instead of dictionary (1)
Easy brute force with simple hashing solution (1)
O(N) solution got accepted (3)
Simple C++ soln, TC - O(n*n) (1)
Very easy C++ Solution :) (1)
C++ solution : Tell me how I can improve this (1)
Why would you use a HashSet? (2)
Inefficient but working solution in Java [Naive approach with extra spaces] (1)
Very Easy Cpp Sol. Straight Forward Approach! (1)
C++ approach Tell me how to improve (3)
C++ easy ,short and without making any auxillary array to save digits (1)
C++ easy solution jfd (2)
Python - O(n*n) solution (1)
Here is the unncessary O(n) solution (3)
O(n) solution of @ritvikush_1996 in Python (2)
C++ simplest sol -> using set (2)
O(n*n) solution is being accepted (2)
Simpl python sol (1)
Simplest C++ solution using map (2)
Simple Python Solution - 1 (1)