I’ve been trying one from the newsletter

This is an interesting one, because its very deceptively simple. I can easily write code to answer the question, its just way too slow, and that seems like the point. otherwise the problem could be solved by something basic like

```
function findPosition(num){
var runningNo = 1; // running count for adding numbers
var infNum =""; //string of inf numbers
var ind = -1;
function longer(){ //add 10k numbers to string of infinte numbers
for(i = 0; i < 10000; i++){
infNum+= runningNo;
runningNo++;
}
}
while(ind == -1){ //keep adding numbers until a match is found
longer();
ind = infNum.indexOf(num);
}
return ind;
}
```

this is just an example solution to show how simple the problem appears to be at first (it works for numbers up to 7 digits or so)

I’ve tried a few different techniques so far but nothing that’s been fast enough.

I do like seeing a high level problem with an easy to understand description though. Even if it takes me forever to solve.