We have to count the numbers up to N(N can be up to 10^17) such that the digits from the smallest possible permutation for Example if I take N=13 then the answer would be 12 since 10 is not the smallest permutation of the digits '0' and '1'.
An interview problem On permutattions
We have to count the numbers up to N(N can be up to 10^17) such that the digits from the smallest possible permutation for Example if I take N=13 then the answer would be 12 since 10 is not the smallest permutation of the digits '0' and '1'.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | himanshu1212 | 2021-04-05 16:35:49 | 3 | Tiny change: 'ion \nfor Example if ' -> 'ion \nfor example if ' | ||
en1 | himanshu1212 | 2021-04-05 16:35:25 | 283 | Initial revision (published) |