3 ms·

My code runs in O(n log n) time and can deal with repeated digits. You converted it to something that takes exponential time and chokes on repeated digits. (BT

My code runs in O(n log n) time and can deal with repeated digits. You converted it to something that takes exponential time and chokes on repeated digits. (BTW, I just realized that my code can be made O(n), by replacing the default sort with a counting sort :-))

Strilanc 12y ago
Hm, embarrassing, I just assumed you were doing the naive brute force. You're de-interleaving the digits with an order swap when the digits first start to differ.
- cousin_it 12y ago
  Yeah, that's pretty much it.