brute force solution

Not sure why everyone's so chuffed about this solution, as it scans the input strings for every letter of the alphabet -- and these strings could be large. A better solution scans the input strings only once.

fantasicccccc!!!!!!

This is a well thought short precise and beautiful answer.

Broken?

Python

logs from command(cmd, num) call
cmd num
461789 33
461789 14
461789 28
461789 46
461789 55
461789 45
461789 29
461789 90
461789 27
461789 8
461789 4
461789 33
461789 28
461789 42
461789 74
461789 76
461789 47
461789 77
461789 1
461789 1
461789 4732

Javascript

logs from command(cmd, num) call
arguments
{ '0': 'b46c24636cd9', '1': 38 }
{ '0': 'b46c24636cd9', '1': 81 }
{ '0': 'b46c24636cd9', '1': 17 }
{ '0': 'b46c24636cd9', '1': 27 }
{ '0': 'b46c24636cd9', '1': 8 }
{ '0': 'b46c24636cd9', '1': 34 }
{ '0': 'b46c24636cd9', '1': 32 }
{ '0': 'b46c24636cd9', '1': 62 }
{ '0': 'b46c24636cd9', '1': 31 }
{ '0': 'b46c24636cd9', '1': 34 }
{ '0': 'b46c24636cd9', '1': 8 }
{ '0': 'b46c24636cd9', '1': 82 }
{ '0': 'b46c24636cd9', '1': 60 }
{ '0': 'b46c24636cd9', '1': 15 }
{ '0': 'b46c24636cd9', '1': 85 }
{ '0': 'b46c24636cd9', '1': 39 }
{ '0': 'b46c24636cd9', '1': 1 }
{ '0': 'b46c24636cd9', '1': 68 }
{ '0': 'b46c24636cd9', '1': 63 }
{ '0': 'b46c24636cd9', '1': 32 }
{ '0': 'b46c24636cd9', '1': 539 }

Very similar to my solution, but done right. Thanks for it!

Good job!!!

Many Execution Timed Out (12000 ms) on successed solutions of Clojure.

Very strange, but I learned something new. Thanks.

https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Functions/arguments/callee

Genial. I never ever think about how to use concat and spread operator to flat a level of arrays. Very nice solution. I learned to much.

Wtf is 'arguments.callee' ?

Nice depth walk!