Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

An interview problem On permutattions

Revision en1, by himanshu1212, 2021-04-05 16:35:25

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'.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English himanshu1212 2021-04-05 16:35:49 3 Tiny change: 'ion \nfor Example if ' -> 'ion \nfor example if '
en1 English himanshu1212 2021-04-05 16:35:25 283 Initial revision (published)